{"meta":{"query_hash":"84c791073ed1","filters":{"topic":"Complexity and Algorithms in Graphs"},"cohort_total":755,"direct_labels_cover":0,"predictions_cover":755,"exported":755,"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/84c791073ed1","api":"https://metacan.xera.ac/api/v1/cohort?topic=Complexity+and+Algorithms+in+Graphs"},"results":[{"id":"W1164874588","doi":"10.1007/s00453-017-0302-8","title":"Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Combinatorics; Rounding; Vertex (graph theory); Complement (music); Physics; Mathematics; Graph; Computer science","score_opus":0.04806380619590854,"score_gpt":0.2791472537857054,"score_spread":0.23108344758979682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164874588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064699777,0.00068788085,0.9893015,0.006872405,0.0010189961,0.000907505,0.00002051966,0.00016605222,0.00037816953],"genre_scores_gemma":[0.20384578,0.00030234555,0.7928737,0.00059309567,0.000986378,0.0007428692,0.000012873148,0.000049014314,0.0005939657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984504,0.00003391535,0.00027314055,0.00057163637,0.00023632705,0.00043459295],"domain_scores_gemma":[0.9977467,0.00041754177,0.00025194514,0.0013320168,0.00014558811,0.00010617966],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058003055,0.0002303076,0.00022469912,0.00006898515,0.0019735985,0.0013593143,0.0020297018,0.00009184014,0.000004959017],"category_scores_gemma":[0.00018417797,0.00016638554,0.00011109638,0.00010507948,0.0003605854,0.0010186926,0.0006526838,0.0001821275,0.0000068935165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006588366,0.000052380525,0.000045538007,0.000044535125,0.00005937238,0.000001343349,0.0004662616,0.0000073910887,0.00034895103,0.023784872,0.00039421787,0.97478855],"study_design_scores_gemma":[0.0006589872,0.00015303779,0.0017063188,0.00003605643,0.000031502506,0.000032763426,0.00006244333,0.88806474,0.0018853114,0.08727427,0.019793486,0.0003010874],"about_ca_topic_score_codex":0.00014787176,"about_ca_topic_score_gemma":0.000023136734,"teacher_disagreement_score":0.9744875,"about_ca_system_score_codex":0.000020095706,"about_ca_system_score_gemma":0.000050631483,"threshold_uncertainty_score":0.99967736},"labels":[],"label_agreement":null},{"id":"W119341521","doi":"10.1007/978-3-642-40104-6_23","title":"Lift-and-Project Methods for Set Cover and Knapsack","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Knapsack problem; Cover (algebra); Set cover problem; Hierarchy; Rounding; Mathematics; Lift (data mining); Combinatorics; Approximation algorithm; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Mathematical optimization; Data mining","score_opus":0.048671866014856124,"score_gpt":0.33168279424756447,"score_spread":0.28301092823270835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119341521","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028893603,0.0014464861,0.9940074,0.00074466044,0.0013536346,0.0008178157,0.000015551494,0.00012524628,0.0014602944],"genre_scores_gemma":[0.0010904461,0.00017504851,0.9959552,0.0017067885,0.0003202671,0.000033833647,0.00000479666,0.000029251787,0.0006843483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667597,0.00006648775,0.00044522388,0.0017177906,0.00044048775,0.0006540458],"domain_scores_gemma":[0.9967494,0.0015653919,0.00022182775,0.0010600917,0.00022230955,0.00018098803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013840201,0.0005493104,0.00063484826,0.0007362376,0.0003798276,0.00091875286,0.0020336774,0.0003218626,0.000025601848],"category_scores_gemma":[0.00015140233,0.00048336538,0.00012906722,0.00045423553,0.0011127059,0.00068631925,0.0019747547,0.00061259407,0.000018736137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036415588,0.000009604723,0.000007790383,0.00006587386,0.000015235879,0.0000061117416,0.00065579725,0.00024935335,0.00004559114,0.05286014,0.00015277867,0.9459281],"study_design_scores_gemma":[0.00027064176,0.00020470952,0.000040249117,0.00015154557,0.000009961257,0.000082105886,2.0409124e-7,0.5683868,0.000296417,0.40237224,0.027637076,0.00054804346],"about_ca_topic_score_codex":0.000041530053,"about_ca_topic_score_gemma":0.000010943375,"teacher_disagreement_score":0.94538003,"about_ca_system_score_codex":0.00008250391,"about_ca_system_score_gemma":0.00030693333,"threshold_uncertainty_score":0.9997618},"labels":[],"label_agreement":null},{"id":"W1205694693","doi":"10.1007/s00037-009-0263-7","title":"The Black-Box Query Complexity of Polynomial Summation","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Combinatorics; Degree (music); Mathematics; Polynomial; Field (mathematics); Discrete mathematics; Finite field; Connection (principal bundle); Physics; Pure mathematics","score_opus":0.05658031693308873,"score_gpt":0.2870780996604076,"score_spread":0.23049778272731886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1205694693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06220251,0.00019082775,0.9222826,0.009139381,0.0006632923,0.0004195984,0.00004741135,0.00032176808,0.0047326074],"genre_scores_gemma":[0.8770367,0.0000076274646,0.1221758,0.0005011583,0.00016397228,0.000004750594,0.00005208465,0.0000074926224,0.00005043556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730664,0.00026947295,0.00071836385,0.00048128792,0.00079360104,0.000430604],"domain_scores_gemma":[0.99770033,0.00060661935,0.00036629912,0.00073815335,0.00044807055,0.00014052875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071973715,0.00026400393,0.00034690186,0.00015922972,0.000850029,0.0002617179,0.0017501493,0.000074119416,0.000026621916],"category_scores_gemma":[0.0001019515,0.00022487622,0.00024104887,0.0007614688,0.0013545078,0.00051096734,0.00031797192,0.00029253098,0.00004588269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003754714,0.00018044488,0.00018290043,0.000011888622,0.00002875084,0.0000029106316,0.00039189623,0.0047128014,0.000077547644,0.96443206,0.0035578008,0.026383433],"study_design_scores_gemma":[0.0003599621,0.00012029014,0.07394475,0.00001537882,0.0000048386964,0.000014164792,0.000026214495,0.32571754,0.00020727089,0.59772,0.0016771962,0.0001923998],"about_ca_topic_score_codex":0.00006290501,"about_ca_topic_score_gemma":0.000045648583,"teacher_disagreement_score":0.8148342,"about_ca_system_score_codex":0.000083928375,"about_ca_system_score_gemma":0.00018311056,"threshold_uncertainty_score":0.9170186},"labels":[],"label_agreement":null},{"id":"W121484681","doi":"10.3233/sat190001","title":"Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems","year":2005,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Complexity and Algorithms in Graphs","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":"Semidefinite programming; Semidefinite embedding; Satisfiability; Relaxation (psychology); Mathematics; Quadratically constrained quadratic program; Maximum cut; Linear programming; Large margin nearest neighbor; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Quadratic programming; Artificial intelligence","score_opus":0.06582800461354198,"score_gpt":0.267172676926121,"score_spread":0.20134467231257902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121484681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15438783,0.00026869884,0.84228426,0.0017527266,0.00019056883,0.0008232555,0.000016441942,0.00015856941,0.000117657495],"genre_scores_gemma":[0.60016906,0.0000655692,0.39938796,0.00016841407,0.00012696668,0.000048620666,0.000011351776,0.000015892196,0.000006163821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662274,0.0003970181,0.0010402757,0.00095416815,0.0005300413,0.00045576677],"domain_scores_gemma":[0.99773943,0.00075228256,0.00036142004,0.00048627815,0.00036444736,0.0002961525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031045715,0.0003861992,0.00048137034,0.0002455281,0.0008729512,0.0007383849,0.00034413778,0.00017517699,0.000006417816],"category_scores_gemma":[0.00034697892,0.0003657282,0.00016709401,0.00031347177,0.0001930329,0.001172602,0.00017820357,0.00052920124,0.0000019790762],"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.000031424363,0.00011677735,0.0010427868,0.00011200834,0.000019969173,3.648021e-7,0.0006448,0.6589874,0.00000467898,0.0078810295,0.000012478693,0.3311463],"study_design_scores_gemma":[0.0007890452,0.0003078357,0.0017212402,0.00008864336,0.000021050044,0.000053776595,0.000068560876,0.77992237,0.000009994783,0.21663344,0.000073307485,0.00031077518],"about_ca_topic_score_codex":0.000022802222,"about_ca_topic_score_gemma":0.000018104036,"teacher_disagreement_score":0.44578123,"about_ca_system_score_codex":0.00018504287,"about_ca_system_score_gemma":0.00011308379,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"W121999068","doi":"10.1007/11523468_95","title":"Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Tree (set theory); Omega; Combinatorics; Set (abstract data type); Mathematics; Function (biology); Polynomial; Discrete mathematics; Degree (music); Computer science; Physics","score_opus":0.03634676900953568,"score_gpt":0.2618878529731364,"score_spread":0.2255410839636007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121999068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002965658,0.0033618417,0.98958856,0.0010633834,0.0025181647,0.0009475443,0.00011205289,0.00020424821,0.0019076111],"genre_scores_gemma":[0.13164493,0.00018658832,0.8653008,0.0014943194,0.00079062884,0.000047872105,0.0000709185,0.000054130098,0.00040980068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956911,0.00007809484,0.00075598987,0.001807393,0.0009158669,0.000751546],"domain_scores_gemma":[0.9951031,0.0013530839,0.00043640166,0.0024722442,0.00037726582,0.00025786928],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001093348,0.00069112744,0.0008375793,0.00057359884,0.00079347246,0.001437675,0.004026067,0.00043207474,0.000022122967],"category_scores_gemma":[0.00008525138,0.0006696984,0.00022348331,0.0004302266,0.0018330814,0.0010155088,0.0021009916,0.00086247915,0.000018781871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046500914,0.00017100654,0.00013758251,0.00011038752,0.00007421354,0.000029955152,0.001977833,0.009208247,0.000080975056,0.286441,0.00039717986,0.7013251],"study_design_scores_gemma":[0.0006771682,0.00014816737,0.00020061118,0.00028946184,0.000017711178,0.000026562006,6.0899276e-7,0.6897103,0.00007657796,0.28918654,0.018946903,0.00071937934],"about_ca_topic_score_codex":0.00021789884,"about_ca_topic_score_gemma":0.000631957,"teacher_disagreement_score":0.70060575,"about_ca_system_score_codex":0.000264268,"about_ca_system_score_gemma":0.00030667856,"threshold_uncertainty_score":0.9995989},"labels":[],"label_agreement":null},{"id":"W126880940","doi":"10.1142/9789812562494_0012","title":"DERANDOMIZATION: A BRIEF OVERVIEW","year":2004,"lang":"en","type":"article","venue":"WORLD SCIENTIFIC eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"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","score_opus":0.03608390684753471,"score_gpt":0.25986663170532603,"score_spread":0.22378272485779133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126880940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003430019,0.0008201983,0.79185516,0.0018559363,0.004365083,0.000468271,0.0000052024084,0.0006465657,0.19655357],"genre_scores_gemma":[0.59028745,0.0000033564727,0.21650934,0.0028345217,0.00033674584,0.00008000991,0.000012670142,0.000030748462,0.18990514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983761,0.000049616734,0.00024872468,0.00055179023,0.00044694645,0.00032683642],"domain_scores_gemma":[0.99880594,0.00004915519,0.00007216417,0.0008430198,0.00010059899,0.00012911613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060982537,0.00013497833,0.00017088563,0.00030263863,0.0006808835,0.0009541075,0.0010274797,0.000024384295,0.000053851723],"category_scores_gemma":[0.0000136199815,0.00012767757,0.00012593306,0.00081990566,0.0002539978,0.00026451203,0.000288446,0.00012477174,0.0001257583],"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.000003927595,0.000040970055,0.000014085861,0.000011895103,0.000008709925,0.00001743389,0.00068023417,0.00016225384,0.00021110539,0.9734533,0.0026854214,0.022710687],"study_design_scores_gemma":[0.0027978385,0.000024303426,0.00023913938,0.00012323823,0.000009197332,0.000039011673,0.000010379799,0.0044299504,0.0053073843,0.38097408,0.6056502,0.0003952967],"about_ca_topic_score_codex":0.0000117741165,"about_ca_topic_score_gemma":0.00085413543,"teacher_disagreement_score":0.60296476,"about_ca_system_score_codex":0.000045476063,"about_ca_system_score_gemma":0.00015034567,"threshold_uncertainty_score":0.92004806},"labels":[],"label_agreement":null},{"id":"W1480046334","doi":"10.5555/1496770.1496810","title":"Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures","year":2009,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Rank (graph theory); Combinatorics; Mathematics; Satisfiability; Upper and lower bounds; Argument (complex analysis); Discrete mathematics; Exponential function","score_opus":0.017158413943393833,"score_gpt":0.26307868204179413,"score_spread":0.24592026809840029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480046334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057081163,0.00033736054,0.92988795,0.003640677,0.0009820242,0.00045254076,0.0000075510125,0.00038535215,0.007225405],"genre_scores_gemma":[0.871459,0.000024212623,0.124761276,0.0019254274,0.0001672842,0.000018109224,0.0000045129973,0.000006561081,0.0016336059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875087,0.000023932194,0.00021394483,0.00047173662,0.00020878384,0.0003307353],"domain_scores_gemma":[0.9992875,0.00006487159,0.000048810427,0.00039738763,0.00008222371,0.00011924982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022688815,0.00017395412,0.00018207236,0.000092851245,0.000209852,0.000343094,0.0005577733,0.00006871157,0.00004056949],"category_scores_gemma":[0.000040038653,0.00014265548,0.00011636967,0.00022923425,0.00010127553,0.0005277253,0.00013604196,0.000110805624,0.0000073977867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010854595,0.0005454486,0.00033221164,0.000063331936,0.000041992917,0.000013875985,0.00086244603,0.0000046289706,0.0014376602,0.70081025,0.04016604,0.25561357],"study_design_scores_gemma":[0.003748301,0.0022587352,0.037043083,0.00013186867,0.00004721032,0.00014991983,0.00018168279,0.088085584,0.008287612,0.69361335,0.16479766,0.0016549939],"about_ca_topic_score_codex":0.000032175656,"about_ca_topic_score_gemma":0.00011259365,"teacher_disagreement_score":0.81437784,"about_ca_system_score_codex":0.00001508053,"about_ca_system_score_gemma":0.000059993494,"threshold_uncertainty_score":0.58173215},"labels":[],"label_agreement":null},{"id":"W1482466102","doi":"","title":"Probabilistic optimization in graph-problems","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Probabilistic logic; Null graph; Voltage graph; Graph; Mathematics; Graph property; Vertex (graph theory); Computation; Regular graph; Combinatorics; Mathematical optimization; Discrete mathematics; Line graph; Algorithm","score_opus":0.05702908760854954,"score_gpt":0.34465273981799505,"score_spread":0.2876236522094455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482466102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025807735,0.0000796064,0.9661029,0.0026211892,0.00076835195,0.0011138795,0.000008873339,0.0001956612,0.003301814],"genre_scores_gemma":[0.4476586,0.00007953425,0.5508394,0.00007961567,0.00021763988,0.00047253745,0.000030531726,0.000022008628,0.0006000948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975989,0.00026291714,0.00034478746,0.0005762717,0.00065665116,0.00056046003],"domain_scores_gemma":[0.9982232,0.00022259202,0.000014836213,0.0008918123,0.0005118847,0.00013570802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977152,0.00013639919,0.00014881081,0.0008948313,0.0005794961,0.00060598215,0.001342051,0.00011623215,0.0001498335],"category_scores_gemma":[0.0003784078,0.00013317456,0.000049380422,0.0030259576,0.0002835203,0.00084677135,0.00040492232,0.001087684,0.000095166666],"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.0000023220523,0.00042622845,0.00022122131,0.000021941047,0.000010990622,0.000022669798,0.001210179,0.417348,0.0016012373,0.5384554,0.00028491672,0.040394887],"study_design_scores_gemma":[0.0002981696,0.00006840824,0.0007173263,0.000015433083,8.799685e-7,0.00002211093,0.000037466878,0.973245,0.00014629049,0.024617007,0.00066964416,0.00016223252],"about_ca_topic_score_codex":0.0006352225,"about_ca_topic_score_gemma":0.0021506317,"teacher_disagreement_score":0.55589706,"about_ca_system_score_codex":0.000054221706,"about_ca_system_score_gemma":0.000276388,"threshold_uncertainty_score":0.58435},"labels":[],"label_agreement":null},{"id":"W1487422852","doi":"10.1007/978-3-540-68891-4_10","title":"Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Cover (algebra); Vertex cover; Vertex (graph theory); Mathematics; Hierarchy; Relaxation (psychology); Graph; Semidefinite programming; Edge cover; Discrete mathematics; Mathematical optimization; Biology","score_opus":0.022295581302762667,"score_gpt":0.23279295565428937,"score_spread":0.2104973743515267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487422852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008912259,0.0026071812,0.98773724,0.0005266582,0.0023457776,0.00031540677,0.00003113178,0.00028325603,0.006064228],"genre_scores_gemma":[0.2615388,0.0017984468,0.71700203,0.010194493,0.0010688559,0.000042639498,0.00007848737,0.00019235957,0.008083862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940928,0.00008958554,0.0007879846,0.002076295,0.0019052377,0.0010480991],"domain_scores_gemma":[0.9960446,0.0010620302,0.00032023643,0.001942302,0.0003194801,0.00031134588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008018626,0.0008111512,0.0008923812,0.0016445649,0.0005820926,0.00057675573,0.0051487302,0.00048739125,0.00009019287],"category_scores_gemma":[0.00013887204,0.0007609435,0.0002720979,0.0018153269,0.0022700299,0.00085147074,0.0020212184,0.0011355531,0.00017005482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014220577,0.00009077819,0.000028549615,0.000059546626,0.00003418729,0.00028306444,0.0007952911,0.004290314,0.00006783774,0.028265161,0.0032699986,0.96280104],"study_design_scores_gemma":[0.0010436922,0.0005702547,0.00028868782,0.0005888293,0.000021414782,0.00045277114,5.0077534e-7,0.63377017,0.002676859,0.27861127,0.07939429,0.0025812818],"about_ca_topic_score_codex":0.00008202167,"about_ca_topic_score_gemma":0.00003614309,"teacher_disagreement_score":0.96021974,"about_ca_system_score_codex":0.00043712254,"about_ca_system_score_gemma":0.00068685465,"threshold_uncertainty_score":0.9994842},"labels":[],"label_agreement":null},{"id":"W1497071043","doi":"10.1007/11496915_5","title":"Disjoint Cycles: Integrality Gap, Hardness, and Approximation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Omega; Packing problems; Mathematics; Approximation algorithm; Vertex (graph theory); Conjecture; Upper and lower bounds; Binary logarithm; Undirected graph; Discrete mathematics; Graph; Physics","score_opus":0.030069022523276742,"score_gpt":0.2571625246057706,"score_spread":0.22709350208249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497071043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010507137,0.00061541976,0.9921127,0.0015365608,0.0016236744,0.00036503258,0.00000870087,0.00022040158,0.0034124441],"genre_scores_gemma":[0.08585408,0.00019461029,0.91109765,0.0015807098,0.00077076885,0.000016754766,0.000012156215,0.00003698921,0.00043625795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626344,0.000045298402,0.00056623854,0.0016343446,0.0008987848,0.00059189723],"domain_scores_gemma":[0.99776727,0.00022708904,0.00027733907,0.0013418078,0.00018383232,0.00020265454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010110398,0.0005504988,0.0005552126,0.0006924575,0.00035512212,0.000857208,0.0024699974,0.0002835124,0.000024509762],"category_scores_gemma":[0.00008096645,0.0004949107,0.00014059294,0.00053958537,0.001259003,0.0009888147,0.0017781658,0.000906379,0.000024970865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025693125,0.000029183768,0.000047743615,0.000044121465,0.0000071789696,0.000017841852,0.00065618765,0.0008485009,0.000017216056,0.1461802,0.00002323104,0.85212606],"study_design_scores_gemma":[0.00018241681,0.000072956755,0.000469587,0.0003162438,0.0000061277574,0.00007760049,3.1356407e-7,0.47939768,0.00023830116,0.5162538,0.0024133567,0.00057158805],"about_ca_topic_score_codex":0.000037988488,"about_ca_topic_score_gemma":0.00011247031,"teacher_disagreement_score":0.85155445,"about_ca_system_score_codex":0.0002308858,"about_ca_system_score_gemma":0.0002642374,"threshold_uncertainty_score":0.99975026},"labels":[],"label_agreement":null},{"id":"W1499475083","doi":"10.1007/3-540-44849-7_26","title":"Nearly Bounded Error Probabilistic Sets","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Connection (principal bundle); Time complexity; Probabilistic logic; Bounded function; Complexity class; Discrete mathematics; Class (philosophy); Combinatorics; Randomized algorithm; Cryptography; Polynomial; Probabilistic analysis of algorithms; Computer science; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02953993998092934,"score_gpt":0.2593161153289079,"score_spread":0.22977617534797856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499475083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007985822,0.00045691826,0.985146,0.0012197932,0.0033246665,0.0005921038,0.000009091218,0.0002863903,0.008885172],"genre_scores_gemma":[0.019910662,0.00002321558,0.97454447,0.004359375,0.0003974585,0.000024947383,0.000008272337,0.00006738011,0.0006642281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458396,0.000070132446,0.0006763638,0.0022293804,0.001394173,0.0010459805],"domain_scores_gemma":[0.99625874,0.0005029383,0.00031756004,0.0022979642,0.00032284812,0.00029992516],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010756231,0.0007542292,0.0007062625,0.0009175037,0.0005400835,0.0012547888,0.0049172817,0.00040286637,0.000051961757],"category_scores_gemma":[0.00017382026,0.0007180669,0.00024350201,0.0011077758,0.0015620542,0.00076604565,0.0014583321,0.001240669,0.00009579588],"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.000006661065,0.00009874604,0.000029578132,0.000095849464,0.000026091557,0.00026780253,0.0009701812,0.0072634043,0.00002303032,0.27051955,0.0001724023,0.7205267],"study_design_scores_gemma":[0.00022323648,0.00016991151,0.000066727276,0.00021981604,0.000007652019,0.00014708369,7.8854626e-8,0.29143256,0.00010435261,0.702068,0.004822032,0.00073860754],"about_ca_topic_score_codex":0.000020433623,"about_ca_topic_score_gemma":0.000087882116,"teacher_disagreement_score":0.7197881,"about_ca_system_score_codex":0.0003870045,"about_ca_system_score_gemma":0.00078432064,"threshold_uncertainty_score":0.999782},"labels":[],"label_agreement":null},{"id":"W1502382854","doi":"10.1007/978-3-540-73545-8_45","title":"On the Complexity of Finding an Unknown Cut Via Vertex Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Computer science; Matching (statistics); Time complexity; Binary logarithm; Combinatorics; Computational complexity theory; Graph; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics","score_opus":0.0698119103731919,"score_gpt":0.284960043533053,"score_spread":0.2151481331598611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502382854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039528846,0.00012796074,0.9890944,0.0008595446,0.0019143914,0.00037121755,0.00000961519,0.00013804388,0.007089575],"genre_scores_gemma":[0.5495109,0.000032779946,0.4461305,0.0035365971,0.0004740877,0.000009413491,0.000011133047,0.000058241727,0.00023637498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957076,0.0000851124,0.0006671577,0.0013805835,0.0014115182,0.0007480735],"domain_scores_gemma":[0.9955183,0.0013927594,0.00041420606,0.0022167729,0.00027865122,0.00017930202],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017535142,0.00059103186,0.00063340634,0.0008946226,0.00060576666,0.00038235792,0.005668248,0.000287276,0.000058821603],"category_scores_gemma":[0.00012998717,0.0004456641,0.00021374896,0.0009972133,0.0043466114,0.0005679777,0.0015011539,0.0011695365,0.000023005621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008273497,0.000047655205,0.000010192292,0.000019899975,0.000010500189,0.00002674452,0.0007048659,0.002191008,0.00004092065,0.70674074,0.0000140750635,0.29018512],"study_design_scores_gemma":[0.00012157517,0.00030941798,0.0001540668,0.00027468777,0.0000048898273,0.000037859194,3.5165706e-7,0.29724053,0.0019488821,0.6988497,0.0006237652,0.00043429443],"about_ca_topic_score_codex":0.00007968437,"about_ca_topic_score_gemma":0.00048693197,"teacher_disagreement_score":0.5491156,"about_ca_system_score_codex":0.00018844068,"about_ca_system_score_gemma":0.00032287798,"threshold_uncertainty_score":0.9997995},"labels":[],"label_agreement":null},{"id":"W1517853613","doi":"10.1007/978-3-540-74915-8_29","title":"Relativizing Small Complexity Classes and Their Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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":"Oracle; Stack (abstract data type); Hierarchy; Bounded function; Class (philosophy); Function (biology); Limit (mathematics); Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","score_opus":0.05651785826671054,"score_gpt":0.26455284292850273,"score_spread":0.20803498466179218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517853613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019253237,0.0013657522,0.98372626,0.00063526887,0.0014245812,0.00031977764,0.000009794365,0.00027523123,0.01205082],"genre_scores_gemma":[0.11664133,0.00016186018,0.8804746,0.0017727136,0.00059409946,0.0000059066483,0.0000062904974,0.00004877756,0.00029442608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961629,0.000060056096,0.0005863575,0.0017174468,0.000623579,0.0008496687],"domain_scores_gemma":[0.9962174,0.0016034569,0.00030487846,0.0014105273,0.00023391104,0.00022981873],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016538132,0.0007162196,0.0007024314,0.0009970975,0.00065247866,0.00084759895,0.0030440276,0.00036540037,0.000017013444],"category_scores_gemma":[0.000117856456,0.00059755845,0.00016155685,0.0007722669,0.0031904909,0.0006468967,0.002624706,0.0013044555,0.000012726518],"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.0000038012809,0.000015556032,0.000069466485,0.000026955686,0.000011231386,0.000035553454,0.0010518173,0.00029166823,0.000019416988,0.499044,0.0000027887547,0.49942777],"study_design_scores_gemma":[0.0001723829,0.00012339109,0.00036851986,0.00030667937,0.0000044569,0.00012756066,9.399557e-7,0.14570868,0.000511379,0.84983355,0.0021913617,0.0006510812],"about_ca_topic_score_codex":0.00003904308,"about_ca_topic_score_gemma":0.0004112359,"teacher_disagreement_score":0.49877667,"about_ca_system_score_codex":0.00016651597,"about_ca_system_score_gemma":0.00030743357,"threshold_uncertainty_score":0.99964756},"labels":[],"label_agreement":null},{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","score_opus":0.021028523623075977,"score_gpt":0.24140401726281083,"score_spread":0.22037549363973485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519655831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004992663,0.0004143413,0.9896368,0.005186647,0.0014558323,0.001157255,0.000010146907,0.00013983437,0.0019941647],"genre_scores_gemma":[0.00907398,0.000042892545,0.9828745,0.0058577624,0.0010959781,0.00010238925,0.000011276959,0.000037967406,0.0009032214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967317,0.000026828991,0.00050328946,0.0012437261,0.0008840444,0.00061043294],"domain_scores_gemma":[0.99685746,0.0011250521,0.0002733263,0.0013881264,0.00026218212,0.00009382511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001000996,0.00046661453,0.0003928866,0.0004334112,0.00059292564,0.0009209684,0.0037415568,0.00023830691,0.0000344756],"category_scores_gemma":[0.000058938287,0.00034399907,0.00021327862,0.0005095604,0.00067417324,0.00078667724,0.0009303074,0.0006462434,0.000049035072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047068947,0.000022086142,0.000003852768,0.000030981148,0.000015366075,0.0000039289926,0.0005508894,0.020102132,0.00002802292,0.11256496,0.00025038453,0.8664227],"study_design_scores_gemma":[0.00022251201,0.00007996363,0.00002620957,0.00010884051,0.000008824654,0.000022946528,6.845559e-8,0.6735702,0.0002746866,0.30793074,0.017414061,0.0003409768],"about_ca_topic_score_codex":0.000008582902,"about_ca_topic_score_gemma":0.000039866944,"teacher_disagreement_score":0.8660817,"about_ca_system_score_codex":0.00020556281,"about_ca_system_score_gemma":0.00035911094,"threshold_uncertainty_score":0.9999012},"labels":[],"label_agreement":null},{"id":"W1522877504","doi":"10.1007/978-3-540-44400-8_6","title":"On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Inequality; Type (biology); Mathematics; Semidefinite programming; Time complexity; Polynomial; Combinatorics; Mathematical optimization; Mathematical analysis","score_opus":0.11658553600442273,"score_gpt":0.27467256941307483,"score_spread":0.1580870334086521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522877504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010552296,0.00034881226,0.98572,0.0011141453,0.0009690809,0.00035510538,0.000015832064,0.00006318149,0.010358649],"genre_scores_gemma":[0.34247762,0.000035373774,0.65320325,0.0038547695,0.00018122146,0.0000069868324,0.0000024957328,0.00003115198,0.00020714894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970467,0.00011354281,0.00048839016,0.0009608815,0.0009338445,0.0004566234],"domain_scores_gemma":[0.9938893,0.004275396,0.00034455876,0.0009581988,0.00043054638,0.00010205172],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012774327,0.00042964495,0.00053346634,0.0007226516,0.00039461307,0.00028122085,0.002123086,0.00015805551,0.00002827111],"category_scores_gemma":[0.0010710097,0.00031554655,0.00008582859,0.0015008688,0.0035904055,0.00025860663,0.0010571774,0.00079928193,0.000006887629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006393453,0.000035364574,0.00006309505,0.000039589362,0.00001718115,0.000015371023,0.00072351616,0.0020615943,0.00004679606,0.8485178,0.000039838542,0.1484335],"study_design_scores_gemma":[0.00014586076,0.00033380432,0.00033727434,0.0002640167,0.000005364334,0.0000435306,7.592301e-7,0.123893976,0.00068141083,0.8738162,0.00012850254,0.0003493165],"about_ca_topic_score_codex":0.000057443303,"about_ca_topic_score_gemma":0.000032779844,"teacher_disagreement_score":0.3414224,"about_ca_system_score_codex":0.00009024714,"about_ca_system_score_gemma":0.00026880362,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"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":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","score_opus":0.013459984448297577,"score_gpt":0.2270239102562561,"score_spread":0.21356392580795852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153015188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4417699,0.000111531954,0.55635905,0.0001317033,0.00018738533,0.00007305925,5.4441966e-7,0.00025482662,0.0011120162],"genre_scores_gemma":[0.78794295,7.411631e-7,0.21177691,0.00011212507,0.00014116969,9.220727e-7,0.000001072282,0.000007392309,0.000016755155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753547,0.00037640758,0.0006661053,0.00047268177,0.0004261897,0.00052314525],"domain_scores_gemma":[0.99739707,0.0011602651,0.00034746635,0.00087712443,0.00015051298,0.00006755713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022349872,0.0002212435,0.0003763126,0.0002458715,0.0003749601,0.000112476824,0.0021478992,0.00005282154,0.0000030052126],"category_scores_gemma":[0.00005583499,0.00022187555,0.00019815455,0.0008799383,0.000300404,0.0004862027,0.00088985835,0.00019237249,0.0000021865162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000990234,0.000118337084,0.0012307578,0.000019044099,0.000012411932,0.000009049694,0.0008789822,0.0055249413,0.0020284692,0.9128605,0.0000121398225,0.07729544],"study_design_scores_gemma":[0.00046864667,0.000086958535,0.03968773,0.000059010334,0.0000050429794,0.00003943812,0.0000946626,0.14390709,0.014181292,0.8011931,0.000039943156,0.00023705982],"about_ca_topic_score_codex":0.000092489696,"about_ca_topic_score_gemma":0.0000054936486,"teacher_disagreement_score":0.34617302,"about_ca_system_score_codex":0.000019050854,"about_ca_system_score_gemma":0.000039222577,"threshold_uncertainty_score":0.90478224},"labels":[],"label_agreement":null},{"id":"W1531964914","doi":"10.5555/2095116.2095241","title":"Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":82,"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":"Set cover problem; Mathematics; Approximation algorithm; Covering problems; Cover (algebra); Combinatorics; Set (abstract data type); Sampling (signal processing); Matching (statistics); Binary logarithm; Discrete mathematics; Computer science","score_opus":0.036789056638086653,"score_gpt":0.2687750987619836,"score_spread":0.23198604212389692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531964914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07807399,0.00035933804,0.91813546,0.00020602095,0.0006391632,0.00018452849,0.000008485594,0.0002582333,0.0021347974],"genre_scores_gemma":[0.7497811,0.000047004916,0.24936044,0.00032787002,0.00013784833,0.00000745685,0.0000065240274,0.000010650683,0.00032113088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849695,0.0000386832,0.00025860817,0.00034120714,0.0002708843,0.00059366744],"domain_scores_gemma":[0.99884516,0.0002250559,0.00008274933,0.00048906665,0.00008921795,0.00026876992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422659,0.00020035352,0.00021814609,0.00040489013,0.0002629039,0.00022166882,0.0005477627,0.00009422353,0.000087672306],"category_scores_gemma":[0.00004016755,0.00017236779,0.000068710375,0.0014146809,0.00008966434,0.0012041023,0.00049756287,0.00022677178,0.00008349154],"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.000032000382,0.001002702,0.025408873,0.0001817092,0.00022916148,0.000011827143,0.004949743,0.0000090852445,0.004193929,0.2918848,0.0019938124,0.67010236],"study_design_scores_gemma":[0.0029585264,0.00074493117,0.056985233,0.000055966793,0.00006475569,0.00048114953,0.00029696262,0.781005,0.007485669,0.08268398,0.06492465,0.0023131694],"about_ca_topic_score_codex":0.00025943507,"about_ca_topic_score_gemma":0.000016005695,"teacher_disagreement_score":0.7809959,"about_ca_system_score_codex":0.000044605895,"about_ca_system_score_gemma":0.000028254577,"threshold_uncertainty_score":0.70289546},"labels":[],"label_agreement":null},{"id":"W1542059531","doi":"10.1007/11814948_29","title":"Efficiency of Local Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Local search (optimization); Heuristic; Constant (computer programming); Guided Local Search; Computer science; Search problem; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.01910925632822527,"score_gpt":0.2489409918068747,"score_spread":0.22983173547864943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542059531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009384425,0.000512648,0.9874709,0.00025511527,0.0011759406,0.0002651727,0.000008219231,0.00012257058,0.010095587],"genre_scores_gemma":[0.48644224,0.00003107293,0.51207423,0.0004405294,0.00041778275,0.0000049123814,0.000006578711,0.000039413964,0.00054324896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550796,0.00003991164,0.0006674588,0.0014420856,0.001583142,0.00075947354],"domain_scores_gemma":[0.9971396,0.0004982285,0.00023400148,0.0016396403,0.00034007142,0.0001484613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010482667,0.0004795639,0.0006170782,0.0012355382,0.00022900193,0.00024354333,0.004971639,0.00029362828,0.000027636537],"category_scores_gemma":[0.00002532362,0.00044892367,0.00021789198,0.0012141796,0.0023711992,0.0003747676,0.0020051452,0.0008996894,0.000030067959],"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.0000034255665,0.000074075484,0.000026937018,0.00006237461,0.000007267095,0.00007605889,0.00027713133,0.10727225,0.00007906038,0.091434166,0.00004061475,0.8006466],"study_design_scores_gemma":[0.00023956146,0.00025036014,0.00013640261,0.0003201453,0.0000051014686,0.0000621528,1.9635405e-7,0.79779416,0.0043879803,0.19544125,0.0007720945,0.00059057877],"about_ca_topic_score_codex":0.000111707486,"about_ca_topic_score_gemma":0.000055055403,"teacher_disagreement_score":0.80005604,"about_ca_system_score_codex":0.00019743518,"about_ca_system_score_gemma":0.00067077624,"threshold_uncertainty_score":0.9997963},"labels":[],"label_agreement":null},{"id":"W1543181490","doi":"10.1007/978-3-540-73556-4_6","title":"Searching Cycle-Disjoint Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Disjoint sets; Computer science; Graph; Time complexity; Vertex (graph theory); Running time; Mathematics; Discrete mathematics; Algorithm","score_opus":0.033346422014682714,"score_gpt":0.2770830695380785,"score_spread":0.24373664752339577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543181490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007769763,0.0005104035,0.97687876,0.0005723506,0.0025573594,0.00037133094,0.000004755908,0.00036136003,0.018665997],"genre_scores_gemma":[0.0549556,0.000094967945,0.941342,0.002433544,0.0007337556,0.000007779273,0.0000067821043,0.00006515207,0.00036043103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940795,0.000049211605,0.0007209412,0.0020992467,0.0017950719,0.0012560473],"domain_scores_gemma":[0.99620754,0.0007499749,0.00028860156,0.0021303992,0.00025704375,0.0003664353],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021236078,0.00071266224,0.0006584503,0.0022395193,0.0005852316,0.00091030047,0.0057541975,0.00037291757,0.000044743858],"category_scores_gemma":[0.000096164826,0.00068167126,0.0003202216,0.0014069887,0.0014044743,0.0007882812,0.0029720499,0.0018321845,0.000090602065],"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.0000030646138,0.00002588117,0.000015566473,0.000024505194,0.000010252926,0.00017921533,0.00046896152,0.0063040163,0.000027029284,0.26724395,0.000008465089,0.7256891],"study_design_scores_gemma":[0.00018156892,0.000117193784,0.00011735912,0.0003204486,0.000004437387,0.00012518953,1.4310123e-7,0.3140184,0.00039528817,0.68190473,0.0021309073,0.000684301],"about_ca_topic_score_codex":0.00007777414,"about_ca_topic_score_gemma":0.00019230985,"teacher_disagreement_score":0.7250048,"about_ca_system_score_codex":0.00028967138,"about_ca_system_score_gemma":0.00048910896,"threshold_uncertainty_score":0.99962515},"labels":[],"label_agreement":null},{"id":"W1551570706","doi":"10.1137/070684008","title":"Algebraic Algorithms for Matching and Matroid Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Algebraic number; Intersection (aeronautics); Weighted matroid; Matching (statistics); Discrete mathematics; Simple (philosophy); Oriented matroid; Matrix (chemical analysis); Exponent; Rank (graph theory); Matrix multiplication; Graphic matroid; Matroid partitioning","score_opus":0.028521770577790092,"score_gpt":0.28192901818277,"score_spread":0.2534072476049799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551570706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040459614,0.00043412403,0.9544281,0.0030816756,0.0007650788,0.00020182709,0.0000012173256,0.00015562668,0.00047273593],"genre_scores_gemma":[0.576987,0.000031321964,0.42079514,0.0014270497,0.0007045104,0.0000012967615,8.6765874e-7,0.000012495467,0.000040249113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983427,0.0000675609,0.00041045976,0.0003665967,0.00032003006,0.0004926391],"domain_scores_gemma":[0.99896723,0.00026339784,0.00023761406,0.00024323277,0.00009704772,0.00019148306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521146,0.00020839517,0.0002574793,0.00021819159,0.0008260222,0.0007316255,0.00069288566,0.00005573423,0.0000029753066],"category_scores_gemma":[0.000036265956,0.00018590635,0.00014232354,0.00027725918,0.00003357106,0.00039249065,0.00013707054,0.00046342547,0.0000056486538],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009185699,0.00009841671,0.0000355718,0.0000251586,0.00002763146,0.00003616755,0.0011415506,0.0027583581,0.00040201965,0.1682562,0.00038486658,0.8268249],"study_design_scores_gemma":[0.001066591,0.00095692335,0.0020768065,0.0003271166,0.0000090850435,0.0013934919,0.00006413714,0.39937583,0.00024817395,0.590581,0.0034878082,0.00041306214],"about_ca_topic_score_codex":0.000001821507,"about_ca_topic_score_gemma":4.584344e-7,"teacher_disagreement_score":0.82641184,"about_ca_system_score_codex":0.0000410331,"about_ca_system_score_gemma":0.00004137037,"threshold_uncertainty_score":0.7581041},"labels":[],"label_agreement":null},{"id":"W1554277184","doi":"10.1007/978-3-540-73545-8_49","title":"Priority Algorithms for the Subset-Sum Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Key (lock); Greedy algorithm; Algorithm; Approximation algorithm; Power (physics); Simple (philosophy); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.046083054014039206,"score_gpt":0.28702786996586904,"score_spread":0.24094481595182984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554277184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044825833,0.001223849,0.9892521,0.0017747602,0.0035912485,0.0013618629,0.000021055777,0.00025409358,0.002516567],"genre_scores_gemma":[0.002462498,0.000109740075,0.99322647,0.0020666674,0.0013799604,0.000046205307,0.000007741219,0.00004922281,0.00065148005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473524,0.000032708343,0.0007325579,0.0019243901,0.0013838192,0.0011912792],"domain_scores_gemma":[0.9946157,0.002121312,0.00037310252,0.0021980645,0.0004731854,0.00021864117],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00290977,0.0007074192,0.000620035,0.00074867374,0.00095075864,0.00093296805,0.007047702,0.0004183058,0.000018037941],"category_scores_gemma":[0.000103249135,0.0005297816,0.0003504981,0.0010380264,0.0014841815,0.0005910992,0.0019589413,0.0012824233,0.000026360556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006110049,0.00003092485,0.000013152207,0.000041041832,0.000019392282,0.000027038504,0.00044307616,0.0024317421,0.000008996905,0.1070016,0.00006530747,0.8899116],"study_design_scores_gemma":[0.00031607307,0.00018795759,0.0001083445,0.00017693653,0.000014708346,0.000075702104,2.4150768e-7,0.51787144,0.0003314492,0.45147088,0.028761327,0.00068496674],"about_ca_topic_score_codex":0.000051351923,"about_ca_topic_score_gemma":0.00024919523,"teacher_disagreement_score":0.8892267,"about_ca_system_score_codex":0.00028692925,"about_ca_system_score_gemma":0.0006608829,"threshold_uncertainty_score":0.9997154},"labels":[],"label_agreement":null},{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"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":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; Computer science; Graph","score_opus":0.022925676934881494,"score_gpt":0.27024134900472824,"score_spread":0.24731567206984675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554407673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028778184,0.00027956828,0.9669082,0.00074335776,0.0002399657,0.00050151563,0.000018865789,0.00016546778,0.0023648525],"genre_scores_gemma":[0.8058921,0.000049344395,0.19346455,0.0004258634,0.000013241321,0.000057885645,0.0000071451173,0.000013343845,0.00007654362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982388,0.00009592699,0.00031243605,0.00062332914,0.0002039726,0.00052554935],"domain_scores_gemma":[0.9991014,0.0003172081,0.000049534843,0.00033204,0.00006582355,0.00013397372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066291506,0.0002347253,0.00027234163,0.00025234962,0.00015252916,0.00015494054,0.00039796537,0.00009757341,0.000013149824],"category_scores_gemma":[0.000047516587,0.00022511317,0.00012318521,0.00055252557,0.00011831253,0.0004046407,0.00006348892,0.0002039654,0.0000018889272],"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.00002209592,0.0002730351,0.004668377,0.000030588937,0.00008971506,0.00011284864,0.004980342,0.0002572278,0.000277383,0.8594585,0.00012756803,0.12970233],"study_design_scores_gemma":[0.0025416345,0.0007393328,0.017958267,0.000091392,0.00002785396,0.00016849238,0.0022390222,0.7124237,0.0004958863,0.25835562,0.0039597056,0.0009991144],"about_ca_topic_score_codex":0.000042197,"about_ca_topic_score_gemma":0.00043312524,"teacher_disagreement_score":0.7771139,"about_ca_system_score_codex":0.000037415673,"about_ca_system_score_gemma":0.000071163944,"threshold_uncertainty_score":0.91798484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050175358,0.00009575732,0.93907064,0.0002123489,0.0046970816,0.004155806,0.00048200454,0.00038416142,0.00072681095],"genre_scores_gemma":[0.6664422,0.000057972826,0.32766908,0.0004763996,0.00047704933,0.0014643053,0.0031324476,0.00008972034,0.00019082658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959284,0.00006809004,0.0018368164,0.0006130567,0.0007145646,0.0008390701],"domain_scores_gemma":[0.99567324,0.00019839106,0.0015232975,0.0015225176,0.000889523,0.00019303049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086352235,0.000674317,0.0010140438,0.00046325382,0.00048378445,0.0009866487,0.0021865207,0.0005223177,0.000011713422],"category_scores_gemma":[0.00005137434,0.0006614453,0.0007466668,0.0003627379,0.00020393508,0.0018296357,0.0015901793,0.0008461139,0.00002779817],"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.00064235955,0.003121409,0.0021820315,0.0345352,0.002022884,0.0000044908816,0.03171713,0.0045963954,0.00052169495,0.20231381,0.008062231,0.71028036],"study_design_scores_gemma":[0.0033718692,0.0008557713,0.00079212687,0.0031011866,0.0002127792,0.0000488378,0.00047833554,0.90686,0.0010850402,0.060335584,0.02143294,0.0014255324],"about_ca_topic_score_codex":0.00008680484,"about_ca_topic_score_gemma":0.000017445991,"teacher_disagreement_score":0.9022636,"about_ca_system_score_codex":0.00014997185,"about_ca_system_score_gemma":0.00015113202,"threshold_uncertainty_score":0.99958366},"labels":[],"label_agreement":null},{"id":"W1554467813","doi":"","title":"On Survivable Set Connectivity","year":2015,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Discrete mathematics; Disjoint sets; Time complexity; Path (computing); Node (physics); Set (abstract data type); Undirected graph; Reduction (mathematics); Set cover problem; Graph; Computer science; Computer network","score_opus":0.08869594552647594,"score_gpt":0.2866805072558247,"score_spread":0.19798456172934878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554467813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04559575,0.000014596168,0.79238844,0.0010665815,0.0006540886,0.000068470945,0.0000020489695,0.0003439232,0.15986608],"genre_scores_gemma":[0.9720374,7.128244e-7,0.02579317,0.0007765134,0.00003946887,0.0000034932398,9.2411904e-7,0.0000030611184,0.0013453038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993115,0.000051546325,0.00006551827,0.0002113299,0.00020219252,0.00015788087],"domain_scores_gemma":[0.9992565,0.00014785814,0.000017294182,0.00041622508,0.000051843574,0.000110268506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036521023,0.00006638673,0.00008115949,0.00004894194,0.000058803987,0.000089705034,0.00047683736,0.000023275345,0.000039783754],"category_scores_gemma":[0.00007303216,0.00005553598,0.000030265039,0.00025677972,0.000025137717,0.00023515464,0.0001757101,0.00007442977,0.00026706088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024816766,0.000045598536,0.00019177997,9.469191e-7,0.0000035471478,0.0000054931666,0.0001129869,0.00008596399,0.000006020797,0.9756366,0.017010482,0.006898126],"study_design_scores_gemma":[0.0005306109,0.0002887645,0.0012820136,0.0000062879176,0.0000011801542,0.000014900855,0.000052627052,0.1375438,0.0016988631,0.83074355,0.027586041,0.00025134473],"about_ca_topic_score_codex":0.00015027191,"about_ca_topic_score_gemma":0.000036824753,"teacher_disagreement_score":0.9264416,"about_ca_system_score_codex":0.000019791234,"about_ca_system_score_gemma":0.000040420397,"threshold_uncertainty_score":0.34326163},"labels":[],"label_agreement":null},{"id":"W1558278838","doi":"10.1145/3095799","title":"An Average-Case Depth Hierarchy Theorem for Boolean Circuits","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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; National Science Foundation","keywords":"Mathematics; Hierarchy; Conjecture; Boolean function; Discrete mathematics; Combinatorics; Converse; Bounded function; Boolean circuit; Random variable; Polynomial; Statistics; Mathematical analysis","score_opus":0.05825755211603171,"score_gpt":0.31813863639199086,"score_spread":0.25988108427595913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558278838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34132877,0.00018102718,0.63710994,0.015265838,0.0040429197,0.00030589246,0.000010853754,0.000040966286,0.0017137957],"genre_scores_gemma":[0.94975805,0.000008617408,0.049213592,0.0003960354,0.00049015955,0.0000014163564,8.1228585e-8,0.000007368534,0.00012465294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907875,0.000085336236,0.00024615714,0.0001378202,0.00025059254,0.00020132145],"domain_scores_gemma":[0.9961566,0.0001786204,0.00050853775,0.0028824853,0.00015678465,0.000117021824],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000960427,0.00009619107,0.00016050723,0.00006896025,0.0009341972,0.00054553803,0.008680812,0.000036372297,0.000007224439],"category_scores_gemma":[0.0009464288,0.000060171235,0.0002527037,0.00006261044,0.00011682052,0.0008706469,0.000898214,0.00024282568,0.0000022559254],"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.00005063911,0.00035979654,0.00244571,0.000032882544,0.00016045633,0.0010146585,0.0025641574,0.0003635594,0.0014900618,0.16085063,0.0078765545,0.8227909],"study_design_scores_gemma":[0.0010755837,0.00041611804,0.013165278,0.000078899364,0.000028419838,0.006333132,0.000050185154,0.023096025,0.0032402356,0.9443263,0.007983472,0.000206363],"about_ca_topic_score_codex":0.0000062544045,"about_ca_topic_score_gemma":0.000016441065,"teacher_disagreement_score":0.8225845,"about_ca_system_score_codex":0.000023374314,"about_ca_system_score_gemma":0.00007257118,"threshold_uncertainty_score":0.9966827},"labels":[],"label_agreement":null},{"id":"W1558498035","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Steiner tree problem; Mathematics; Logarithm; Modulo; Approximation algorithm; Binary logarithm; Tree (set theory); Matching (statistics); Time complexity; Discrete mathematics; Hierarchy","score_opus":0.09702573959776858,"score_gpt":0.19240859151308234,"score_spread":0.09538285191531376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558498035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036154084,0.00008518254,0.946304,0.000031899446,0.0008590209,0.00042778414,0.000008153339,0.001228691,0.014901177],"genre_scores_gemma":[0.92551774,0.000045716562,0.07268017,0.00004885907,0.000117638025,0.0000036165998,0.000017976308,0.00003209019,0.0015361987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725604,0.00018768416,0.00035605516,0.00148582,0.00014654324,0.0005678808],"domain_scores_gemma":[0.99743444,0.00011295959,0.00043174176,0.0016227455,0.00019152851,0.00020661313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003805397,0.0004666197,0.0004993101,0.00042691192,0.0003113666,0.0001995229,0.0028886984,0.00031587676,0.000054567437],"category_scores_gemma":[0.00003603692,0.0005287528,0.00032805564,0.0009788072,0.00015491367,0.0005262204,0.0037765547,0.00088270527,0.00007199738],"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.00004179538,0.00072353246,0.002282076,0.00080013403,0.00063026405,0.00074098905,0.0042854296,0.2300427,0.0003394013,0.718712,0.0005831362,0.0408186],"study_design_scores_gemma":[0.00028769212,0.00003817082,0.00024977583,0.000174945,0.00004226871,0.00000835409,0.000028452647,0.805417,0.00013995428,0.1928558,0.00020987562,0.00054767664],"about_ca_topic_score_codex":0.0003137445,"about_ca_topic_score_gemma":0.000072630755,"teacher_disagreement_score":0.88936365,"about_ca_system_score_codex":0.00014032143,"about_ca_system_score_gemma":0.0001100715,"threshold_uncertainty_score":0.9997164},"labels":[],"label_agreement":null},{"id":"W1563601717","doi":"10.1016/s0927-0507(05)12007-6","title":"Submodular Function Minimization","year":2005,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Submodular set function; Minification; Function (biology); Computer science; Mathematics; Mathematical optimization; Algorithm; Philosophy; Linguistics; German","score_opus":0.07223204777223924,"score_gpt":0.32228452341118896,"score_spread":0.2500524756389497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563601717","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008319406,0.0009862653,0.33006534,0.00086935057,0.00037860448,0.0011738956,0.0000053858666,0.00010130508,0.66633666],"genre_scores_gemma":[0.016696589,0.010204062,0.09499426,0.00040306442,0.00029262574,0.0002484764,0.000033071585,0.000035996476,0.8770918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701166,0.000036788657,0.00030015694,0.000927929,0.0012257172,0.0004977366],"domain_scores_gemma":[0.9987176,0.000044481465,0.000027234219,0.00076962897,0.0002887778,0.00015229588],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001656354,0.00019278284,0.00016567988,0.0019585888,0.001075667,0.0010657277,0.0012031411,0.000089571375,0.00007668558],"category_scores_gemma":[0.000030214316,0.00019324046,0.00003252769,0.0005829847,0.0010146878,0.0012833341,0.0012091285,0.00040367187,0.0000718566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037864734,0.000026472195,0.0000028053362,0.000022549373,0.0000068679783,0.000012814018,0.00010434202,0.00051370874,0.000024011564,0.9274311,0.00037767334,0.07147388],"study_design_scores_gemma":[0.0008419596,0.00046233047,0.00047141858,0.0006191402,0.00001323902,0.000016273692,0.000073182426,0.3042048,0.00017671406,0.36954424,0.32280886,0.00076783716],"about_ca_topic_score_codex":0.00002007298,"about_ca_topic_score_gemma":0.00034434145,"teacher_disagreement_score":0.55788684,"about_ca_system_score_codex":0.00017268142,"about_ca_system_score_gemma":0.00014024868,"threshold_uncertainty_score":0.9999713},"labels":[],"label_agreement":null},{"id":"W1568987606","doi":"10.1007/978-3-540-68891-4_7","title":"A Polynomial Algorithm for Weighted Abstract Flow","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Path (computing); Generalization; Flow (mathematics); Constructive; Oracle; Mathematics; Flow network; Minimum-cost flow problem; sort; Mathematical optimization; Maximum flow problem; Polynomial; Computer science; Algorithm; Arithmetic","score_opus":0.02192116302009429,"score_gpt":0.24524403444849918,"score_spread":0.2233228714284049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568987606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010088746,0.00065874256,0.99140567,0.00064605294,0.0040352326,0.00073182007,0.00006004804,0.0002995502,0.0021527698],"genre_scores_gemma":[0.0011795417,0.00012321163,0.99528915,0.0013020318,0.0015447142,0.000029686373,0.000020325084,0.000051112762,0.00046021672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499804,0.000019769335,0.0007284257,0.0020814282,0.0011100866,0.0010622515],"domain_scores_gemma":[0.99659795,0.0007774399,0.0003438514,0.0016466437,0.00034641466,0.000287698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067287515,0.00076707645,0.0007802695,0.001148013,0.0006506161,0.0005740142,0.0047031455,0.0004819651,0.00003694929],"category_scores_gemma":[0.00004937036,0.0007388111,0.0004076149,0.0007109079,0.0010873986,0.00071719906,0.0012310843,0.0009877781,0.000048402402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051327047,0.000042563384,0.000001476623,0.00001899967,0.000017519616,0.00010082901,0.00034323733,0.001381715,0.000014844198,0.0008566097,0.0008841271,0.99633294],"study_design_scores_gemma":[0.00056325,0.00022603606,0.000045423276,0.0001959466,0.000008043811,0.00014811703,6.515877e-8,0.91056085,0.00056670746,0.061917447,0.024861239,0.00090685725],"about_ca_topic_score_codex":0.000028418455,"about_ca_topic_score_gemma":0.00003864307,"teacher_disagreement_score":0.99542606,"about_ca_system_score_codex":0.00029877233,"about_ca_system_score_gemma":0.00087440363,"threshold_uncertainty_score":0.9995063},"labels":[],"label_agreement":null},{"id":"W1574619705","doi":"10.1007/978-3-540-85363-3_19","title":"A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Approximation algorithm; Mathematics; Vertex connectivity; Minimum spanning tree; Metric (unit); Graph; Steiner tree problem; Enhanced Data Rates for GSM Evolution; Constant (computer programming); Graph factorization; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.024936180216039577,"score_gpt":0.23986739243886984,"score_spread":0.21493121222283026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574619705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029637123,0.00066223886,0.9941702,0.0003463293,0.0012937584,0.0013749213,0.00005406889,0.00031117196,0.0014909459],"genre_scores_gemma":[0.1226747,0.000101820006,0.87573904,0.0008289535,0.00034831767,0.00007193486,0.000029218272,0.00006085187,0.00014517248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951508,0.000044788456,0.0006741735,0.0019814821,0.0012369531,0.0009117897],"domain_scores_gemma":[0.9956356,0.0014593167,0.00049838074,0.0014749067,0.00067570375,0.0002560359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004969947,0.00076144916,0.0008183363,0.0022758394,0.0005737472,0.0006686659,0.003199748,0.00036133602,0.00001411782],"category_scores_gemma":[0.00017824904,0.0006416711,0.00024339088,0.0023780323,0.0013569808,0.00073095795,0.0006746109,0.0007263251,0.000011914374],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005552657,0.00012436451,0.00007344378,0.000118428936,0.00007191397,0.00011890013,0.0014652482,0.002390144,0.00013250789,0.06434068,0.000107759115,0.93100107],"study_design_scores_gemma":[0.0017866233,0.0012000381,0.00025067865,0.00073019584,0.000030571857,0.00046345816,8.912104e-7,0.87574136,0.0023221823,0.111816525,0.0037105414,0.0019469179],"about_ca_topic_score_codex":0.000020168369,"about_ca_topic_score_gemma":0.00007510115,"teacher_disagreement_score":0.92905414,"about_ca_system_score_codex":0.00038921493,"about_ca_system_score_gemma":0.0008215436,"threshold_uncertainty_score":0.99960345},"labels":[],"label_agreement":null},{"id":"W1577738218","doi":"10.1007/3-540-45535-3_3","title":"Edge Covers of Setpairs and the Iterative Rounding Method","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Computer science; Enhanced Data Rates for GSM Evolution; Iterative method; Algorithm; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.02282914659477234,"score_gpt":0.2737104800340561,"score_spread":0.25088133343928376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577738218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035310502,0.00073992065,0.9889631,0.0009769798,0.0011311411,0.00036063578,0.00000614849,0.00005862528,0.0077280845],"genre_scores_gemma":[0.055016767,0.00021136667,0.94242305,0.001511567,0.0003616171,0.000010101847,0.000002546391,0.000025957743,0.00043702102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970803,0.0001257113,0.00048796696,0.0010733306,0.0007819585,0.0004506906],"domain_scores_gemma":[0.9961667,0.0021444347,0.00034900062,0.0010370467,0.00019931095,0.00010347651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002057252,0.00041685122,0.000640845,0.0006003356,0.0003704163,0.00048749847,0.0026478728,0.00018155936,0.000015632744],"category_scores_gemma":[0.00012433853,0.00029751196,0.00016694365,0.00079849,0.002166649,0.0005399998,0.0016220427,0.0007328316,0.0000032904054],"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.000016378419,0.000014782936,0.000027003272,0.0000286237,0.000026575583,0.000032699445,0.003275066,0.006152807,0.000030982083,0.45288724,0.00001676343,0.5374911],"study_design_scores_gemma":[0.0005196847,0.00008857672,0.00003623623,0.0002467924,0.0000107890155,0.000113406684,9.259363e-7,0.51255786,0.00039205013,0.48401922,0.001694984,0.00031948488],"about_ca_topic_score_codex":0.000054924945,"about_ca_topic_score_gemma":0.000043937795,"teacher_disagreement_score":0.5371716,"about_ca_system_score_codex":0.0001178348,"about_ca_system_score_gemma":0.00024565597,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W1584512166","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Combinatorics; Vertex (graph theory); Vertex cover; Polytope; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Theory of computation; Linear programming relaxation; Graph; Discrete mathematics; Linear programming; Computer science; Mathematical optimization; Algorithm","score_opus":0.10416338469422035,"score_gpt":0.1982802356524526,"score_spread":0.09411685095823225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584512166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2995261,0.000119081036,0.6738284,0.00048233892,0.0053275214,0.001280199,0.000033974313,0.00057851867,0.018823875],"genre_scores_gemma":[0.9974383,0.00005910226,0.00020243667,0.00026603971,0.00025037522,0.000003848294,0.0000064836186,0.00001787079,0.0017555263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766123,0.00033639232,0.00022940466,0.0010909513,0.00020692356,0.00047508377],"domain_scores_gemma":[0.99727565,0.0003730741,0.000253782,0.0018764486,0.00010867746,0.000112356654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005790151,0.00037844895,0.00037246096,0.00023885549,0.00049130915,0.00039838295,0.0030090124,0.00024039252,0.000030046942],"category_scores_gemma":[0.00005639179,0.00031536055,0.00029425463,0.0005371445,0.00017307627,0.00025945946,0.00220146,0.00089994195,0.0002674478],"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.000034874323,0.00009980616,0.00042743812,0.0000882346,0.000120099176,0.000115253635,0.0003707324,0.091547325,0.000006538504,0.903176,0.0030149426,0.0009987475],"study_design_scores_gemma":[0.000264116,0.00011168453,0.0001926868,0.0002175068,0.000039905906,0.00000846963,0.00006800056,0.97511476,0.00006137582,0.010025753,0.013447865,0.0004478853],"about_ca_topic_score_codex":0.00040264573,"about_ca_topic_score_gemma":0.000010301517,"teacher_disagreement_score":0.89315027,"about_ca_system_score_codex":0.000142958,"about_ca_system_score_gemma":0.0002492075,"threshold_uncertainty_score":0.99992985},"labels":[],"label_agreement":null},{"id":"W1585955818","doi":"10.1007/978-3-642-13036-6_23","title":"Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Quadratic equation; Semidefinite programming; Mathematics; Combinatorics; Quadratic programming; Value (mathematics); Discrete mathematics; Mathematical optimization; Statistics; Geometry; Law; Political science","score_opus":0.02057281308764426,"score_gpt":0.271971755758368,"score_spread":0.25139894267072377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585955818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003250707,0.00013495701,0.9945658,0.0022912996,0.00051134446,0.0013938481,0.000006614252,0.0002249097,0.000546154],"genre_scores_gemma":[0.03583596,0.000008256226,0.9615711,0.0019651502,0.0002945363,0.00013405673,0.0000039112724,0.00003286236,0.00015416456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958309,0.000036400317,0.00048831076,0.001964048,0.00088975136,0.00079062406],"domain_scores_gemma":[0.99708396,0.00035260903,0.00017656123,0.0016371484,0.00025413546,0.0004955636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010098396,0.0005910412,0.00055066723,0.0009433548,0.00058573124,0.0013149921,0.0030554174,0.00023490748,0.000011478336],"category_scores_gemma":[0.000052807118,0.00049900124,0.00008502483,0.0013967712,0.0007444093,0.00048128047,0.0017439668,0.0011212081,0.000023522605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005803954,0.000033737808,0.00007878953,0.000045005403,0.00000979198,0.000027741766,0.0012624345,0.0010459193,0.00023063888,0.07155226,0.000005202176,0.9257027],"study_design_scores_gemma":[0.0007796304,0.0017738462,0.0012863206,0.0023637244,0.000048670634,0.00068282726,0.000006452779,0.155805,0.0035550736,0.75942904,0.06996858,0.004300821],"about_ca_topic_score_codex":0.00010345335,"about_ca_topic_score_gemma":0.00086139695,"teacher_disagreement_score":0.92140186,"about_ca_system_score_codex":0.00017280705,"about_ca_system_score_gemma":0.0002862203,"threshold_uncertainty_score":0.99974614},"labels":[],"label_agreement":null},{"id":"W1598457899","doi":"10.1145/2540088","title":"Graph Isomorphism is Not AC0-Reducible to Group Isomorphism","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","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":"Nondeterministic algorithm; Upper and lower bounds; Isomorphism (crystallography); Mathematics; Graph isomorphism; Quasigroup; Combinatorics; Discrete mathematics; Bounded function; Group (periodic table); Group isomorphism; Parity (physics); Graph; Automorphism; Automorphism group; Line graph","score_opus":0.02684005737958888,"score_gpt":0.25856516828993625,"score_spread":0.23172511091034736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598457899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011230369,0.00003893842,0.97478807,0.010886798,0.0013264904,0.00061572465,0.000026654316,0.0005500634,0.0005369022],"genre_scores_gemma":[0.7651397,0.000020415704,0.222965,0.0106538255,0.00008078548,0.00020516237,0.000009548147,0.000033636094,0.0008919344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975102,0.0002408046,0.000449901,0.00081214623,0.000514151,0.0004728063],"domain_scores_gemma":[0.99744165,0.00067446195,0.000115000454,0.0012546764,0.00021781829,0.00029640915],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045241672,0.00032754647,0.00028680847,0.00069124234,0.00065010804,0.0003567763,0.0015882162,0.00012089218,0.0008032244],"category_scores_gemma":[0.00003358842,0.0003386855,0.0002487943,0.0013801114,0.00014516298,0.00089642056,0.00006233762,0.00037923563,0.0019485203],"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.000047318415,0.00063546025,0.0000063296075,0.000022818334,0.00013109246,0.0000088979405,0.0033356408,0.009674122,0.0020739585,0.152705,0.005461391,0.825898],"study_design_scores_gemma":[0.0009691716,0.00052664644,0.0017315837,0.000068106405,0.000032701173,0.000054349435,0.0002250215,0.043542262,0.008327588,0.9398653,0.0038929167,0.0007643589],"about_ca_topic_score_codex":0.000121317236,"about_ca_topic_score_gemma":0.000007288391,"teacher_disagreement_score":0.8251336,"about_ca_system_score_codex":0.00006823735,"about_ca_system_score_gemma":0.000050085284,"threshold_uncertainty_score":0.99990654},"labels":[],"label_agreement":null},{"id":"W1600160158","doi":"10.1007/3-540-45061-0_17","title":"Approximating Steiner k-Cuts","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Rounding; Steiner tree problem; Linear programming relaxation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Discrete mathematics; Maximum cut; Minimum weight; Relaxation (psychology); Minimum cut; Linear programming; Graph; Computer science; Algorithm","score_opus":0.0220167658478086,"score_gpt":0.23985756490570773,"score_spread":0.21784079905789913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600160158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017740113,0.0005365389,0.97472394,0.0007961144,0.0024313983,0.0003565634,0.0000041456656,0.00025229706,0.020881277],"genre_scores_gemma":[0.0059885583,0.000033045082,0.98898613,0.003290967,0.0004666894,0.000011854775,0.0000040849795,0.000047513102,0.0011711272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951467,0.00005079043,0.0007187661,0.0018932541,0.001273153,0.00091736065],"domain_scores_gemma":[0.99678427,0.0004337484,0.00036510965,0.0019488273,0.00024213232,0.00022592732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012257496,0.0006684848,0.0006608849,0.0009825235,0.00043754315,0.00081694045,0.0043593543,0.00033826483,0.00004391069],"category_scores_gemma":[0.00011744246,0.00062660204,0.00021262495,0.0009853019,0.0008477373,0.0007273955,0.0016521704,0.0011491738,0.00006646108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017095996,0.000036702855,0.000019223156,0.00004987416,0.00001402972,0.00011037016,0.0005266658,0.007236174,0.000055373217,0.16750865,0.000090161084,0.8243511],"study_design_scores_gemma":[0.00024295122,0.000119910255,0.000018956256,0.00034141258,0.000006436058,0.00014766812,1.3832225e-7,0.45815822,0.0006486471,0.5308659,0.008564622,0.00088509824],"about_ca_topic_score_codex":0.000012550695,"about_ca_topic_score_gemma":0.000026176263,"teacher_disagreement_score":0.823466,"about_ca_system_score_codex":0.00023463485,"about_ca_system_score_gemma":0.00036097833,"threshold_uncertainty_score":0.99961853},"labels":[],"label_agreement":null},{"id":"W1602585208","doi":"10.1007/s00224-003-1126-2","title":"Asymmetric Communication Protocols via Hotlink Assignments","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Computer science; Protocol (science); Communications protocol; Theoretical computer science; Computer network; Distributed computing","score_opus":0.03579338451336043,"score_gpt":0.28659772980480025,"score_spread":0.2508043452914398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602585208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029384808,0.00037222455,0.97941005,0.000021577527,0.00038818232,0.003095622,0.0000010396462,0.00021058467,0.013562234],"genre_scores_gemma":[0.95694375,0.000002020736,0.04267002,0.00003533689,0.000034236666,0.0001860168,0.0000013032936,0.000012226036,0.00011509719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709094,0.0013719494,0.0005580249,0.00028932607,0.00041049687,0.0002792396],"domain_scores_gemma":[0.9974017,0.0007306637,0.0004438887,0.0012030144,0.00014798141,0.000072751594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035680488,0.00016395684,0.00032791906,0.0002516061,0.00025157476,0.00013370671,0.0014762604,0.000070038855,0.000004446054],"category_scores_gemma":[0.00013217858,0.00015755623,0.00009484983,0.00089800317,0.000116079114,0.0001961624,0.00024213952,0.00018424954,0.000025281352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004244987,0.00013061606,0.00030307096,0.00009146794,0.00003591205,0.0000013930021,0.0005954177,0.00062429457,0.0001667503,0.9700501,0.00012226476,0.027874444],"study_design_scores_gemma":[0.002449493,0.0006036303,0.004350185,0.0016635244,0.000030869378,0.0001995218,0.00036356927,0.42308688,0.008983536,0.54338366,0.013742746,0.0011423619],"about_ca_topic_score_codex":0.000015248143,"about_ca_topic_score_gemma":2.092298e-7,"teacher_disagreement_score":0.95400524,"about_ca_system_score_codex":0.000049452996,"about_ca_system_score_gemma":0.000048500566,"threshold_uncertainty_score":0.64249563},"labels":[],"label_agreement":null},{"id":"W1606888841","doi":"10.1007/3-540-44842-x_16","title":"An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Backtracking; Subroutine; Computer science; Algorithm; Automation; Process (computing); Computational complexity theory; Mathematical optimization; Mathematics; Programming language","score_opus":0.022599433767272428,"score_gpt":0.2451318771842228,"score_spread":0.2225324434169504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606888841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016873717,0.0003571582,0.9790049,0.0011135067,0.0006507547,0.0017973247,0.00005398515,0.000036653197,0.00011201022],"genre_scores_gemma":[0.87626404,0.000013461628,0.119349554,0.0036678356,0.00031683483,0.00009875225,0.0000034222062,0.000051514773,0.00023458533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971514,0.00011663365,0.00041727876,0.0010187672,0.0006751257,0.00062084827],"domain_scores_gemma":[0.9961752,0.0017368965,0.00028217325,0.0014536494,0.0002472542,0.000104787454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013043018,0.00047882024,0.00049158104,0.00020347786,0.0017853791,0.00076437835,0.0027887293,0.000110596295,0.000018522955],"category_scores_gemma":[0.000028886689,0.00023897148,0.00013144,0.0003733449,0.0022960044,0.0004243935,0.0007312618,0.0004947283,3.9689456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003335763,0.00015085387,0.00080515805,0.000060720304,0.00013613528,0.00030469772,0.029522948,0.004214834,0.000006899861,0.0022365197,0.00007975851,0.9624481],"study_design_scores_gemma":[0.0024702542,0.001928025,0.0015873844,0.00015113101,0.00007962699,0.0013326505,0.0001470272,0.9786955,0.00018098448,0.009763612,0.0028711746,0.00079260656],"about_ca_topic_score_codex":0.0000765941,"about_ca_topic_score_gemma":0.0063887206,"teacher_disagreement_score":0.9744807,"about_ca_system_score_codex":0.00009241722,"about_ca_system_score_gemma":0.00021644428,"threshold_uncertainty_score":0.99951416},"labels":[],"label_agreement":null},{"id":"W1636181092","doi":"10.1007/978-3-642-25591-5_4","title":"Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Graph; Function (biology); Bounded function; Linear programming relaxation; Tree (set theory); k-minimum spanning tree; Integer (computer science); Discrete mathematics; Algorithm; K-ary tree; Computer science; Binary tree; Tree structure; Mathematical analysis; Linear programming","score_opus":0.021496381944811557,"score_gpt":0.2290866575978369,"score_spread":0.20759027565302535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636181092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024773914,0.001277278,0.99371654,0.00095012714,0.0008804784,0.00076499017,0.000026875205,0.0001588349,0.0019771215],"genre_scores_gemma":[0.05132134,0.00023716364,0.9451647,0.0011624735,0.00044475004,0.00008833891,0.000013590298,0.00006137458,0.0015062751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966294,0.000023862647,0.00050507265,0.0017327318,0.0004514551,0.0006574676],"domain_scores_gemma":[0.9976871,0.00047314927,0.00026606506,0.0011108593,0.00021770585,0.00024514835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062674744,0.0005886054,0.0005817859,0.0008713921,0.0006300845,0.00053294096,0.0018552735,0.00031802998,0.00001581616],"category_scores_gemma":[0.00006428626,0.000521256,0.00015200846,0.0004475739,0.0010668397,0.0006150631,0.0018367618,0.00045489598,0.0000035358769],"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.000019178946,0.00005947016,0.000081357866,0.00015424214,0.000041201416,0.000019025989,0.0020076125,0.00016749547,0.0007375258,0.23356232,0.000042885666,0.76310766],"study_design_scores_gemma":[0.00060416176,0.00034715646,0.00028662954,0.00021253439,0.000021845508,0.00011940698,3.128554e-7,0.45849738,0.0010534993,0.53185356,0.006126278,0.00087723555],"about_ca_topic_score_codex":0.00003197091,"about_ca_topic_score_gemma":0.00047701868,"teacher_disagreement_score":0.76223046,"about_ca_system_score_codex":0.00008592079,"about_ca_system_score_gemma":0.00015350759,"threshold_uncertainty_score":0.9997239},"labels":[],"label_agreement":null},{"id":"W1650093283","doi":"10.1016/j.jcss.2016.01.001","title":"Separating OR, SUM, and XOR circuits","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Academy of Finland","keywords":"Electronic circuit; Boolean circuit; Mathematics; Monotone polygon; Modulo; Rewriting; Netlist; Circuit complexity; Discrete mathematics; Boolean function; Arithmetic; Algorithm; Computer science","score_opus":0.04163178691523718,"score_gpt":0.27593742014764816,"score_spread":0.234305633232411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650093283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20069097,0.0006291744,0.79611105,0.00092916476,0.0010760864,0.00005385077,8.3698575e-7,0.000029220062,0.00047968575],"genre_scores_gemma":[0.9563767,0.000043311644,0.04319234,0.00007932608,0.00026278113,4.5838354e-7,7.666578e-9,0.0000018682717,0.00004322159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.00010241533,0.00038785904,0.00021472963,0.00038600698,0.00022570866],"domain_scores_gemma":[0.99897844,0.00036457408,0.00026814637,0.000121581295,0.00011209588,0.00015518967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957645,0.00010122846,0.00024451796,0.0001864498,0.00029638116,0.0004246739,0.00063678663,0.000027931907,0.0000020896075],"category_scores_gemma":[0.000018176028,0.000049683076,0.00004894835,0.00030400572,0.0002105735,0.0009413563,0.00020062957,0.00006211064,0.0000016597419],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089164405,0.000040011084,0.0075658355,0.00010872581,0.000043621225,0.00016211165,0.0017542886,0.000031749623,0.0006665318,0.16125001,0.0011526447,0.82721555],"study_design_scores_gemma":[0.0083835265,0.011053126,0.1518183,0.009600435,0.0000994161,0.058217652,0.0024271344,0.68530995,0.002740035,0.049112555,0.018599583,0.0026382739],"about_ca_topic_score_codex":0.0000043827627,"about_ca_topic_score_gemma":0.0000027665885,"teacher_disagreement_score":0.8245773,"about_ca_system_score_codex":0.000016585402,"about_ca_system_score_gemma":0.000098026954,"threshold_uncertainty_score":0.40951404},"labels":[],"label_agreement":null},{"id":"W1700848872","doi":"10.1016/j.jpdc.2008.03.002","title":"Computing all the best swap edges distributively","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Swap (finance); Computation; Routing (electronic design automation); Distributed computing; Computer network; Algorithm","score_opus":0.0480711353341684,"score_gpt":0.27243581450483123,"score_spread":0.22436467917066283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700848872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17600589,0.0013614066,0.8199704,0.0019170237,0.00045021012,0.000080474645,0.000015576055,0.00004637509,0.00015258756],"genre_scores_gemma":[0.969611,0.0001496115,0.029537287,0.00026997694,0.0004019223,3.6922316e-7,0.000008542005,0.0000074644977,0.000013857759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978379,0.00017026,0.0007439771,0.00028391858,0.00047886127,0.00048506318],"domain_scores_gemma":[0.99786407,0.0005985568,0.00067034404,0.000306753,0.0003419763,0.00021832764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829636,0.00024850218,0.0004203484,0.00009919499,0.0009433927,0.00024076572,0.0012279847,0.000074367505,0.0000029341943],"category_scores_gemma":[0.00015455004,0.00017249043,0.0002205218,0.0005052936,0.00029023457,0.00035986307,0.00063673937,0.00057573395,0.000006070294],"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.00031868697,0.002683881,0.11126527,0.00024593004,0.0019398887,0.0040955585,0.01706921,0.08916217,0.00072297757,0.25251126,0.043102186,0.476883],"study_design_scores_gemma":[0.004481644,0.0011960776,0.18298572,0.00050118583,0.0001528504,0.015083402,0.0019351955,0.72817785,0.0003437955,0.025448756,0.038323477,0.0013700253],"about_ca_topic_score_codex":0.000021539243,"about_ca_topic_score_gemma":0.000001498735,"teacher_disagreement_score":0.7936051,"about_ca_system_score_codex":0.000048277983,"about_ca_system_score_gemma":0.00011229172,"threshold_uncertainty_score":0.72559094},"labels":[],"label_agreement":null},{"id":"W1706312069","doi":"10.1016/j.dam.2014.05.007","title":"On the van der Waerden numbers<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si167.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Conjecture; Combinatorics; Mathematics; Upper and lower bounds; Solver; Heuristic; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.017026558341712024,"score_gpt":0.23475725351554888,"score_spread":0.21773069517383686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706312069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5583548,0.0024397832,0.029630532,0.002775002,0.008022109,0.0005651489,0.002424966,0.0018591704,0.3939285],"genre_scores_gemma":[0.954663,0.0018494679,0.024195787,0.004794092,0.0050734733,0.0037474453,0.0024974567,0.0024163215,0.00076294935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9723553,0.0012775912,0.0057563637,0.0056820605,0.007789794,0.007138887],"domain_scores_gemma":[0.976655,0.006222455,0.006043863,0.0071335877,0.00068291003,0.0032621864],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0069031822,0.0034520668,0.001562813,0.00152166,0.006246754,0.0061372356,0.009762289,0.005614414,0.06503346],"category_scores_gemma":[0.0033244977,0.0055605993,0.005172417,0.0038972143,0.0052806507,0.0035568497,0.00829623,0.0058040833,0.008571585],"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.0017214441,0.0012589112,0.000008763396,0.0027757823,0.0036131807,0.0013952062,0.0061730654,0.0029867338,0.0024181912,0.79572487,0.17721093,0.0047129057],"study_design_scores_gemma":[0.00555225,0.0035966511,0.00005744905,0.0039028677,0.004807777,0.004161098,0.006104105,0.28806028,0.63135517,0.031109829,0.014672723,0.006619786],"about_ca_topic_score_codex":0.002212533,"about_ca_topic_score_gemma":0.0015497145,"teacher_disagreement_score":0.76461506,"about_ca_system_score_codex":0.00010390415,"about_ca_system_score_gemma":0.0027815185,"threshold_uncertainty_score":0.9997245},"labels":[],"label_agreement":null},{"id":"W1719847780","doi":"10.1007/978-3-642-38768-5_24","title":"Approximating the Minimum Independent Dominating Set in Perturbed Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Independent set; Graph; Discrete mathematics; Approximation algorithm; Running time; Time complexity; Simple (philosophy); Algorithm","score_opus":0.02306009861298433,"score_gpt":0.24525928156052923,"score_spread":0.2221991829475449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719847780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010871337,0.00048674276,0.9899627,0.0013895712,0.0017571062,0.00083468197,0.000004549479,0.00014610779,0.0043313988],"genre_scores_gemma":[0.36082366,0.00004974645,0.6354279,0.0026473512,0.00049042125,0.00008055242,0.0000074903596,0.00006265529,0.00041020598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465233,0.00011649824,0.0009604194,0.0017835291,0.0014679085,0.0010193099],"domain_scores_gemma":[0.99581355,0.0014927776,0.00050380593,0.0018126087,0.0002188555,0.00015838965],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002307583,0.0006910594,0.0006823339,0.0011999416,0.0005456554,0.0012023952,0.0062941248,0.00035779725,0.00004507455],"category_scores_gemma":[0.00023409045,0.00051722204,0.00022347516,0.0013458346,0.001046508,0.00082342315,0.0029182283,0.0018879606,0.00004497238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037607783,0.000046663386,0.00012344007,0.00006563273,0.000015837712,0.00009948976,0.0056230817,0.0077448306,0.00009997287,0.09008908,0.000038561146,0.8960497],"study_design_scores_gemma":[0.00026574507,0.0000661064,0.00024441676,0.0003792654,0.0000037856935,0.00007756079,0.0000025212705,0.62646955,0.0001783616,0.37153926,0.00024613575,0.0005272493],"about_ca_topic_score_codex":0.00011961896,"about_ca_topic_score_gemma":0.00020959767,"teacher_disagreement_score":0.8955224,"about_ca_system_score_codex":0.0002711218,"about_ca_system_score_gemma":0.0003540358,"threshold_uncertainty_score":0.9998345},"labels":[],"label_agreement":null},{"id":"W172422417","doi":"","title":"Polynomial Time with Restricted Use of Randomness","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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":"Randomness; Turing machine; Time complexity; Focus (optics); Hierarchy; Computer science; Stack (abstract data type); Polynomial hierarchy; Computation; Time hierarchy theorem; Binary logarithm; DTIME; Discrete mathematics; Random number generation; PSPACE; Theoretical computer science; Mathematics; Algorithm; Computational complexity theory; Universal Turing machine; Statistics","score_opus":0.02529183199500784,"score_gpt":0.24338374597036094,"score_spread":0.2180919139753531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172422417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34730992,0.00010519808,0.6432467,0.004265829,0.0002495873,0.0011045737,0.00006400563,0.0006314967,0.0030226777],"genre_scores_gemma":[0.95602274,0.0000035098622,0.042968433,0.000658159,0.0000792304,0.000011037528,0.00005645116,0.000012169485,0.00018825287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721605,0.00021513981,0.00048656945,0.0006117116,0.00084303756,0.00062748493],"domain_scores_gemma":[0.9979414,0.0007091219,0.0002769142,0.0005803923,0.00035292277,0.0001392669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025539042,0.00031390475,0.0004883913,0.00034972245,0.00031633954,0.0001777918,0.0009227353,0.000074157084,0.000065004235],"category_scores_gemma":[0.00006087243,0.00028863474,0.0001621771,0.0014817455,0.00022929892,0.00049583544,0.00011376509,0.00038004498,0.000025480149],"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.002978732,0.0016277224,0.00017327484,0.000017322907,0.00022093207,0.000041730145,0.0002634248,0.07432887,0.0008958659,0.8845422,0.012075799,0.022834098],"study_design_scores_gemma":[0.007892749,0.005416599,0.0630618,0.000093291594,0.000038990576,0.00014952746,0.000005954333,0.72541004,0.0010563796,0.18590617,0.009975722,0.0009927509],"about_ca_topic_score_codex":0.000044408822,"about_ca_topic_score_gemma":0.0000213396,"teacher_disagreement_score":0.69863605,"about_ca_system_score_codex":0.00018799237,"about_ca_system_score_gemma":0.0006232584,"threshold_uncertainty_score":0.9999566},"labels":[],"label_agreement":null},{"id":"W1750858516","doi":"10.1007/978-3-319-08783-2_29","title":"Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Vertex cover; Approximation algorithm; Vertex (graph theory); Dual (grammatical number); Cover (algebra); Time complexity; Computer science; Edge cover; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Graph","score_opus":0.024143704193589348,"score_gpt":0.23782307009736783,"score_spread":0.21367936590377848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750858516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089858004,0.00029611273,0.9948977,0.0006957842,0.0014748519,0.0015644564,0.000025148556,0.00030077857,0.0006553162],"genre_scores_gemma":[0.027576871,0.000036080095,0.9695538,0.0011616033,0.00081441057,0.00010625784,0.00005613529,0.000087638226,0.0006071982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940989,0.000060211663,0.0007629348,0.0023303325,0.0016673261,0.0010803202],"domain_scores_gemma":[0.9960483,0.000616061,0.00052770704,0.0018516271,0.0007058771,0.00025046692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015374032,0.00089866284,0.00092598854,0.00092981814,0.0005983186,0.0008339459,0.0032021403,0.0004314854,0.000018342613],"category_scores_gemma":[0.00010586285,0.0007617335,0.00025788244,0.00077325554,0.0011729309,0.00089816964,0.001058706,0.00090296345,0.000033010503],"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.0000439715,0.00012119791,0.00004347642,0.00046097927,0.00008104362,0.00004896105,0.0014846234,0.15251061,0.000117168114,0.11682504,0.00009539066,0.72816753],"study_design_scores_gemma":[0.0007374171,0.0006565426,0.000052501528,0.0004807635,0.000021435451,0.00010792316,2.4313576e-7,0.8195897,0.00093427085,0.17094015,0.0055434504,0.0009356483],"about_ca_topic_score_codex":0.000025305131,"about_ca_topic_score_gemma":0.000038687132,"teacher_disagreement_score":0.7272319,"about_ca_system_score_codex":0.00029329048,"about_ca_system_score_gemma":0.0006075349,"threshold_uncertainty_score":0.99948335},"labels":[],"label_agreement":null},{"id":"W1803930816","doi":"10.1007/s10107-016-1035-1","title":"Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Polytope; Operator (biology); Chordal graph; Characterization (materials science); Indifference graph; Strong perfect graph theorem; Discrete mathematics; Graph; 1-planar graph; Physics","score_opus":0.0202639909015393,"score_gpt":0.25145209598900103,"score_spread":0.23118810508746174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803930816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32971957,0.0008654251,0.66083163,0.0030213662,0.00050621456,0.0010934961,0.000007297798,0.0014425209,0.00251245],"genre_scores_gemma":[0.65831256,0.000029328867,0.34092817,0.00027028203,0.00004115809,0.00009573268,0.0000010635299,0.000036660498,0.00028505354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973216,0.00011933688,0.00049330434,0.00074041577,0.0005175656,0.00080779725],"domain_scores_gemma":[0.9981192,0.0004497332,0.00010211445,0.0008602862,0.00009447843,0.0003742058],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075862696,0.0003534743,0.0004291382,0.0001143236,0.00059359666,0.0011043117,0.0008216373,0.00013093183,0.00013115116],"category_scores_gemma":[0.0002134702,0.0002356463,0.00021064327,0.00071916886,0.0007376344,0.0007535607,0.00057584286,0.00023893133,0.0002682635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000696473,0.00018595663,0.0010382495,0.000097287906,0.00004571198,0.000035881356,0.00071531185,9.811274e-7,0.00034117923,0.6319129,0.00021429655,0.36540526],"study_design_scores_gemma":[0.0017879887,0.00060438365,0.0013089263,0.000651957,0.00006225403,0.00028621338,0.000076669974,0.044893496,0.0017365399,0.897215,0.05006249,0.0013140822],"about_ca_topic_score_codex":0.000013000545,"about_ca_topic_score_gemma":0.0000056228964,"teacher_disagreement_score":0.3640912,"about_ca_system_score_codex":0.000024303105,"about_ca_system_score_gemma":0.000055606342,"threshold_uncertainty_score":0.99993265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13689575,0.00020840645,0.8420474,0.000596584,0.0055625713,0.0022823296,0.005561805,0.00097079296,0.005874379],"genre_scores_gemma":[0.3313659,0.00006800487,0.6572801,0.001246835,0.00097305916,0.0003614842,0.008499615,0.000107025575,0.00009795884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926248,0.000219268,0.002815982,0.0011960408,0.0017270015,0.0014168646],"domain_scores_gemma":[0.9926059,0.0006675043,0.0016963179,0.0032223111,0.0011238254,0.00068414287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017903997,0.0012358634,0.0016201384,0.0005526606,0.0009544059,0.0021788354,0.004823443,0.0008969892,0.000095388816],"category_scores_gemma":[0.00034151901,0.0012329841,0.00092994404,0.00060650817,0.0006434596,0.0022558845,0.0063436436,0.002052574,0.00032175996],"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.001356619,0.00454521,0.010219573,0.0037469573,0.0024399369,0.000116637246,0.06112311,0.0103354575,0.0000832873,0.4042608,0.14973311,0.35203928],"study_design_scores_gemma":[0.0024585433,0.00021669095,0.0018085353,0.0005999548,0.00007147886,0.000029685401,0.00036682247,0.5920284,0.00017587803,0.38139522,0.019612925,0.0012358488],"about_ca_topic_score_codex":0.0004873847,"about_ca_topic_score_gemma":0.0008144978,"teacher_disagreement_score":0.58169293,"about_ca_system_score_codex":0.0005528189,"about_ca_system_score_gemma":0.0004404707,"threshold_uncertainty_score":0.999012},"labels":[],"label_agreement":null},{"id":"W1825657983","doi":"10.1007/978-3-319-13075-0_42","title":"Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Constant (computer programming); Randomized algorithm; Computer science; Algorithm; Approximation algorithm; Deterministic algorithm; Matching (statistics); Maximization; Greedy algorithm; Online algorithm; Running time; Simple (philosophy); Mathematics; Combinatorics; Mathematical optimization","score_opus":0.02816901447274186,"score_gpt":0.26118368632132904,"score_spread":0.23301467184858718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1825657983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006847027,0.00007210206,0.9912761,0.00096050027,0.0038908687,0.0012151084,0.000016373178,0.0002587637,0.0022417328],"genre_scores_gemma":[0.076829284,0.000026291238,0.91812575,0.0026625937,0.0014304284,0.00009951556,0.000056573295,0.000084870604,0.00068468176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478877,0.000036420384,0.0007782906,0.002275608,0.0011494486,0.0009714575],"domain_scores_gemma":[0.99596816,0.00087891426,0.00044314584,0.002015677,0.00043729605,0.00025678572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012164791,0.00082393474,0.0008436553,0.0012873611,0.00062142935,0.0009742377,0.0038838338,0.00049320393,0.00001663318],"category_scores_gemma":[0.00010715681,0.000794125,0.00032556284,0.00084442616,0.000964076,0.00046318094,0.00084863394,0.0007927875,0.000033527238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003440398,0.00005841379,0.000012725709,0.000074619325,0.000029092382,0.000031625706,0.00038007056,0.045642152,0.00006719932,0.1344805,0.00005834683,0.81913084],"study_design_scores_gemma":[0.0011848079,0.0004331961,0.000042613792,0.00039057955,0.000012423673,0.000035256457,1.2727493e-7,0.71941674,0.0016868875,0.2740667,0.001935775,0.0007949335],"about_ca_topic_score_codex":0.00002301255,"about_ca_topic_score_gemma":0.00004724936,"teacher_disagreement_score":0.8183359,"about_ca_system_score_codex":0.00033286144,"about_ca_system_score_gemma":0.00057781645,"threshold_uncertainty_score":0.999451},"labels":[],"label_agreement":null},{"id":"W186506571","doi":"","title":"Using core beliefs for point-based value iteration","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","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":"McGill University","funders":"","keywords":"Simplex; Computer science; Mathematical optimization; Partially observable Markov decision process; Set (abstract data type); Heuristic; Core (optical fiber); Simplex algorithm; Bellman equation; Point (geometry); Value (mathematics); Function (biology); Algorithm; Artificial intelligence; Mathematics; Linear programming; Machine learning; Markov chain; Combinatorics; Markov model","score_opus":0.29352949057106004,"score_gpt":0.3825340826528269,"score_spread":0.08900459208176686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186506571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004009743,0.000011093054,0.98294276,0.009032901,0.0014528427,0.00034930455,0.000037092104,0.00016221678,0.0020020318],"genre_scores_gemma":[0.74342346,0.0000052681053,0.25426874,0.0016397208,0.00049852853,0.00003994625,0.000024648196,0.000012105067,0.00008761346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997847,0.000046635676,0.00062348397,0.0006063021,0.00054370705,0.0003328382],"domain_scores_gemma":[0.99844426,0.00020926101,0.00021911267,0.00044744773,0.00056602614,0.000113914335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004334475,0.00024029674,0.00020230965,0.00034330765,0.0002542258,0.0005450162,0.0011038365,0.000088899746,0.0002330649],"category_scores_gemma":[0.00020802587,0.0002467603,0.00018353364,0.00024186545,0.00012394488,0.0006444494,0.00013224549,0.00020978153,0.00017013837],"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.000029337512,0.00016864775,0.0000070262745,0.0000047396834,0.000014282944,0.0000031323068,0.00021357523,0.019052472,0.0060397387,0.82213485,0.00008277533,0.15224944],"study_design_scores_gemma":[0.000056922647,0.00011611749,0.000026140386,0.00008345601,0.0000036195233,0.000007271732,0.000032033284,0.7385575,0.06264061,0.19686824,0.0013917467,0.00021629946],"about_ca_topic_score_codex":0.000044425182,"about_ca_topic_score_gemma":0.000057938774,"teacher_disagreement_score":0.7394137,"about_ca_system_score_codex":0.00017158702,"about_ca_system_score_gemma":0.0001873816,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W1872088823","doi":"10.1007/978-3-540-85363-3_30","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Nondeterministic algorithm; Constant (computer programming); Computer science; Function (biology); Combinatorics; Set (abstract data type); Computable function; String (physics); Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.02753479408787502,"score_gpt":0.27092340219700467,"score_spread":0.24338860810912966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872088823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013727268,0.00085055793,0.9953283,0.00060128677,0.0004728702,0.0007516453,0.000013454349,0.00016108897,0.001683532],"genre_scores_gemma":[0.24461539,0.0005213957,0.7536207,0.00059000624,0.00026457084,0.000038177215,0.00002383905,0.00002914616,0.0002967766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969493,0.00013028126,0.0007181114,0.0011675388,0.0005619875,0.00047275086],"domain_scores_gemma":[0.9950456,0.002437483,0.00037711687,0.001736139,0.00021828157,0.00018535368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011680061,0.00048678747,0.00094065536,0.00066951563,0.0007036556,0.00050697604,0.0026794148,0.00027911476,0.00000833738],"category_scores_gemma":[0.0002066156,0.00044308332,0.00018471238,0.00043451253,0.0025670922,0.00058757997,0.0016731796,0.00082727446,0.000011737745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017605197,0.00005942453,0.00007449722,0.00006048094,0.000055523768,0.000046250283,0.004038288,0.0019484309,0.00005187173,0.033238314,0.00005479665,0.9601961],"study_design_scores_gemma":[0.006635737,0.00008305447,0.00012734921,0.00018183912,0.000022757657,0.00007682525,1.239202e-7,0.8472908,0.00015363347,0.14396039,0.0008674001,0.0006000622],"about_ca_topic_score_codex":0.000045516983,"about_ca_topic_score_gemma":0.00007187148,"teacher_disagreement_score":0.95959604,"about_ca_system_score_codex":0.00010921777,"about_ca_system_score_gemma":0.00033967398,"threshold_uncertainty_score":0.9998021},"labels":[],"label_agreement":null},{"id":"W1892871566","doi":"10.1109/spdp.1993.395504","title":"Parallel network dual simplex method on a shared memory multiprocessor","year":2002,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Computer science; Simplex algorithm; Dual (grammatical number); Multiprocessing; Scope (computer science); Simplex; Parallel computing; Extension (predicate logic); Distributed memory; Parallel algorithm; Theoretical computer science; Mathematical optimization; Distributed computing; Algorithm; Linear programming; Shared memory; Programming language; Mathematics","score_opus":0.06083322208946867,"score_gpt":0.2889409379408651,"score_spread":0.22810771585139644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892871566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033596196,0.00017488419,0.96170104,0.0022673807,0.0004321147,0.00021632956,0.000004433275,0.0005876585,0.0342802],"genre_scores_gemma":[0.027887162,0.00001796187,0.9633064,0.0037636124,0.00037894712,0.000038375536,0.0000032484502,0.000015091272,0.004589182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981243,0.000113652975,0.00026615665,0.0005893416,0.0003757797,0.0005307382],"domain_scores_gemma":[0.9986181,0.0003819301,0.000075088254,0.00070413185,0.000062785184,0.00015795008],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034361664,0.000214376,0.00023607875,0.000092132526,0.0002785598,0.00021215364,0.0009490461,0.000077169956,0.0010464842],"category_scores_gemma":[0.000054479886,0.00018412367,0.0001318428,0.000667646,0.000044431286,0.000369826,0.00033609907,0.0002230435,0.0003916472],"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.000020728892,0.00041945683,0.000049887727,0.000026298174,0.00007166452,0.0001052617,0.001512106,0.017097654,0.000035127472,0.24296026,0.1421127,0.59558886],"study_design_scores_gemma":[0.0006405752,0.0001295783,0.00043759297,0.000017743696,0.000004674563,0.000027949294,0.000024568493,0.93946177,0.00013553457,0.025429362,0.03335619,0.00033445098],"about_ca_topic_score_codex":0.00003234426,"about_ca_topic_score_gemma":0.000023481518,"teacher_disagreement_score":0.9223641,"about_ca_system_score_codex":0.000020775604,"about_ca_system_score_gemma":0.000013231727,"threshold_uncertainty_score":0.9998667},"labels":[],"label_agreement":null},{"id":"W1897679864","doi":"10.5555/1496770.1496787","title":"Comparison-based time-space lower bounds for selection","year":2009,"lang":"en","type":"article","venue":"","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; Binary logarithm; Combinatorics; Log-log plot; Mathematics; Mathematical proof; Streaming algorithm; Space (punctuation); Selection (genetic algorithm); Discrete mathematics; Running time; Randomized algorithm; Computer science; Algorithm","score_opus":0.023164110130631292,"score_gpt":0.2960447433243519,"score_spread":0.2728806331937206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897679864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001317417,0.000023390252,0.9877049,0.0036509861,0.0002581162,0.000166427,0.0000010495402,0.00037813923,0.0064995806],"genre_scores_gemma":[0.5192745,4.971772e-7,0.4767155,0.0016292363,0.00010719542,0.000010683888,0.0000041031726,0.0000049592727,0.0022533562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914926,0.000019804596,0.00014522151,0.0002783231,0.00016130683,0.00024606576],"domain_scores_gemma":[0.9994323,0.000105689884,0.00004499495,0.00026129192,0.00008972366,0.00006596293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017148086,0.000105999075,0.00013933833,0.000092944014,0.00021245245,0.00019854396,0.0004304145,0.00004546099,0.00007247357],"category_scores_gemma":[0.000017774999,0.00009923599,0.00009745751,0.00041537528,0.000025395808,0.00021157795,0.000024487656,0.0000784705,0.000058773905],"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.0000745554,0.0011373374,0.0006763438,0.00001728348,0.000030564024,0.000002909564,0.00023584443,0.0039832057,0.00392318,0.6307655,0.19525476,0.16389851],"study_design_scores_gemma":[0.00033153963,0.00044331874,0.00077070284,0.000005499199,0.0000032411197,0.0000019878726,0.0000023014063,0.926923,0.0050330115,0.019471858,0.04685397,0.00015959854],"about_ca_topic_score_codex":0.000008170956,"about_ca_topic_score_gemma":0.000008046848,"teacher_disagreement_score":0.9229398,"about_ca_system_score_codex":0.000029401,"about_ca_system_score_gemma":0.00006299529,"threshold_uncertainty_score":0.40467265},"labels":[],"label_agreement":null},{"id":"W1899845837","doi":"10.1007/s00145-001-0007-6","title":"Complexity Bounds on General Hard-Core Predicates","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; McGill University; University of Texas at Austin; National Science Foundation","keywords":"Predicate (mathematical logic); Boolean function; Mathematics; Discrete mathematics; Combinatorics; Monotone polygon; Core (optical fiber); Hard core; Computer science","score_opus":0.08349018298500696,"score_gpt":0.30711456702709455,"score_spread":0.2236243840420876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899845837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61048555,0.0003542304,0.3729003,0.009308256,0.0023201213,0.000070135975,0.0000028302586,0.000067834924,0.004490729],"genre_scores_gemma":[0.7084529,0.00018834222,0.2874211,0.002622132,0.0010969366,0.0000025481634,0.0000018378058,0.000013474087,0.00020077822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855685,0.00010034652,0.00047074963,0.0001983975,0.000352235,0.00032143074],"domain_scores_gemma":[0.9987884,0.00014894531,0.0003570909,0.00035838573,0.00018799896,0.00015917403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414434,0.00014198339,0.0003470977,0.0002688521,0.00016256572,0.000083378334,0.0012212165,0.00009158616,0.00013686596],"category_scores_gemma":[0.00008370256,0.00011596673,0.00018697705,0.00031798406,0.00027971357,0.00029144346,0.00015119105,0.00041714864,0.00003320772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009872025,0.000330788,0.009560293,0.000008125099,0.0000889174,0.0005034669,0.00029196843,0.00015063449,0.0006368142,0.9460161,0.015669866,0.02664435],"study_design_scores_gemma":[0.0011820049,0.0013653405,0.094323374,0.000040443043,0.000019109842,0.0046073953,0.000019942408,0.019300705,0.00056616863,0.77437586,0.103937745,0.0002619066],"about_ca_topic_score_codex":0.000008032502,"about_ca_topic_score_gemma":0.000007001829,"teacher_disagreement_score":0.1716402,"about_ca_system_score_codex":0.00004129353,"about_ca_system_score_gemma":0.0000975205,"threshold_uncertainty_score":0.4728986},"labels":[],"label_agreement":null},{"id":"W1906705979","doi":"10.1109/lics.2004.1319632","title":"VTC/sup O/: a second-order theory for TC/sup 0/","year":2004,"lang":"en","type":"article","venue":"","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":"Order (exchange); Combinatorics; Physics; Mathematics; Discrete mathematics","score_opus":0.019732397253852948,"score_gpt":0.2514702293808242,"score_spread":0.23173783212697124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906705979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003258941,0.000110119916,0.9757187,0.0014994756,0.00028241664,0.00026223226,0.000007959089,0.0003141626,0.018546019],"genre_scores_gemma":[0.18433541,0.000009475493,0.8035665,0.0041150753,0.00024452986,0.00009344864,0.0000063422403,0.000021535137,0.007607702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987938,0.000040363157,0.00019730044,0.00041737087,0.00017686418,0.000374322],"domain_scores_gemma":[0.9989213,0.00023756557,0.000039408656,0.0005981979,0.00010131957,0.000102238846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048307318,0.0001560644,0.00016027525,0.00010883116,0.00021998488,0.0001660283,0.00096775097,0.00006421691,0.00039733932],"category_scores_gemma":[0.000058729238,0.00013420595,0.00013626524,0.0004104138,0.0000844866,0.00041182546,0.00024688046,0.00011801597,0.00011245443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057177826,0.000069279835,0.000008136868,0.000011695787,0.000017774377,0.0000035167686,0.0005793278,0.00034205435,0.000037811726,0.9595931,0.0012643833,0.038067196],"study_design_scores_gemma":[0.00093584834,0.00012710749,0.00010824158,0.000013878554,0.0000047082763,0.000026435377,0.0000995212,0.026022354,0.0015971387,0.9198384,0.05095253,0.00027378328],"about_ca_topic_score_codex":0.000015132601,"about_ca_topic_score_gemma":0.00003275765,"teacher_disagreement_score":0.18107647,"about_ca_system_score_codex":0.000029891675,"about_ca_system_score_gemma":0.000103042476,"threshold_uncertainty_score":0.547276},"labels":[],"label_agreement":null},{"id":"W1914444769","doi":"10.48550/arxiv.1507.01309","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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","funders":"","keywords":"Mathematics; Relaxation (psychology); Combinatorics; Tree (set theory); Linear programming relaxation; Lift (data mining); Discrete mathematics; Algorithm; Linear programming; Computer science","score_opus":0.12767938969733542,"score_gpt":0.21251196647232504,"score_spread":0.08483257677498962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914444769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13693613,0.0001404412,0.8547673,0.00015606076,0.0010278727,0.00045948348,0.000019109137,0.00045279515,0.0060408106],"genre_scores_gemma":[0.948136,0.00015319351,0.04941937,0.00014631035,0.0002495044,0.0000051274064,0.00006652529,0.00002692332,0.0017971041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782443,0.00017132919,0.00028607642,0.0011762835,0.0001661756,0.0003757322],"domain_scores_gemma":[0.9982192,0.00008269998,0.00034418094,0.0009868164,0.00018538414,0.00018174826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048151897,0.00035335353,0.00037130908,0.00037832264,0.00042849017,0.0001941466,0.0014011413,0.00023558883,0.000015054146],"category_scores_gemma":[0.000030872794,0.00040812622,0.00015843708,0.0007789332,0.00016134839,0.00058357377,0.003675487,0.0005687572,0.000024473524],"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.00007598212,0.00054138637,0.0017002379,0.00040372633,0.00042040946,0.00044068895,0.0062547354,0.017479379,0.00006188149,0.8866899,0.005112518,0.08081917],"study_design_scores_gemma":[0.00051687035,0.000088350884,0.00014029672,0.00008967979,0.000052226926,0.000010986178,0.00014173894,0.76998115,0.00005861224,0.22698642,0.0014793373,0.0004543262],"about_ca_topic_score_codex":0.00025023724,"about_ca_topic_score_gemma":0.00006911821,"teacher_disagreement_score":0.81119984,"about_ca_system_score_codex":0.0001635898,"about_ca_system_score_gemma":0.00020145107,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W1919479762","doi":"10.1109/parbse.1990.77154","title":"A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Queen's University","funders":"","keywords":"Bipartite graph; Speedup; Combinatorics; Cardinality (data modeling); Parallel algorithm; Computer science; Computation; Mathematics; Discrete mathematics; Algorithm; Graph; Parallel computing","score_opus":0.05374301300305884,"score_gpt":0.24984191510868212,"score_spread":0.19609890210562328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919479762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014750625,0.00029571165,0.98461115,0.0059181666,0.0005007692,0.0010933192,0.000022792223,0.00033456835,0.007076037],"genre_scores_gemma":[0.03333583,0.00019734651,0.957525,0.0033622081,0.00026292106,0.00053466763,0.00001000869,0.000036715956,0.00473526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778044,0.0000967021,0.0003491316,0.0006387821,0.00051989715,0.00061506877],"domain_scores_gemma":[0.99810463,0.00062832277,0.00010924391,0.00092548854,0.00008684221,0.00014544558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043054845,0.00029875347,0.00026284222,0.00015926533,0.0006849642,0.00034398914,0.0014350332,0.0000643654,0.00034866302],"category_scores_gemma":[0.000010305987,0.0001903683,0.00029919678,0.00065246643,0.0001522685,0.0002508938,0.00024041405,0.00022678918,0.00021548898],"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.000007582915,0.00037474572,0.000029852807,0.000012454624,0.00011524607,0.000008421696,0.00042666667,0.00021882007,0.00006831013,0.39074564,0.02729522,0.58069706],"study_design_scores_gemma":[0.0007667682,0.00047188517,0.00021352535,0.00002167296,0.000015836113,0.000017428532,0.000021943368,0.85368514,0.00018035619,0.046658136,0.097647466,0.00029983884],"about_ca_topic_score_codex":0.000038371207,"about_ca_topic_score_gemma":0.000014269538,"teacher_disagreement_score":0.85346633,"about_ca_system_score_codex":0.00004173555,"about_ca_system_score_gemma":0.000014981427,"threshold_uncertainty_score":0.7762994},"labels":[],"label_agreement":null},{"id":"W1928219016","doi":"10.1007/978-3-642-13036-6_29","title":"Hypergraphic LP Relaxations for Steiner Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics","score_opus":0.020650835062804664,"score_gpt":0.24624998155214245,"score_spread":0.2255991464893378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928219016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065431996,0.00030383997,0.9910065,0.0017315227,0.0036262954,0.0006042571,0.000022701623,0.00025991444,0.0023795248],"genre_scores_gemma":[0.028772589,0.000049679333,0.9676598,0.0012592599,0.001108275,0.000050337017,0.0000147598375,0.000049134764,0.0010361896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996168,0.000023171231,0.00056006265,0.0016632837,0.00084445806,0.00074100716],"domain_scores_gemma":[0.99629605,0.00090789085,0.00031756837,0.0018907096,0.0003825076,0.00020525946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007368932,0.0005667622,0.0005452117,0.0013119739,0.0006668719,0.0006374224,0.004312954,0.0004783809,0.00002688228],"category_scores_gemma":[0.00016625445,0.00051828416,0.0003185805,0.0008967588,0.0011555587,0.0006425605,0.0010550665,0.0011820622,0.000025177203],"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.000005511624,0.0000564786,0.000038415936,0.00003500045,0.000021143132,0.000023229311,0.00046140287,0.0036019578,0.00056819763,0.35931465,0.000064557295,0.6358094],"study_design_scores_gemma":[0.00033526617,0.00020431154,0.00011586637,0.00016875724,0.000012540844,0.000047885627,1.0398013e-7,0.2521334,0.0010330655,0.7260822,0.019135168,0.00073143636],"about_ca_topic_score_codex":0.000021961532,"about_ca_topic_score_gemma":0.0005564457,"teacher_disagreement_score":0.635078,"about_ca_system_score_codex":0.000100329955,"about_ca_system_score_gemma":0.0004697436,"threshold_uncertainty_score":0.9997269},"labels":[],"label_agreement":null},{"id":"W1964180408","doi":"10.1016/j.ipl.2007.08.014","title":"Improved FPT algorithm for feedback vertex set problem in bipartite tournament","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tournament; Bipartite graph; Vertex (graph theory); Feedback vertex set; Mathematics; Algorithm; Combinatorics; Set (abstract data type); Vertex cover; Feedback arc set; Approximation algorithm; Computer science; Graph","score_opus":0.01527569381448809,"score_gpt":0.25495503024486904,"score_spread":0.23967933643038095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964180408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063389037,0.000027495425,0.9895304,0.002903265,0.0003189896,0.0004103756,0.0000062222584,0.00015402237,0.00031031994],"genre_scores_gemma":[0.10305355,0.000004238525,0.8864072,0.010274285,0.00009438381,0.00009168787,0.000041133742,0.000011817224,0.000021733307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847406,0.000014496419,0.00059456745,0.00018458522,0.0002720366,0.0004602617],"domain_scores_gemma":[0.9992624,0.000066514636,0.000252311,0.00021380905,0.00012093072,0.00008402501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091616076,0.00015839971,0.0001490416,0.00036148474,0.00020280275,0.00051651616,0.0005283037,0.000065576554,0.000004219105],"category_scores_gemma":[0.00002403122,0.00015587013,0.00006227254,0.00063766417,0.000048117425,0.0036412086,0.00009959189,0.00018526179,0.000015068132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009200327,0.000025494837,0.0000543631,0.00008771731,0.000006335837,0.000001783403,0.0042455043,0.00013131236,0.00089620036,0.0005458027,0.00088034495,0.99311596],"study_design_scores_gemma":[0.0014515442,0.00007908234,0.0009386492,0.00015667925,0.0000048924844,0.000022428767,0.00031770693,0.9687629,0.0058465046,0.0020211765,0.020011133,0.000387336],"about_ca_topic_score_codex":0.00001968905,"about_ca_topic_score_gemma":0.000008310426,"teacher_disagreement_score":0.9927286,"about_ca_system_score_codex":0.00012979156,"about_ca_system_score_gemma":0.00006835881,"threshold_uncertainty_score":0.63562},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"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 New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","score_opus":0.035183989583035154,"score_gpt":0.2237815915891898,"score_spread":0.18859760200615466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964276725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044019046,0.00018621325,0.9965393,0.0006001898,0.00021729288,0.0012492544,0.00003988004,0.00027599302,0.00045167378],"genre_scores_gemma":[0.056915473,0.000010657156,0.9419915,0.00016843858,0.00013421508,0.00055714644,0.00003617326,0.00001614118,0.0001702634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804425,0.00008293424,0.00034761545,0.00061662897,0.00044697738,0.00046160733],"domain_scores_gemma":[0.99823135,0.00017070168,0.00018352478,0.00087131007,0.00044821633,0.00009489096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069063803,0.00026701583,0.00023021376,0.00010677236,0.0005528424,0.00019021904,0.0009933156,0.00008496291,0.00002133302],"category_scores_gemma":[0.00002822983,0.00018077019,0.00010572229,0.00065108197,0.00026402745,0.00076323986,0.00020552288,0.00021118208,0.000025604779],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024757332,0.00021312006,0.000037050457,0.000050979503,0.00009751095,0.0000041642515,0.0034090348,0.000049613107,0.000025051473,0.043386098,0.00026020707,0.9524424],"study_design_scores_gemma":[0.0010023745,0.00054973125,0.00198796,0.00003675807,0.00005845368,0.0000929055,0.00039927298,0.9365055,0.004818774,0.04891004,0.005110931,0.0005273167],"about_ca_topic_score_codex":0.00014963055,"about_ca_topic_score_gemma":0.000020841713,"teacher_disagreement_score":0.9519151,"about_ca_system_score_codex":0.00005733658,"about_ca_system_score_gemma":0.00014416853,"threshold_uncertainty_score":0.7371595},"labels":[],"label_agreement":null},{"id":"W1965026568","doi":"10.1016/j.dam.2011.05.004","title":"Analysing local algorithms in location-aware quasi-unit-disk graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unit disk graph; Algorithm; Vertex (graph theory); Mathematics; Set (abstract data type); Matching (statistics); Graph; Approximation algorithm; Computer science; Combinatorics; Wireless network","score_opus":0.04545922886075514,"score_gpt":0.2643196687415958,"score_spread":0.21886043988084064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965026568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044452865,0.00005918959,0.98596895,0.000049136794,0.0001151012,0.00028897854,0.0000053408603,0.00021845734,0.008849549],"genre_scores_gemma":[0.62578875,0.000013520079,0.37398213,0.00008760704,0.000021094604,0.000050699342,0.000011621597,0.000020850324,0.00002374041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978986,0.00003370789,0.00060739566,0.00052834046,0.00044618195,0.00048576732],"domain_scores_gemma":[0.99836314,0.0001313385,0.00020647135,0.0010620465,0.000091771384,0.00014525227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047277272,0.00030333034,0.00041437458,0.0004052445,0.00018375972,0.00012482573,0.0012882254,0.00011442062,0.00004714528],"category_scores_gemma":[0.000019354791,0.00028548477,0.00012682528,0.0018374878,0.0002198036,0.0003184644,0.00035769568,0.00029317196,0.00008013023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004698758,0.0004050389,0.000140786,0.00011979893,0.00004668826,0.000020203246,0.008420207,0.00016396672,0.000051985306,0.9547199,0.000038644,0.03586806],"study_design_scores_gemma":[0.00040034327,0.000049329923,0.00075828645,0.00008953734,0.000027318494,0.000013957211,0.0025118883,0.45992616,0.0010132501,0.53467757,0.00006801158,0.0004643382],"about_ca_topic_score_codex":0.00009861812,"about_ca_topic_score_gemma":0.000090113426,"teacher_disagreement_score":0.62134343,"about_ca_system_score_codex":0.000041911146,"about_ca_system_score_gemma":0.00006498164,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W1965608008","doi":"10.1007/s00453-013-9850-8","title":"Approximating Minimum-Cost Connected T-Joins","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Rounding; Degree (music); Steiner tree problem; Discrete mathematics; Theory of computation; Path (computing); Undirected graph; Graph; Algorithm; Computer science","score_opus":0.017538724247570543,"score_gpt":0.22843547818148097,"score_spread":0.2108967539339104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965608008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01567257,0.000105930776,0.96769136,0.0026194097,0.00084215833,0.00077589916,0.0000092249575,0.0008729012,0.011410571],"genre_scores_gemma":[0.27660632,0.000007686321,0.72099656,0.0011755046,0.00032463737,0.00023357366,0.000017140019,0.000029136412,0.00060942554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805254,0.00007836832,0.00040271966,0.0005568707,0.00033787338,0.00057164533],"domain_scores_gemma":[0.99842346,0.00024619943,0.00013319428,0.0008253038,0.00016968096,0.00020218852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021384664,0.00023376419,0.00026434677,0.00016346581,0.0002926987,0.00040226002,0.0013166167,0.00009121894,0.00025896617],"category_scores_gemma":[0.00010285354,0.00022223585,0.00012257427,0.0007444171,0.00010942618,0.0007833097,0.00045376364,0.00026434078,0.000931711],"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.0000017064082,0.00021341575,0.000106083935,0.000027248629,0.000064086664,0.00002613094,0.0009728422,0.000018996165,0.0021530148,0.11315201,0.01098242,0.872282],"study_design_scores_gemma":[0.00072193355,0.000108947555,0.0020138267,0.000042521162,0.000009389864,0.000093869596,0.00014329907,0.90317464,0.005000137,0.07453882,0.013502628,0.00065000635],"about_ca_topic_score_codex":0.0001512751,"about_ca_topic_score_gemma":0.000004664262,"teacher_disagreement_score":0.9031556,"about_ca_system_score_codex":0.00003580475,"about_ca_system_score_gemma":0.000054588236,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W1965641578","doi":"10.1016/j.dam.2007.05.001","title":"Flows over edge-disjoint mixed multipaths and applications","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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 New Brunswick; University of Windsor","funders":"","keywords":"Disjoint sets; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Theoretical computer science; Computer science; Telecommunications","score_opus":0.016258153685711853,"score_gpt":0.2561109614297292,"score_spread":0.23985280774401738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965641578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007976812,0.00008251214,0.9772411,0.00006980899,0.00009407607,0.0005244658,0.000008283399,0.00024142137,0.013761495],"genre_scores_gemma":[0.21729064,0.000020513417,0.78215533,0.00016236134,0.00013821531,0.00012303695,0.000009468654,0.000023745682,0.00007669934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985527,0.0000070914575,0.00038276508,0.0003992285,0.00029251733,0.00036572802],"domain_scores_gemma":[0.9986366,0.0002445989,0.00012674638,0.00078959455,0.000037496706,0.00016496812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048287958,0.00021040562,0.00024170337,0.00011894199,0.00023003393,0.00014785051,0.0006033026,0.00008041121,0.000015065837],"category_scores_gemma":[0.000016288188,0.00019047619,0.0000721789,0.0003769238,0.00010947464,0.00013983632,0.0004305585,0.00016777149,0.0000554413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022475958,0.00010421022,0.000012826022,0.00007999386,0.000018284962,0.0000030450126,0.0010613103,0.0000101847745,0.0021405853,0.9358997,0.00014384357,0.06052378],"study_design_scores_gemma":[0.001172463,0.000054092627,0.0019490892,0.00006167565,0.000048198897,0.00004853499,0.0009577428,0.18098722,0.008663729,0.78242004,0.022650816,0.0009864157],"about_ca_topic_score_codex":0.0000043272703,"about_ca_topic_score_gemma":0.000017974253,"teacher_disagreement_score":0.20931382,"about_ca_system_score_codex":0.000023173374,"about_ca_system_score_gemma":0.000018452787,"threshold_uncertainty_score":0.77673936},"labels":[],"label_agreement":null},{"id":"W1967648182","doi":"10.1007/s00373-007-0714-3","title":"Efficient Many-To-Many Point Matching in One Dimension","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; Queen's University; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Matching (statistics); Dimension (graph theory); Point (geometry); Context (archaeology); 3-dimensional matching; Line (geometry); Discrete mathematics; Bipartite graph; Computer science; Graph; Statistics; Geometry","score_opus":0.016632490546493427,"score_gpt":0.23473731553534669,"score_spread":0.21810482498885325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967648182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661599,0.00028878637,0.23132433,0.00039953162,0.0006557421,0.00017934313,8.584591e-7,0.00011878796,0.00087273226],"genre_scores_gemma":[0.9881368,0.000030377278,0.011407421,0.00036981588,0.000011183078,0.000005507332,7.9658884e-7,0.000009365631,0.000028695189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983622,0.000034583358,0.00031131375,0.00045129037,0.0003725619,0.00046806346],"domain_scores_gemma":[0.9991237,0.00011847326,0.000060959646,0.00043154272,0.0000581801,0.00020713442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005281,0.00017403626,0.00021863356,0.00049368525,0.00021172753,0.00011883937,0.0004670429,0.00007085166,0.0000029740252],"category_scores_gemma":[0.000015973052,0.00017660149,0.00006479136,0.0014285747,0.000043569507,0.000095969415,0.00048727202,0.00025008555,0.000011120002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007791783,0.00026282118,0.0012321823,0.000014917999,0.000005907622,0.00004761445,0.001324395,0.000121444486,0.00024910114,0.98426133,0.000038031583,0.012434454],"study_design_scores_gemma":[0.00089056476,0.0002535107,0.07293924,0.00011233827,0.0000061938813,0.000028013672,0.00024369097,0.029556341,0.00073119847,0.89427286,0.0005022944,0.00046373773],"about_ca_topic_score_codex":0.000100079575,"about_ca_topic_score_gemma":0.000016770511,"teacher_disagreement_score":0.22197695,"about_ca_system_score_codex":0.000046766894,"about_ca_system_score_gemma":0.000015235338,"threshold_uncertainty_score":0.72016},"labels":[],"label_agreement":null},{"id":"W1968226734","doi":"10.1109/hpcc.2010.44","title":"Exploiting Parallelism in Iterative Irregular Maxflow Computations on GPU Accelerators","year":2010,"lang":"en","type":"article","venue":"","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 Manitoba","funders":"","keywords":"Computer science; Parallel computing; Graphics processing unit; CUDA; Graph; General-purpose computing on graphics processing units; Iterative method; Pointer (user interface); Graphics; Computation; Parallel algorithm; Out-of-core algorithm; Algorithm; Theoretical computer science; Computer graphics (images)","score_opus":0.0252760637902123,"score_gpt":0.2674711484262791,"score_spread":0.24219508463606682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968226734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46354035,0.000013868613,0.5196972,0.002569705,0.0010997917,0.00025217014,0.0000031647965,0.00032774688,0.012496046],"genre_scores_gemma":[0.8179918,0.0000018395355,0.18096927,0.00077239395,0.00008667349,0.00002288959,0.000003720138,0.0000065654635,0.00014483463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988139,0.000056958706,0.00023841763,0.0003875363,0.00022614525,0.0002770041],"domain_scores_gemma":[0.9992022,0.00019473411,0.000049795774,0.0004045301,0.000062140985,0.000086610875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021401964,0.00014801593,0.00014842888,0.0002380756,0.00019652947,0.00029346434,0.0006719577,0.000060370392,0.00009668243],"category_scores_gemma":[0.00003565596,0.0001362563,0.00006246721,0.0005729007,0.000061602106,0.0005346722,0.00018181598,0.00039168587,0.000072518465],"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.0000025543152,0.00015456289,0.0006453153,0.0000043181994,0.000008280587,0.000034498808,0.002111362,0.0011264374,0.0006241667,0.9368919,0.000533045,0.05786352],"study_design_scores_gemma":[0.0010007226,0.00014587276,0.022385243,0.000058803584,0.0000026043538,0.00002821343,0.00028977264,0.78479177,0.004866356,0.17968576,0.0061115054,0.00063337164],"about_ca_topic_score_codex":0.00003918402,"about_ca_topic_score_gemma":0.0001466845,"teacher_disagreement_score":0.78366536,"about_ca_system_score_codex":0.00001598683,"about_ca_system_score_gemma":0.000035564397,"threshold_uncertainty_score":0.5556371},"labels":[],"label_agreement":null},{"id":"W1969972789","doi":"10.1109/tkde.2011.260","title":"The Minimum Consistent Subset Cover Problem: A Minimization View of Data Mining","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Bipartite graph; Cardinality (data modeling); Clique; Set cover problem; Set (abstract data type); Theoretical computer science; Artificial intelligence; Graph; Mathematics; Data mining; Combinatorics","score_opus":0.08975363559799747,"score_gpt":0.27409211179744,"score_spread":0.1843384761994425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969972789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055260013,0.0011453227,0.9970045,0.000043088094,0.0004467821,0.00014502893,0.00021700688,0.000072365925,0.0003732739],"genre_scores_gemma":[0.71447915,0.0016182964,0.28346995,0.00003583193,0.000061683495,0.000030888907,0.000094925694,0.000028448478,0.00018084567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900955,0.00003068845,0.00027031012,0.00039592717,0.00011403355,0.00017947552],"domain_scores_gemma":[0.9979887,0.00024847296,0.00005312383,0.0015938274,0.000052721083,0.000063154956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032773544,0.00013268145,0.00014958423,0.00009470849,0.00017814897,0.00006491318,0.0014630466,0.00004046924,0.000010252039],"category_scores_gemma":[0.000009032425,0.000108625914,0.000027108155,0.00033303368,0.000064942484,0.0007431464,0.00006977437,0.00011654631,0.000007420953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005626401,0.0008037898,0.00004511808,0.00058261293,0.00042064177,0.0000136135695,0.00601497,0.0021627604,0.00066004775,0.0076936013,0.0044267764,0.9771198],"study_design_scores_gemma":[0.00033360862,0.000082272396,0.00010245806,0.00016298144,0.000049569317,0.00002418338,0.00005463477,0.9746625,0.0013874413,0.000096190364,0.022833755,0.00021045026],"about_ca_topic_score_codex":0.000012628344,"about_ca_topic_score_gemma":0.00004076039,"teacher_disagreement_score":0.97690934,"about_ca_system_score_codex":0.000008238702,"about_ca_system_score_gemma":0.00004544194,"threshold_uncertainty_score":0.44296363},"labels":[],"label_agreement":null},{"id":"W1971426115","doi":"10.1145/1146381.1146410","title":"Oracle size","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Oracle; Computer science; Dissemination; Node (physics); Broadcast communication network; Task (project management); Communication complexity; Computer network; Measure (data warehouse); Network topology; Telecommunications network; Time complexity; Distributed computing; Theoretical computer science; Data mining; Algorithm; Telecommunications","score_opus":0.02255457743138917,"score_gpt":0.25477995277378834,"score_spread":0.23222537534239918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971426115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008155626,0.00017040926,0.8564914,0.0012505768,0.0011757995,0.00012566798,0.000005914231,0.0006455956,0.13931908],"genre_scores_gemma":[0.044853974,0.000015803254,0.94257367,0.0006565331,0.00031989595,0.000024190584,0.0000083031955,0.000012963466,0.01153464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870807,0.00003600627,0.00020796421,0.0005490079,0.00026349945,0.00023547522],"domain_scores_gemma":[0.9985154,0.0001323574,0.00007889513,0.0011531876,0.00006173656,0.00005839408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015683584,0.00018404718,0.00020058306,0.00006699791,0.000082939434,0.0003603955,0.0019168347,0.00014638739,0.00012269414],"category_scores_gemma":[0.000023136074,0.00017179614,0.00015705141,0.00019044502,0.00004633142,0.000115066025,0.0032996791,0.0004043133,0.00012280053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014989762,0.00022639621,0.0003716161,0.00009019389,0.00004360158,0.0000678285,0.00016200184,0.00077325245,0.000018979115,0.6586197,0.09243869,0.24718626],"study_design_scores_gemma":[0.0001459641,0.000021507587,0.006436787,0.000042695603,0.000006160962,0.0000107494825,0.000002617656,0.16952616,0.00038052126,0.77458316,0.048302047,0.00054161594],"about_ca_topic_score_codex":0.00045037316,"about_ca_topic_score_gemma":0.00004562046,"teacher_disagreement_score":0.24664463,"about_ca_system_score_codex":0.000026700542,"about_ca_system_score_gemma":0.00008877777,"threshold_uncertainty_score":0.7005643},"labels":[],"label_agreement":null},{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","score_opus":0.059710073086277904,"score_gpt":0.3185660829249645,"score_spread":0.2588560098386866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971650774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868611,0.00019001863,0.9655038,0.000738444,0.0020214014,0.00023996257,0.000006727575,0.00022250971,0.0023910068],"genre_scores_gemma":[0.533773,0.000009821172,0.4650389,0.00081915193,0.00030511344,0.0000023785801,0.000003936898,0.000019938012,0.000027779017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997409,0.00026704167,0.0006680468,0.0004698597,0.0005106225,0.00067543203],"domain_scores_gemma":[0.9973867,0.0011478006,0.0004555037,0.00037515568,0.00040756233,0.00022730108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014383043,0.00028815592,0.00037889104,0.00027324204,0.0017628898,0.00071079115,0.0009069558,0.00007399109,0.000020642941],"category_scores_gemma":[0.00036007405,0.0002820814,0.00028126582,0.0007730462,0.0001155037,0.00040478428,0.00014326612,0.00063048006,0.000030257168],"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.000021562313,0.00053406623,0.0015509564,0.00010816541,0.00017386356,0.00008089042,0.001334654,0.06024648,0.00016254328,0.8104454,0.0057405373,0.119600855],"study_design_scores_gemma":[0.0010197703,0.00028619415,0.0013111988,0.00017468768,0.000013941111,0.0007080268,0.00015134791,0.8758022,0.0002772476,0.092461586,0.027339527,0.00045422482],"about_ca_topic_score_codex":0.000004071104,"about_ca_topic_score_gemma":0.0000025732422,"teacher_disagreement_score":0.81555575,"about_ca_system_score_codex":0.00010946412,"about_ca_system_score_gemma":0.000198208,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"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 Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","score_opus":0.0649624365213801,"score_gpt":0.2936631913235376,"score_spread":0.22870075480215746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972068724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051539566,0.0005333859,0.9414292,0.0029920493,0.00021473132,0.0011852728,0.00013438886,0.00017165208,0.0017997745],"genre_scores_gemma":[0.82599956,0.0000050438925,0.17355575,0.000073530406,0.000076342476,0.00007424429,0.00017639656,0.000010049447,0.000029112547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977929,0.0004536907,0.00058196374,0.0004837429,0.00041458747,0.00027309012],"domain_scores_gemma":[0.99693197,0.001385654,0.0003919885,0.0007353412,0.00050124904,0.000053788714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013200238,0.00022922938,0.0004276666,0.00011041734,0.00076019403,0.00016722741,0.0009778639,0.000041834024,0.000009151769],"category_scores_gemma":[0.00013289819,0.00017858615,0.0001777869,0.00040943848,0.0026401526,0.0003769834,0.00048962224,0.00017960322,0.0000021534004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010914907,0.00017003456,0.00065128214,0.000051739513,0.000023116592,2.0458661e-7,0.00028445508,0.0072380663,0.00002285221,0.9872041,0.00028098392,0.0039640595],"study_design_scores_gemma":[0.0011447277,0.000031954296,0.049602803,0.000020133028,0.0000116189585,0.00000845122,0.000019187666,0.43225786,0.000081009384,0.51648706,0.000211565,0.00012359557],"about_ca_topic_score_codex":0.00040119656,"about_ca_topic_score_gemma":0.00017139719,"teacher_disagreement_score":0.77445996,"about_ca_system_score_codex":0.000043330278,"about_ca_system_score_gemma":0.00006797438,"threshold_uncertainty_score":0.9727752},"labels":[],"label_agreement":null},{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","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":"University of New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","score_opus":0.01131194124672325,"score_gpt":0.22609503827198374,"score_spread":0.2147830970252605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972661641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013733839,0.0016129141,0.9873024,0.0037706292,0.00046156623,0.00020495577,9.4934137e-7,0.00028640905,0.0062228423],"genre_scores_gemma":[0.14312534,0.0008117087,0.8473529,0.003106607,0.0024639075,0.00006368518,0.000009689358,0.000029249773,0.003036905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884975,0.0000684341,0.00020700757,0.0002857153,0.00019964908,0.0003894505],"domain_scores_gemma":[0.99895525,0.00016687067,0.0000630568,0.00068281754,0.000053731306,0.00007827573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038862694,0.00012375014,0.000109284585,0.000028848062,0.00047720727,0.0003152132,0.0011318921,0.00006324621,0.0000152120365],"category_scores_gemma":[0.0000117604395,0.000086586835,0.000086690554,0.00043441972,0.00006886423,0.00024382588,0.0003120967,0.00027457994,0.00006773911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029814196,0.000020681586,0.000046338988,0.0000018824793,0.00001132011,0.000003373424,0.0001142577,0.015152058,0.0000018113963,0.035487466,0.012458344,0.9366995],"study_design_scores_gemma":[0.00013604992,0.000015597541,0.00025855284,0.000015732003,0.0000022108109,0.000008358017,0.0000023897783,0.74949783,0.00000770266,0.009872324,0.24008429,0.00009892798],"about_ca_topic_score_codex":0.0000043165314,"about_ca_topic_score_gemma":0.000020496469,"teacher_disagreement_score":0.93660057,"about_ca_system_score_codex":0.000023997147,"about_ca_system_score_gemma":0.000014701536,"threshold_uncertainty_score":0.36703408},"labels":[],"label_agreement":null},{"id":"W1973129994","doi":"10.1007/bf02896389","title":"Generalizedk-multiway cut problems","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Theory of computation; Vertex (graph theory); Combinatorics; Local search (optimization); Set (abstract data type); Simple (philosophy); Greedy algorithm; Approximation algorithm; Graph; Independent set; Discrete mathematics; Mathematical optimization; Algorithm; Computer science","score_opus":0.016441978761371778,"score_gpt":0.22698239764784522,"score_spread":0.21054041888647346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973129994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06932693,0.00024215344,0.9258514,0.00015669577,0.00016603642,0.00008500937,3.7964702e-7,0.000035400175,0.004135968],"genre_scores_gemma":[0.3006709,0.000012399864,0.6990094,0.000060469483,0.0002235511,5.054542e-7,2.3448519e-7,0.000007189849,0.000015334423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882466,0.0000069764546,0.0005580005,0.000134356,0.0002798665,0.00019612815],"domain_scores_gemma":[0.999064,0.00011835435,0.00048280135,0.00018102431,0.0000913547,0.00006241625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047509262,0.00012757805,0.00027673662,0.000119789656,0.0001578154,0.00021570634,0.0004543511,0.000038976228,0.0000026225919],"category_scores_gemma":[0.0000063646794,0.0001024323,0.000080956626,0.00019765906,0.00004211168,0.00010944075,0.00020843626,0.00017504151,0.0000018472679],"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.0000031947252,0.00021079724,0.000012720499,0.00009259477,0.000030059082,0.000015471835,0.00149372,0.005672701,0.0026879162,0.92678034,0.0006489377,0.062351547],"study_design_scores_gemma":[0.0006369006,0.00006352583,0.000102565595,0.000111432455,0.000015416783,0.00027247577,0.00008185663,0.53007066,0.0024724863,0.46407682,0.0018912539,0.00020459974],"about_ca_topic_score_codex":0.0000043341424,"about_ca_topic_score_gemma":0.0000010801958,"teacher_disagreement_score":0.52439797,"about_ca_system_score_codex":0.000013576766,"about_ca_system_score_gemma":0.00002481275,"threshold_uncertainty_score":0.41770682},"labels":[],"label_agreement":null},{"id":"W1974465585","doi":"10.1007/s40305-014-0053-z","title":"Simultaneous Approximation of Multi-criteria Submodular Function Maximization","year":2014,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Maximization; Mathematics; Function (biology); Approximation algorithm; Characterization (materials science); Mathematical optimization; Combinatorics; Physics","score_opus":0.04455253395858549,"score_gpt":0.32998570413484907,"score_spread":0.2854331701762636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974465585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09369745,0.00009638227,0.9035946,0.002101382,0.000268967,0.00017260667,0.000002839063,0.000007513649,0.000058230875],"genre_scores_gemma":[0.81041414,0.00006591583,0.1892726,0.00003344258,0.00009031015,0.000002046983,0.0000014975068,0.000004928063,0.00011515156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997917,0.00049171277,0.0004751686,0.00011990319,0.00084265147,0.00015355047],"domain_scores_gemma":[0.9979355,0.00019928218,0.0001924373,0.00041608675,0.0012060939,0.000050651895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027503688,0.00007620756,0.00018167819,0.00011770136,0.00039677444,0.00011233575,0.0009043477,0.000060847906,0.000014772696],"category_scores_gemma":[0.0006436159,0.000053769396,0.00025280865,0.00074855215,0.00020805186,0.0005711424,0.0002083358,0.00035421707,0.000001090196],"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.00007459479,0.00127334,0.00033930189,0.0003261438,0.00024579882,9.312973e-7,0.012273117,0.7216881,0.12275586,0.05676357,0.0035907673,0.0806685],"study_design_scores_gemma":[0.0004124977,0.00022329896,0.0026168684,0.00006604266,0.000007975736,0.00001254517,0.00011002531,0.98378855,0.006455188,0.0058288896,0.0004268768,0.00005124569],"about_ca_topic_score_codex":0.000040048875,"about_ca_topic_score_gemma":0.000008665244,"teacher_disagreement_score":0.71671665,"about_ca_system_score_codex":0.000051187002,"about_ca_system_score_gemma":0.00012784192,"threshold_uncertainty_score":0.30517083},"labels":[],"label_agreement":null},{"id":"W1974542877","doi":"10.5555/1283383.1283520","title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","score_opus":0.03007951308552398,"score_gpt":0.2687336219725512,"score_spread":0.2386541088870272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974542877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034049123,0.00009437509,0.98626006,0.0013941916,0.0010761147,0.0016342177,0.00006149506,0.0006349487,0.005439672],"genre_scores_gemma":[0.19032773,0.000044967474,0.80168736,0.00060877355,0.0012978743,0.0010290975,0.00028654074,0.00017646149,0.004541162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956868,0.00009008035,0.0007481955,0.0013143965,0.0009491385,0.0012113814],"domain_scores_gemma":[0.9971563,0.0005007719,0.00039377672,0.0011470829,0.00044215153,0.00035989154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016443476,0.0005773473,0.0005011432,0.0005316822,0.001247048,0.00053544936,0.001167986,0.00020235742,0.000012329781],"category_scores_gemma":[0.00006998628,0.0004888626,0.00029371923,0.001736364,0.00021134988,0.0009749073,0.00024063121,0.00045612376,0.00003158544],"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.0016898199,0.004454155,0.0059018102,0.0016688575,0.0019787732,0.00031142143,0.012788867,0.06445301,0.013692101,0.4038747,0.007499862,0.48168662],"study_design_scores_gemma":[0.004418265,0.003657773,0.0031818852,0.00033339055,0.00011635645,0.00022995146,0.00048561534,0.9389687,0.0063498886,0.01858553,0.021848848,0.0018237571],"about_ca_topic_score_codex":0.0000953799,"about_ca_topic_score_gemma":0.00017380364,"teacher_disagreement_score":0.8745157,"about_ca_system_score_codex":0.00022941128,"about_ca_system_score_gemma":0.00017100916,"threshold_uncertainty_score":0.9997563},"labels":[],"label_agreement":null},{"id":"W1975508655","doi":"10.1109/focs.2013.67","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Mathematics; Undirected graph; Graph; Node (physics); Tree (set theory); Discrete mathematics; Computer science","score_opus":0.025581953325768878,"score_gpt":0.2619176437730184,"score_spread":0.23633569044724953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975508655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041213757,0.000018421659,0.98907006,0.0009257865,0.0003681217,0.00076788187,0.0000046277796,0.00046567147,0.004258036],"genre_scores_gemma":[0.01992905,0.000002109792,0.9774901,0.0004866284,0.00017402937,0.0002250492,0.00001619699,0.000015107903,0.0016617167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984695,0.000062827035,0.00031009325,0.00049857976,0.0002586234,0.00040042264],"domain_scores_gemma":[0.99872226,0.00018613167,0.000102954255,0.00059252494,0.00026052867,0.00013558171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003002114,0.00018371188,0.00020057494,0.00017777637,0.00037486193,0.00046969132,0.0008365933,0.00008372904,0.00012048762],"category_scores_gemma":[0.000026989028,0.00015728139,0.00009649321,0.00064892805,0.00004487513,0.0012178606,0.00013754779,0.000112022506,0.000053129013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020929058,0.00017383807,0.00005590776,0.000014081019,0.000022664966,0.0000010126928,0.0004405491,0.000019202796,0.001648371,0.045703154,0.0029039166,0.9490152],"study_design_scores_gemma":[0.0005930389,0.0001673237,0.00057399104,0.000009306223,0.0000048750953,0.000008134199,0.00007914932,0.9483521,0.004227142,0.04422252,0.0015166401,0.000245788],"about_ca_topic_score_codex":0.00016561916,"about_ca_topic_score_gemma":0.000032727046,"teacher_disagreement_score":0.94876945,"about_ca_system_score_codex":0.000041379102,"about_ca_system_score_gemma":0.000051270385,"threshold_uncertainty_score":0.6413749},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","score_opus":0.023675307206910665,"score_gpt":0.23164786684606414,"score_spread":0.20797255963915348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976459503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009395464,0.00032473367,0.9940106,0.0002690574,0.0007191065,0.0001416428,9.5179956e-7,0.0001491694,0.0034451715],"genre_scores_gemma":[0.8399587,0.0000039877827,0.15960816,0.000054012784,0.00007833574,0.000015984455,0.0000028528864,0.0000069141943,0.0002710375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988832,0.00013203511,0.000265245,0.00024814604,0.00021896267,0.00025242782],"domain_scores_gemma":[0.99889886,0.00035725985,0.00015893074,0.00042124535,0.00011895316,0.000044727232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897901,0.0001172474,0.0001749007,0.0000930883,0.00027410733,0.000078388824,0.0006060371,0.000049070182,0.0000093255185],"category_scores_gemma":[0.000028880539,0.000118141856,0.00007021687,0.0010772698,0.00006006178,0.0003257194,0.00017379443,0.00012969186,0.000014162294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022111021,0.00012777322,0.0006677266,0.0000057000657,0.000010722485,0.0000061748856,0.00018572777,0.0028473372,0.000086426946,0.9864533,0.007499187,0.0021077371],"study_design_scores_gemma":[0.0002604678,0.00015820879,0.0026394047,0.000026019672,0.0000063041916,0.000008220586,0.000005599462,0.077408515,0.00066904514,0.91532737,0.0033213052,0.00016954084],"about_ca_topic_score_codex":0.00003763041,"about_ca_topic_score_gemma":0.0000013957037,"teacher_disagreement_score":0.8390192,"about_ca_system_score_codex":0.00006817431,"about_ca_system_score_gemma":0.000045369303,"threshold_uncertainty_score":0.48176852},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"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; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","score_opus":0.01898129140375479,"score_gpt":0.24302492648471866,"score_spread":0.22404363508096387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976584101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0793126,0.00016030081,0.905296,0.012503243,0.0013818073,0.00026991265,1.8942995e-7,0.000017497854,0.0010584173],"genre_scores_gemma":[0.75149673,0.000010626351,0.2472713,0.0004447531,0.00030597308,0.000007410525,1.00226636e-7,0.000004994547,0.00045809767],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989119,0.00025265175,0.00034511325,0.00007721304,0.00030020918,0.00011286908],"domain_scores_gemma":[0.998292,0.00042611852,0.00042430634,0.00063292566,0.0001818218,0.000042787833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552676,0.000077140685,0.00024130673,0.00009078709,0.0001264342,0.00026474972,0.0022728236,0.000024332294,0.00002674883],"category_scores_gemma":[0.00074936013,0.000040538704,0.00024496584,0.00023371108,0.000057066645,0.000978619,0.0005068376,0.00019047168,0.000014248014],"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.003056344,0.0007519087,0.00096671714,0.000084831576,0.0011407268,0.00003747071,0.024037227,0.0019815762,0.03161206,0.23803706,0.04390084,0.65439326],"study_design_scores_gemma":[0.020753864,0.00006653215,0.0013941946,0.00009009647,0.00002788249,0.00018408238,0.000058252717,0.19123366,0.0028814082,0.7826443,0.0005344231,0.00013133226],"about_ca_topic_score_codex":0.000011210291,"about_ca_topic_score_gemma":0.000001442388,"teacher_disagreement_score":0.6721841,"about_ca_system_score_codex":0.0000369657,"about_ca_system_score_gemma":0.000025410465,"threshold_uncertainty_score":0.42235097},"labels":[],"label_agreement":null},{"id":"W1976939532","doi":"10.1016/j.tcs.2015.03.042","title":"Finding median in read-only memory on integer input","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Integer (computer science); Logarithm; Algorithm; Binary number; Mathematics; Combinatorics; Selection (genetic algorithm); Simple (philosophy); Upper and lower bounds; Space (punctuation); Time complexity; Binary logarithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence","score_opus":0.035885963671493847,"score_gpt":0.2864995203129722,"score_spread":0.2506135566414784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976939532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048979666,0.000021051002,0.9169729,0.0035653878,0.0019314976,0.00018699338,0.000001258208,0.00024585717,0.02809544],"genre_scores_gemma":[0.8810693,0.0000018338744,0.11731174,0.0013979458,0.00018136289,0.0000055476194,6.1327484e-7,0.000007765221,0.000023871029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966947,0.00018263551,0.00035224477,0.00090061815,0.0011090288,0.0007607724],"domain_scores_gemma":[0.9977831,0.0004166936,0.00006507597,0.0010409332,0.00016095045,0.00053320476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030842407,0.0002320113,0.00026878587,0.0006221012,0.00022092875,0.0004340941,0.0036349907,0.000073893585,0.00003633712],"category_scores_gemma":[0.00031771747,0.00019451292,0.00006622672,0.0023536007,0.002497015,0.00077513006,0.0014955217,0.00047882568,0.00019651004],"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.000008462273,0.0000772399,0.00010833281,0.0000026954972,0.000001421281,0.00005557469,0.0014031987,0.00022760911,0.000017367745,0.89776736,0.00014018058,0.100190565],"study_design_scores_gemma":[0.00038849533,0.0003349211,0.0008374221,0.00007747268,0.0000012697105,0.00006657669,0.00003174299,0.5107821,0.0007558133,0.4861541,0.00027948033,0.00029055364],"about_ca_topic_score_codex":0.000017542961,"about_ca_topic_score_gemma":0.000008539628,"teacher_disagreement_score":0.83208966,"about_ca_system_score_codex":0.00016592794,"about_ca_system_score_gemma":0.00036770952,"threshold_uncertainty_score":0.9200356},"labels":[],"label_agreement":null},{"id":"W1977673587","doi":"10.1007/s00220-014-2260-1","title":"A Combinatorial Approach to Nonlocality and Contextuality","year":2015,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche","keywords":"Kochen–Specker theorem; Quantum nonlocality; Quantum; Formalism (music); Graph; Probabilistic logic; Diagrammatic reasoning; Qubit; Hierarchy","score_opus":0.1682497022073137,"score_gpt":0.3497480707735672,"score_spread":0.18149836856625348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977673587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019995961,0.00006499858,0.9549099,0.0012012254,0.00007183064,0.00027899846,0.0000032655284,0.000089062734,0.041381083],"genre_scores_gemma":[0.60564905,0.0000039880492,0.39406276,0.00019413154,0.000022098311,0.00005170511,0.0000030337003,0.0000044995454,0.000008696162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988575,0.00023013937,0.00028036683,0.00023290818,0.0002261229,0.00017294989],"domain_scores_gemma":[0.9970926,0.0004061803,0.00004574422,0.0021704778,0.00010851274,0.00017650618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009176554,0.00010844865,0.00022843866,0.000041783853,0.00010580611,0.00011664449,0.0018431774,0.00004437551,6.11803e-7],"category_scores_gemma":[0.00031550968,0.00010513271,0.000035179604,0.0005732935,0.00026079777,0.00023103891,0.0017987093,0.00023912587,0.000032111533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018426149,0.00062676746,0.000052167972,0.000014897266,0.0000041437975,1.6424379e-7,0.0021912523,0.000010303065,0.000003210403,0.99078536,0.000138562,0.0061713425],"study_design_scores_gemma":[0.0002828064,0.00002105115,0.00014450397,0.000016957501,0.0000022442382,0.0000024958576,0.00014753704,0.21592447,0.000009709459,0.7826664,0.0006782942,0.00010356283],"about_ca_topic_score_codex":0.000018621186,"about_ca_topic_score_gemma":0.0000026603836,"teacher_disagreement_score":0.6036495,"about_ca_system_score_codex":0.000049860388,"about_ca_system_score_gemma":0.000052025054,"threshold_uncertainty_score":0.42871875},"labels":[],"label_agreement":null},{"id":"W1978372231","doi":"10.1016/j.orl.2009.01.010","title":"An edge-reduction algorithm for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Vertex cover; Edge cover; Cover (algebra); Vertex (graph theory); Feedback vertex set; Reduction (mathematics); Algorithm; Combinatorics; Mathematics; Upper and lower bounds; Approximation algorithm; Graph","score_opus":0.057983112540506636,"score_gpt":0.3598596864221159,"score_spread":0.30187657388160927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978372231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017961358,0.00006459224,0.944539,0.05217448,0.000290363,0.00080251315,0.000009428758,0.000082868326,0.00024063108],"genre_scores_gemma":[0.17333058,0.000068067515,0.81905264,0.0048348326,0.00095319195,0.0005714772,0.000051732557,0.00002016964,0.0011173014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834293,0.00019489347,0.00016015206,0.00037976337,0.00050010264,0.00042216937],"domain_scores_gemma":[0.99872637,0.00015526795,0.000011065346,0.0007221607,0.00029036537,0.00009477289],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001105145,0.00009829991,0.00008241613,0.00018896474,0.0016112368,0.0009925214,0.0011753935,0.000036614652,0.000026417712],"category_scores_gemma":[0.000039039667,0.0000736262,0.000063840176,0.00075845,0.00016773815,0.001046263,0.0000741687,0.0003013314,0.000053498137],"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.000004503968,0.00017599257,0.0000012788609,0.0000028611153,0.00001897841,0.0000028436277,0.0008386603,0.01598244,0.01712725,0.07424286,0.04204164,0.8495607],"study_design_scores_gemma":[0.0002496896,0.00024406402,0.00020982612,0.000007844828,0.0000027480423,0.000015308075,0.00006302373,0.9709917,0.0016506854,0.0039341645,0.022510527,0.00012042587],"about_ca_topic_score_codex":0.00008477791,"about_ca_topic_score_gemma":0.000013824538,"teacher_disagreement_score":0.9550093,"about_ca_system_score_codex":0.00007049897,"about_ca_system_score_gemma":0.00010580724,"threshold_uncertainty_score":0.9996885},"labels":[],"label_agreement":null},{"id":"W1980190601","doi":"10.1145/1721837.1721842","title":"Comparison-based time-space lower bounds for selection","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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; Binary logarithm; Mathematics; Combinatorics; Log-log plot; Streaming algorithm; Running time; Space (punctuation); Mathematical proof; Selection (genetic algorithm); Discrete mathematics; Randomized algorithm; Deterministic algorithm; Time complexity; Algorithm; Computer science","score_opus":0.024947962434627175,"score_gpt":0.2988886896203971,"score_spread":0.27394072718576995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980190601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018620731,0.000012073216,0.99117184,0.0031646735,0.0024337855,0.00040481787,0.000034977675,0.0005874535,0.0003282865],"genre_scores_gemma":[0.21985206,0.000002573919,0.7783786,0.00046578064,0.00019882545,0.00017172101,0.000009618385,0.00003138978,0.00088942173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981883,0.00004582762,0.00031202412,0.0006194249,0.00036629298,0.0004681171],"domain_scores_gemma":[0.99795324,0.0005145979,0.0000983209,0.0010514064,0.00020329685,0.00017915672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033594866,0.00027183557,0.00027826944,0.00031123296,0.00076729245,0.0002950901,0.0012485583,0.0001814055,0.00024872035],"category_scores_gemma":[0.000050323044,0.00028078601,0.00027901182,0.0008346831,0.00013166097,0.00039375992,0.000014819938,0.0006371729,0.00016113113],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012684504,0.0025119707,0.00008712661,0.000042629195,0.00015793036,0.000006251524,0.00039843563,0.009338041,0.010297984,0.011340656,0.004323654,0.9613685],"study_design_scores_gemma":[0.000992511,0.00059059676,0.00028534688,0.000015018916,0.000029043022,0.00001684017,0.000011426389,0.9131518,0.024230978,0.008891125,0.05134397,0.00044131407],"about_ca_topic_score_codex":0.00003826341,"about_ca_topic_score_gemma":0.000081834005,"teacher_disagreement_score":0.9609272,"about_ca_system_score_codex":0.00005119653,"about_ca_system_score_gemma":0.00016267376,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W1980582286","doi":"","title":"Basis reduction and the complexity of branch-and-bound","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Mathematics; Upper and lower bounds; Lattice reduction; Combinatorics; Matrix (chemical analysis); Integer matrix; Integer (computer science); Reduction (mathematics); Lattice (music); Matrix multiplication; Constraint (computer-aided design); Branch and bound; Discrete mathematics; Mathematical optimization; Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.03230018893325343,"score_gpt":0.25104429026433395,"score_spread":0.21874410133108052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980582286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80908436,0.00015396674,0.16534969,0.013553614,0.0009302771,0.0002285652,0.0000028940383,0.0001088204,0.010587804],"genre_scores_gemma":[0.9589503,0.000020159856,0.040771995,0.0000956011,0.000044175216,0.000002576542,2.430525e-7,0.0000016379539,0.00011334764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.000036430985,0.00011303445,0.00015787034,0.00010762153,0.000085503336],"domain_scores_gemma":[0.9995054,0.00008222904,0.000041601237,0.0002993494,0.00003800431,0.00003341363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434878,0.000056735436,0.000104225925,0.00003647724,0.00015947291,0.00007987102,0.0002649585,0.000025553922,0.000031998094],"category_scores_gemma":[0.000022838352,0.000036050664,0.00003064633,0.00015150907,0.0013800377,0.00017673815,0.00019668929,0.00012663583,0.000001467504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005107458,0.000012358392,0.00011007225,0.0000052201513,0.0000060725706,9.4564086e-8,0.00035426806,2.243545e-7,0.0013960919,0.95505875,0.00009260375,0.04295915],"study_design_scores_gemma":[0.00074116635,0.00003014856,0.024366908,0.0000051296206,0.0000070730666,0.00009312617,0.00005170842,0.025530167,0.0063830274,0.94122714,0.0014602095,0.00010419722],"about_ca_topic_score_codex":0.000252052,"about_ca_topic_score_gemma":0.000097793454,"teacher_disagreement_score":0.1498659,"about_ca_system_score_codex":0.0000014257938,"about_ca_system_score_gemma":0.000010401804,"threshold_uncertainty_score":0.50848067},"labels":[],"label_agreement":null},{"id":"W1980738047","doi":"10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","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":"Bipartite graph; Correctness; 3-dimensional matching; Blossom algorithm; Lemma (botany); Perfect graph theorem; Algorithm; Matching (statistics); Factor-critical graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Voltage graph; Line graph","score_opus":0.08537728207017845,"score_gpt":0.39757137192269176,"score_spread":0.3121940898525133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980738047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026891073,0.00034460245,0.9911976,0.00033176498,0.0031798808,0.0003187245,3.723139e-7,0.0002657817,0.001672176],"genre_scores_gemma":[0.07836675,0.000018357025,0.9203317,0.00094004563,0.00029419613,0.000034087938,2.4675518e-7,0.0000063849106,0.000008228095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954978,0.0011390148,0.00065356196,0.0007605749,0.0007125865,0.001236458],"domain_scores_gemma":[0.9962791,0.0022727645,0.00016682186,0.0008216684,0.000091290814,0.00036834014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018292543,0.00027255117,0.0006553273,0.00049531227,0.00043714448,0.0005033664,0.0031437008,0.00009293151,0.000019216386],"category_scores_gemma":[0.00041716883,0.00020650717,0.00021103275,0.002655964,0.0009771669,0.00265409,0.0023354974,0.0004703832,0.000023050343],"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.000050026658,0.00010721099,0.0001413629,0.0000070494466,0.0000044114263,0.000007840616,0.0013600236,0.00041491352,0.0002819039,0.38003942,0.00000568315,0.6175802],"study_design_scores_gemma":[0.0057213865,0.000040439947,0.0015801565,0.000036024547,0.0000034001018,0.00009050344,0.000012906778,0.71756065,0.0013482913,0.27292988,0.00032674617,0.0003496291],"about_ca_topic_score_codex":0.000032740103,"about_ca_topic_score_gemma":6.8988686e-7,"teacher_disagreement_score":0.71714574,"about_ca_system_score_codex":0.000093424125,"about_ca_system_score_gemma":0.00006770107,"threshold_uncertainty_score":0.8421118},"labels":[],"label_agreement":null},{"id":"W1981850523","doi":"10.1007/s00037-007-0222-0","title":"The Complexity of Tensor Circuit Evaluation","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Semiring; Mathematics; Discrete mathematics; Combinatorics; Tensor (intrinsic definition); Boolean circuit; Matrix exponential; Kleene algebra; Complexity class; Diagonal; Matrix (chemical analysis); Boolean function; Time complexity; Pure mathematics","score_opus":0.16958956963516084,"score_gpt":0.3361128090989626,"score_spread":0.16652323946380174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981850523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037897035,0.0002761164,0.95156586,0.0016982517,0.0007261313,0.00049052684,0.000021975326,0.00017251179,0.0071515734],"genre_scores_gemma":[0.8986574,0.0000028487948,0.10091767,0.00021716823,0.00011672871,0.000011040153,0.000037479636,0.000009651156,0.000030017443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654835,0.00027290313,0.00075367617,0.00048083888,0.0014672896,0.00047690817],"domain_scores_gemma":[0.9963594,0.0011754277,0.00037401702,0.00075956626,0.0011856508,0.00014593033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384101,0.00022262907,0.00028063962,0.00017955278,0.0009412638,0.00016120065,0.0016663668,0.00006562689,0.000058609297],"category_scores_gemma":[0.00026823522,0.00018530205,0.00019996769,0.0009584659,0.001716903,0.00033087068,0.00042865938,0.00026621277,0.0000387537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017986378,0.000113028116,0.00068705983,0.000011640692,0.00003698652,0.0000023652788,0.00022782406,0.0021183868,0.00004447623,0.94270515,0.00039247636,0.053642605],"study_design_scores_gemma":[0.00033248338,0.00004639421,0.1364089,0.000009445025,0.000007483489,0.000019804073,0.000029765582,0.28925955,0.00011284349,0.57285285,0.0007868516,0.00013366425],"about_ca_topic_score_codex":0.000065773325,"about_ca_topic_score_gemma":0.0001254851,"teacher_disagreement_score":0.8607604,"about_ca_system_score_codex":0.00012672697,"about_ca_system_score_gemma":0.00022367855,"threshold_uncertainty_score":0.75563985},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","score_opus":0.01236291145485941,"score_gpt":0.23366009205835583,"score_spread":0.22129718060349643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015921688,0.0000426987,0.9897717,0.0016482489,0.00016108713,0.00024111109,0.000005158003,0.00009464808,0.0064431746],"genre_scores_gemma":[0.5328751,0.00004044624,0.4666281,0.000100980134,0.00005606125,0.000033815133,0.00001610333,0.000010654845,0.00023873585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.00003375835,0.00013894819,0.00023359848,0.00015640853,0.0001749926],"domain_scores_gemma":[0.99936324,0.00012349206,0.000089476634,0.00024637987,0.00011259834,0.000064835855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020463625,0.00010103836,0.00007731058,0.000047584075,0.0005363298,0.00038294905,0.00031115522,0.000042277832,0.0000146864795],"category_scores_gemma":[0.000042492895,0.00006896999,0.000019366726,0.00027153562,0.00016278008,0.00040473967,0.00009345962,0.00014905247,0.0000023931768],"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.000010101295,0.000025172167,0.0003425946,0.000009005592,0.00003693014,0.0000037042926,0.0016077484,0.018037068,0.00045282813,0.94926125,0.00008114103,0.030132487],"study_design_scores_gemma":[0.00029550446,0.000048281563,0.0008016586,0.000013843043,0.0000084956855,0.000024818977,0.00004821374,0.99592745,0.00013178239,0.0017530014,0.00081909524,0.00012783441],"about_ca_topic_score_codex":0.0000051336156,"about_ca_topic_score_gemma":0.000026276828,"teacher_disagreement_score":0.97789043,"about_ca_system_score_codex":0.0000046214286,"about_ca_system_score_gemma":0.000046233872,"threshold_uncertainty_score":0.41250694},"labels":[],"label_agreement":null},{"id":"W1983574453","doi":"10.5555/982792.982947","title":"Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Bandwidth (computing); Computer science; Network packet; Computer network; Upper and lower bounds; Scheduling (production processes); Bandwidth allocation; Real-time computing; Dynamic bandwidth allocation; Algorithm; Mathematics; Mathematical optimization","score_opus":0.020722902244617942,"score_gpt":0.24388518050995478,"score_spread":0.22316227826533683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983574453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2202833,0.00010111805,0.7673413,0.008123427,0.00033334977,0.00023227061,0.0000031868015,0.00020098238,0.0033810332],"genre_scores_gemma":[0.3185788,0.000023350918,0.67689586,0.0035854673,0.000079594625,0.000013078436,0.0000012330962,0.00001264,0.00080998155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835765,0.000043267868,0.000241058,0.0006412539,0.00032728587,0.0003894852],"domain_scores_gemma":[0.99891526,0.00013204468,0.00004198574,0.0005728053,0.00007164695,0.0002662673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785105,0.0002319906,0.00023783563,0.00016062496,0.00022110401,0.0003207087,0.0007064148,0.000080524085,0.00010934005],"category_scores_gemma":[0.00004152308,0.00019252044,0.00008087713,0.00028326947,0.00006755251,0.00043992634,0.00047156613,0.00017696703,0.000115744784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596887,0.00080016744,0.0051820497,0.00011072122,0.00028451468,0.00035367682,0.009051881,0.031628624,0.0018447108,0.86783785,0.005017305,0.07762879],"study_design_scores_gemma":[0.015960867,0.0026476826,0.11371403,0.001176661,0.000118391195,0.0005409679,0.0003931436,0.16330627,0.027652595,0.63519657,0.03394302,0.0053497828],"about_ca_topic_score_codex":0.000058060352,"about_ca_topic_score_gemma":0.000025124702,"teacher_disagreement_score":0.23264128,"about_ca_system_score_codex":0.000040876454,"about_ca_system_score_gemma":0.00004508413,"threshold_uncertainty_score":0.78507555},"labels":[],"label_agreement":null},{"id":"W198434069","doi":"10.1007/978-3-642-22935-0_26","title":"Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cover (algebra); Combinatorics; Bounded function; Tree (set theory); Mathematics; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Graph; Vertex cover; Algorithm","score_opus":0.033483422496557655,"score_gpt":0.2419623660101153,"score_spread":0.20847894351355767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198434069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016107313,0.0009199909,0.9922137,0.0009677133,0.002008944,0.0016880399,0.000025458165,0.0001585621,0.0020014558],"genre_scores_gemma":[0.011665034,0.0002224068,0.9819972,0.0020593684,0.00093977543,0.00018709115,0.000019618892,0.00008370186,0.0028257954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584216,0.000042013304,0.0006570943,0.0018042906,0.00082098425,0.00083346316],"domain_scores_gemma":[0.9962047,0.0011996188,0.0004564859,0.0016271713,0.0003319661,0.00018011272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012885409,0.00070973526,0.00063144666,0.0005345825,0.0007565801,0.0011567654,0.0035279815,0.00038015787,0.000027092392],"category_scores_gemma":[0.00010585148,0.00048325583,0.000241194,0.0005692173,0.0015049366,0.0009195873,0.0014244821,0.0007456223,0.000020342457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581486,0.00004175444,0.0000074414997,0.000079999816,0.00003745539,0.0000063406346,0.0012171555,0.0008387163,0.00007890411,0.03428132,0.00007732823,0.96331775],"study_design_scores_gemma":[0.00052295055,0.0002682554,0.00008078056,0.00013535433,0.000022396967,0.000045421857,2.425997e-7,0.6563643,0.00043515337,0.3334266,0.008167784,0.00053075806],"about_ca_topic_score_codex":0.000064667125,"about_ca_topic_score_gemma":0.00013404961,"teacher_disagreement_score":0.96278703,"about_ca_system_score_codex":0.00017998971,"about_ca_system_score_gemma":0.0004314887,"threshold_uncertainty_score":0.99988014},"labels":[],"label_agreement":null},{"id":"W1986273263","doi":"10.1007/s00493-003-0030-3","title":"Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Time complexity; Minimum-cost flow problem; Combinatorics; Flow (mathematics); Disjoint sets; Algorithm; Flow network; Discrete mathematics","score_opus":0.02942264740207311,"score_gpt":0.2672352279507417,"score_spread":0.2378125805486686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986273263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002653084,0.0007507048,0.9883281,0.00042189262,0.0035513877,0.00058054616,0.000016299513,0.0002919465,0.003406067],"genre_scores_gemma":[0.6830288,0.0000826424,0.31497976,0.0005333679,0.00018826543,0.00035410354,0.000014135037,0.00005153291,0.00076733896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.00007531864,0.0003106509,0.0006127418,0.00032340016,0.00062091247],"domain_scores_gemma":[0.99847937,0.00020218243,0.00009945106,0.0008107005,0.00019707665,0.00021120837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004074593,0.00023894296,0.0002931794,0.00013250281,0.00045942896,0.00019566044,0.0010631402,0.00009469697,0.000020215366],"category_scores_gemma":[0.00013555074,0.00025271447,0.00017639293,0.00075567194,0.00006994258,0.00032045186,0.00016447555,0.0001918829,0.000035286273],"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.000008313119,0.00047327142,0.00029868033,0.000053672775,0.00006186636,0.000031790885,0.0006812323,0.0007778208,0.00022513203,0.8339563,0.005788008,0.1576439],"study_design_scores_gemma":[0.0019033363,0.00028208565,0.00021422168,0.000035482237,0.000017342527,0.000031841926,0.000066647466,0.47967222,0.0041225585,0.31315958,0.19980095,0.0006937179],"about_ca_topic_score_codex":0.000021243342,"about_ca_topic_score_gemma":0.0000034854188,"teacher_disagreement_score":0.68037575,"about_ca_system_score_codex":0.00012300981,"about_ca_system_score_gemma":0.0001230764,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W1986446280","doi":"10.1016/j.disopt.2012.05.002","title":"Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Clique problem; Clique; Combinatorics; Approximation algorithm; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Time complexity; Integer (computer science); Branch and bound; Mathematical optimization; Discrete mathematics; Algorithm; Chordal graph; Computer science; Graph","score_opus":0.023079159256816015,"score_gpt":0.27368003639205085,"score_spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986446280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024669289,0.000104265026,0.9985096,0.00017569373,0.0001660354,0.0003654426,0.00003802273,0.000079069905,0.00031521186],"genre_scores_gemma":[0.055108078,0.000026466552,0.94432884,0.000077084536,0.00009315988,0.00012480015,0.00020022881,0.000011132288,0.000030202973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894166,0.0000769939,0.0002799813,0.0002326934,0.00019153453,0.00027714006],"domain_scores_gemma":[0.9990117,0.00010960841,0.00018975059,0.00047167935,0.00014392311,0.000073346055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203407,0.00011825577,0.00018678268,0.00018441114,0.00028534315,0.00012268432,0.0004862555,0.000051170406,0.000022140237],"category_scores_gemma":[0.00001934861,0.00009084869,0.0001552613,0.0011876031,0.00007063785,0.0009961926,0.000109732326,0.000065822045,7.7964853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007317036,0.00014254963,0.0006800777,0.000022630107,0.00035871557,2.3043552e-7,0.0017485941,0.77723384,0.00001643919,0.061576486,0.000029290166,0.15818386],"study_design_scores_gemma":[0.0001582351,0.000051092924,0.00076125085,0.000007965163,0.00020246279,0.0000013858048,0.000086276596,0.9956384,0.00022416598,0.0025819363,0.00015970912,0.00012714011],"about_ca_topic_score_codex":0.000037149854,"about_ca_topic_score_gemma":0.00001039688,"teacher_disagreement_score":0.21840456,"about_ca_system_score_codex":0.000017425047,"about_ca_system_score_gemma":0.000018839419,"threshold_uncertainty_score":0.3704702},"labels":[],"label_agreement":null},{"id":"W1986858995","doi":"10.1016/j.dam.2011.07.004","title":"Randomized algorithms and upper bounds for multiple domination in graphs and networks","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Domination analysis; Upper and lower bounds; Combinatorics; Dominating set; Randomized algorithm; Tuple; Graph; Discrete mathematics; Algorithm; Vertex (graph theory)","score_opus":0.02782976408193505,"score_gpt":0.24571431039309174,"score_spread":0.2178845463111567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986858995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019855263,0.00019031917,0.976873,0.000051951287,0.00009508082,0.0010587577,0.000004309639,0.00008262883,0.0017886859],"genre_scores_gemma":[0.3879579,0.000096090786,0.6115417,0.000059742895,0.000015283735,0.0002894007,0.000006031404,0.000013735887,0.000020157151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885887,0.000025384368,0.00037502625,0.00033619374,0.000135162,0.0002693697],"domain_scores_gemma":[0.9988229,0.00063732575,0.00013296763,0.00029934506,0.00003336897,0.00007405344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488395,0.00018833778,0.00044192013,0.00015756866,0.00013337607,0.00012452691,0.00028277002,0.000087503635,0.000003457971],"category_scores_gemma":[0.000063123356,0.00015872679,0.00007735149,0.0002221639,0.0002251257,0.00019379793,0.00019241445,0.000110711626,8.173169e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004291685,0.00007189228,0.00004256733,0.000081158505,0.000027732602,0.0000011601229,0.0052230554,0.000008057102,0.00003221588,0.9762161,0.000019296547,0.017847646],"study_design_scores_gemma":[0.019809937,0.000018035733,0.00014430497,0.000023157581,0.000015680242,0.0000050548106,0.00017501779,0.50598556,0.0001256536,0.4735145,0.000026070622,0.00015702982],"about_ca_topic_score_codex":0.000015225103,"about_ca_topic_score_gemma":0.000014425635,"teacher_disagreement_score":0.5059775,"about_ca_system_score_codex":0.000009602354,"about_ca_system_score_gemma":0.0000095188525,"threshold_uncertainty_score":0.64726907},"labels":[],"label_agreement":null},{"id":"W1988044523","doi":"10.1016/j.orl.2007.10.006","title":"The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scaling; Semidefinite programming; Equivalence (formal languages); Semidefinite embedding; Polynomial; Mathematics; Mathematical optimization; Computer science; Combinatorics; Discrete mathematics; Mathematical analysis; Quadratically constrained quadratic program; Geometry","score_opus":0.06701004283141021,"score_gpt":0.35075252352602226,"score_spread":0.28374248069461205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988044523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41499218,0.00020689929,0.5772631,0.0067317383,0.000110189205,0.00031059977,0.0000033430388,0.000024065013,0.00035784184],"genre_scores_gemma":[0.9355729,0.000058696805,0.06418863,0.00007168707,0.000041745865,0.00001697509,0.0000023022176,0.0000042300185,0.000042822616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857616,0.00014847639,0.00029185216,0.0001911287,0.00048707426,0.00030527543],"domain_scores_gemma":[0.9985734,0.0006398813,0.000034801596,0.0004272499,0.00025854673,0.00006608818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025981094,0.000060017483,0.000084535895,0.0001999403,0.00071033713,0.00016807778,0.0006210239,0.000027697977,0.000002746007],"category_scores_gemma":[0.00022896481,0.00004640853,0.00003856687,0.0009117425,0.00072463317,0.0002849379,0.0003028578,0.00023702228,0.0000025766547],"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.000036567795,0.000253604,0.0033405526,0.00006554186,0.00007443088,0.000012472845,0.0064505558,0.0032864271,0.2008318,0.22240584,0.0011199387,0.5621223],"study_design_scores_gemma":[0.0015286035,0.0008421242,0.034156535,0.00038054225,0.0000206825,0.000087285545,0.0019631528,0.8543107,0.08759943,0.0073961257,0.0109831635,0.0007316919],"about_ca_topic_score_codex":0.0002986034,"about_ca_topic_score_gemma":0.00021017797,"teacher_disagreement_score":0.85102427,"about_ca_system_score_codex":0.00002227648,"about_ca_system_score_gemma":0.00005482329,"threshold_uncertainty_score":0.5463411},"labels":[],"label_agreement":null},{"id":"W1989485302","doi":"10.1145/2487241.2487243","title":"The VPN Conjecture Is True","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Mathematics; Context (archaeology); Discrete mathematics; Matrix (chemical analysis); Path (computing); Shortest path problem; Graph; Computer science","score_opus":0.01333278377694644,"score_gpt":0.22806660800660872,"score_spread":0.21473382422966228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989485302","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27768105,0.002825593,0.037936803,0.66914546,0.00891644,0.00035291017,0.000002620414,0.000050797975,0.0030883192],"genre_scores_gemma":[0.93456095,0.00017784357,0.053717766,0.008238563,0.0009316406,0.000003265803,3.420038e-8,0.000010702387,0.0023592387],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992446,0.00006850798,0.00019772018,0.00006471806,0.00028409503,0.00014040321],"domain_scores_gemma":[0.99813867,0.000252663,0.00022011375,0.0012269235,0.00011350838,0.00004811904],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003339321,0.00006334917,0.00009109981,0.000026553735,0.00029239795,0.00027541054,0.0058825486,0.000026856056,0.00004568985],"category_scores_gemma":[0.00031856546,0.000026732845,0.00017474877,0.0001988232,0.000074510375,0.00026149227,0.00092079653,0.00029602987,0.000033367876],"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.000007775053,0.0000714489,0.0010110355,0.000006764539,0.00013939125,0.0000129574155,0.002483411,0.000081226804,0.0008939254,0.045679055,0.7305657,0.21904725],"study_design_scores_gemma":[0.00025842752,0.000084294516,0.014784074,0.000030593892,0.00000914833,0.00038322323,0.00006711498,0.0038261588,0.0022138942,0.8440758,0.13417844,0.00008879429],"about_ca_topic_score_codex":0.000011147049,"about_ca_topic_score_gemma":0.0000027178312,"teacher_disagreement_score":0.79839677,"about_ca_system_score_codex":0.0000150404985,"about_ca_system_score_gemma":0.00004696188,"threshold_uncertainty_score":0.9994961},"labels":[],"label_agreement":null},{"id":"W1990177682","doi":"10.5555/1873601.1873636","title":"Asymmetric traveling salesman path and directed latency problems","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Travelling salesman problem; Linear programming relaxation; Combinatorics; Approximation algorithm; Binary logarithm; Mathematics; Log-log plot; Path (computing); Upper and lower bounds; Relaxation (psychology); Latency (audio); Linear programming; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.011671707685845136,"score_gpt":0.23382718519165582,"score_spread":0.2221554775058107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990177682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24765824,0.0024625515,0.60709953,0.014640607,0.015624987,0.0040536,0.0002587888,0.0076403236,0.10056139],"genre_scores_gemma":[0.813997,0.0005537362,0.18345419,0.00046479068,0.0005817824,0.00009848763,0.00003631467,0.000075823606,0.00073793373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722236,0.00009675469,0.00044108476,0.0009986671,0.0005672025,0.0006739086],"domain_scores_gemma":[0.99822193,0.00020783996,0.00015706451,0.00095614715,0.00012039019,0.0003366527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335181,0.0004070022,0.00036664036,0.00037566526,0.00044571538,0.00044026648,0.0011079072,0.00019280805,0.000018158607],"category_scores_gemma":[0.000059556016,0.0003559271,0.00014736048,0.0013450735,0.00019910494,0.00053815945,0.00038132264,0.0007648719,0.00005157329],"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.000040620816,0.0008810429,0.003148595,0.00022892692,0.0002642792,0.00023476708,0.0039526983,0.0002228504,0.04452967,0.2912487,0.0013551066,0.65389276],"study_design_scores_gemma":[0.002779436,0.0013653069,0.034087334,0.0002565579,0.00007468067,0.0003364087,0.00006848514,0.8610567,0.009266636,0.0666084,0.021609286,0.0024907985],"about_ca_topic_score_codex":0.000098298035,"about_ca_topic_score_gemma":0.000031082836,"teacher_disagreement_score":0.8608338,"about_ca_system_score_codex":0.000024057672,"about_ca_system_score_gemma":0.000060207596,"threshold_uncertainty_score":0.99988925},"labels":[],"label_agreement":null},{"id":"W1991263747","doi":"10.1016/j.tcs.2014.09.005","title":"Brushing with additional cleaning restrictions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Ryerson University","keywords":"Brush; Traverse; Graph; Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Engineering; Cartography; Mechanical engineering; Geography","score_opus":0.00951835568800899,"score_gpt":0.2215320800433167,"score_spread":0.21201372435530771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991263747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031066807,0.0000030219671,0.9825977,0.0009593073,0.00033041753,0.0000669071,0.0000055714654,0.00032960004,0.012600782],"genre_scores_gemma":[0.57699263,4.877689e-7,0.42235532,0.00047226014,0.00016239526,0.0000050629883,0.000001910517,0.000004127885,0.000005812952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978224,0.00009368169,0.00018159206,0.00064049615,0.0007677115,0.00049411657],"domain_scores_gemma":[0.99820995,0.00061925786,0.000056701963,0.0006952526,0.00017064705,0.0002482142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009102818,0.00014837802,0.0001398437,0.00022647783,0.0010134776,0.0006461007,0.0020774524,0.00003099076,0.00022496727],"category_scores_gemma":[0.0001109627,0.000117223615,0.00004735138,0.0016647184,0.002324549,0.00089155004,0.00073129317,0.00025584034,0.00007595089],"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.0000023689158,0.000028717444,0.000020875692,0.0000015357616,0.0000021723245,0.000003895556,0.00010492349,0.0003017379,0.000020025369,0.9466943,0.0003128513,0.0525066],"study_design_scores_gemma":[0.00013605648,0.0002227095,0.0020345983,0.00003701948,0.0000021869912,0.000087430686,0.0000036374825,0.6733585,0.00017808455,0.32167152,0.0020837672,0.00018449369],"about_ca_topic_score_codex":0.0000041134012,"about_ca_topic_score_gemma":0.0000014832547,"teacher_disagreement_score":0.6730568,"about_ca_system_score_codex":0.00003754236,"about_ca_system_score_gemma":0.00010417032,"threshold_uncertainty_score":0.8564898},"labels":[],"label_agreement":null},{"id":"W1992520347","doi":"10.1145/1290672.1290684","title":"Packing element-disjoint steiner trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Linear programming relaxation; Disjoint sets; Upper and lower bounds; Packing problems; Matching (statistics); Terminal and nonterminal symbols; Approximation algorithm; Discrete mathematics; Linear programming; Binary logarithm; Algorithm; Computer science","score_opus":0.032282289362734744,"score_gpt":0.28109758381179123,"score_spread":0.24881529444905648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992520347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019245038,0.000079315505,0.9930883,0.0015448593,0.001161878,0.00019932433,0.000013434082,0.00048562756,0.0015027577],"genre_scores_gemma":[0.45544004,0.000054166525,0.54263496,0.0008064366,0.00020735714,0.00002829058,0.00000458576,0.000029535284,0.000794624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776536,0.00004974038,0.0004255024,0.0005864945,0.0005507487,0.00062214164],"domain_scores_gemma":[0.99798834,0.00027628551,0.00008763656,0.0013460685,0.00009315831,0.00020851142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006362072,0.00026992924,0.00022603488,0.0004055619,0.00048501632,0.00018269783,0.0013973736,0.00009689166,0.00018404562],"category_scores_gemma":[0.000022688826,0.00025755906,0.00022615262,0.0009366489,0.0000953016,0.0005269711,0.00004364655,0.00040451396,0.00013876478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001009106,0.0002815597,0.000025594567,0.0000057553975,0.000055859688,0.000040863255,0.0004306989,0.0003922151,0.00035891676,0.0067283222,0.000113590904,0.9915565],"study_design_scores_gemma":[0.009973897,0.003920115,0.038031626,0.00052301347,0.0002637472,0.00072199747,0.002854803,0.31406146,0.2066982,0.20916288,0.20770757,0.0060806973],"about_ca_topic_score_codex":0.00007785656,"about_ca_topic_score_gemma":0.00017086157,"teacher_disagreement_score":0.98547584,"about_ca_system_score_codex":0.00009069228,"about_ca_system_score_gemma":0.00004153751,"threshold_uncertainty_score":0.99998766},"labels":[],"label_agreement":null},{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.038946646905112035,"score_gpt":0.2594211731772316,"score_spread":0.22047452627211958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994002660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017890602,0.000068528716,0.9802254,0.00030543644,0.00058427476,0.00055539655,0.0000022084816,0.00024267363,0.00012548818],"genre_scores_gemma":[0.35611507,0.000005647114,0.64321744,0.000049691946,0.00038215984,0.00013810476,0.000010501469,0.000019548477,0.00006180001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986123,0.00004068682,0.00032989294,0.00038062906,0.0002874231,0.000349096],"domain_scores_gemma":[0.9991979,0.00020921991,0.00009385109,0.00027910876,0.00009225218,0.0001276631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031281973,0.00016714918,0.00023909217,0.00009807357,0.00041047932,0.00017694167,0.0002904962,0.00009153891,0.0000073791985],"category_scores_gemma":[0.00014314314,0.0001580261,0.00009448514,0.00025984118,0.00015059684,0.00045741684,0.00015194088,0.000114052826,0.000007768657],"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.00004997817,0.00046509033,0.000096102114,0.00016180209,0.000055288918,0.000011856326,0.00096123427,0.000026331738,0.000090999936,0.67937624,0.00057014864,0.3181349],"study_design_scores_gemma":[0.00266195,0.0010726658,0.00037348032,0.00006208017,0.00005124039,0.00015998841,0.00011583601,0.67075986,0.00040155463,0.30658808,0.017165532,0.0005877447],"about_ca_topic_score_codex":0.0000023203522,"about_ca_topic_score_gemma":4.779352e-7,"teacher_disagreement_score":0.6707335,"about_ca_system_score_codex":0.000025765768,"about_ca_system_score_gemma":0.00003560077,"threshold_uncertainty_score":0.64441174},"labels":[],"label_agreement":null},{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","score_opus":0.028307662286784503,"score_gpt":0.26016036637486684,"score_spread":0.23185270408808234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994006656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6037306,0.02933463,0.3569645,0.0015042722,0.0029969488,0.0015033165,0.000009710492,0.00039364444,0.0035623848],"genre_scores_gemma":[0.98569196,0.00017774747,0.013468756,0.00022192998,0.00014858242,0.00009347906,0.0000036080473,0.000021763082,0.00017215536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.000069287154,0.000327078,0.00048719047,0.00020979813,0.0006826224],"domain_scores_gemma":[0.99865484,0.000524962,0.0001022887,0.00044689392,0.000046864472,0.00022417783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005982217,0.00027039577,0.00042195446,0.00021707852,0.00028139094,0.00040073827,0.0004913765,0.00012565787,0.000004555527],"category_scores_gemma":[0.000059835897,0.00024754147,0.000095707794,0.0004667142,0.00016862899,0.0007677687,0.00042781638,0.00023503702,0.0000016288504],"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.0002262798,0.00081924093,0.15036799,0.00008092248,0.00013682728,0.000024804873,0.004222448,0.000055360968,0.00011005756,0.7376967,0.0040986324,0.10216072],"study_design_scores_gemma":[0.016884733,0.0010659706,0.16869631,0.00025168897,0.00006935057,0.00009143699,0.00026737226,0.40099776,0.00022878531,0.36325923,0.04653793,0.00164943],"about_ca_topic_score_codex":0.000039518643,"about_ca_topic_score_gemma":0.00007458061,"teacher_disagreement_score":0.4009424,"about_ca_system_score_codex":0.000050356346,"about_ca_system_score_gemma":0.000031886815,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"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; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.04323806333478964,"score_gpt":0.25696351552347346,"score_spread":0.21372545218868383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994612875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033728906,0.0032442585,0.98474,0.009290598,0.00063628855,0.00089302706,0.000006999462,0.000052383133,0.0007991136],"genre_scores_gemma":[0.034861613,0.0011982056,0.9621176,0.00048525044,0.00090808794,0.00013131856,0.0000018151997,0.000027806618,0.00026827268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978724,0.0002144795,0.00078134815,0.00026401278,0.000526422,0.00034130499],"domain_scores_gemma":[0.99702173,0.0013292715,0.0007055541,0.00034664015,0.00050159334,0.000095197756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795875,0.00019909765,0.00033978737,0.00013099091,0.0009014231,0.0006142355,0.0007431805,0.000067292654,0.000017653316],"category_scores_gemma":[0.0002049498,0.0001113029,0.00020897562,0.0005322928,0.00032721317,0.0008849648,0.00014214261,0.00043689983,0.0000025646773],"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.00011719422,0.00022949612,0.00004408547,0.00008254737,0.00033087854,0.000021014459,0.0104956385,0.0018115373,0.00019061539,0.17140447,0.0044541135,0.81081843],"study_design_scores_gemma":[0.0028886443,0.00029180947,0.000025126541,0.00011104192,0.000061693725,0.0005239366,0.00052636623,0.91803014,0.00050615554,0.06944918,0.0074051092,0.00018081376],"about_ca_topic_score_codex":0.000016198137,"about_ca_topic_score_gemma":0.0000066931702,"teacher_disagreement_score":0.9162186,"about_ca_system_score_codex":0.00005816306,"about_ca_system_score_gemma":0.00006302611,"threshold_uncertainty_score":0.69331086},"labels":[],"label_agreement":null},{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","score_opus":0.2635310348025377,"score_gpt":0.4164277997338451,"score_spread":0.15289676493130738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994932713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009432294,0.00037071217,0.96744525,0.020450886,0.000080825506,0.0014546106,0.000037387086,0.00006633398,0.0006616978],"genre_scores_gemma":[0.7092479,0.00036158285,0.28784022,0.0007837821,0.00015003241,0.0009945646,0.000025099382,0.000016399903,0.0005804499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984079,0.0001695961,0.00023519294,0.0002954118,0.0005387861,0.0003531069],"domain_scores_gemma":[0.99779344,0.00089820515,0.000023120276,0.00045757883,0.0007529793,0.000074709795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015700344,0.00009129822,0.00012072003,0.0002531313,0.0012319576,0.00019507536,0.00051854196,0.00004361048,0.000012572668],"category_scores_gemma":[0.00021609092,0.00006807773,0.00007936538,0.00078037457,0.0003335291,0.0002964442,0.0001257256,0.00021598897,0.000008513151],"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.000056673805,0.00081311696,0.00013452746,0.00009810632,0.00006794909,0.000010300878,0.002769313,0.011679036,0.00069147005,0.18447098,0.010291485,0.78891706],"study_design_scores_gemma":[0.00031580296,0.00060579675,0.00048576598,0.000055551667,0.0000021493017,0.000010166887,0.000044392356,0.97446805,0.004618851,0.0054339455,0.01385271,0.00010683623],"about_ca_topic_score_codex":0.000096488475,"about_ca_topic_score_gemma":0.000043603213,"teacher_disagreement_score":0.962789,"about_ca_system_score_codex":0.000008076656,"about_ca_system_score_gemma":0.00017814657,"threshold_uncertainty_score":0.9475346},"labels":[],"label_agreement":null},{"id":"W1995031698","doi":"10.1145/1255443.1255444","title":"(Almost) Tight bounds and existence theorems for single-commodity confluent flows","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Mathematics; Flow (mathematics); Maximum flow problem; Flow network; Sink (geography); Computer science; Combinatorics; Geometry","score_opus":0.0438101471097265,"score_gpt":0.276298589715113,"score_spread":0.2324884426053865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995031698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49758983,0.0009443056,0.48714086,0.009364105,0.003113888,0.0002391314,0.0000067056953,0.000029226549,0.001571953],"genre_scores_gemma":[0.8105734,0.000020951908,0.18795416,0.00090154813,0.0004214185,0.0000011010816,2.4515745e-7,0.000007770699,0.00011938539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.000048562935,0.00032926694,0.0001261881,0.0002958614,0.00021499499],"domain_scores_gemma":[0.9980867,0.0004890297,0.00029450963,0.00085809996,0.00017732907,0.00009432847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015430864,0.000097949196,0.00017189764,0.00006725118,0.00025734142,0.0001700108,0.0027775313,0.00004032373,0.0000039710494],"category_scores_gemma":[0.0005574126,0.00006037315,0.00016306514,0.00018074343,0.00013833397,0.00030336852,0.00075512775,0.0002053704,9.4918784e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047287135,0.0011226378,0.006046903,0.00014169121,0.00034761147,0.00015083633,0.007613789,0.00016406966,0.055017907,0.61659145,0.012998518,0.29933172],"study_design_scores_gemma":[0.0010786284,0.00050819723,0.01074925,0.00013876334,0.000033315962,0.0012119791,0.000093355025,0.0066889026,0.014444751,0.87694055,0.0878667,0.00024560347],"about_ca_topic_score_codex":0.0000036973365,"about_ca_topic_score_gemma":0.000009936301,"teacher_disagreement_score":0.31298357,"about_ca_system_score_codex":0.000041998108,"about_ca_system_score_gemma":0.0000430761,"threshold_uncertainty_score":0.51613903},"labels":[],"label_agreement":null},{"id":"W1996328142","doi":"10.1016/j.tcs.2009.03.018","title":"Efficient enumeration of words in regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Mathematics; Computation; Domain (mathematical analysis); Algorithm; Combinatorics; Computer science; Discrete mathematics","score_opus":0.006969939814450132,"score_gpt":0.25593533423711606,"score_spread":0.24896539442266594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996328142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18299577,0.00004292643,0.8141717,0.00078795594,0.00016149368,0.00008864869,4.4572508e-7,0.00006452486,0.0016865903],"genre_scores_gemma":[0.82505155,0.0000012858053,0.1746982,0.00020733048,0.00003658471,0.0000010565506,2.2521309e-7,0.0000015641799,0.0000022154968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833786,0.00007725384,0.00026161768,0.00042940074,0.0005548821,0.0003389725],"domain_scores_gemma":[0.9990577,0.000104500265,0.00005491094,0.00059839885,0.00008759129,0.00009687795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011845577,0.00010892513,0.00016937222,0.00029518383,0.00011780888,0.00012311546,0.0015346656,0.0000330007,0.000012574708],"category_scores_gemma":[0.00005614732,0.00009384821,0.00004820167,0.0017036308,0.0010559988,0.0001787287,0.00030414842,0.00013063283,0.0000075002836],"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.0000029764694,0.00008769683,0.000032747317,0.0000022321335,5.430305e-7,0.000007526544,0.000601493,0.0028673445,0.0009986561,0.90658665,0.0000034799236,0.088808656],"study_design_scores_gemma":[0.00014523164,0.00016122713,0.005754549,0.000031539515,8.477982e-7,0.000010448838,0.000009184019,0.7984122,0.0057974802,0.18956245,0.00000823681,0.00010657354],"about_ca_topic_score_codex":0.0000035211106,"about_ca_topic_score_gemma":5.918114e-7,"teacher_disagreement_score":0.79554486,"about_ca_system_score_codex":0.00003207929,"about_ca_system_score_gemma":0.000060903214,"threshold_uncertainty_score":0.38908714},"labels":[],"label_agreement":null},{"id":"W1999966159","doi":"10.1007/s10107-011-0463-1","title":"Structural and algorithmic properties for parametric minimum cuts","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Parametric statistics; Property (philosophy); Submodular set function; Arc length; Minimum cut; Mathematical optimization; Parametric model; Applied mathematics; Arc (geometry); Combinatorics; Geometry","score_opus":0.09634188982781142,"score_gpt":0.2654593284455053,"score_spread":0.16911743861769388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999966159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049280904,0.00025236534,0.9484471,0.00013438391,0.00016497077,0.000831485,0.0000014675875,0.00029723434,0.00059005606],"genre_scores_gemma":[0.40974432,0.0000015536518,0.59001464,0.00003072058,0.00003317725,0.00009931728,4.6738324e-7,0.000008773459,0.00006702461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876976,0.000026335043,0.0002731792,0.00034627557,0.00019000702,0.0003944351],"domain_scores_gemma":[0.99928546,0.00014608928,0.000066254004,0.0003183614,0.00006192921,0.0001219136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027753352,0.00016583772,0.00022776253,0.00012502041,0.00020499849,0.00021154185,0.000493234,0.000059432634,0.0000116722995],"category_scores_gemma":[0.00016505487,0.00012496677,0.00008343533,0.00033853672,0.00017545838,0.000302206,0.00024736166,0.00010873005,0.000010779443],"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.0000090622225,0.0001062555,0.00008989954,0.00029961678,0.00003220939,0.000006988819,0.0028779774,4.402173e-7,0.000038324335,0.39268044,0.00003078449,0.603828],"study_design_scores_gemma":[0.00044480897,0.0003348216,0.00020971795,0.000083439605,0.000023478615,0.00010340784,0.00014443042,0.3774762,0.0009954487,0.61877906,0.0010283318,0.00037684888],"about_ca_topic_score_codex":0.0000059956374,"about_ca_topic_score_gemma":7.958526e-7,"teacher_disagreement_score":0.60345113,"about_ca_system_score_codex":0.000012286286,"about_ca_system_score_gemma":0.00001673608,"threshold_uncertainty_score":0.5095997},"labels":[],"label_agreement":null},{"id":"W2000222614","doi":"10.1145/371282.371388","title":"Logics capturing local properties","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Locality; Mathematics; Characterization (materials science); Bounded function; Isomorphism (crystallography); Hierarchy; Expressive power; Discrete mathematics; Statement (logic); Pure mathematics; Theoretical computer science; Computer science; Linguistics","score_opus":0.06790359646617276,"score_gpt":0.25965123243288374,"score_spread":0.19174763596671096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000222614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028168592,0.000105362,0.9914817,0.0036134971,0.00038837592,0.00012807999,0.000004306659,0.0003534816,0.00110831],"genre_scores_gemma":[0.8264866,0.000017000628,0.17216718,0.0010902653,0.000038906623,0.000020430072,0.000003905107,0.000006972938,0.0001687486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986635,0.00006620259,0.00023276522,0.0003918049,0.00037956532,0.00026616515],"domain_scores_gemma":[0.99908113,0.00022167257,0.000049034203,0.00044249019,0.000117134754,0.00008850553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673423,0.00017344141,0.00014453715,0.00018392655,0.00044511873,0.00013309144,0.0009156084,0.000064441294,0.00008608264],"category_scores_gemma":[0.000017676854,0.00015026324,0.00011759696,0.00051543594,0.00014323735,0.00034719633,0.000031347874,0.00025542875,0.0001747004],"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.000015650188,0.00023614799,0.000021996557,0.000007622528,0.000032511518,0.00003752799,0.00021397554,0.7678852,0.000017733979,0.059035033,0.00004926297,0.17244731],"study_design_scores_gemma":[0.00039176655,0.00019665169,0.0013839032,0.000028200358,0.000010254908,0.0002310134,0.00006939051,0.5433894,0.00025358243,0.45153448,0.002196326,0.00031507603],"about_ca_topic_score_codex":0.00002739048,"about_ca_topic_score_gemma":0.00001374701,"teacher_disagreement_score":0.82366973,"about_ca_system_score_codex":0.0000634964,"about_ca_system_score_gemma":0.00006220731,"threshold_uncertainty_score":0.6127557},"labels":[],"label_agreement":null},{"id":"W2001432254","doi":"10.1016/j.dam.2003.11.009","title":"A note on line broadcast in digraphs under the edge-disjoint paths mode","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Concordia University; University of Ottawa","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Time complexity; Line (geometry); Approximation algorithm; Enhanced Data Rates for GSM Evolution; Integer (computer science); Node (physics); Discrete mathematics; Tree (set theory); Degree (music); Running time; Algorithm; Computer science","score_opus":0.028447797900540576,"score_gpt":0.27861105444618267,"score_spread":0.2501632565456421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001432254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013123536,0.000047774964,0.97586215,0.0017823081,0.00015329267,0.00049770955,0.000011452021,0.00017879423,0.008342971],"genre_scores_gemma":[0.7852699,0.000034994748,0.2134628,0.00097015005,0.0000811875,0.0001051775,0.000007339765,0.000030388559,0.00003806964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981763,0.000019488292,0.00044589417,0.0004408811,0.000471552,0.0004459363],"domain_scores_gemma":[0.9983514,0.00022061601,0.000142611,0.0011630184,0.00002880548,0.000093557064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032287755,0.00029085993,0.00030827045,0.00016116993,0.00020206822,0.00019134069,0.0012196773,0.00008867454,0.000007990215],"category_scores_gemma":[0.000019991636,0.00019974241,0.00014334254,0.00072756707,0.00016072833,0.00012953751,0.0003729747,0.0003976798,0.00009094902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062669983,0.0002533093,9.371831e-7,0.000035780995,0.000012781899,0.000009019108,0.004035698,0.012866578,0.000394713,0.97178376,0.00003431267,0.010566828],"study_design_scores_gemma":[0.0007563581,0.00008022885,0.00007094043,0.00011551772,0.000010134372,0.000013160118,0.0005476751,0.12282726,0.0020737636,0.8728886,0.00028776878,0.00032858696],"about_ca_topic_score_codex":0.00003428107,"about_ca_topic_score_gemma":0.000072041905,"teacher_disagreement_score":0.77214634,"about_ca_system_score_codex":0.00007199375,"about_ca_system_score_gemma":0.00006268193,"threshold_uncertainty_score":0.8145259},"labels":[],"label_agreement":null},{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","score_opus":0.04709839733559648,"score_gpt":0.30241239680414445,"score_spread":0.25531399946854794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001944732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048753605,0.00007936033,0.9910973,0.0010343909,0.00019895604,0.0011204776,0.0000018079759,0.00068980554,0.0009025519],"genre_scores_gemma":[0.106974095,0.0000035953935,0.892061,0.00013089273,0.00017258737,0.00034618436,0.000005545884,0.000024266172,0.00028182467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777603,0.000048675538,0.00048857235,0.0005559212,0.00038225998,0.0007485403],"domain_scores_gemma":[0.9983942,0.0004597155,0.00011956261,0.00066794007,0.00012806707,0.00023050475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084641355,0.0002495897,0.00036128188,0.00009982859,0.0003531442,0.0005052782,0.00086483837,0.00009540441,0.000028338325],"category_scores_gemma":[0.00037732083,0.00021208322,0.0002627222,0.00057433825,0.00018217336,0.0003782339,0.0003514878,0.00020985727,0.00006772232],"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.000006884758,0.00038019806,0.00012512978,0.00014205698,0.000022035836,0.000020018062,0.0004339933,0.0000041975063,0.0000372753,0.2981881,0.000085906715,0.70055425],"study_design_scores_gemma":[0.0009956042,0.00048709306,0.00008759776,0.00018533858,0.00003948204,0.00020631791,0.00020273608,0.2951645,0.00058861414,0.41610628,0.28519917,0.0007372833],"about_ca_topic_score_codex":0.000006711507,"about_ca_topic_score_gemma":0.000005037024,"teacher_disagreement_score":0.69981694,"about_ca_system_score_codex":0.00004438559,"about_ca_system_score_gemma":0.00004099591,"threshold_uncertainty_score":0.8648503},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","score_opus":0.1246287817561772,"score_gpt":0.31596490909890745,"score_spread":0.19133612734273026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003104918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06267783,0.00018177695,0.8619535,0.004733219,0.0008990005,0.00046493972,0.000047317324,0.0009271543,0.068115234],"genre_scores_gemma":[0.88671076,0.000018049499,0.110293016,0.002355319,0.00016673685,0.000032135187,0.00019547003,0.000026070753,0.00020247036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621654,0.00040870797,0.000669967,0.0009075195,0.0011461253,0.0006511618],"domain_scores_gemma":[0.99685514,0.0004643177,0.00027861947,0.0016034107,0.0004940961,0.00030444367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217328,0.00044951017,0.00047354418,0.000345653,0.0012321335,0.00057250506,0.0028149877,0.00012930532,0.0003337088],"category_scores_gemma":[0.00009977603,0.00048086565,0.00029729254,0.0012689428,0.00089105574,0.0007547776,0.00086084893,0.00060968735,0.0004271218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042708525,0.0006428002,0.0008195138,0.000013336317,0.00005067148,0.000029512872,0.0002915214,0.0043613315,0.0000070414144,0.96292216,0.0023664343,0.028452964],"study_design_scores_gemma":[0.0006396559,0.00018282076,0.12597717,0.000037741353,0.0000071472577,0.0001007718,0.000014505969,0.1948216,0.000015564483,0.6665706,0.011200305,0.0004321259],"about_ca_topic_score_codex":0.0002004641,"about_ca_topic_score_gemma":0.00016349759,"teacher_disagreement_score":0.8240329,"about_ca_system_score_codex":0.00025451064,"about_ca_system_score_gemma":0.00022722493,"threshold_uncertainty_score":0.9997643},"labels":[],"label_agreement":null},{"id":"W2003388935","doi":"10.1145/1978782.1978784","title":"How well can primal-dual and local-ratio algorithms perform?","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"Alterra Power (Canada); University of Toronto","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Scheduling (production processes); Set cover problem; Steiner tree problem; Algorithm; Upper and lower bounds; Discrete mathematics; Set (abstract data type); Computer science; Mathematical optimization","score_opus":0.039176623895394745,"score_gpt":0.2333518551774825,"score_spread":0.19417523128208775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003388935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022463554,0.0001269848,0.99239403,0.0023928056,0.0009406452,0.00035072383,0.000047517835,0.0004506078,0.0010503299],"genre_scores_gemma":[0.45987153,0.00022288409,0.53771317,0.0006083027,0.00014724256,0.000095902906,0.000008032377,0.00004420395,0.0012887524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973478,0.00010028551,0.00036227427,0.0009489281,0.0005619705,0.00067874196],"domain_scores_gemma":[0.99772394,0.00014983029,0.0001155276,0.0014808998,0.00015719744,0.0003726295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030447455,0.00045471586,0.00037105766,0.0003738446,0.00075133116,0.00039686039,0.0012803937,0.00019998042,0.0002023554],"category_scores_gemma":[0.000018367775,0.0004353897,0.00019108802,0.000785545,0.00041710565,0.0010174986,0.00008523687,0.00063894136,0.000060066708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016623413,0.00036433432,0.000027306343,0.000022112008,0.00009358312,0.000056571615,0.0019529797,0.00005301863,0.00005652691,0.008729119,0.00007759937,0.98855025],"study_design_scores_gemma":[0.0054899678,0.0039501134,0.009481188,0.00019999384,0.00027276273,0.0013950323,0.0037170677,0.76791984,0.07842036,0.09778697,0.027360326,0.0040063853],"about_ca_topic_score_codex":0.00032495268,"about_ca_topic_score_gemma":0.00012455735,"teacher_disagreement_score":0.98454386,"about_ca_system_score_codex":0.000100899124,"about_ca_system_score_gemma":0.00012487904,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2003833943","doi":"10.1016/j.ipl.2007.08.023","title":"Feedback arc set problem in bipartite tournaments","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipartite; Bipartite graph; Arc (geometry); Feedback arc set; Set (abstract data type); Mathematics; Tournament; Combinatorics; Discrete mathematics; Computer science; Quantum entanglement","score_opus":0.01714777052366188,"score_gpt":0.2536164302606104,"score_spread":0.23646865973694856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003833943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11089899,0.00002062761,0.8805165,0.004914372,0.00022096005,0.00016083877,0.0000013566555,0.00017660222,0.0030897232],"genre_scores_gemma":[0.85604966,0.0000026132986,0.13415678,0.009703055,0.000047503872,0.000010949495,0.000010665561,0.00000491303,0.000013837461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873734,0.000015011359,0.00045668273,0.00012350269,0.00032956162,0.00033793366],"domain_scores_gemma":[0.9994834,0.000022799357,0.00018798998,0.00018147368,0.000058717964,0.00006559883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066243485,0.00011009627,0.00009678798,0.0003772963,0.00013755445,0.0004547023,0.00049395225,0.000038065165,0.000006816019],"category_scores_gemma":[0.000016719763,0.000108598724,0.000031315845,0.000793629,0.0000371616,0.004463047,0.00010546722,0.00017976294,0.00007470835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021940134,0.00006263261,0.005916839,0.00022084576,0.000011086343,0.00002158447,0.022129074,0.0012336638,0.0015568793,0.004113081,0.0038101238,0.9609023],"study_design_scores_gemma":[0.007815895,0.00027567914,0.119413115,0.002126302,0.000021282483,0.00037731073,0.0033572968,0.5984618,0.035305765,0.030371493,0.19912188,0.0033521657],"about_ca_topic_score_codex":0.000016243286,"about_ca_topic_score_gemma":0.0000072970147,"teacher_disagreement_score":0.9575501,"about_ca_system_score_codex":0.00007797972,"about_ca_system_score_gemma":0.0000389622,"threshold_uncertainty_score":0.44285277},"labels":[],"label_agreement":null},{"id":"W2004012902","doi":"10.1145/780542.780629","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":68,"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","keywords":"Hypergraph; Cover (algebra); Vertex (graph theory); Vertex cover; Edge cover; Computer science; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Engineering; Approximation algorithm; Graph; Mechanical engineering","score_opus":0.012564676074446786,"score_gpt":0.21331606367483305,"score_spread":0.20075138760038627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004012902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015618147,0.00059226475,0.9585854,0.0011012997,0.0007556942,0.00024047037,0.0000017843104,0.00008841887,0.023016546],"genre_scores_gemma":[0.9019493,0.00004867494,0.09549946,0.00048038884,0.000011390714,0.000003842408,1.3305143e-7,0.000004075061,0.002002734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930453,0.00007084749,0.0001382745,0.00018820353,0.00016288609,0.00013524588],"domain_scores_gemma":[0.9993096,0.00015578973,0.00003980799,0.00039649545,0.000037343743,0.00006095475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022851684,0.00008330748,0.00014699627,0.000047597485,0.00008382282,0.00006353814,0.00042930117,0.000027139324,0.00008354842],"category_scores_gemma":[0.00005190882,0.0000514494,0.000069656795,0.0003122126,0.00013456657,0.0001594736,0.000112862326,0.00006612064,0.000009608031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009822302,0.000026684293,0.00031659746,0.000005776435,0.000022333628,0.0000011329128,0.0005224083,0.000014514223,0.00010018126,0.9738667,0.0032688607,0.021844992],"study_design_scores_gemma":[0.013878885,0.00020948767,0.01843581,0.00006921612,0.00004020129,0.0001211587,0.0003067761,0.27892268,0.013695921,0.53775805,0.13572447,0.0008373598],"about_ca_topic_score_codex":0.00014761773,"about_ca_topic_score_gemma":0.000012975839,"teacher_disagreement_score":0.88633114,"about_ca_system_score_codex":0.000003087927,"about_ca_system_score_gemma":0.00004432427,"threshold_uncertainty_score":0.20980455},"labels":[],"label_agreement":null},{"id":"W2004699374","doi":"10.1007/s10107-007-0139-z","title":"The capacitated max k-cut problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Numerical analysis; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.023004667484770168,"score_gpt":0.2664882864225961,"score_spread":0.2434836189378259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004699374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019206712,0.000090302616,0.98373306,0.0010795093,0.00014570187,0.0003617746,2.509177e-7,0.00042456613,0.012244137],"genre_scores_gemma":[0.16543648,0.0000033362621,0.8337209,0.00012751544,0.00008447522,0.000042746917,8.270512e-7,0.000015542268,0.00056814885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828756,0.000038850016,0.00037917073,0.00026782887,0.00039786403,0.0006287455],"domain_scores_gemma":[0.998495,0.00066452706,0.0000797245,0.00054364814,0.00007635459,0.00014074409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942037,0.00014540165,0.0001477302,0.000057031164,0.00055133534,0.00048105084,0.0010030195,0.000055124514,0.000011923778],"category_scores_gemma":[0.00014728968,0.00009365304,0.00010088127,0.0005633464,0.00022778354,0.00019756725,0.00026405495,0.00024200868,0.00014215261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016817909,0.00005943056,0.000009342439,0.000022661838,0.00001079203,0.00001437343,0.00051429315,7.040428e-7,0.000025655496,0.62839484,0.000096512995,0.3708497],"study_design_scores_gemma":[0.00019581165,0.00009241127,0.0000642466,0.00006094587,0.00000779859,0.000095032134,0.00026630567,0.02150583,0.00086164294,0.9158579,0.0607347,0.00025737216],"about_ca_topic_score_codex":0.000005081996,"about_ca_topic_score_gemma":0.00001522954,"teacher_disagreement_score":0.37059233,"about_ca_system_score_codex":0.00002944866,"about_ca_system_score_gemma":0.000019287214,"threshold_uncertainty_score":0.46387842},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","score_opus":0.05865507247347649,"score_gpt":0.2737072331314133,"score_spread":0.21505216065793684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005509629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01337527,0.0001029375,0.98338807,0.00039280803,0.00016080652,0.0008411355,4.4320203e-7,0.0008422073,0.0008963377],"genre_scores_gemma":[0.33148664,8.05484e-7,0.66827005,0.000055868863,0.00006552057,0.00008125153,0.0000023314935,0.000026130954,0.000011413418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970406,0.00005979292,0.0007368347,0.00064893643,0.0006231989,0.00089058717],"domain_scores_gemma":[0.99860746,0.000101336125,0.00023929136,0.0007216014,0.00010486631,0.00022544636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081016746,0.000344285,0.00042931808,0.00014178749,0.0004303191,0.0009362872,0.0010125532,0.00011162953,0.000012642736],"category_scores_gemma":[0.00019865744,0.00029126822,0.00023045656,0.0009247177,0.00021919768,0.000752129,0.0006624851,0.00043582515,0.00005707399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015524457,0.00063367496,0.00012538568,0.00043186615,0.00003690584,0.000035278717,0.0034958795,0.0004330224,0.00025600955,0.61534023,0.000002029669,0.37920818],"study_design_scores_gemma":[0.0004969479,0.00015936037,0.000007923297,0.0011778384,0.00002141257,0.00023117363,0.0006156147,0.33793133,0.00044822326,0.6577611,0.0005955417,0.0005535701],"about_ca_topic_score_codex":0.00002992531,"about_ca_topic_score_gemma":0.00000441148,"teacher_disagreement_score":0.3786546,"about_ca_system_score_codex":0.00013366825,"about_ca_system_score_gemma":0.0000697381,"threshold_uncertainty_score":0.9999539},"labels":[],"label_agreement":null},{"id":"W2005606079","doi":"10.1016/j.tcs.2013.03.014","title":"Fast balanced partitioning is hard even on grids and trees","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Grid; Partition (number theory); Time complexity; Limit (mathematics); Reduction (mathematics); Approximation algorithm; Maximum cut; Graph partition; Discrete mathematics; Running time; Graph; Mathematical optimization","score_opus":0.012910397604447118,"score_gpt":0.23486422708311516,"score_spread":0.22195382947866804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005606079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13696411,0.000019066485,0.8548797,0.004314432,0.0004668457,0.00016886351,0.0000018835385,0.0002025697,0.0029825547],"genre_scores_gemma":[0.87559956,0.0000055590517,0.12217816,0.002061414,0.00011242859,0.000014081428,4.047739e-7,0.0000048965753,0.000023469125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978642,0.00006753786,0.00021065059,0.00074868003,0.0005769995,0.0005319392],"domain_scores_gemma":[0.99863756,0.00021501083,0.0000475219,0.00068365445,0.00012845603,0.00028777518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367853,0.00018034024,0.00018710908,0.00015727409,0.00057926663,0.0009220539,0.0015311061,0.00004019194,0.00013638729],"category_scores_gemma":[0.000039768278,0.00014583078,0.000053135787,0.00077613076,0.0023086898,0.0008689189,0.0008476937,0.00019683524,0.00020427439],"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.0000017306312,0.0000341466,0.00018515709,0.000002908472,0.000002679568,0.0000026601501,0.00043512136,0.000040212348,0.00029898525,0.9134709,0.00028401802,0.08524146],"study_design_scores_gemma":[0.00017412985,0.00024349095,0.024414254,0.00004272244,0.0000017689879,0.000020790872,0.000007503739,0.58119667,0.0021284714,0.3914375,0.00012196051,0.00021074027],"about_ca_topic_score_codex":0.000010107084,"about_ca_topic_score_gemma":5.677959e-7,"teacher_disagreement_score":0.7386355,"about_ca_system_score_codex":0.000026000476,"about_ca_system_score_gemma":0.00004116156,"threshold_uncertainty_score":0.8891387},"labels":[],"label_agreement":null},{"id":"W2006228567","doi":"10.1287/moor.25.1.76.15208","title":"Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","score_opus":0.08106170843672988,"score_gpt":0.37544963839231127,"score_spread":0.2943879299555814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006228567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0789988,0.00023192329,0.91021615,0.0022498106,0.00011886878,0.0024299568,0.00036357332,0.000079829784,0.005311078],"genre_scores_gemma":[0.07049601,0.00015981299,0.92726076,0.00006380025,0.00007669348,0.00031369875,0.000025968702,0.000021421849,0.0015818183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823993,0.00010510972,0.00038274087,0.00036603017,0.00051627116,0.00038988778],"domain_scores_gemma":[0.9976473,0.0009108308,0.000031069376,0.0005011095,0.0007879509,0.00012172953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010169632,0.00014011664,0.00024724766,0.0002212224,0.0008007614,0.00033533265,0.0006399124,0.000068587935,0.00007824442],"category_scores_gemma":[0.00038244601,0.00013264475,0.000048943046,0.0009106231,0.00031570214,0.00044361866,0.0002118683,0.0002519645,0.000017299495],"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.00006884077,0.0015940357,0.000019659888,0.00042965155,0.00025251223,0.000023232104,0.050641794,0.035226073,0.0038152775,0.3554194,0.0033170385,0.5491925],"study_design_scores_gemma":[0.0004858135,0.00017607573,0.000028443186,0.00011125278,0.0000056783188,0.000012637363,0.0006069739,0.9631655,0.0057153497,0.02922961,0.00031825242,0.00014439938],"about_ca_topic_score_codex":0.00023976564,"about_ca_topic_score_gemma":0.00023183454,"teacher_disagreement_score":0.9279394,"about_ca_system_score_codex":0.00005615319,"about_ca_system_score_gemma":0.00020411388,"threshold_uncertainty_score":0.615889},"labels":[],"label_agreement":null},{"id":"W2006271461","doi":"10.1145/2422436.2422459","title":"A characterization of approximation resistance for even k-partite CSPs","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Constraint satisfaction problem; Predicate (mathematical logic); Characterization (materials science); Conjecture; Approximation algorithm; Mathematics; Constraint satisfaction; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.017987106922776087,"score_gpt":0.22626357157772153,"score_spread":0.20827646465494545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006271461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053341236,0.0000063755556,0.944081,0.00087863795,0.0000984519,0.00033027868,0.0000034894497,0.00006359917,0.0011969457],"genre_scores_gemma":[0.59432113,0.0000046005125,0.40301493,0.000186724,0.000046858037,0.00015847196,0.000018710482,0.000005015413,0.0022435533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.000015337057,0.0001645698,0.00014314537,0.00010263685,0.00010162696],"domain_scores_gemma":[0.99948424,0.000039161983,0.00008462579,0.00023837166,0.00012943149,0.00002419729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010561976,0.00005019807,0.00007934498,0.000052209118,0.000049966333,0.000055581397,0.00027523667,0.000022129347,0.000030447045],"category_scores_gemma":[0.000019829413,0.00004536487,0.000037540525,0.00020625991,0.000020351394,0.0005841859,0.000046700206,0.0000207794,0.000013944568],"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.0000055775145,0.00007673763,0.00014119368,0.00009152862,0.000010367135,7.969839e-8,0.0005036427,0.0000050638323,0.16864508,0.79311794,0.00083869405,0.03656406],"study_design_scores_gemma":[0.00059403165,0.00010424801,0.03421367,0.00006694038,0.0000058295495,0.0000014187726,0.0000232114,0.52267414,0.18036157,0.24784184,0.013807147,0.00030594924],"about_ca_topic_score_codex":0.000009781316,"about_ca_topic_score_gemma":0.0000074108652,"teacher_disagreement_score":0.5452761,"about_ca_system_score_codex":0.000006955881,"about_ca_system_score_gemma":0.000012571907,"threshold_uncertainty_score":0.18499258},"labels":[],"label_agreement":null},{"id":"W2008152388","doi":"10.1063/1.2992977","title":"Additivity and distinguishability of random unitary channels","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Unitary state; Additive function; Quantum channel; Circular ensemble; Quantum; Quantum relative entropy; Quantum phase estimation algorithm; Unitary matrix; Entropy (arrow of time)","score_opus":0.0371805067340154,"score_gpt":0.2494014278954573,"score_spread":0.2122209211614419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008152388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3322338,0.00006166571,0.6667033,0.0001626136,0.00012373111,0.000054170498,0.000004412371,0.000010859131,0.0006454731],"genre_scores_gemma":[0.9477839,0.000011322778,0.052006617,0.000026630716,0.00015935623,5.685262e-7,1.8334073e-7,0.0000033233266,0.000008127038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990286,0.00007803586,0.00038222503,0.0000786779,0.0003198899,0.000112563925],"domain_scores_gemma":[0.9983751,0.00085035415,0.00027095058,0.00021036834,0.00020395551,0.000089250825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137937,0.00008581853,0.0003577215,0.00003275257,0.00007417686,0.000016658088,0.00033536385,0.000025897363,0.000008798221],"category_scores_gemma":[0.00046023927,0.000065186236,0.00013423059,0.00018465154,0.0002587516,0.00027346303,0.00014497752,0.00018047405,0.0000015261932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016980822,0.0040041944,0.0012240986,0.0013050146,0.00025612095,0.00022385908,0.01273906,0.00020953846,0.001145422,0.90815324,0.0020917065,0.06847793],"study_design_scores_gemma":[0.0007213639,0.00017519957,0.002106903,0.0000976612,0.000014987942,0.00026502516,0.000032627442,0.018354058,0.0013255562,0.9767646,0.000045641016,0.00009634178],"about_ca_topic_score_codex":0.0000013378841,"about_ca_topic_score_gemma":6.5206166e-8,"teacher_disagreement_score":0.6155501,"about_ca_system_score_codex":0.000009222889,"about_ca_system_score_gemma":0.000042509266,"threshold_uncertainty_score":0.26582175},"labels":[],"label_agreement":null},{"id":"W2009786555","doi":"10.1109/focs.2012.55","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":60,"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; Submodular set function; Greedy algorithm; Monotone polygon; Mathematics; Rounding; Function (biology); Combinatorics; Constraint (computer-aided design); Mathematical optimization; Approximation algorithm; Algorithm; Discrete mathematics; Combinatorial optimization; Computer science","score_opus":0.019811698661797293,"score_gpt":0.25453204224525283,"score_spread":0.23472034358345553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009786555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011807475,0.000042028714,0.9932595,0.000714822,0.002749745,0.0005768317,0.000015839007,0.00026441904,0.0011960844],"genre_scores_gemma":[0.12114082,0.0000026408043,0.8774132,0.0006229521,0.00052109535,0.00009956475,0.000012333061,0.000013632393,0.00017375412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861366,0.00004859232,0.00023231223,0.0003157478,0.00026431604,0.0005253524],"domain_scores_gemma":[0.9990174,0.000112312046,0.00005208201,0.0004326769,0.00013021384,0.00025532354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484269,0.0001647768,0.00019118052,0.00015656109,0.00018795331,0.00016010465,0.0005954255,0.00006923003,0.00005621074],"category_scores_gemma":[0.000044407574,0.000154243,0.00011916746,0.0004622023,0.00004705379,0.00049732614,0.00020608123,0.00008141641,0.000060694412],"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.000006503682,0.000179579,0.0001393414,0.0000093400795,0.000022281474,0.0000015766088,0.00041252418,0.00001719462,0.00014794244,0.82065815,0.0027009016,0.17570467],"study_design_scores_gemma":[0.0036896144,0.00081354484,0.002207545,0.00004100688,0.000037939455,0.00013909115,0.00014002016,0.64125466,0.016321367,0.19119777,0.14277703,0.0013804341],"about_ca_topic_score_codex":0.000024802972,"about_ca_topic_score_gemma":0.00000301697,"teacher_disagreement_score":0.64123744,"about_ca_system_score_codex":0.000050814706,"about_ca_system_score_gemma":0.000050110888,"threshold_uncertainty_score":0.6289847},"labels":[],"label_agreement":null},{"id":"W2010962367","doi":"10.1016/s0304-3975(00)00019-0","title":"A space lower bound for st-connectivity on node-named JAGs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Turing machine; Discrete mathematics; Path (computing); Logarithm; Directed graph; Space (punctuation); Computation; Computer science; Algorithm","score_opus":0.014345452906201827,"score_gpt":0.2586123640249335,"score_spread":0.24426691111873167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010962367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09331227,0.00001535928,0.8937805,0.004185045,0.0011191604,0.0003898416,0.000010942072,0.00031808505,0.0068687634],"genre_scores_gemma":[0.8387733,0.000004383018,0.15919882,0.001658619,0.00024490262,0.000026240616,9.457408e-7,0.000011675518,0.000081124184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965746,0.00011729839,0.00028547656,0.0012305337,0.00085426535,0.0009378703],"domain_scores_gemma":[0.9971441,0.0008863285,0.00005973914,0.001352517,0.00018320578,0.00037413108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017534612,0.0002933769,0.00030814763,0.00020803532,0.0009195508,0.0006980173,0.0032157085,0.00007778283,0.00027276488],"category_scores_gemma":[0.00013145868,0.00025037842,0.00017170407,0.0013663503,0.003125418,0.00073670316,0.0005395399,0.00032202734,0.00016347038],"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.000044492856,0.00015539296,0.0000075613675,0.0000055472547,0.0000044581548,0.000009272608,0.00021751485,0.00025899083,0.00007325662,0.8749421,0.00023425292,0.12404716],"study_design_scores_gemma":[0.00041930203,0.00062572176,0.00053029327,0.000035894762,0.000003927867,0.000023408846,0.0000021413796,0.55505353,0.0014877015,0.4383555,0.0031339815,0.00032859464],"about_ca_topic_score_codex":0.0000068084287,"about_ca_topic_score_gemma":0.0000017516527,"teacher_disagreement_score":0.745461,"about_ca_system_score_codex":0.00008922304,"about_ca_system_score_gemma":0.00015790737,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"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":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","score_opus":0.011839585345832392,"score_gpt":0.22527799712169255,"score_spread":0.21343841177586015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010996873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688202,0.0001973264,0.72342837,0.052321415,0.0032099488,0.0043414994,0.0005597383,0.00100805,0.07805165],"genre_scores_gemma":[0.9699648,0.000017618695,0.0282504,0.00049702014,0.00010928308,0.000086017295,0.000037615584,0.00002551186,0.0010117306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974603,0.00027844057,0.000498274,0.0006326795,0.0007245122,0.00040578496],"domain_scores_gemma":[0.9980025,0.00014835158,0.0002766286,0.0013200324,0.00017454971,0.00007790491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055751007,0.000283273,0.0003039611,0.0001199934,0.00031570825,0.00014911321,0.0015499091,0.00011538627,0.00001111961],"category_scores_gemma":[0.000021202448,0.00021126926,0.00025374978,0.00083320454,0.00030393133,0.00031269822,0.00044327226,0.000321604,0.0000036967392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022964141,0.0009012559,0.002186992,0.00012681262,0.000051745108,0.000007855712,0.0008022469,0.0020877488,0.0064195246,0.97312456,0.0017188862,0.012549432],"study_design_scores_gemma":[0.0027152519,0.0009443537,0.05467756,0.0002287768,0.000052773048,0.000041140327,0.000067511995,0.19183676,0.11644214,0.62089103,0.010835334,0.0012673669],"about_ca_topic_score_codex":0.0007782922,"about_ca_topic_score_gemma":0.00008228325,"teacher_disagreement_score":0.8330828,"about_ca_system_score_codex":0.00012239779,"about_ca_system_score_gemma":0.00012832646,"threshold_uncertainty_score":0.861531},"labels":[],"label_agreement":null},{"id":"W2011182146","doi":"10.1145/509907.509911","title":"Dynamic subgraph connectivity with geometric applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Computer science","score_opus":0.017720459785821974,"score_gpt":0.22338481021640538,"score_spread":0.2056643504305834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011182146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037264389,0.00017014232,0.9781795,0.00062289723,0.000043283206,0.00017685619,0.0000019005325,0.00033013368,0.016748851],"genre_scores_gemma":[0.8797474,0.000028901954,0.11935068,0.00017818999,0.00000863005,0.00005722963,8.641128e-7,0.0000045095358,0.0006236167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916434,0.000019769423,0.000094072464,0.00032273977,0.0001918021,0.00020726328],"domain_scores_gemma":[0.99912506,0.00012605764,0.000036114743,0.00058136793,0.0000552832,0.0000761135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009101881,0.00009624575,0.0000998288,0.00032033524,0.00018733699,0.00010465967,0.00062103465,0.000026982503,0.00015458562],"category_scores_gemma":[0.00000684416,0.00007706112,0.00004509177,0.002786779,0.000073947966,0.00028541702,0.0001077817,0.00010114791,0.00013161084],"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.0000013252061,0.00037737872,0.0020848385,0.000011539101,0.0000332433,0.000008175427,0.000107237924,0.00008755413,0.000037389516,0.5057516,0.0006889232,0.49081075],"study_design_scores_gemma":[0.0007208434,0.00027317615,0.023465516,0.000009572376,0.000012761197,0.00013014136,0.000037816677,0.90474033,0.00034263852,0.04766967,0.021961033,0.0006364994],"about_ca_topic_score_codex":0.000027409473,"about_ca_topic_score_gemma":0.00004532915,"teacher_disagreement_score":0.9046528,"about_ca_system_score_codex":0.000018318273,"about_ca_system_score_gemma":0.0000072180455,"threshold_uncertainty_score":0.31424615},"labels":[],"label_agreement":null},{"id":"W2011204371","doi":"10.1145/2229163.2229166","title":"I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Binary logarithm; Shortest path problem; Undirected graph; Spanning tree; Minimum spanning tree; Random graph; Path (computing); Bounded function; Enhanced Data Rates for GSM Evolution; Time complexity; Shortest-path tree; Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.04606075865658251,"score_gpt":0.28554418786670077,"score_spread":0.23948342921011825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011204371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031380395,0.00028331336,0.990168,0.00064192235,0.0029014382,0.0014651349,0.00015108757,0.0009448955,0.00030619587],"genre_scores_gemma":[0.2750584,0.00010297689,0.7221321,0.00050614896,0.00044352678,0.000886934,0.000035539597,0.00010567693,0.0007287336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593997,0.00017381825,0.0006361727,0.0010201604,0.0008419721,0.0013879151],"domain_scores_gemma":[0.9956047,0.0012542767,0.00019494125,0.0019037222,0.00047154195,0.00057080155],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007974449,0.0006671331,0.0006623306,0.00059305876,0.0013054523,0.00033895366,0.0017971388,0.00023065973,0.00012452996],"category_scores_gemma":[0.0001387374,0.00051523227,0.00043530355,0.00207462,0.00031975788,0.00060329394,0.00005130658,0.0005851569,0.00006114025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009698032,0.004924691,0.00010081033,0.000071170034,0.00075239985,0.000043118238,0.002497594,0.0050067003,0.00013083173,0.012584515,0.00085776614,0.9720606],"study_design_scores_gemma":[0.022280423,0.004465521,0.0033122888,0.0004170753,0.00064205774,0.0006236488,0.00095763506,0.8825264,0.00849716,0.015838005,0.056313112,0.004126646],"about_ca_topic_score_codex":0.00008145265,"about_ca_topic_score_gemma":0.00006462154,"teacher_disagreement_score":0.96793395,"about_ca_system_score_codex":0.00016392814,"about_ca_system_score_gemma":0.00023572046,"threshold_uncertainty_score":0.9999947},"labels":[],"label_agreement":null},{"id":"W2012511041","doi":"10.1007/s10107-005-0693-1","title":"A 2 + ɛ approximation algorithm for the k-MST problem","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Approximation algorithm; Minimum spanning tree; Combinatorics; Triangle inequality; Spanning tree; k-minimum spanning tree; Graph; Algorithm; Discrete mathematics; Tree structure; K-ary tree","score_opus":0.029306888118048803,"score_gpt":0.274109404855013,"score_spread":0.2448025167369642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012511041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002552336,0.0001236077,0.9938486,0.0036378964,0.00006949189,0.0010201372,0.0000013379419,0.0003073866,0.0009659894],"genre_scores_gemma":[0.004447914,0.000002166517,0.9944142,0.00018022684,0.00021019876,0.0005267875,0.000002030287,0.000011581999,0.00020489463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.00002649578,0.00030438922,0.0002807365,0.00028523925,0.0003757945],"domain_scores_gemma":[0.9988047,0.0005147026,0.00008284974,0.00045287373,0.000074020594,0.00007088619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074234436,0.00014036233,0.00015635978,0.000049507675,0.00037440375,0.0004100189,0.00082057394,0.000049543934,0.000017668877],"category_scores_gemma":[0.00007087921,0.00009225602,0.00013629504,0.00031661507,0.00009533142,0.00034662848,0.00019235123,0.00013686642,0.000062971325],"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":[4.4954893e-7,0.00008841885,3.7696307e-7,0.000030719108,0.0000105166355,2.9800248e-7,0.00041107007,0.000013133265,0.000003997817,0.30112207,0.00012074397,0.6981982],"study_design_scores_gemma":[0.00017767512,0.00004289212,0.0000027693022,0.00002417023,0.000010182449,0.000018870034,0.000049931296,0.74956685,0.00014825304,0.19735643,0.052488398,0.00011357011],"about_ca_topic_score_codex":0.0000016942162,"about_ca_topic_score_gemma":0.00000167404,"teacher_disagreement_score":0.74955374,"about_ca_system_score_codex":0.000029255742,"about_ca_system_score_gemma":0.000020206082,"threshold_uncertainty_score":0.39538217},"labels":[],"label_agreement":null},{"id":"W2012939571","doi":"10.1023/a:1009893108387","title":"Steiner k-Edge Connected Subgraph Polyhedra","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Polyhedron; Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph; Enhanced Data Rates for GSM Evolution; Computer science; Algorithm","score_opus":0.008733764535961423,"score_gpt":0.2215240309997457,"score_spread":0.2127902664637843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012939571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024804154,0.0003987211,0.9591489,0.0013853739,0.008889867,0.0001882425,0.0000026371351,0.00013558794,0.0050465427],"genre_scores_gemma":[0.6870133,0.00033877368,0.31065255,0.00032847867,0.0013262011,0.000003032405,0.000006379056,0.000027710597,0.00030358063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00013891228,0.0005495595,0.00016055841,0.00047550764,0.00020811646],"domain_scores_gemma":[0.99869007,0.00011225578,0.00032558237,0.0002871855,0.0004480201,0.00013689257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040556054,0.00014284832,0.00027011434,0.00026433906,0.00014587535,0.00021058673,0.0007732587,0.00009152209,0.00033080854],"category_scores_gemma":[0.00007400622,0.00012919598,0.00016677617,0.0009063779,0.00005176506,0.0010367539,0.000048672468,0.0002334727,0.000011461923],"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.00036868895,0.0011449151,0.00042361012,0.000026296999,0.00022339787,0.00014169906,0.0012016307,0.3315854,0.00032984465,0.57555497,0.0067519154,0.0822476],"study_design_scores_gemma":[0.009904099,0.0020643792,0.0013908544,0.00017280784,0.00009294331,0.0004865779,0.00004468701,0.78544927,0.0023577418,0.16464098,0.03248083,0.00091483543],"about_ca_topic_score_codex":0.000006532092,"about_ca_topic_score_gemma":1.930145e-7,"teacher_disagreement_score":0.66220915,"about_ca_system_score_codex":0.000042382282,"about_ca_system_score_gemma":0.000111014764,"threshold_uncertainty_score":0.5268459},"labels":[],"label_agreement":null},{"id":"W2014708079","doi":"10.1007/s10878-014-9774-5","title":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Bounded function; Graph; Integer (computer science); Tree (set theory); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008175121224844557,"score_gpt":0.21915758837031976,"score_spread":0.2109824671454752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014708079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069042575,0.00020620436,0.9887932,0.0015624906,0.0019911348,0.0002263061,0.00000282871,0.000033213924,0.00028038467],"genre_scores_gemma":[0.3665302,0.00017033963,0.63232064,0.00014582352,0.000673886,0.00001690702,0.0000064198925,0.000022296033,0.00011345652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.0000765411,0.00044621193,0.00020009668,0.00022912618,0.0001708002],"domain_scores_gemma":[0.9986448,0.00022899109,0.0004167121,0.0001953996,0.00038171504,0.00013237665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605082,0.00014513532,0.00027740543,0.00023885895,0.00027242093,0.00022837606,0.0003072283,0.00008995254,0.000004718462],"category_scores_gemma":[0.0002099506,0.00012663443,0.000093938026,0.0002724387,0.000058735015,0.00070736127,0.0001297198,0.00011587069,2.1283536e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022237569,0.00038645894,0.00043508242,0.00011507951,0.00014958384,0.0000029390992,0.0011808459,0.017344777,0.0026815063,0.95344865,0.0010701023,0.022962617],"study_design_scores_gemma":[0.003081369,0.0006928836,0.00025972378,0.000036243146,0.0000390285,0.00005424761,0.000013376819,0.9161119,0.0006760479,0.07304461,0.00579131,0.00019925444],"about_ca_topic_score_codex":0.0000026438852,"about_ca_topic_score_gemma":0.0000021144413,"teacher_disagreement_score":0.8987671,"about_ca_system_score_codex":0.00002943093,"about_ca_system_score_gemma":0.00003509464,"threshold_uncertainty_score":0.5164003},"labels":[],"label_agreement":null},{"id":"W2015242277","doi":"10.1145/1497290.1497295","title":"Bicriteria approximation tradeoff for the node-cost budget problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"Seventh Framework Programme; Israel Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematical optimization; Graph; Mathematics; Profit (economics); Binary logarithm; Computer science; Economics","score_opus":0.036657713358995384,"score_gpt":0.282440860536305,"score_spread":0.24578314717730965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015242277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007910308,0.00009777319,0.9795135,0.017831774,0.0007447693,0.0010632778,0.000056892117,0.0003605646,0.00025230937],"genre_scores_gemma":[0.06972212,0.00010070936,0.92701775,0.0021592847,0.00020110786,0.00044838135,0.000015699872,0.000022427885,0.0003125452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982876,0.000057777168,0.00034434153,0.000527075,0.00034430093,0.00043888862],"domain_scores_gemma":[0.9980573,0.00040636412,0.00008752371,0.001238229,0.00010693082,0.00010361957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003950287,0.00025413118,0.00020497195,0.00019155326,0.0008313678,0.0003448503,0.0017222363,0.00010359685,0.0000335014],"category_scores_gemma":[0.000023119728,0.00019677289,0.00024164883,0.0007480046,0.00008080101,0.00059174834,0.000013025821,0.00030732556,0.000033452812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016836335,0.00028368254,4.933252e-7,0.00001111879,0.000033493096,0.0000015347933,0.0005767995,0.0011987356,0.00026549087,0.009691632,0.00048200265,0.9874382],"study_design_scores_gemma":[0.0017761929,0.0007272134,0.001126484,0.00006808348,0.00007395803,0.00008253956,0.00012876082,0.7873145,0.007942954,0.15896693,0.04109255,0.0006998393],"about_ca_topic_score_codex":0.000017198878,"about_ca_topic_score_gemma":0.0000060398065,"teacher_disagreement_score":0.9867383,"about_ca_system_score_codex":0.000052767988,"about_ca_system_score_gemma":0.0000502101,"threshold_uncertainty_score":0.80241656},"labels":[],"label_agreement":null},{"id":"W2015423869","doi":"10.1007/s10107-009-0299-0","title":"New geometry-inspired relaxations and algorithms for the metric Steiner tree problem","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Bipartite graph; Metric (unit); Linear programming relaxation; Combinatorics; Approximation algorithm; Upper and lower bounds; Algorithm; Relaxation (psychology); Schema (genetic algorithms); Discrete mathematics; Linear programming; Computer science; Graph","score_opus":0.03784171705136553,"score_gpt":0.2851208739396493,"score_spread":0.24727915688828378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015423869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015577662,0.00056623784,0.9919166,0.0053921314,0.00007257826,0.0008712731,0.0000011286842,0.00025759445,0.0007666732],"genre_scores_gemma":[0.028936334,0.000009833669,0.9700671,0.00018187867,0.000116957,0.000083879764,0.0000016210048,0.000010139905,0.0005922685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854124,0.000029566716,0.0003454843,0.0003586494,0.0003243565,0.00040073527],"domain_scores_gemma":[0.9982818,0.0008997692,0.00010928841,0.0004817163,0.000070757145,0.00015671586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629268,0.00017422796,0.00023454527,0.00018641783,0.00040807965,0.0004953161,0.0006787137,0.00006548306,0.000010563514],"category_scores_gemma":[0.00033616315,0.000114931165,0.00012612084,0.0012884662,0.00006859246,0.00029274778,0.00014606716,0.00016386234,0.00001142044],"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.0000012443471,0.00006220272,0.0000048069614,0.000020804015,0.000014910532,0.000001038339,0.00025253778,0.000005023618,0.0000068962845,0.31305772,0.00026201902,0.6863108],"study_design_scores_gemma":[0.000638693,0.00039748425,0.00047459756,0.000058765192,0.00005338056,0.000043104155,0.00007837169,0.26212826,0.00010631907,0.71134305,0.024391448,0.00028654883],"about_ca_topic_score_codex":0.000008832509,"about_ca_topic_score_gemma":0.0000033417912,"teacher_disagreement_score":0.68602425,"about_ca_system_score_codex":0.000021526572,"about_ca_system_score_gemma":0.00003431307,"threshold_uncertainty_score":0.4776345},"labels":[],"label_agreement":null},{"id":"W2016263640","doi":"10.1145/2635822","title":"The complexity of the comparator circuit value problem","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Complexity class; Combinatorics; Bipartite graph; Conjecture; Discrete mathematics; Class (philosophy); P; Comparator; Oracle; Time complexity; Graph; Computer science","score_opus":0.04217450054507668,"score_gpt":0.2620574507414464,"score_spread":0.2198829501963697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016263640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022924081,0.00003420248,0.99213547,0.0025557457,0.00075673,0.0003010252,0.000008114122,0.00014152488,0.0017747929],"genre_scores_gemma":[0.96574384,0.0000049751598,0.033574346,0.0004698028,0.000033743596,0.000024739838,0.000001262106,0.000010060176,0.00013725413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978707,0.00080225326,0.00037410462,0.00030161513,0.00041856142,0.00023277104],"domain_scores_gemma":[0.99674994,0.0016987982,0.00019780468,0.0011433051,0.00014960661,0.00006052677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853001,0.00016246647,0.00018060567,0.0000812461,0.0011586719,0.00012887757,0.0020661554,0.000049307724,0.000013957247],"category_scores_gemma":[0.000057999594,0.000105034684,0.00020204949,0.00066011754,0.0007917694,0.00017738868,0.000053030148,0.00029892035,0.000029631774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010524162,0.00009734368,0.000008246813,0.000009710499,0.000031211363,9.96914e-8,0.00043057094,0.016953083,0.00005023359,0.8453132,0.000073693096,0.13702211],"study_design_scores_gemma":[0.00028768013,0.00007904666,0.0017385941,0.000026695801,0.000013276654,0.00000994139,0.000051387222,0.11600922,0.0015697917,0.8787436,0.001348616,0.00012218124],"about_ca_topic_score_codex":0.000017810611,"about_ca_topic_score_gemma":0.000018535711,"teacher_disagreement_score":0.9634514,"about_ca_system_score_codex":0.000034681496,"about_ca_system_score_gemma":0.00006404733,"threshold_uncertainty_score":0.8911685},"labels":[],"label_agreement":null},{"id":"W2016590269","doi":"10.1109/ccc.2014.34","title":"Mining Circuit Lower Bound Proofs for Meta-algorithms","year":2014,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Algorithm; Mathematical proof; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Computer science; Truth table; Discrete mathematics; Mathematics; Combinatorics; Boolean circuit","score_opus":0.09072336173278771,"score_gpt":0.28257512977703253,"score_spread":0.1918517680442448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016590269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000651622,0.000104005645,0.9824034,0.0008846667,0.0008788823,0.00027072767,0.0000029941166,0.00029041356,0.014513298],"genre_scores_gemma":[0.12525819,0.000002563839,0.8657396,0.0019258328,0.00042163854,0.0003288454,0.000004264761,0.000024308823,0.006294771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984805,0.000047940466,0.0002584061,0.00052502006,0.0002806366,0.0004075139],"domain_scores_gemma":[0.99864644,0.00033760633,0.00007505976,0.00070588506,0.00012012453,0.00011490634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007301655,0.00018607354,0.00031993387,0.00010865179,0.00026858653,0.000355973,0.0010473233,0.000060194092,0.00015000072],"category_scores_gemma":[0.00009023476,0.0001480402,0.00032584326,0.00031448135,0.000071079776,0.0004243882,0.00021804604,0.00008618242,0.000043575375],"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.000002881904,0.00010913946,0.00002034197,0.00002270858,0.0003018507,0.0000027086126,0.00028652282,0.000026324124,0.00007259455,0.8130558,0.0070517,0.17904739],"study_design_scores_gemma":[0.00063829013,0.00039958392,0.000186654,0.000008890839,0.00017779964,0.000025326814,0.000021678845,0.38790718,0.0018412991,0.31751227,0.29073578,0.00054524513],"about_ca_topic_score_codex":0.000013201234,"about_ca_topic_score_gemma":0.000014827478,"teacher_disagreement_score":0.49554357,"about_ca_system_score_codex":0.000015954847,"about_ca_system_score_gemma":0.000036992886,"threshold_uncertainty_score":0.6036904},"labels":[],"label_agreement":null},{"id":"W201798103","doi":"10.1007/978-3-319-07557-0_16","title":"A $\\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Approximation algorithm; Integer (computer science); Relaxation (psychology); Linear programming relaxation; Discrete mathematics; Linear programming; Algorithm; Computer science","score_opus":0.041494969496302866,"score_gpt":0.2730944437374828,"score_spread":0.23159947424117994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201798103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007651486,0.00019163708,0.9956025,0.00046218061,0.0019635265,0.00072918297,0.000010925429,0.00019660308,0.0007669286],"genre_scores_gemma":[0.06841906,0.0000066547677,0.9298554,0.00078340125,0.0007155701,0.000022540467,0.000015832495,0.00003810461,0.00014339706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964359,0.000036341,0.00059307844,0.0014698049,0.0008020084,0.0006628601],"domain_scores_gemma":[0.99698037,0.0007127201,0.00036517554,0.0014099412,0.00038002105,0.0001517908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010592367,0.00048923184,0.00052954484,0.0010705835,0.0006098611,0.000695966,0.0026817168,0.00030936804,0.0000132628165],"category_scores_gemma":[0.00013363741,0.0004972179,0.00024734298,0.00076005445,0.0005679118,0.0005754724,0.00078789674,0.00052025577,0.000015194254],"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.0000036792553,0.0000260646,0.00001821418,0.00008276691,0.000014757372,0.000007313758,0.0004997074,0.06420109,0.0001934364,0.2926229,0.000014617244,0.64231545],"study_design_scores_gemma":[0.00017073932,0.000064599386,0.000030832853,0.0001651712,0.000008786669,0.00003609671,5.9012887e-8,0.6346477,0.00017983315,0.36320853,0.0011049976,0.00038261036],"about_ca_topic_score_codex":0.00002191183,"about_ca_topic_score_gemma":0.000044670476,"teacher_disagreement_score":0.64193285,"about_ca_system_score_codex":0.00030096807,"about_ca_system_score_gemma":0.00047490004,"threshold_uncertainty_score":0.99974793},"labels":[],"label_agreement":null},{"id":"W2020715570","doi":"10.1016/j.tcs.2014.04.009","title":"Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Algorithm; Computer science; Mathematics; Computer network; Physics","score_opus":0.020491603163998888,"score_gpt":0.27287342488921645,"score_spread":0.25238182172521756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020715570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00251794,0.000012349061,0.9941212,0.00081038993,0.00024624477,0.0014696369,0.00000960264,0.00034137908,0.0004712736],"genre_scores_gemma":[0.32884842,6.224549e-7,0.67000073,0.00064485753,0.00013121087,0.00034310026,0.0000012109525,0.000012995674,0.000016836735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959955,0.0001160432,0.00047825527,0.001512341,0.0008756943,0.0010221563],"domain_scores_gemma":[0.99675125,0.0005885249,0.00014695304,0.0014240723,0.00046763895,0.00062155485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027098663,0.00033124213,0.00035827587,0.00026999993,0.0012132676,0.0007421509,0.004079094,0.00006861799,0.000007111925],"category_scores_gemma":[0.00019665307,0.00025908076,0.000093888535,0.0021262155,0.0021118266,0.00063696626,0.0011631853,0.00024334941,0.000037121637],"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.0000082008755,0.00013183246,0.000037182865,0.000032586962,0.0000044537937,0.000001253322,0.0010337264,0.001403703,0.0007873307,0.89551765,0.00002771619,0.10101436],"study_design_scores_gemma":[0.00044043388,0.00069023523,0.00026224635,0.00007909694,0.0000062188064,0.000029374989,0.000023126375,0.90355796,0.0011711618,0.09242608,0.000898157,0.00041590456],"about_ca_topic_score_codex":0.000004649882,"about_ca_topic_score_gemma":0.0000021685798,"teacher_disagreement_score":0.90215427,"about_ca_system_score_codex":0.00006407405,"about_ca_system_score_gemma":0.00017992617,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"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":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","score_opus":0.06449367461059989,"score_gpt":0.2738331663970109,"score_spread":0.20933949178641098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020899710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007411924,0.000036931633,0.9953984,0.0016929548,0.00093182654,0.000581712,0.00007408127,0.00037304245,0.00016987737],"genre_scores_gemma":[0.0805874,0.000038137016,0.9180632,0.00034085335,0.00015774455,0.00038566452,0.000025641673,0.00002179541,0.00037956185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982343,0.00005308317,0.0003381735,0.0005632106,0.0004395169,0.00037174925],"domain_scores_gemma":[0.99832517,0.00035208667,0.00009576539,0.0009077545,0.00019000412,0.00012920624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021106694,0.00024555478,0.00022616785,0.0002433786,0.0009310372,0.000104178485,0.00093088223,0.00012579159,0.00007264115],"category_scores_gemma":[0.000040656723,0.00024350274,0.00024478592,0.00045592274,0.00013038501,0.0009133316,0.000024906196,0.00033601813,0.000072284456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034998775,0.0012226752,0.000031312677,0.00005804034,0.00012809056,0.000006643192,0.001068328,0.013046073,0.00023185041,0.004023817,0.0006103008,0.97953784],"study_design_scores_gemma":[0.0011972062,0.00020627992,0.0004206264,0.000026674808,0.00001541013,0.00009806198,0.000023293638,0.952027,0.0036791642,0.021981824,0.019944087,0.00038034076],"about_ca_topic_score_codex":0.000025228748,"about_ca_topic_score_gemma":0.000010019164,"teacher_disagreement_score":0.9791575,"about_ca_system_score_codex":0.00007276419,"about_ca_system_score_gemma":0.000075037315,"threshold_uncertainty_score":0.99297535},"labels":[],"label_agreement":null},{"id":"W2023627355","doi":"10.1145/1993636.1993741","title":"Learning submodular functions","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":101,"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":"Submodular set function; Matroid; Multiplicative function; Upper and lower bounds; Monotone polygon; Learnability; Mathematics; Function (biology); Distribution (mathematics); Product (mathematics); Discrete mathematics; Sample (material); Combinatorics; Computer science; Artificial intelligence","score_opus":0.0434839937141398,"score_gpt":0.21171946030112956,"score_spread":0.16823546658698976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023627355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062995004,0.000018992356,0.87520695,0.00007526124,0.00027666328,0.00002491085,9.491008e-8,0.0003391727,0.11775845],"genre_scores_gemma":[0.83615345,0.0000044059716,0.1580246,0.00014744076,0.00003675722,0.000004956705,5.68503e-7,0.0000034218572,0.005624411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999529,0.000022291943,0.000068067304,0.00016123739,0.000086054904,0.00013333392],"domain_scores_gemma":[0.99964803,0.000015606029,0.000015535454,0.0002465652,0.000028020577,0.000046214496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099450306,0.00004905573,0.00004623933,0.000055821205,0.00015288281,0.000037391274,0.00036577004,0.00001850679,0.00037119514],"category_scores_gemma":[0.00001103527,0.00004388169,0.000042043648,0.00024925004,0.000025945394,0.00024824598,0.0001427475,0.000098906115,0.0003084944],"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.0000013011949,0.000078042765,0.0033524453,0.000002449576,0.00001469353,0.000011870473,0.001317453,0.000024659766,0.00011724602,0.81463736,0.001362782,0.17907968],"study_design_scores_gemma":[0.00072047504,0.0007863865,0.09986646,0.000019691763,0.00001606742,0.00012620364,0.0006584317,0.3488508,0.0069997907,0.31218946,0.2287319,0.0010343473],"about_ca_topic_score_codex":0.00005834879,"about_ca_topic_score_gemma":0.0000074565023,"teacher_disagreement_score":0.82985395,"about_ca_system_score_codex":0.00000487834,"about_ca_system_score_gemma":0.000010112941,"threshold_uncertainty_score":0.40643266},"labels":[],"label_agreement":null},{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","score_opus":0.05525673498615786,"score_gpt":0.26710998064801583,"score_spread":0.21185324566185798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024091095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08157626,0.001168761,0.9152676,0.0004500789,0.0006190644,0.00016637516,0.0000023740347,0.000031303465,0.00071819604],"genre_scores_gemma":[0.9584338,0.000055086075,0.0413131,0.00007408614,0.000108397784,0.000001584766,1.4058188e-7,0.0000022290174,0.000011554642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00004002357,0.0003998831,0.00022288099,0.0003117988,0.00017591105],"domain_scores_gemma":[0.9990744,0.00020374227,0.00028284077,0.00012745081,0.00019885489,0.00011270047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914873,0.00010463328,0.0002256893,0.00021616385,0.00038813666,0.00055811735,0.00049907534,0.00003552662,9.472484e-7],"category_scores_gemma":[0.0000086698965,0.00007362403,0.00005629994,0.0003437554,0.00016420575,0.00081015396,0.00011090719,0.000076331824,7.1898154e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071584923,0.00012870312,0.0069008432,0.00022472757,0.00005094271,0.000025039313,0.0034752511,0.0005426259,0.0004960784,0.2820128,0.00131459,0.7048212],"study_design_scores_gemma":[0.0005702378,0.000491962,0.0033929108,0.00021553828,0.000006033307,0.0005443707,0.00011268094,0.9912161,0.00008304785,0.0026882556,0.0005562807,0.00012258715],"about_ca_topic_score_codex":0.000001804469,"about_ca_topic_score_gemma":0.0000012246651,"teacher_disagreement_score":0.9906735,"about_ca_system_score_codex":0.000015736969,"about_ca_system_score_gemma":0.000021577835,"threshold_uncertainty_score":0.5381938},"labels":[],"label_agreement":null},{"id":"W2024836278","doi":"10.1142/s1793830912500085","title":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Complexity and Algorithms in Graphs","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Bounded function; Mathematics; Algorithm; Vertex (graph theory); Combinatorics; Treewidth; Tree-depth; Graph; Discrete mathematics; Theoretical computer science; Computer science; Pathwidth; Line graph","score_opus":0.03785958332532282,"score_gpt":0.3017967662122005,"score_spread":0.2639371828868777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024836278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023953501,0.00077249855,0.97304565,0.00018457448,0.00015619367,0.0010880553,0.00028090688,0.00011261282,0.00040603295],"genre_scores_gemma":[0.14437336,0.00014846896,0.85404545,0.000049043276,0.0006564842,0.00054515986,0.000118716234,0.00003683556,0.000026501437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977067,0.000053203774,0.00066825317,0.00047724423,0.0005099708,0.00058460835],"domain_scores_gemma":[0.99795645,0.0007031219,0.00031602816,0.00059571373,0.00019737064,0.00023129034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069117866,0.00031032896,0.00047062722,0.0003076465,0.00069177966,0.0003107311,0.0007000445,0.000111400244,0.000011345966],"category_scores_gemma":[0.000053310618,0.00028168623,0.00024275848,0.0008635105,0.00032738215,0.00029556674,0.00024633986,0.00020197954,0.0000025489544],"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.0000061912497,0.0004420167,0.000060026032,0.00026480397,0.000113685004,2.5591734e-7,0.0024516333,0.00007770349,0.00093509175,0.8530604,0.00020955429,0.14237861],"study_design_scores_gemma":[0.002124767,0.00020512684,0.0007747399,0.00014575613,0.00016332729,0.000049978258,0.0037581488,0.50837153,0.009663441,0.46571004,0.007882068,0.0011510781],"about_ca_topic_score_codex":0.000017638196,"about_ca_topic_score_gemma":0.0000017294775,"teacher_disagreement_score":0.5082938,"about_ca_system_score_codex":0.000023467475,"about_ca_system_score_gemma":0.00003595034,"threshold_uncertainty_score":0.9999635},"labels":[],"label_agreement":null},{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","score_opus":0.05471051344573013,"score_gpt":0.28800868506642247,"score_spread":0.23329817162069233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026036943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10380455,0.00010993786,0.8906953,0.001142936,0.0011651235,0.0003394833,0.00001898069,0.00048501304,0.0022387023],"genre_scores_gemma":[0.82172626,0.0000014223937,0.17721002,0.00068520923,0.00028649377,0.000018530001,0.000028210281,0.000017336237,0.000026511818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970379,0.00013551825,0.00056876737,0.0007825448,0.0009016008,0.00057368283],"domain_scores_gemma":[0.9983326,0.00032627504,0.00021341264,0.0005777249,0.00031690448,0.00023308663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420803,0.0003296811,0.000402633,0.0002684023,0.0010350457,0.0008355961,0.001586326,0.0000882833,0.00005390993],"category_scores_gemma":[0.0001541225,0.00036232208,0.0002817445,0.00086298195,0.00039251972,0.0018579547,0.0006682646,0.0003897944,0.00012806873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045343197,0.00040696235,0.00071832543,0.00003632054,0.000070256865,0.000061939245,0.00070509774,0.04093824,0.00014599515,0.95101434,0.00033578405,0.0055213673],"study_design_scores_gemma":[0.0031418302,0.0000997575,0.034520347,0.00005506076,0.000012458295,0.00012869861,0.00001474195,0.08973329,0.00007094455,0.8711692,0.0005741602,0.00047949332],"about_ca_topic_score_codex":0.00025947427,"about_ca_topic_score_gemma":0.000248667,"teacher_disagreement_score":0.71792173,"about_ca_system_score_codex":0.0002959656,"about_ca_system_score_gemma":0.00044153573,"threshold_uncertainty_score":0.9998829},"labels":[],"label_agreement":null},{"id":"W2026365732","doi":"10.1016/j.tcs.2013.05.003","title":"Addendum to “Recursively defined metric spaces without contraction” [Theoret. Comput. Sci. 380 (1/2) (2007) 143–163]","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Addendum; Mathematics; Contraction (grammar); Metric space; Metric (unit); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Calculus (dental); Pure mathematics; Engineering","score_opus":0.012924827962777725,"score_gpt":0.25207466812166757,"score_spread":0.23914984015888985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026365732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026093049,0.00008080222,0.95822436,0.0040113465,0.003319918,0.00084643194,0.00000774092,0.00065226824,0.0067641097],"genre_scores_gemma":[0.6870697,0.000006067483,0.31017742,0.002132142,0.0004941316,0.00004132124,0.0000017008298,0.000019600995,0.00005790981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937793,0.0003012689,0.00066851184,0.0017893616,0.0017936798,0.0016678491],"domain_scores_gemma":[0.9947671,0.00095726585,0.00021365951,0.0016842542,0.001130095,0.001247581],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021715292,0.00056555547,0.00065079617,0.0011698169,0.0012186231,0.0025545286,0.005822288,0.00014018221,0.0005046434],"category_scores_gemma":[0.0005851481,0.00048060776,0.00017114171,0.0074793193,0.004094219,0.0021036451,0.002450998,0.0005863923,0.0016333886],"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.0000131199795,0.0001286843,0.00017961286,0.000008441199,0.000018241602,0.00001354075,0.00043422388,0.00027339836,0.00026509247,0.94520426,0.0026152013,0.050846186],"study_design_scores_gemma":[0.0006733187,0.0007523366,0.0075122067,0.00008697117,0.000019298628,0.00011954687,0.00004459841,0.5721539,0.0016038222,0.413365,0.002698073,0.0009709306],"about_ca_topic_score_codex":0.0000915907,"about_ca_topic_score_gemma":0.000004090386,"teacher_disagreement_score":0.66097665,"about_ca_system_score_codex":0.00017647092,"about_ca_system_score_gemma":0.0003270494,"threshold_uncertainty_score":0.99976456},"labels":[],"label_agreement":null},{"id":"W2029278215","doi":"10.3390/a1010002","title":"Impact of Locality on Location Aware Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Locality; Unit disk graph; Dominating set; Computer science; Vertex (graph theory); Vertex cover; Connected dominating set; Unit disk; Set (abstract data type); Constant (computer programming); Wireless network; Set cover problem; Cover (algebra); Approximation algorithm; Maximal independent set; Theoretical computer science; Wireless; Graph; Algorithm; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Telecommunications","score_opus":0.05234068564554768,"score_gpt":0.30624244218194935,"score_spread":0.2539017565364017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029278215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21614572,0.00014140357,0.78145015,0.00018350116,0.00046350498,0.00023451255,0.00003454091,0.00024555915,0.0011010789],"genre_scores_gemma":[0.9872472,0.000058033424,0.012434332,0.000079133206,0.000060926726,0.000009830795,0.000014795737,0.000010794314,0.0000849274],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983836,0.00009738073,0.00032070966,0.00041764963,0.00045780497,0.00032286847],"domain_scores_gemma":[0.9984139,0.00014058585,0.00014200331,0.0009125085,0.00024919465,0.00014176499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002178843,0.0002078997,0.0002682698,0.00022110429,0.00023164743,0.00003233712,0.0008970494,0.000081404505,0.000032643333],"category_scores_gemma":[0.00003787305,0.0001779145,0.00023347231,0.0013907305,0.00024389109,0.00035294308,0.00016810163,0.00020795898,0.00004918929],"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.00010564723,0.00340413,0.10694987,0.00013188187,0.00056501775,0.0003447134,0.004149564,0.013512106,0.00020057466,0.17622758,0.005305628,0.6891033],"study_design_scores_gemma":[0.0011361295,0.0014245766,0.6143746,0.00009528903,0.000017413044,0.00019740826,0.00004750951,0.3330635,0.0014769637,0.046860382,0.00061687577,0.0006893724],"about_ca_topic_score_codex":0.00061248685,"about_ca_topic_score_gemma":0.0000098585715,"teacher_disagreement_score":0.77110153,"about_ca_system_score_codex":0.000050305607,"about_ca_system_score_gemma":0.00015340815,"threshold_uncertainty_score":0.72551423},"labels":[],"label_agreement":null},{"id":"W2030012922","doi":"10.1145/1597036.1597043","title":"A linear-time algorithm to find a separator in a graph excluding a minor","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Graph; Algorithm; Separator (oil production); Minor (academic); Discrete mathematics; Physics","score_opus":0.028380276662102726,"score_gpt":0.29104313032599277,"score_spread":0.26266285366389003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030012922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006138503,0.00008757062,0.9876007,0.0043114885,0.00049342925,0.0005583628,0.0000594695,0.00042627504,0.00032423183],"genre_scores_gemma":[0.03613881,0.000034503213,0.9599901,0.002535832,0.00015438584,0.00012975106,0.000005054077,0.000029359098,0.0009822493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694157,0.00011859419,0.00055368844,0.0009997635,0.0005791699,0.00080718845],"domain_scores_gemma":[0.9977133,0.00024418774,0.0000826102,0.0014725416,0.00010618261,0.00038112566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004226155,0.00042851822,0.00046681912,0.0011448986,0.0003582935,0.00020820524,0.0018907669,0.00017293595,0.00010838075],"category_scores_gemma":[0.000048260168,0.0004495379,0.00028794105,0.0032821489,0.00006247234,0.0006144574,0.000045055633,0.0005836147,0.0004389653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022073602,0.0006472302,0.0000043516507,0.0000048624747,0.00003132698,0.00009517118,0.0010272196,0.0014906947,0.00072499696,0.00034623305,0.0002617895,0.99534404],"study_design_scores_gemma":[0.0043971566,0.003277374,0.008828852,0.00040571677,0.000062340536,0.000363956,0.0002001951,0.8937427,0.011074791,0.06367574,0.0113167865,0.0026544125],"about_ca_topic_score_codex":0.00008791836,"about_ca_topic_score_gemma":0.000024027417,"teacher_disagreement_score":0.9926896,"about_ca_system_score_codex":0.00012233634,"about_ca_system_score_gemma":0.00010559205,"threshold_uncertainty_score":0.9997956},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"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":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","score_opus":0.027687554589769903,"score_gpt":0.26386242298239165,"score_spread":0.23617486839262175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030970869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008011792,0.00005426934,0.9811441,0.01697808,0.0005024229,0.0007054021,0.000018392602,0.00022247409,0.00029476435],"genre_scores_gemma":[0.09922127,0.000048586102,0.8943051,0.005196336,0.00015734442,0.00033082857,0.000009242757,0.000017491868,0.00071379583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.00004200711,0.00024914282,0.0003929851,0.00031061852,0.00030363712],"domain_scores_gemma":[0.9983894,0.0004084414,0.00006639312,0.00097297516,0.000098746845,0.000064027336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026868202,0.00018361642,0.00014901414,0.00012048584,0.00065775454,0.00025847697,0.0011637482,0.00007491212,0.000044136],"category_scores_gemma":[0.000019151084,0.00013798138,0.00018637729,0.0004946274,0.000057270696,0.0005533231,0.000010449343,0.00023669985,0.00006175894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011823315,0.00017717363,5.679812e-7,0.000005964715,0.000034616765,0.0000010094897,0.0004102856,0.0017344996,0.0001191803,0.012915857,0.0008326843,0.98375636],"study_design_scores_gemma":[0.00095972314,0.0004527008,0.0006075534,0.000028001657,0.00003823356,0.000023289878,0.00003206939,0.80729854,0.0034795941,0.17054653,0.016215404,0.0003183467],"about_ca_topic_score_codex":0.000009477433,"about_ca_topic_score_gemma":0.0000033490426,"teacher_disagreement_score":0.983438,"about_ca_system_score_codex":0.000044062217,"about_ca_system_score_gemma":0.000043598502,"threshold_uncertainty_score":0.5626717},"labels":[],"label_agreement":null},{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","score_opus":0.02376304741433146,"score_gpt":0.2586423356285821,"score_spread":0.2348792882142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032198109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039816257,0.00033180843,0.95641387,0.00016243936,0.0016251665,0.0005861061,0.000007741158,0.00032452896,0.00073210744],"genre_scores_gemma":[0.82615143,0.0000931208,0.17324089,0.00021336999,0.000052640004,0.00013786943,0.000012932609,0.000026581703,0.000071163624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780613,0.000088387686,0.0003979508,0.00071456895,0.00036003665,0.0006329534],"domain_scores_gemma":[0.9983854,0.00021874427,0.000119274875,0.000939846,0.00012834927,0.00020835949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041976786,0.00027242803,0.00038372862,0.0003901434,0.0005008682,0.000107293694,0.001576306,0.0001254588,0.0000061468086],"category_scores_gemma":[0.00003317845,0.0002864658,0.00016424696,0.0014837768,0.00011526625,0.00069514994,0.00025411186,0.000275771,0.000014574574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001744908,0.0023243797,0.0051488425,0.0000418114,0.000046790745,0.00028233876,0.0029716312,0.000027410757,0.0004877612,0.50425655,0.0028053662,0.48158965],"study_design_scores_gemma":[0.0037512092,0.001173977,0.009552467,0.000050419356,0.000009090466,0.000080489874,0.000042696076,0.3836365,0.0008060572,0.59238034,0.007693621,0.000823151],"about_ca_topic_score_codex":0.00006646295,"about_ca_topic_score_gemma":0.0000065611175,"teacher_disagreement_score":0.7863352,"about_ca_system_score_codex":0.00008794863,"about_ca_system_score_gemma":0.00007097103,"threshold_uncertainty_score":0.99995875},"labels":[],"label_agreement":null},{"id":"W2032923445","doi":"10.2139/ssrn.2160674","title":"Easy with Difficulty Objective Functions for Max Cut","year":2002,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.014968181310300047,"score_gpt":0.2184014908054379,"score_spread":0.20343330949513783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032923445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067427484,0.0008562798,0.98842376,0.0011815021,0.00032797467,0.00018354865,0.0000046107602,0.000106302025,0.0021732585],"genre_scores_gemma":[0.9745975,0.000567354,0.013361332,0.00021792884,0.0005582474,0.000044318534,0.0000028460088,0.000024893488,0.010625569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760014,0.000045657383,0.00017497584,0.00029094447,0.00025956627,0.0016287436],"domain_scores_gemma":[0.9992839,0.00008124238,0.00010980299,0.00027201127,0.00015495882,0.000098074925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000412463,0.0001594331,0.00015405877,0.00012996142,0.0006411989,0.00017135145,0.00061966135,0.000046160003,0.000027108232],"category_scores_gemma":[0.000024976063,0.00012205009,0.00014432463,0.00042516305,0.00006173507,0.0004375862,0.000057047295,0.001004629,0.00003431358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970245,0.0002900307,0.0002965897,0.0000054247944,0.00028604624,0.000007557355,0.00051013584,0.0002441993,0.00006607119,0.8568176,0.0013906421,0.14004597],"study_design_scores_gemma":[0.0036006328,0.0037417032,0.0016997668,0.00005375437,0.00009059127,0.0046928665,0.0014502767,0.0844751,0.00019602108,0.86056924,0.03853641,0.00089365005],"about_ca_topic_score_codex":0.000013828017,"about_ca_topic_score_gemma":0.00044859698,"teacher_disagreement_score":0.97506243,"about_ca_system_score_codex":0.00037804226,"about_ca_system_score_gemma":0.0003511,"threshold_uncertainty_score":0.49770585},"labels":[],"label_agreement":null},{"id":"W2033642621","doi":"10.1016/j.dam.2015.04.004","title":"The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases","year":2015,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Generalization; Rank (graph theory); Discrete mathematics; Time complexity; Quadratic equation; Matrix (chemical analysis)","score_opus":0.043573282218933806,"score_gpt":0.2789088800179288,"score_spread":0.235335597798995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033642621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023755038,0.0008266187,0.9588093,0.0014018093,0.0010589433,0.0036144918,0.000059886188,0.0011367952,0.030716628],"genre_scores_gemma":[0.061950106,0.00005710714,0.9359002,0.00011347567,0.00029823318,0.0010240134,0.000059961603,0.00007953187,0.0005173733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646306,0.000060226022,0.0009869606,0.0008210099,0.0008111775,0.0008575797],"domain_scores_gemma":[0.9959787,0.00063087384,0.0007218791,0.0022003585,0.00020232474,0.00026584283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014410985,0.0006261371,0.00070570415,0.00013411503,0.00066169904,0.0019081433,0.0030074245,0.00026843866,0.000007978677],"category_scores_gemma":[0.00013632604,0.00044980904,0.00026336563,0.0004418481,0.000458686,0.00016869737,0.0029938943,0.00082872587,0.000072267016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012263063,0.0002110715,0.0000040836053,0.00086528953,0.00022104834,0.000043459768,0.004289083,0.00075869216,0.00012450817,0.9523149,0.0029847005,0.03817088],"study_design_scores_gemma":[0.000450783,0.000094148665,0.0000025520258,0.0003765465,0.00011434537,0.00007569405,0.0010659457,0.099831015,0.00039841517,0.8865246,0.010081436,0.0009845232],"about_ca_topic_score_codex":0.000051800413,"about_ca_topic_score_gemma":0.0001278068,"teacher_disagreement_score":0.09907232,"about_ca_system_score_codex":0.00011339274,"about_ca_system_score_gemma":0.0007333256,"threshold_uncertainty_score":0.9997954},"labels":[],"label_agreement":null},{"id":"W2035762900","doi":"10.1145/1595391.1595392","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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":"Division of Computing and Communication Foundations","keywords":"Mathematics; Nondeterministic algorithm; Constant (computer programming); Combinatorics; Function (biology); Communication complexity; Binary logarithm; Discrete mathematics; Set (abstract data type); Computer science","score_opus":0.023594611815198247,"score_gpt":0.2962639757253391,"score_spread":0.27266936391014085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035762900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048199375,0.000078196696,0.9919532,0.0018331795,0.00012816094,0.00045668724,0.00001186645,0.00028959056,0.0004292069],"genre_scores_gemma":[0.8116878,0.000031326766,0.18766332,0.00043574304,0.00001932616,0.00003434189,0.000016257853,0.0000061963565,0.0001056443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983197,0.00060535374,0.00039236268,0.00033619528,0.00016667625,0.0001797433],"domain_scores_gemma":[0.9962049,0.0027276436,0.00013493722,0.00073475007,0.00010034176,0.00009742596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630455,0.00017776804,0.000314113,0.00022811061,0.00061996595,0.00019711877,0.00061901874,0.000074353426,0.0000146508355],"category_scores_gemma":[0.000109825625,0.00017112968,0.00013068765,0.00034704176,0.00020244862,0.0004436848,0.000019155985,0.00024914532,0.0000162125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072856253,0.00020536978,0.0000040436103,0.000008546092,0.000063907086,0.0000013166982,0.0018801532,0.0029615925,0.00012343208,0.12663254,0.000023965746,0.86736655],"study_design_scores_gemma":[0.012198569,0.00015127224,0.0006388973,0.000024706162,0.00005578501,0.000010491009,0.000045075467,0.3603275,0.00050336064,0.6257399,0.00007426801,0.00023022541],"about_ca_topic_score_codex":0.000008159292,"about_ca_topic_score_gemma":0.0000042510896,"teacher_disagreement_score":0.86713636,"about_ca_system_score_codex":0.000026933569,"about_ca_system_score_gemma":0.000037254722,"threshold_uncertainty_score":0.6978466},"labels":[],"label_agreement":null},{"id":"W2036569687","doi":"10.5555/1283383.1283507","title":"An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem","year":2007,"lang":"en","type":"article","venue":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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; Steiner tree problem; Path (computing); Terminal (telecommunication); Graph; Connection (principal bundle); Connectivity; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Set (abstract data type); Discrete mathematics; Computer network; Telecommunications","score_opus":0.10361633555766601,"score_gpt":0.3297581427751367,"score_spread":0.22614180721747068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036569687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0820597,0.00014180316,0.8892943,0.0011333947,0.00086948794,0.0039642733,0.00006748451,0.0007671236,0.021702396],"genre_scores_gemma":[0.94808435,0.00034738358,0.033223968,0.000119122,0.00046306907,0.0000076219217,0.00004541297,0.000096887205,0.017612174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926497,0.0006981394,0.00044087818,0.0019859518,0.0018144816,0.0024108726],"domain_scores_gemma":[0.99187446,0.0027124353,0.00030005083,0.0022969046,0.0018515567,0.0009646242],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.005457386,0.0006165395,0.0006021409,0.0025610009,0.004847623,0.0007073762,0.0061431257,0.00038949453,0.000034206405],"category_scores_gemma":[0.00026321007,0.00062198873,0.0005706647,0.005922309,0.00077641004,0.0014177547,0.0027112323,0.0015540891,0.000033147575],"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.0006908397,0.0007269367,0.00044775073,0.00017090932,0.0003182719,0.00258913,0.0034862778,0.012007599,0.003197483,0.9603673,0.001019284,0.014978222],"study_design_scores_gemma":[0.0073118163,0.0019244059,0.00042520041,0.00030426893,0.00030377708,0.00017042863,0.03226052,0.7325382,0.012057815,0.012479069,0.19801293,0.0022115577],"about_ca_topic_score_codex":0.0021739153,"about_ca_topic_score_gemma":0.003292848,"teacher_disagreement_score":0.94788826,"about_ca_system_score_codex":0.0016580728,"about_ca_system_score_gemma":0.00074074307,"threshold_uncertainty_score":0.9996231},"labels":[],"label_agreement":null},{"id":"W2037387767","doi":"10.1016/j.jda.2006.05.002","title":"Cut problems in graphs with a budget constraint","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maximum cut; Approximation algorithm; Constraint (computer-aided design); Mathematics; Mathematical optimization; Constant (computer programming); Combinatorics; Computer science; Graph","score_opus":0.010646582172347409,"score_gpt":0.2290906437144165,"score_spread":0.2184440615420691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037387767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044645704,0.0012324812,0.9454012,0.002507847,0.00071159174,0.0003567157,0.000025234174,0.00008651655,0.005032735],"genre_scores_gemma":[0.738214,0.00008312271,0.26113918,0.00016877624,0.00025087906,0.000009045893,0.000003942929,0.000021781309,0.000109248474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977873,0.0000946786,0.0007421205,0.00028506696,0.0006562651,0.0004345689],"domain_scores_gemma":[0.99872047,0.00010028368,0.0004716283,0.00035462895,0.00021515696,0.00013783414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507629,0.00023418358,0.00041622642,0.00051050493,0.000091988666,0.00021536525,0.0010004975,0.00007204251,0.000015409336],"category_scores_gemma":[0.00001643905,0.00017035031,0.00019006724,0.0010017017,0.00022898379,0.00082101143,0.000121970246,0.00048945064,0.000004342616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021522392,0.0029530437,0.057189703,0.00028858834,0.00059256225,0.0054925606,0.0044540707,0.023700625,0.0022563487,0.56297535,0.0075962436,0.33228567],"study_design_scores_gemma":[0.011299178,0.004463645,0.08445729,0.001509035,0.000105596955,0.008471521,0.0007219636,0.12574416,0.0029582086,0.7396493,0.018455045,0.002165079],"about_ca_topic_score_codex":0.0001402769,"about_ca_topic_score_gemma":0.00016925583,"teacher_disagreement_score":0.6935683,"about_ca_system_score_codex":0.000058329337,"about_ca_system_score_gemma":0.0001729122,"threshold_uncertainty_score":0.6946684},"labels":[],"label_agreement":null},{"id":"W2037455685","doi":"10.1016/j.orl.2010.03.003","title":"Revisiting a simple algorithm for the planar multiterminal cut problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","score_opus":0.059342137113430476,"score_gpt":0.36125828020580025,"score_spread":0.3019161430923698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037455685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069090556,0.000032335385,0.9552117,0.03648559,0.0002159914,0.00085036387,0.000032057193,0.00007522798,0.00018765485],"genre_scores_gemma":[0.03401531,0.00001423139,0.96204585,0.0018414344,0.0010282107,0.00065360987,0.000030149416,0.00001826009,0.00035296116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982466,0.00014013502,0.0002097316,0.00038444548,0.00049507053,0.00052400964],"domain_scores_gemma":[0.99807274,0.0008116966,0.00001781754,0.0007128874,0.00028642418,0.00009843864],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018208608,0.000109794455,0.000102098034,0.00018755978,0.0020649356,0.0010691562,0.0014278387,0.000041963445,0.000035381978],"category_scores_gemma":[0.00020514269,0.000080628255,0.00008252,0.00059403817,0.00024540108,0.0005162607,0.00024104933,0.00069048087,0.000039610255],"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.0000035873425,0.000060884988,0.000054835065,0.000022396945,0.00003657338,0.000021800783,0.0011005164,0.0010136588,0.02980924,0.07186814,0.015617143,0.88039124],"study_design_scores_gemma":[0.00022726263,0.000036052927,0.00017469988,0.000012866752,0.0000027034703,0.000029641924,0.00006449834,0.919279,0.00092106714,0.0010276888,0.07809916,0.00012537396],"about_ca_topic_score_codex":0.0002752526,"about_ca_topic_score_gemma":0.00029986876,"teacher_disagreement_score":0.91826534,"about_ca_system_score_codex":0.000026343547,"about_ca_system_score_gemma":0.00010256164,"threshold_uncertainty_score":0.9999678},"labels":[],"label_agreement":null},{"id":"W2037688351","doi":"10.5555/545381.545430","title":"I/O-optimal algorithms for planar graphs using separators","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Planar graph; Planar straight-line graph; Breadth-first search; Planar; Algorithm; Book embedding; Computer science; Embedding; Outerplanar graph; Vertex (graph theory); Depth-first search; Graph; Search algorithm; Pathwidth; Theoretical computer science; Line graph; Artificial intelligence","score_opus":0.047448525013619354,"score_gpt":0.2870264706846065,"score_spread":0.23957794567098717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037688351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009900375,0.0007723764,0.9756552,0.002364377,0.003455321,0.001413042,0.00033575317,0.0010025235,0.0051010335],"genre_scores_gemma":[0.06366877,0.000335076,0.9302285,0.0018646221,0.0012941635,0.0003420258,0.000086230866,0.0001976692,0.0019829574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954542,0.00014531745,0.00072499184,0.0015004943,0.00087113946,0.0013038558],"domain_scores_gemma":[0.9972621,0.0003148271,0.00028132516,0.0014893037,0.00018481175,0.00046763493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048984296,0.0007115955,0.00064343214,0.00057218096,0.00087205775,0.00052726734,0.002073695,0.00026393135,0.00007877539],"category_scores_gemma":[0.000034978537,0.00067993975,0.0006069195,0.0012259638,0.00027063655,0.0009456938,0.0002782557,0.00044237668,0.00013110245],"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.00033761025,0.003471734,0.0007006378,0.0005061171,0.0019434853,0.0008148337,0.0103066955,0.03862551,0.014567289,0.6589079,0.05640357,0.21341465],"study_design_scores_gemma":[0.0014387311,0.00087665627,0.00006558306,0.00007732488,0.000054858134,0.000111870955,0.00008044809,0.9636265,0.0035746167,0.009473456,0.01950518,0.0011147837],"about_ca_topic_score_codex":0.000055425993,"about_ca_topic_score_gemma":0.000004093473,"teacher_disagreement_score":0.92500097,"about_ca_system_score_codex":0.0001391653,"about_ca_system_score_gemma":0.000054944805,"threshold_uncertainty_score":0.9995652},"labels":[],"label_agreement":null},{"id":"W2039116808","doi":"10.1006/jcss.2001.1764","title":"On the Complexity of Some Problems on Groups Input as Multiplication Tables","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Iterated function; Multiplication (music); Abelian group; Group (periodic table); Combinatorics; Nilpotent; Associative property; Discrete mathematics; Binary number; Arithmetic; Pure mathematics","score_opus":0.06203262370306753,"score_gpt":0.26828629767360634,"score_spread":0.20625367397053881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039116808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363882,0.00040235597,0.35543677,0.0044839936,0.0011463941,0.0002844972,0.000002585211,0.00003796044,0.0018172924],"genre_scores_gemma":[0.9891797,0.00004073772,0.010270181,0.00029947446,0.00019374865,0.0000021564958,1.3600426e-7,0.0000024953265,0.000011428653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815935,0.0001943539,0.0005172064,0.00022986821,0.00070860545,0.00019062412],"domain_scores_gemma":[0.9984662,0.00046716075,0.00053695706,0.00027893172,0.00016759547,0.00008313799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752113,0.00012879274,0.00028158384,0.0002383547,0.0003985,0.0002721011,0.0012832603,0.000033334116,0.000003381088],"category_scores_gemma":[0.000021820904,0.00007227738,0.00010133539,0.0005429165,0.00053966924,0.0005350883,0.00015860342,0.00015827964,0.0000046812547],"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.00001148604,0.00010186753,0.00039882853,0.00003277215,0.000016334838,0.0000070048545,0.0006879396,0.001789929,0.00008570647,0.98486865,0.00028427824,0.011715234],"study_design_scores_gemma":[0.0008487566,0.0033669788,0.0141934175,0.0012143797,0.000013707125,0.0011662055,0.00049518904,0.65729344,0.00068791123,0.31905586,0.0013438993,0.0003202365],"about_ca_topic_score_codex":0.00002843188,"about_ca_topic_score_gemma":0.0000034300933,"teacher_disagreement_score":0.66581273,"about_ca_system_score_codex":0.000024902158,"about_ca_system_score_gemma":0.00006159794,"threshold_uncertainty_score":0.30649802},"labels":[],"label_agreement":null},{"id":"W2039681975","doi":"10.1145/2591796.2591838","title":"Communication lower bounds via critical block sensitivity","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"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":"Computer science; Block (permutation group theory); Sensitivity (control systems); Simplicity; Simple (philosophy); Protocol (science); Upper and lower bounds; Communication complexity; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01485514328879404,"score_gpt":0.26195787536655696,"score_spread":0.24710273207776293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039681975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042790985,0.000018649596,0.96637326,0.004878675,0.00030618886,0.000038987688,4.629766e-7,0.00024691006,0.023857772],"genre_scores_gemma":[0.8567706,0.000002415598,0.14198498,0.0010311855,0.000049372822,0.0000022429847,8.679872e-7,0.0000033750655,0.00015495297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.00021041557,0.00012887624,0.0002260967,0.00018875474,0.00020138285],"domain_scores_gemma":[0.99825513,0.0005811365,0.000020132866,0.00096431357,0.00009600636,0.000083291765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605849,0.000086768974,0.000106076,0.000047389214,0.0002572038,0.00018293869,0.000500108,0.00004563194,0.00003320621],"category_scores_gemma":[0.00012325177,0.00008154044,0.000059462054,0.00020538585,0.00016751229,0.00032365503,0.00041984103,0.000148349,0.00012012225],"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.0000019086365,0.00013605793,0.00007938061,0.000004680725,0.0000046785904,0.0000034465704,0.00009276198,0.000013318713,0.00028793098,0.9584655,0.0013308912,0.03957945],"study_design_scores_gemma":[0.00014313588,0.000076688746,0.0037205105,0.000011962213,0.0000037860034,0.00006544248,0.000005688992,0.7866995,0.0009856113,0.18594122,0.022129448,0.00021703777],"about_ca_topic_score_codex":0.00007316543,"about_ca_topic_score_gemma":0.00006583828,"teacher_disagreement_score":0.8524915,"about_ca_system_score_codex":0.00001343416,"about_ca_system_score_gemma":0.000012990365,"threshold_uncertainty_score":0.33251226},"labels":[],"label_agreement":null},{"id":"W2042361512","doi":"10.1145/1940475.1940488","title":"Optimization techniques for small matrix multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"Western University","funders":"","keywords":"Strassen algorithm; Multiplication (music); Matrix multiplication; Mathematics; Multiplication algorithm; Base (topology); Matrix (chemical analysis); Code (set theory); Differential (mechanical device); Computer science; Arithmetic; Algebra over a field; Algorithm; Combinatorics; Pure mathematics","score_opus":0.09747031034217751,"score_gpt":0.3175422735804849,"score_spread":0.2200719632383074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042361512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039194882,0.00018201306,0.9960304,0.0013890478,0.0001621093,0.00071956747,0.000005351934,0.000525123,0.00059446605],"genre_scores_gemma":[0.050911486,0.00017408338,0.9480566,0.0003056274,0.000050069128,0.00042295727,0.00004470801,0.000016516387,0.00001800297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862087,0.00014441181,0.00045537818,0.0004087243,0.000108692744,0.0002619158],"domain_scores_gemma":[0.99430174,0.00049663906,0.0001613321,0.0047779265,0.00020391133,0.000058451467],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005013503,0.00017290603,0.00018859448,0.00034847774,0.0002763083,0.000120153134,0.006410785,0.00010329347,0.000007550302],"category_scores_gemma":[0.00007964293,0.00019229946,0.00009728306,0.0007353417,0.00012483964,0.00048917864,0.0024363461,0.00020715124,0.000010728487],"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.00001014268,0.0006272572,0.0010164217,0.000027223126,0.000028812317,9.931582e-7,0.0021978498,0.0007198919,0.000049041944,0.5029321,0.0004456577,0.49194464],"study_design_scores_gemma":[0.0003152556,0.00008910932,0.0018418174,0.000042362688,0.000006246066,0.00000956966,0.000011828574,0.8760479,0.00060889055,0.11776221,0.0030037053,0.00026108933],"about_ca_topic_score_codex":0.00008085838,"about_ca_topic_score_gemma":0.00005969324,"teacher_disagreement_score":0.875328,"about_ca_system_score_codex":0.000061160776,"about_ca_system_score_gemma":0.000046933874,"threshold_uncertainty_score":0.998965},"labels":[],"label_agreement":null},{"id":"W2042788891","doi":"10.1016/j.orl.2010.09.004","title":"Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Linear programming relaxation; Hypergraph; Mathematics; Upper and lower bounds; Combinatorics; Bounded function; Relaxation (psychology); Linear programming; Tree (set theory); Approximation algorithm; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.06305174887661538,"score_gpt":0.33851725168657865,"score_spread":0.2754655028099633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042788891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697189,0.000023690203,0.02102113,0.008056075,0.0001821272,0.00044308678,0.00001554474,0.000012169803,0.00052727724],"genre_scores_gemma":[0.9880609,0.0000054687516,0.011645209,0.000088090404,0.00003246388,0.000046498535,0.000003819035,0.0000059611475,0.00011156901],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979404,0.0003603797,0.0003955873,0.00025718127,0.0008181876,0.00022821862],"domain_scores_gemma":[0.9980973,0.00017616109,0.00005038692,0.0010435642,0.00058287964,0.000049726434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113722,0.00009244034,0.00017249645,0.00034971247,0.00025987963,0.00007856858,0.0012134846,0.0000591387,0.000037280002],"category_scores_gemma":[0.00040000706,0.00006369701,0.00014098026,0.0015433738,0.00091237033,0.0003916521,0.00031549297,0.0005479521,0.0000016668545],"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.000017090731,0.00044430475,0.009196136,0.00007073665,0.00006632475,0.0000013710195,0.002399621,0.0020959822,0.7614553,0.2113337,0.0017270641,0.011192372],"study_design_scores_gemma":[0.0010729356,0.00048216782,0.11792301,0.00033950724,0.000032673892,0.000028427368,0.0005639892,0.36539742,0.49634233,0.013579608,0.0036954195,0.0005425209],"about_ca_topic_score_codex":0.00077762746,"about_ca_topic_score_gemma":0.00195786,"teacher_disagreement_score":0.36330143,"about_ca_system_score_codex":0.000019638604,"about_ca_system_score_gemma":0.00018564347,"threshold_uncertainty_score":0.33616665},"labels":[],"label_agreement":null},{"id":"W2046371296","doi":"10.1023/a:1014895808844","title":"Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Relaxation (psychology); Polytope; Theory of computation; Rank (graph theory); Matrix (chemical analysis); Dimension (graph theory); Semidefinite programming; Projection (relational algebra); Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.015041707881023478,"score_gpt":0.2364874729956339,"score_spread":0.22144576511461045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046371296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002437117,0.0005264325,0.99067605,0.000523429,0.004819364,0.000092809125,0.0000026436564,0.000033569562,0.0008885953],"genre_scores_gemma":[0.50818324,0.00051116664,0.4905804,0.000060816303,0.00047633963,0.0000021055755,0.000003275479,0.000018058374,0.00016460688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981608,0.00012091116,0.00079884054,0.00014143651,0.0005908859,0.00018712868],"domain_scores_gemma":[0.99766994,0.0002354119,0.0010024989,0.0003176355,0.0006660821,0.00010843135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006015208,0.00012997484,0.00031822323,0.00051835354,0.00012827189,0.00009570929,0.000698634,0.00011374176,0.00013958896],"category_scores_gemma":[0.00027853806,0.00012563696,0.0001938076,0.0012454892,0.000059287224,0.0009117833,0.000106396874,0.0002800595,0.000007965344],"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.0000697745,0.0010156707,0.00059107615,0.000060999842,0.00017832448,0.00003901426,0.0010945561,0.5723305,0.0003251404,0.40548936,0.00455826,0.014247337],"study_design_scores_gemma":[0.002699823,0.0005930211,0.00020001555,0.00010106897,0.000058374426,0.00016892605,0.000020247895,0.9293103,0.0010314386,0.062389124,0.0031642343,0.00026339307],"about_ca_topic_score_codex":0.0000046725045,"about_ca_topic_score_gemma":1.239331e-7,"teacher_disagreement_score":0.5057461,"about_ca_system_score_codex":0.00005967978,"about_ca_system_score_gemma":0.000047658712,"threshold_uncertainty_score":0.5123326},"labels":[],"label_agreement":null},{"id":"W2047406446","doi":"10.1016/j.tcs.2012.02.017","title":"On derandomization and average-case complexity of monotone functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Indiana State University; Cisco Systems; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Discrete mathematics; Algorithm; Geometry","score_opus":0.02453344038941696,"score_gpt":0.25747873425363593,"score_spread":0.23294529386421897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047406446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123090364,0.000024933051,0.8747119,0.00027483242,0.0007386296,0.00014566472,0.0000030983963,0.00008105444,0.00092956115],"genre_scores_gemma":[0.79761595,0.0000016943868,0.20208234,0.00019317983,0.00009576371,0.000004006636,5.511032e-7,0.000003334263,0.0000031723152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846244,0.00012337357,0.00024211708,0.00037656468,0.00039936652,0.00039613622],"domain_scores_gemma":[0.9985861,0.00041444384,0.00007181494,0.00053785404,0.00012467263,0.00026510554],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012086905,0.00013903373,0.00020381896,0.00020713326,0.00051510194,0.00014380703,0.0006264358,0.000034926943,0.000042633492],"category_scores_gemma":[0.00009155228,0.00011558941,0.000052487656,0.0008344808,0.0036443109,0.0006954171,0.0005938944,0.00014362842,0.000016548818],"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.000017896331,0.00013069496,0.000051969797,0.000006126922,0.0000039453735,0.0000075010294,0.00040934663,0.0002499354,0.000057767375,0.98105186,0.000019854246,0.017993074],"study_design_scores_gemma":[0.00051539706,0.00015093175,0.0007283728,0.000014403066,0.000004535765,0.00035994768,0.000004941593,0.67801577,0.000922486,0.31912985,0.000021189153,0.00013215198],"about_ca_topic_score_codex":0.0000057420684,"about_ca_topic_score_gemma":4.8580296e-7,"teacher_disagreement_score":0.67776585,"about_ca_system_score_codex":0.000022053493,"about_ca_system_score_gemma":0.00003062135,"threshold_uncertainty_score":0.9990672},"labels":[],"label_agreement":null},{"id":"W2051229026","doi":"10.1016/j.orl.2013.04.011","title":"Network design with a discrete set of traffic matrices","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Variety (cybernetics); Set (abstract data type); Scheme (mathematics); Time complexity; Computer science; Approximation algorithm; Network planning and design; Computational complexity theory; Polynomial; Mathematical optimization; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.07737951602445946,"score_gpt":0.3222089761203714,"score_spread":0.24482946009591194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051229026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09799498,0.0000885107,0.88216066,0.018869638,0.000053338546,0.0006110819,0.0000030994452,0.000058226437,0.00016046844],"genre_scores_gemma":[0.57613957,0.000018526473,0.42301664,0.00040518306,0.000114471404,0.00017901513,0.0000049244427,0.00000871306,0.00011295984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823475,0.00037603235,0.00016758668,0.0002686421,0.00054674235,0.00040624975],"domain_scores_gemma":[0.9989115,0.00026742576,0.000016666974,0.0004985426,0.00021598402,0.00008986922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261967,0.000088524124,0.00011498201,0.000205989,0.0004395232,0.00048183525,0.0008817388,0.000024305586,0.00007730811],"category_scores_gemma":[0.00003083768,0.00006639583,0.000030864627,0.0013625904,0.00024886007,0.0007403022,0.0001679047,0.00023453432,0.00007418875],"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.000007086809,0.000031487576,0.000040970976,0.000013467749,0.000029280603,0.00001029317,0.0008771527,0.94759524,0.0014931594,0.011245409,0.029344946,0.009311496],"study_design_scores_gemma":[0.0002443909,0.00025184662,0.0005083938,0.00004785057,0.0000027087563,0.000010913235,0.00009103047,0.9965477,0.00039280043,0.00062802597,0.0011146669,0.00015966722],"about_ca_topic_score_codex":0.00021358242,"about_ca_topic_score_gemma":0.00005340626,"teacher_disagreement_score":0.47814456,"about_ca_system_score_codex":0.00002315143,"about_ca_system_score_gemma":0.00008887121,"threshold_uncertainty_score":0.46463484},"labels":[],"label_agreement":null},{"id":"W2053637543","doi":"10.1145/2608628.2608673","title":"Linear independence oracles and applications to rectangular and low rank linear systems","year":2014,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Rank (graph theory); Row and column spaces; Row; Randomized algorithm; Mathematics; Combinatorics; Matrix (chemical analysis); Solver; Field (mathematics); Algorithm; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.015951318851620745,"score_gpt":0.25495673060099533,"score_spread":0.2390054117493746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053637543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011642674,0.00035818043,0.98610955,0.0005250714,0.00009647517,0.00030916758,0.0000025765291,0.00017088902,0.000785382],"genre_scores_gemma":[0.7461289,0.00012378402,0.25214162,0.0007198055,0.00034203284,0.00010395793,0.0000021021438,0.000013383404,0.00042438915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990142,0.00005353153,0.00016119737,0.0003963782,0.00020007358,0.00017461108],"domain_scores_gemma":[0.99912673,0.00014173146,0.000035744044,0.0004551678,0.00008115566,0.00015947333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054512,0.00010767502,0.00014690748,0.00009817743,0.00018605146,0.00016470229,0.0004104278,0.00005780146,0.0000038862245],"category_scores_gemma":[0.000040502815,0.00009527752,0.000019135472,0.00034050402,0.00006215928,0.00019853118,0.0003106339,0.0001088283,0.00003362932],"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.0000072495604,0.00008110902,0.0011510678,0.00012957945,0.000023571978,0.0000045697698,0.00060403004,0.0004784051,0.0013893944,0.6095362,0.00046060726,0.38613424],"study_design_scores_gemma":[0.00037122206,0.00014920926,0.0017487253,0.00006913055,0.000007866504,0.00007494767,0.00007896693,0.92027587,0.0012056251,0.011989649,0.063631125,0.0003976934],"about_ca_topic_score_codex":0.00010738876,"about_ca_topic_score_gemma":0.000022410717,"teacher_disagreement_score":0.9197974,"about_ca_system_score_codex":0.0000068582917,"about_ca_system_score_gemma":0.000016114935,"threshold_uncertainty_score":0.38853046},"labels":[],"label_agreement":null},{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","score_opus":0.30987741822452286,"score_gpt":0.34170317087719915,"score_spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053658780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004975388,0.00038926516,0.98819715,0.0015387295,0.001287881,0.0005789155,0.00007170948,0.00040697586,0.0025539675],"genre_scores_gemma":[0.28612748,5.684176e-7,0.71185476,0.0009749913,0.00035791128,0.00024916138,0.00010219948,0.000026579622,0.0003063635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971493,0.00014322757,0.00053330086,0.0008062781,0.0008343703,0.00053355185],"domain_scores_gemma":[0.9974052,0.0005628623,0.00021634182,0.00060585735,0.00085762615,0.00035216068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010461141,0.00034004092,0.0005514206,0.00021312556,0.0004861563,0.00047811415,0.0014162039,0.000084641055,0.00006408952],"category_scores_gemma":[0.00019642997,0.00032778597,0.0004351898,0.0006569468,0.00031290678,0.00070530723,0.00045749592,0.00018875953,0.00006580883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032011707,0.00035968365,0.00009192377,0.00003765711,0.00061566377,0.00001937444,0.0008313434,0.013208315,0.0000055523215,0.9578258,0.015469913,0.011502779],"study_design_scores_gemma":[0.0006450954,0.00017699192,0.0008013762,0.0000058166047,0.00007197651,0.000040928502,0.000019798368,0.3923003,0.000021749898,0.59291494,0.012704429,0.0002965847],"about_ca_topic_score_codex":0.000024832178,"about_ca_topic_score_gemma":0.000015709966,"teacher_disagreement_score":0.37909198,"about_ca_system_score_codex":0.000120660276,"about_ca_system_score_gemma":0.0003781494,"threshold_uncertainty_score":0.99991745},"labels":[],"label_agreement":null},{"id":"W2054116841","doi":"10.2298/yjor1101011d","title":"On-line computation and maximum-weighted hereditary subgraph problems","year":2011,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","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":"Université de Montréal","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Computation; Line (geometry); Focus (optics); Mathematics; Graph; Subgraph isomorphism problem; Set (abstract data type); Computer science; Algorithm; Line graph; Physics","score_opus":0.1693381571729664,"score_gpt":0.3650028625847389,"score_spread":0.1956647054117725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054116841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23027162,0.0006956019,0.76430476,0.001612208,0.00046225064,0.00032382426,0.0000063113985,0.000036672922,0.0022867692],"genre_scores_gemma":[0.8683207,0.00016137835,0.13120662,0.000070842914,0.00013386793,0.000007916302,0.0000028595584,0.000009208649,0.00008660958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796265,0.00032749563,0.0004388433,0.0002232595,0.0007626121,0.00028516463],"domain_scores_gemma":[0.9981773,0.00023183413,0.00005843348,0.00026151692,0.0010895397,0.00018136168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058956,0.000111783505,0.00017864324,0.00083454256,0.00050832325,0.00027046123,0.00068457605,0.000057830555,0.00006448656],"category_scores_gemma":[0.00010701053,0.000089872614,0.00006870758,0.0009993234,0.00021624738,0.0007827717,0.0001772806,0.00061319326,0.000019715833],"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.00020489524,0.0023996043,0.00089219055,0.00009730488,0.00032337275,0.00079579913,0.015046796,0.015667846,0.0014172392,0.7172592,0.0083790235,0.23751669],"study_design_scores_gemma":[0.0017333028,0.0040240884,0.004719296,0.00021234778,0.000012472211,0.001001709,0.00034509046,0.53010654,0.0018747202,0.45500398,0.00064111175,0.00032534657],"about_ca_topic_score_codex":0.000083769526,"about_ca_topic_score_gemma":0.000057936973,"teacher_disagreement_score":0.63804907,"about_ca_system_score_codex":0.00003539198,"about_ca_system_score_gemma":0.00018469618,"threshold_uncertainty_score":0.3909663},"labels":[],"label_agreement":null},{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","score_opus":0.023679275711912053,"score_gpt":0.2385259495041349,"score_spread":0.21484667379222283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055000959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004994719,0.00005186304,0.99061716,0.0018266013,0.001141843,0.00020871537,0.000112748996,0.000656626,0.00038971257],"genre_scores_gemma":[0.55167836,0.00015399077,0.44593447,0.00108665,0.00010806166,0.000072350136,0.000044863482,0.00004413622,0.00087714527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771714,0.0000800014,0.0003711237,0.0006818339,0.0005995317,0.0005503765],"domain_scores_gemma":[0.99794525,0.00022548849,0.000085425854,0.0013897071,0.00011607561,0.00023807546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001472877,0.00033267058,0.00031811334,0.00025646994,0.00090026157,0.00011222745,0.001731161,0.00014609886,0.00034090228],"category_scores_gemma":[0.000015389605,0.00032816152,0.0002679155,0.0011103222,0.00019978624,0.0007366644,0.000052327046,0.0005424341,0.0006204811],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009304035,0.0019176193,0.00009450402,0.000031306998,0.00032397086,0.0005481427,0.0016760929,0.0013061878,0.00054207974,0.006694146,0.003678489,0.9830944],"study_design_scores_gemma":[0.004279176,0.0010031351,0.012350682,0.000097910895,0.00008803074,0.002208646,0.000070098904,0.7986009,0.013601128,0.11285255,0.05265109,0.0021966642],"about_ca_topic_score_codex":0.00012974246,"about_ca_topic_score_gemma":0.0000060390084,"teacher_disagreement_score":0.9808978,"about_ca_system_score_codex":0.0001027206,"about_ca_system_score_gemma":0.000082864884,"threshold_uncertainty_score":0.99991703},"labels":[],"label_agreement":null},{"id":"W2057952251","doi":"10.1109/focs.2014.20","title":"Circuit Complexity, Proof Complexity, and Polynomial Identity Testing","year":2014,"lang":"en","type":"preprint","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Santa Fe Institute; National Science Foundation","keywords":"Proof complexity; Mathematics; Discrete mathematics; Mathematical proof; Polynomial; Upper and lower bounds; Algebraic number; Proof theory; Complexity class; Combinatorics; Identity (music); Boolean circuit; Conjecture; Time complexity; Boolean function","score_opus":0.1470915544222957,"score_gpt":0.3050535386634883,"score_spread":0.15796198424119257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057952251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017347807,0.00024284184,0.94573337,0.0014040004,0.0022029397,0.00087339827,0.00005280572,0.0010108167,0.031132016],"genre_scores_gemma":[0.6704306,0.000011328302,0.32754338,0.0008170264,0.00078655605,0.000052068233,0.000038853937,0.000042191452,0.00027799307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954621,0.00029048466,0.00082173006,0.0017434548,0.00088616885,0.0007960413],"domain_scores_gemma":[0.9964474,0.00041059163,0.0004770821,0.0019651167,0.00032593755,0.00037385928],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001207629,0.0006860936,0.0009456933,0.0003978296,0.00064899615,0.0020697745,0.0039676353,0.00036935828,0.00008412892],"category_scores_gemma":[0.00024303232,0.00071389193,0.0002529761,0.00055468717,0.0010099015,0.00075915694,0.015629746,0.0013265592,0.000051704406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005829961,0.00024643735,0.0029722396,0.0006305421,0.000121680256,0.000032168762,0.00042555804,0.0002059068,0.00009335652,0.9341135,0.003315391,0.0578374],"study_design_scores_gemma":[0.00039164315,0.00008705876,0.014459055,0.00017500865,0.000025968731,0.0000780116,0.000010007986,0.2782462,0.00011539078,0.70452857,0.00106036,0.0008227366],"about_ca_topic_score_codex":0.0017235057,"about_ca_topic_score_gemma":0.0006811964,"teacher_disagreement_score":0.6530828,"about_ca_system_score_codex":0.00010612933,"about_ca_system_score_gemma":0.00024373502,"threshold_uncertainty_score":0.9995312},"labels":[],"label_agreement":null},{"id":"W2059154872","doi":"10.1007/s004930170005","title":"Critical Facets of the Stable Set Polytope","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Critical graph; Birkhoff polytope; Graph; Facet (psychology); Discrete mathematics; Line graph; Voltage graph; Geometry; Convex set","score_opus":0.028981905935811323,"score_gpt":0.27306865573500755,"score_spread":0.24408674979919623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059154872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23256388,0.003956919,0.51694643,0.06498549,0.016101029,0.0011736061,0.000046029392,0.0010862962,0.16314033],"genre_scores_gemma":[0.9972142,0.000020007452,0.0018958541,0.00034039313,0.00001997043,0.0000049963132,3.0097414e-7,0.0000048584084,0.00049941463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989654,0.000072481496,0.00017316123,0.00021715685,0.00030659733,0.00026521442],"domain_scores_gemma":[0.9988325,0.00016555903,0.000044706732,0.0007742913,0.00010849087,0.00007441766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001601499,0.00009439784,0.00014296801,0.000046575045,0.00019443073,0.0000673268,0.0013991867,0.000042433516,0.00004793068],"category_scores_gemma":[0.00013555332,0.00007046971,0.000088805435,0.0008140505,0.00013636277,0.00022815815,0.00057360256,0.00015725048,0.00002270978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018293275,0.00014019292,0.0021354847,0.000008340643,0.000006976211,0.000006635326,0.0001723454,0.0000038118426,0.00015615665,0.98655325,0.0061736135,0.004641368],"study_design_scores_gemma":[0.00058529445,0.00021604399,0.019097753,0.000048462738,0.000011634323,0.00007199932,0.000049979986,0.010286872,0.006622742,0.7702417,0.19243237,0.00033514414],"about_ca_topic_score_codex":0.000027851342,"about_ca_topic_score_gemma":0.0000012997664,"teacher_disagreement_score":0.76465034,"about_ca_system_score_codex":0.000026488102,"about_ca_system_score_gemma":0.000051786938,"threshold_uncertainty_score":0.28736714},"labels":[],"label_agreement":null},{"id":"W2060309802","doi":"10.5555/338219.338663","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Unimodular matrix; Linear programming; Oracle; Convergence (economics); Polynomial; Time complexity; Mathematics; Construct (python library); Algorithm; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.029279266353768554,"score_gpt":0.2800338732180439,"score_spread":0.25075460686427536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060309802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016289838,0.00017743645,0.9787321,0.0018593001,0.0009285223,0.0013481291,0.00006390459,0.0003128624,0.0002879285],"genre_scores_gemma":[0.16878912,0.000026612895,0.8166444,0.001758828,0.0026500842,0.0004968475,0.00003708462,0.00005085608,0.009546224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776447,0.000030145738,0.0004768975,0.00072218885,0.00022446398,0.0007818253],"domain_scores_gemma":[0.99869066,0.000261404,0.0001186902,0.00060775626,0.00014110572,0.00018038128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037919724,0.00027498158,0.00032664684,0.00009010206,0.00052998547,0.00035585937,0.001012645,0.00014360965,0.00014936693],"category_scores_gemma":[0.000029468207,0.00026973503,0.00028833348,0.0002986754,0.00008777543,0.00035304655,0.00012085276,0.00016432967,0.00001705592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028330623,0.00020348708,0.00005154607,0.00003652921,0.00007869839,0.0000023868456,0.00057508267,0.007203805,0.00020877569,0.0018347076,0.043455746,0.9460659],"study_design_scores_gemma":[0.001067465,0.00033152424,0.000040731793,0.000016269401,0.00001519527,0.00000421795,0.000035099423,0.7660515,0.0022397726,0.00012796003,0.22975072,0.00031958453],"about_ca_topic_score_codex":0.00039716062,"about_ca_topic_score_gemma":0.00018207003,"teacher_disagreement_score":0.94574636,"about_ca_system_score_codex":0.00006021634,"about_ca_system_score_gemma":0.00020172578,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"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":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","score_opus":0.041048612578643416,"score_gpt":0.285998406091064,"score_spread":0.24494979351242055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060363698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011346347,0.000112016794,0.99427545,0.0015319401,0.0012205185,0.0007794464,0.00008857498,0.00044486302,0.00041254718],"genre_scores_gemma":[0.09082012,0.00008712043,0.90801126,0.00030643103,0.00020945395,0.00016054361,0.000025153466,0.00003768861,0.0003422432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747384,0.00004977693,0.0005738949,0.0008388397,0.0004409746,0.0006227055],"domain_scores_gemma":[0.99785846,0.0005454886,0.00016316162,0.0010222599,0.00019297466,0.00021766263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001316249,0.00030988164,0.00028777073,0.00039817407,0.00075527007,0.0002952195,0.0009178074,0.00016587456,0.0000054177835],"category_scores_gemma":[0.00008346747,0.00031027576,0.00016359457,0.00079382607,0.00013682873,0.0008086751,0.000041497056,0.0003338484,0.000013398858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004532666,0.00024239274,0.0000043520845,0.00004769152,0.00004842033,0.0000061795936,0.0012033955,0.0006203487,0.00018712197,0.0031692944,0.00007039793,0.9943551],"study_design_scores_gemma":[0.005206062,0.00094568264,0.0017126462,0.00021261733,0.000068784764,0.00016833175,0.00048228103,0.8287604,0.015164812,0.12767597,0.018353162,0.0012492627],"about_ca_topic_score_codex":0.00006241995,"about_ca_topic_score_gemma":0.00005176052,"teacher_disagreement_score":0.9931058,"about_ca_system_score_codex":0.00007730688,"about_ca_system_score_gemma":0.00004510627,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W2062135503","doi":"10.1145/2528405","title":"Lower bounds for local approximation","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"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":"Helsingin Yliopiston Tiedesäätiö; Suomen Kulttuurirahasto; Academy of Finland","keywords":"Mathematics; Combinatorics; Approximation algorithm; Dominating set; Upper and lower bounds; Discrete mathematics; Numbering; Bounded function; Independent set; Vertex (graph theory); Graph; Algorithm","score_opus":0.02291329635721146,"score_gpt":0.2504942880361266,"score_spread":0.22758099167891516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062135503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019674573,0.00007551608,0.9667267,0.0118168155,0.0013908513,0.000102768936,3.6469908e-7,0.000008946987,0.00020345017],"genre_scores_gemma":[0.64165884,0.0000064962096,0.3568637,0.0008604471,0.00034023888,0.000005502561,8.997006e-8,0.0000047911954,0.00025991476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994519,0.000024034905,0.00018001055,0.000056018118,0.00018742155,0.00010064911],"domain_scores_gemma":[0.99892455,0.000099935285,0.00017602081,0.00060118525,0.00016283727,0.00003549481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028504786,0.00004553326,0.00007930801,0.00004078185,0.00010415926,0.00014088255,0.0024167167,0.000022221855,0.00001529786],"category_scores_gemma":[0.00023108246,0.000026709942,0.000143985,0.00013409134,0.000043691936,0.00046324372,0.00039019165,0.000105192164,0.000009693603],"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.00003311623,0.00039152952,0.00039238995,0.00004758805,0.00011907605,0.0000047738886,0.0012227476,0.0013239636,0.0019542058,0.12318204,0.3059138,0.5654148],"study_design_scores_gemma":[0.00035416783,0.00015599692,0.0026419954,0.00003197163,0.0000076736405,0.000099682955,0.000030243478,0.1125162,0.0012536111,0.8653391,0.01749446,0.00007492598],"about_ca_topic_score_codex":0.000003684891,"about_ca_topic_score_gemma":7.6553005e-7,"teacher_disagreement_score":0.74215704,"about_ca_system_score_codex":0.000023245871,"about_ca_system_score_gemma":0.00003496651,"threshold_uncertainty_score":0.4490901},"labels":[],"label_agreement":null},{"id":"W2063494850","doi":"10.1016/j.ipl.2010.05.011","title":"Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mathematics; Indifference graph; Maximal independent set; Interval graph; Permutation graph; Pathwidth; Induced subgraph isomorphism problem; Cograph; Discrete mathematics; Clique-sum; Split graph; Algorithm; 1-planar graph; Line graph; Graph; Voltage graph","score_opus":0.023393805936179624,"score_gpt":0.25343921096351546,"score_spread":0.23004540502733584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063494850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13942084,0.000035886944,0.8517661,0.0065661,0.0005984597,0.0010864025,0.000026112391,0.00031730908,0.00018279474],"genre_scores_gemma":[0.9059928,0.00000989333,0.089802235,0.0038107142,0.000041476094,0.00028791465,0.000034194447,0.000012563322,0.000008224479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985289,0.000032108488,0.00047769296,0.000261113,0.00039281187,0.00030735836],"domain_scores_gemma":[0.99886256,0.0001677204,0.0003344829,0.000302274,0.0002552249,0.000077758625],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044082143,0.0002248533,0.00015486687,0.00036245945,0.00075031444,0.001205028,0.00048793133,0.00007809598,0.0000042080255],"category_scores_gemma":[0.000072550894,0.00015805627,0.00009223773,0.00055611716,0.0002882244,0.0033625492,0.00007566183,0.0003281788,0.000008347339],"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.00004781849,0.00006567552,0.00047469762,0.0003137322,0.000045509405,0.0000010388595,0.011478447,0.00033345557,0.004981799,0.11718029,0.000714681,0.86436284],"study_design_scores_gemma":[0.0018428427,0.00030186345,0.0067189108,0.0002565829,0.00004713124,0.0001264945,0.00064029853,0.9254496,0.0056925253,0.048119247,0.009916153,0.0008883315],"about_ca_topic_score_codex":0.000012399949,"about_ca_topic_score_gemma":0.000009111693,"teacher_disagreement_score":0.9251162,"about_ca_system_score_codex":0.00001920831,"about_ca_system_score_gemma":0.0000604606,"threshold_uncertainty_score":0.9998318},"labels":[],"label_agreement":null},{"id":"W2063687001","doi":"10.1007/s10878-012-9526-3","title":"Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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 New Brunswick","funders":"","keywords":"Approximation algorithm; Disjoint sets; Mathematics; Convexity; Theory of computation; Combinatorics; Function (biology); Range (aeronautics); Relaxation (psychology); Algorithm; Discrete mathematics","score_opus":0.02017153551588397,"score_gpt":0.25076873655230497,"score_spread":0.230597201036421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063687001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043775758,0.00050707546,0.9909008,0.0017106669,0.005686138,0.00070696557,0.0000017186477,0.000020828755,0.000028036606],"genre_scores_gemma":[0.49064776,0.00047466284,0.5063072,0.00017670395,0.0021884555,0.00013438087,0.000018528073,0.000023011587,0.000029301056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00013927744,0.00044579688,0.000105210325,0.00028880293,0.00017137993],"domain_scores_gemma":[0.9983867,0.00041008618,0.00062067196,0.0001842284,0.0003407177,0.000057616307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019293812,0.00011279277,0.00017015738,0.00008984826,0.00040525556,0.0002733305,0.0003380741,0.000056469118,0.0000023481382],"category_scores_gemma":[0.00016521921,0.00006437478,0.00010776618,0.00029332784,0.000097522374,0.001403704,0.00007676137,0.00015800413,2.94493e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065037474,0.0006235522,0.00023942583,0.00012555232,0.00031488884,4.4103618e-7,0.009448821,0.15538144,0.0006732627,0.7077362,0.0007781679,0.12402787],"study_design_scores_gemma":[0.003492536,0.00016685469,0.00016806324,0.000018014187,0.000062799125,0.000045124943,0.00012520404,0.95805633,0.0005636581,0.036810987,0.00039396188,0.00009647484],"about_ca_topic_score_codex":0.000010376448,"about_ca_topic_score_gemma":3.357073e-7,"teacher_disagreement_score":0.8026749,"about_ca_system_score_codex":0.00005910395,"about_ca_system_score_gemma":0.000041678057,"threshold_uncertainty_score":0.3116939},"labels":[],"label_agreement":null},{"id":"W2063991224","doi":"10.1016/s0304-3975(01)00152-9","title":"Lower bounds for invariant queries in logics with counting","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preorder; Unary operation; Locality; Transitive closure; Mathematics; Discrete mathematics; Complexity class; Expressive power; First-order logic; Binary relation; Transitive relation; Second-order logic; Succinctness; Invariant (physics); Proof theory; Combinatorics; Time complexity; Higher-order logic; Computer science; Mathematical proof; Theoretical computer science; Description logic","score_opus":0.022308949309105132,"score_gpt":0.23628980476978478,"score_spread":0.21398085546067966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063991224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016452594,0.000033948392,0.978158,0.001484414,0.00045554497,0.00022592042,0.0000017088499,0.00014157609,0.0030462893],"genre_scores_gemma":[0.6506544,0.0000032771663,0.34863967,0.0006071032,0.000067430716,0.000012649674,2.3504568e-7,0.000005075656,0.00001015538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773043,0.000050723524,0.00026497358,0.000712433,0.0005528211,0.00068860425],"domain_scores_gemma":[0.9985799,0.00038313676,0.000064026135,0.0006532334,0.00016973165,0.00014995804],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012882027,0.0001875646,0.00022350773,0.00021894561,0.00047882428,0.0007450954,0.0021001103,0.000047297453,0.00004310157],"category_scores_gemma":[0.00008999191,0.00014290423,0.000051129435,0.0015705375,0.0030580943,0.0008676581,0.00064346043,0.00019878676,0.000016862035],"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.000008370661,0.00009199732,0.00013336014,0.000007783975,0.000002012054,0.000021959459,0.00051004946,0.00016827513,0.00002886034,0.98419887,0.000041680716,0.014786807],"study_design_scores_gemma":[0.00030974048,0.00038445523,0.00038341555,0.000039716277,0.0000017722268,0.000044312295,0.000007756154,0.7501076,0.0002387804,0.24761073,0.00064744405,0.00022430965],"about_ca_topic_score_codex":0.000005906596,"about_ca_topic_score_gemma":0.000008119412,"teacher_disagreement_score":0.74993926,"about_ca_system_score_codex":0.000055602213,"about_ca_system_score_gemma":0.00006396998,"threshold_uncertainty_score":0.999655},"labels":[],"label_agreement":null},{"id":"W2066144963","doi":"10.1090/s0894-0347-2011-00694-2","title":"Non-commutative circuits and the sum-of-squares problem","year":2011,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Mathematics; Parenthesis; Algorithm; Commutative property; Statistics; Discrete mathematics; Linguistics; Philosophy","score_opus":0.027813818679021912,"score_gpt":0.2585632479588518,"score_spread":0.23074942927982992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066144963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23257507,0.0002434761,0.75588363,0.0058225635,0.00016834695,0.00037907663,0.000002892792,0.000022996275,0.004901953],"genre_scores_gemma":[0.8457771,0.000049085025,0.15357164,0.0005376247,0.00003329195,0.0000031451139,1.6550162e-8,0.0000057192487,0.000022405797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880594,0.0001482563,0.0004207497,0.0000941891,0.00036919565,0.00016167933],"domain_scores_gemma":[0.9979969,0.0006371863,0.00081598386,0.00034992528,0.00013557833,0.00006440297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011129129,0.00010600507,0.00039766266,0.000018401352,0.00016224291,0.000044259483,0.0013246856,0.000019314353,0.000010397331],"category_scores_gemma":[0.0000926344,0.000048455924,0.00043198277,0.0003997898,0.0016482013,0.00016230544,0.00039001738,0.0003151638,0.0000016483216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007830003,0.0008575849,0.0020038593,0.0002712632,0.0010038693,0.00000970132,0.19294369,0.000025176703,0.0006222244,0.7304559,0.0042749424,0.06745348],"study_design_scores_gemma":[0.0007136038,0.00025762568,0.007972844,0.00015135147,0.00006572378,0.00017264069,0.0029888696,0.0138070565,0.000973036,0.9726901,0.000080879,0.00012627934],"about_ca_topic_score_codex":0.000018861901,"about_ca_topic_score_gemma":5.4793134e-7,"teacher_disagreement_score":0.613202,"about_ca_system_score_codex":0.000016829981,"about_ca_system_score_gemma":0.0000504158,"threshold_uncertainty_score":0.60728663},"labels":[],"label_agreement":null},{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","score_opus":0.12454342522397675,"score_gpt":0.3089948682333011,"score_spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06498257,0.00018358404,0.9142869,0.011143131,0.00081072137,0.00030669256,0.000028588775,0.00028362314,0.00797418],"genre_scores_gemma":[0.8281727,0.0000074621485,0.17124353,0.00027873728,0.00015683462,0.0000126152045,0.000026329215,0.000009010577,0.000092789145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977769,0.00022919841,0.0005490583,0.00047697916,0.00062020385,0.0003476397],"domain_scores_gemma":[0.99804574,0.00034733512,0.0002598381,0.0008286447,0.00040646497,0.00011199364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005508587,0.00021061549,0.00028927685,0.00017580732,0.000825198,0.00013105413,0.0016714737,0.00004943545,0.00014379119],"category_scores_gemma":[0.00008553381,0.00017545852,0.00021005204,0.0013164822,0.0018840894,0.0004119611,0.00054297113,0.00030683266,0.00004158998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010498379,0.00017027695,0.00029214853,0.00001110436,0.00003970611,0.000004644027,0.00046301985,0.01682755,0.00006453268,0.97326094,0.0015464823,0.0073091234],"study_design_scores_gemma":[0.00021781394,0.000047781297,0.040486813,0.000018345425,0.0000073546666,0.0001618539,0.00004595114,0.27274862,0.000079693724,0.6834071,0.002614847,0.00016376899],"about_ca_topic_score_codex":0.00021736321,"about_ca_topic_score_gemma":0.000030658328,"teacher_disagreement_score":0.76319015,"about_ca_system_score_codex":0.00005820777,"about_ca_system_score_gemma":0.00014624496,"threshold_uncertainty_score":0.7154991},"labels":[],"label_agreement":null},{"id":"W2068462176","doi":"","title":"On distance to monotonicity and longest increasing subsequence of a data stream","year":2008,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotonic function; Longest common subsequence problem; Subsequence; Longest increasing subsequence; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Sequence (biology); Approximation algorithm; Space (punctuation); Streaming algorithm; Set (abstract data type); Edit distance; Log-log plot; Data stream; Discrete mathematics; Binary logarithm; Algorithm; Computer science; Statistics; Bounded function","score_opus":0.04200296111938706,"score_gpt":0.28511185113436605,"score_spread":0.24310889001497898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068462176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60369617,0.000369426,0.38702345,0.0029247806,0.000505661,0.000795806,0.0005429103,0.00030180308,0.003839985],"genre_scores_gemma":[0.9122392,0.00021536011,0.08697618,0.0003576365,0.00007830928,0.000018190087,0.000029003282,0.00002065255,0.00006549988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722314,0.00015056645,0.00039980345,0.0011334021,0.00062373927,0.00046935322],"domain_scores_gemma":[0.9968167,0.0004144533,0.00015979148,0.0022309667,0.000087185625,0.00029093688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004771017,0.00032320787,0.00039492978,0.00020397741,0.0003242603,0.0001234356,0.0022216216,0.0000801674,0.0000058477617],"category_scores_gemma":[0.000101990685,0.00029732505,0.00006819605,0.0006987348,0.00032946147,0.00076273066,0.0010815123,0.00026328478,0.000016942518],"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.001164134,0.0024458,0.011551185,0.0003786283,0.00040646532,0.0012837792,0.008608955,0.004053067,0.016728347,0.7282097,0.0025274733,0.22264251],"study_design_scores_gemma":[0.003960877,0.0059372145,0.080737464,0.0016769881,0.00009029858,0.0009245416,0.00022519546,0.82107323,0.03507849,0.04031711,0.006183539,0.0037950503],"about_ca_topic_score_codex":0.0005171836,"about_ca_topic_score_gemma":0.000046662855,"teacher_disagreement_score":0.8170202,"about_ca_system_score_codex":0.00005959318,"about_ca_system_score_gemma":0.00009950606,"threshold_uncertainty_score":0.9999479},"labels":[],"label_agreement":null},{"id":"W2071642760","doi":"10.1007/s101070100253","title":"A faster capacity scaling algorithm for minimum cost submodular flow","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Minimum-cost flow problem; Maximum flow problem; Scaling; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Approximation algorithm; Suurballe's algorithm; Flow (mathematics); Flow network; Algorithm; Graph; Combinatorics","score_opus":0.0668083390083673,"score_gpt":0.26281270927000383,"score_spread":0.19600437026163653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071642760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013410697,0.00008534764,0.9960242,0.0004916899,0.00024689065,0.00092020445,0.000007855695,0.00036426212,0.00051848276],"genre_scores_gemma":[0.019805167,0.0000019030048,0.97934633,0.00016998945,0.00017159502,0.0002802328,0.0000030018473,0.000023534081,0.00019825401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978345,0.00005213211,0.0004454427,0.00053834956,0.00041005324,0.0007195468],"domain_scores_gemma":[0.99859756,0.0003573426,0.00009276956,0.0006226079,0.00010898985,0.00022073003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057267374,0.00025444615,0.00035650088,0.0001071912,0.0003290116,0.00048160274,0.0008341114,0.000109970824,0.00008385565],"category_scores_gemma":[0.00015649434,0.00022956253,0.00025485482,0.0004076581,0.0001570896,0.00037859092,0.00025105153,0.00021801291,0.00013196547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.087156e-7,0.00027849874,0.0000041560334,0.0001008292,0.000023772182,0.000008821027,0.0009656645,0.0000102329195,0.000021240467,0.023618646,0.00016268203,0.97480464],"study_design_scores_gemma":[0.00040757115,0.00007680883,0.0000046428067,0.00007685764,0.000014889442,0.000047527144,0.00004554543,0.9201764,0.00031006578,0.06757045,0.010980126,0.0002891287],"about_ca_topic_score_codex":0.000002365727,"about_ca_topic_score_gemma":0.0000010008906,"teacher_disagreement_score":0.9745155,"about_ca_system_score_codex":0.00004194332,"about_ca_system_score_gemma":0.000007894175,"threshold_uncertainty_score":0.93612885},"labels":[],"label_agreement":null},{"id":"W2072445778","doi":"10.1016/j.disc.2013.08.017","title":"The cluster deletion problem for cographs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Split graph; Time complexity; Partition (number theory); Cograph; Clique graph; Graph; Clique; Discrete mathematics; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.015411901310856943,"score_gpt":0.2459727440412529,"score_spread":0.23056084273039595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072445778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015798608,0.000066566565,0.9910912,0.0031110966,0.0001700854,0.0008592619,0.000003270423,0.00012558931,0.0029930824],"genre_scores_gemma":[0.052805025,0.00002868911,0.9451045,0.00040355595,0.00008583624,0.000619024,0.000006336179,0.000020026895,0.00092704163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990599,0.000025189975,0.00025228548,0.00018231018,0.00019956227,0.00028073043],"domain_scores_gemma":[0.99878377,0.00041213262,0.000104099636,0.00052405096,0.000120713274,0.00005525361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034155409,0.00011757486,0.000115186966,0.000041670533,0.0004083091,0.0004906665,0.00080686423,0.000038553597,0.000009489816],"category_scores_gemma":[0.000047080677,0.00007287501,0.00012687159,0.00021378508,0.00009044983,0.00027437415,0.00018069887,0.00007783828,0.00006114647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001139045,0.00003783011,0.000011686692,0.000068742156,0.000023645802,1.7223387e-7,0.0009914055,0.0000144979485,0.000051745148,0.9593653,0.0076123443,0.031821463],"study_design_scores_gemma":[0.00015658699,0.000044837336,0.000047551923,0.000023299754,0.000005805148,0.0000055177147,0.0001278087,0.31377736,0.00012397149,0.67607945,0.009492679,0.00011514675],"about_ca_topic_score_codex":0.000006805989,"about_ca_topic_score_gemma":0.000006707766,"teacher_disagreement_score":0.31376284,"about_ca_system_score_codex":0.000009515141,"about_ca_system_score_gemma":0.000013300801,"threshold_uncertainty_score":0.47315085},"labels":[],"label_agreement":null},{"id":"W2073512309","doi":"10.1089/cmb.2006.13.979","title":"An <i>O</i> ( <i>n</i> log <i>n</i> )-Time Algorithm for the Restriction Scaffold Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; McGill University","funders":"","keywords":"Computer science; Algorithm; Scaffold; Combinatorics; Mathematics; Programming language","score_opus":0.01202318925585627,"score_gpt":0.2583048064252301,"score_spread":0.24628161716937386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073512309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095888274,0.00039017055,0.99456906,0.0028603154,0.0006986338,0.00023197998,0.000025436068,0.000040844196,0.00022464883],"genre_scores_gemma":[0.10818917,0.00003826324,0.8892823,0.0011151446,0.001246332,0.00002131105,0.00004061819,0.00001297304,0.000053892854],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998428,0.0001625644,0.0006200317,0.0002307913,0.00030129906,0.00025734992],"domain_scores_gemma":[0.9977674,0.00094609667,0.00053993124,0.00020924336,0.00046579435,0.000071571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008893378,0.00015221229,0.00024097385,0.00016721622,0.00031064052,0.00013429612,0.0009437801,0.00008482047,0.000007555665],"category_scores_gemma":[0.00001309127,0.000104732404,0.00019411488,0.00034353792,0.00012543102,0.00039889847,0.00007432458,0.000174171,0.0000075402536],"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.00005621641,0.0007510064,0.00027402316,0.000010493229,0.00016471649,0.000016008495,0.00008177553,0.17122568,0.0037783217,0.33271456,0.027437922,0.46348926],"study_design_scores_gemma":[0.00079347345,0.00088039186,0.00089542277,0.000011798418,0.000023080665,0.00022156848,0.0000074799514,0.45161206,0.00043376235,0.51829624,0.026672376,0.0001523697],"about_ca_topic_score_codex":0.000017148028,"about_ca_topic_score_gemma":0.0000015973214,"teacher_disagreement_score":0.46333688,"about_ca_system_score_codex":0.00005621268,"about_ca_system_score_gemma":0.00016777983,"threshold_uncertainty_score":0.42708632},"labels":[],"label_agreement":null},{"id":"W2075025003","doi":"10.1007/bf02984830","title":"What this country needs is an 18c piece","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Business","score_opus":0.06498037748851589,"score_gpt":0.3063643580093941,"score_spread":0.24138398052087823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075025003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004719733,0.0006496984,0.961764,0.0021608586,0.0010443444,0.00027621415,0.0000023998978,0.00023347593,0.029149316],"genre_scores_gemma":[0.7321124,0.0014525999,0.21940872,0.023192117,0.00058223086,0.00018381362,0.000004947485,0.00011184013,0.02295135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982727,0.00015416047,0.0003485082,0.00031309787,0.00050176645,0.0004097703],"domain_scores_gemma":[0.9979571,0.00045714554,0.00007193588,0.0012708183,0.000092735594,0.00015027593],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009382433,0.00020967066,0.00022443089,0.00008851249,0.0002881529,0.0007795167,0.0017743479,0.00008698714,0.0031087697],"category_scores_gemma":[0.00012451124,0.00013314116,0.00011052691,0.00083880645,0.0003216681,0.00097568444,0.00021816237,0.0003061656,0.0012780325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018600253,0.00012298407,0.0000039155198,0.000017513064,0.000018129,0.0000031807997,0.008752669,0.00000788489,0.000022523423,0.97541475,0.0017932447,0.013841323],"study_design_scores_gemma":[0.000044290482,0.00008283915,0.000004220545,0.000069493486,0.000013637994,0.00007185892,0.0015943139,0.060975388,0.0055675493,0.9073864,0.023948489,0.00024150459],"about_ca_topic_score_codex":0.000010788563,"about_ca_topic_score_gemma":0.0000030429073,"teacher_disagreement_score":0.7423552,"about_ca_system_score_codex":0.000028245935,"about_ca_system_score_gemma":0.000049560713,"threshold_uncertainty_score":0.99949956},"labels":[],"label_agreement":null},{"id":"W2075553387","doi":"10.1016/j.jcss.2014.04.027","title":"Randomized diffusion for indivisible loads","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Hypercube; Randomized algorithm; Vertex (graph theory); Mathematics; Computer science; Expander graph; Eigenvalues and eigenvectors; Load balancing (electrical power); Exponential function; Degree (music); Upper and lower bounds; Combinatorics; Discrete mathematics; Graph; Grid","score_opus":0.021908114671098634,"score_gpt":0.2596130867643442,"score_spread":0.23770497209324556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075553387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03597238,0.00030730825,0.9608555,0.00042577588,0.0015792695,0.00015064156,4.244738e-7,0.000024363633,0.00068432564],"genre_scores_gemma":[0.78920436,0.000015488107,0.2102422,0.000118198455,0.00039670663,0.0000026012842,7.1136824e-8,0.000002144144,0.000018225393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.00023882512,0.000511868,0.0001945774,0.00041957694,0.00018930146],"domain_scores_gemma":[0.9983136,0.00087609777,0.00040084918,0.00014083195,0.00016202677,0.000106593005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047765756,0.00010612195,0.0004969389,0.0002744869,0.00034273343,0.0004731952,0.0009061738,0.000033445674,8.0694775e-7],"category_scores_gemma":[0.00004059687,0.00006616957,0.00019330237,0.00029171407,0.00021521786,0.00050800754,0.00016935561,0.00007639118,9.900376e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005307386,0.0000660909,0.00044841625,0.00015109727,0.000048792175,0.0000051858256,0.0012871621,0.0004319311,0.000056354318,0.8420937,0.0010061271,0.15387441],"study_design_scores_gemma":[0.024627307,0.0005491444,0.00040580917,0.0002215804,0.000015142516,0.00031971987,0.00006104899,0.9474481,0.0000777416,0.024097338,0.0020357412,0.00014134958],"about_ca_topic_score_codex":0.000004051246,"about_ca_topic_score_gemma":5.232711e-7,"teacher_disagreement_score":0.9470161,"about_ca_system_score_codex":0.000010602531,"about_ca_system_score_gemma":0.00004938686,"threshold_uncertainty_score":0.4563032},"labels":[],"label_agreement":null},{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","score_opus":0.01972464748282074,"score_gpt":0.24912374400685244,"score_spread":0.2293990965240317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075766499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021087788,0.0004504562,0.97513914,0.0009604859,0.00015382204,0.00035512206,0.0000034307973,0.00024340475,0.001606369],"genre_scores_gemma":[0.6023961,0.000038609287,0.3969299,0.00021632938,0.00009356814,0.00005140201,0.000007583696,0.00003691118,0.00022962023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754894,0.000041708106,0.00048317216,0.0004957111,0.00041428307,0.001016217],"domain_scores_gemma":[0.9983986,0.00032301896,0.00013737229,0.0009925828,0.00004304925,0.000105394385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004922566,0.00029258896,0.00035362225,0.00019735038,0.00015639637,0.00023415293,0.0013847314,0.00010425105,0.00003310325],"category_scores_gemma":[0.00021084797,0.00028032222,0.00013919677,0.00090630277,0.00011393892,0.00040492706,0.00037587766,0.00043979692,0.0000897189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001148211,0.000980127,0.00006305134,0.00017699247,0.00006340277,0.000039262206,0.0058938605,0.020556172,0.0019979882,0.9082485,0.00008233629,0.061886866],"study_design_scores_gemma":[0.0009706678,0.00022540172,0.00002471761,0.00018616929,0.0000116542105,0.00007522058,0.000070722665,0.23862326,0.010262177,0.7460412,0.0029958596,0.0005129931],"about_ca_topic_score_codex":0.00003472869,"about_ca_topic_score_gemma":0.00012411237,"teacher_disagreement_score":0.5813083,"about_ca_system_score_codex":0.00035566266,"about_ca_system_score_gemma":0.00017894566,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2076347651","doi":"10.1145/2733693.2733702","title":"Zigzag Form over Families of Parametric Matrices","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; Zigzag; Computer science; Library science; Genealogy; History; Archaeology","score_opus":0.07643292070875024,"score_gpt":0.320113334141787,"score_spread":0.24368041343303676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076347651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17933205,0.004676659,0.8070799,0.0032529775,0.0009077594,0.0005272975,0.000013772526,0.00042177856,0.0037878132],"genre_scores_gemma":[0.4954242,0.0003882427,0.50394195,0.00017430805,0.000028110422,0.000019193329,0.0000073639135,0.000007103969,0.0000095205005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826455,0.00019710214,0.0005622337,0.00031955366,0.0003717885,0.00028476556],"domain_scores_gemma":[0.9930568,0.0010580155,0.00020575685,0.0053741867,0.00019935741,0.00010591746],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006852539,0.00017913783,0.00030791934,0.0008235849,0.00012040846,0.0001332332,0.008503407,0.000081736245,0.000005183914],"category_scores_gemma":[0.00017797809,0.00018103907,0.000105531384,0.0028887303,0.0002478826,0.0007400534,0.0056921793,0.00030377458,0.000027966267],"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.000008847356,0.00083916995,0.021388981,0.00004272705,0.00006974634,0.0000065432996,0.00431152,0.000565586,0.000011453736,0.46980664,0.003687694,0.49926108],"study_design_scores_gemma":[0.001132801,0.00021670487,0.0355472,0.00009769885,0.000012786607,0.0000277647,0.00013533758,0.5312558,0.00013248509,0.41577956,0.015193465,0.0004684025],"about_ca_topic_score_codex":0.00032111214,"about_ca_topic_score_gemma":0.00010444075,"teacher_disagreement_score":0.5306902,"about_ca_system_score_codex":0.00007324281,"about_ca_system_score_gemma":0.000120775236,"threshold_uncertainty_score":0.99686104},"labels":[],"label_agreement":null},{"id":"W2076513440","doi":"10.1016/j.dam.2006.03.003","title":"Approximating the minimum clique cover and other hard problems in subtree filament graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Clique-sum; Mathematics; Indifference graph; Maximal independent set; Discrete mathematics; Split graph; Treewidth; Clique problem; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.020750884686091344,"score_gpt":0.22998158125748325,"score_spread":0.2092306965713919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076513440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10796094,0.0002057042,0.85014164,0.00070420105,0.00010716792,0.0014552374,0.000017183094,0.0002213382,0.039186597],"genre_scores_gemma":[0.6056417,0.000014332367,0.39319196,0.0005228292,0.000058181493,0.00027903603,0.0000059313297,0.000036084733,0.00024990056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985053,0.000026550628,0.00047429165,0.0003504886,0.00030149752,0.00034190153],"domain_scores_gemma":[0.9989273,0.00023057996,0.00018960687,0.00059393345,0.000017516584,0.000041059564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057987124,0.00021655003,0.00025811957,0.00009369942,0.00015573908,0.00024426484,0.0006370632,0.00006557321,0.0000138129235],"category_scores_gemma":[0.000012639431,0.00015157867,0.00006397725,0.00038260786,0.00015446826,0.00011524486,0.0003132541,0.00019870077,0.000019785957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017754912,0.00011667181,0.0002513885,0.00014978785,0.000013177489,0.0000019342954,0.003088741,0.00028362236,0.0008692244,0.9933071,0.00033839326,0.0015781805],"study_design_scores_gemma":[0.0005134875,0.000028370889,0.0008223336,0.00010415833,0.000011267617,0.000013719565,0.00044486916,0.15848541,0.00081349513,0.8369189,0.0015112973,0.0003327076],"about_ca_topic_score_codex":0.000043792155,"about_ca_topic_score_gemma":0.000036459678,"teacher_disagreement_score":0.4976808,"about_ca_system_score_codex":0.000020555155,"about_ca_system_score_gemma":0.00001805483,"threshold_uncertainty_score":0.6181199},"labels":[],"label_agreement":null},{"id":"W2076901012","doi":"10.1007/s00453-011-9596-0","title":"Two-stage Robust Network Design with Exponential Scenarios","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Theory of computation; Facility location problem; Integer programming; Mathematical optimization; Computer science; Combinatorial optimization; Tree (set theory); Combinatorics; Integer (computer science); Network planning and design; Mathematics; Approximation algorithm; Stage (stratigraphy); Discrete mathematics; Algorithm","score_opus":0.06642916085159743,"score_gpt":0.22959198527262015,"score_spread":0.1631628244210227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076901012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006497975,0.00011141552,0.99377507,0.00011784266,0.0006790951,0.00031671353,0.0000037599366,0.00043257995,0.0039137364],"genre_scores_gemma":[0.04843974,0.000009593797,0.95029944,0.0003211259,0.00040039385,0.000042006166,0.0000038820895,0.000028498253,0.00045532672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997703,0.00015932298,0.0002943541,0.00068374374,0.00041813546,0.0007414226],"domain_scores_gemma":[0.99844843,0.00010776593,0.00013467594,0.0009827453,0.00010568306,0.00022071021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004318668,0.00030090622,0.0002792673,0.00012076291,0.00038003907,0.00017382413,0.0015383987,0.000079258774,0.00022122513],"category_scores_gemma":[0.00001097254,0.00025959397,0.00010548069,0.00077020325,0.00018820123,0.00060271006,0.00041534618,0.00030795427,0.00013031311],"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.00041719718,0.0014798392,0.00071341835,0.000059838254,0.0006740163,0.002863241,0.006978485,0.05553733,0.00030535698,0.5787063,0.012285977,0.339979],"study_design_scores_gemma":[0.00255754,0.001062632,0.0014909472,0.00011335803,0.000059266185,0.0002784645,0.00012816135,0.9500949,0.004072769,0.031073513,0.007598982,0.0014694898],"about_ca_topic_score_codex":0.00020209058,"about_ca_topic_score_gemma":0.000028806831,"teacher_disagreement_score":0.89455754,"about_ca_system_score_codex":0.0000331678,"about_ca_system_score_gemma":0.00011337591,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2077484581","doi":"10.1145/2633602","title":"On the One-Way Function Candidate Proposed by Goldreich","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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 Computing and Communication Foundations; European Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Discrete mathematics; Satisfiability; Exponential function; Function (biology); Bipartite graph; Backtracking; Combinatorics; Upper and lower bounds; Algorithm; Graph","score_opus":0.016132672164525262,"score_gpt":0.23243034732104328,"score_spread":0.21629767515651802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077484581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067181345,0.000015607131,0.9866597,0.003580629,0.0007416792,0.00029842672,0.000011421792,0.0003382599,0.0016361616],"genre_scores_gemma":[0.98691064,0.000006368816,0.0098695755,0.0025566067,0.000049777238,0.00003689267,0.000013112134,0.000016902179,0.0005401318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809676,0.00056447537,0.00024746868,0.00044024334,0.00040195757,0.00024909276],"domain_scores_gemma":[0.99721855,0.0016615529,0.00010384096,0.00084011606,0.00009514621,0.00008077612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085892406,0.00019559266,0.00014912708,0.00016575668,0.0007410055,0.00020335194,0.00089031126,0.00007123094,0.0001312253],"category_scores_gemma":[0.00006877853,0.00015310712,0.000113855014,0.0005510605,0.000117933756,0.00026884497,0.000018309309,0.0003546689,0.00024031065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000746565,0.00027035593,0.0000013874179,0.000007668195,0.00005872992,4.468616e-7,0.0003347845,0.009540884,0.00028235445,0.5442484,0.0009637518,0.44421658],"study_design_scores_gemma":[0.00055900053,0.00053954177,0.00024522518,0.00003457399,0.000025774385,0.00000503433,0.000046332407,0.1185972,0.004116989,0.87322235,0.002341371,0.00026660433],"about_ca_topic_score_codex":0.000019767602,"about_ca_topic_score_gemma":0.000010399334,"teacher_disagreement_score":0.9801925,"about_ca_system_score_codex":0.00005092007,"about_ca_system_score_gemma":0.00003190543,"threshold_uncertainty_score":0.6243527},"labels":[],"label_agreement":null},{"id":"W2078140591","doi":"10.1016/j.tcs.2014.11.008","title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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":"Rounding; Mathematics; Bipartite graph; Function (biology); Approximation algorithm; Value (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Boolean function; Time complexity; Integer (computer science); Algorithm; Computer science","score_opus":0.026753670774554365,"score_gpt":0.26676395496704475,"score_spread":0.24001028419249038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078140591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006870815,0.00006744976,0.9904788,0.0013528616,0.0005614201,0.0003522021,0.0000012732934,0.00009985801,0.00021528937],"genre_scores_gemma":[0.7277764,0.000004887764,0.27191317,0.00017441214,0.00010296289,0.00001873865,3.8492638e-7,0.0000045810357,0.000004425932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795026,0.00011715011,0.0002951887,0.00052597735,0.000487751,0.0006236689],"domain_scores_gemma":[0.9978059,0.0010417913,0.00009194614,0.0007379685,0.00015487787,0.00016753023],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0032907438,0.00015572167,0.00020826336,0.0001229286,0.0013176731,0.0005132685,0.0018844848,0.000035248973,0.0000030705723],"category_scores_gemma":[0.00014487197,0.00010602309,0.0000894515,0.0008686122,0.0038929633,0.0004603858,0.0010663474,0.00014493444,0.0000033753458],"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.0000021202586,0.00003880658,0.000022416305,0.000010631889,0.000005173026,2.8722894e-7,0.00045053934,0.00046394154,0.00011918635,0.8545959,0.000006415807,0.14428458],"study_design_scores_gemma":[0.00013832514,0.00023014788,0.00032624684,0.000028502693,0.000006043165,0.000013892533,0.00000836162,0.6710248,0.00027725872,0.32764065,0.00020244831,0.0001033039],"about_ca_topic_score_codex":0.000008342545,"about_ca_topic_score_gemma":0.0000016740122,"teacher_disagreement_score":0.7209056,"about_ca_system_score_codex":0.000020857338,"about_ca_system_score_gemma":0.00005954577,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W2078952510","doi":"10.1007/s00453-013-9823-y","title":"Lower Bounds Against Weakly-Uniform Threshold Circuits","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical proof; Theory of computation; Electronic circuit; Boolean circuit; Mathematics; Discrete mathematics; Computer science; Boolean function; Arithmetic; Algorithm; Electrical engineering","score_opus":0.01584595035044201,"score_gpt":0.22472843624327576,"score_spread":0.20888248589283376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078952510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070678085,0.00072263,0.7190493,0.008142669,0.006833717,0.0014060285,0.000029722427,0.0022250547,0.19091283],"genre_scores_gemma":[0.90628505,0.000069306865,0.08619215,0.003787299,0.0007081757,0.00014167391,0.000020300182,0.000051342173,0.002744695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975802,0.00003465245,0.00039213483,0.0006859769,0.00054309046,0.00076398236],"domain_scores_gemma":[0.9980458,0.000095856776,0.00011006876,0.0012669943,0.00019126103,0.0002899984],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023250398,0.00031718187,0.00029499328,0.00021629142,0.0003886054,0.00066376594,0.0020246347,0.00014180827,0.00027710464],"category_scores_gemma":[0.000025730107,0.0002989288,0.00020494088,0.0008053705,0.00018555413,0.0013228342,0.0006095459,0.00038364687,0.0015622514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015271432,0.00031945165,0.0001367679,0.000019951784,0.000082987564,0.0000742549,0.00044872714,0.000037430094,0.0012896038,0.12272469,0.024185225,0.8506794],"study_design_scores_gemma":[0.0013289319,0.0004561842,0.005972011,0.00011554436,0.00002393279,0.00015613933,0.00012400212,0.5476874,0.0052021607,0.27838942,0.15852347,0.002020793],"about_ca_topic_score_codex":0.00008231657,"about_ca_topic_score_gemma":0.000007783324,"teacher_disagreement_score":0.84865856,"about_ca_system_score_codex":0.00007104135,"about_ca_system_score_gemma":0.00009444921,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W2079241283","doi":"10.1145/2488608.2488662","title":"Every locally characterized affine-invariant property is testable","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Affine transformation; Mathematics; Invariant (physics); Linear subspace; Bounded function; Discrete mathematics; Property (philosophy); Affine combination; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.020656875713861992,"score_gpt":0.21239289814555204,"score_spread":0.19173602243169005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079241283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007323007,0.00004976651,0.9069216,0.015176104,0.000604692,0.0006712288,0.000004451535,0.00077543355,0.06847369],"genre_scores_gemma":[0.20516312,0.00006248221,0.6820776,0.015710335,0.00038205215,0.00023006431,0.0000085003685,0.00003842242,0.09632743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998598,0.00004084338,0.0002453032,0.00043985975,0.00027428486,0.00040170012],"domain_scores_gemma":[0.9988549,0.000059053775,0.000055967455,0.0007414368,0.00014742784,0.00014123628],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016373863,0.00017172561,0.00019430468,0.00008673185,0.00015385836,0.00044483444,0.0010723404,0.000059019803,0.0024346816],"category_scores_gemma":[0.00002572547,0.000105000225,0.00008335733,0.0004394826,0.00006912316,0.0011495663,0.00035317903,0.0001408552,0.0015044184],"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.000011402732,0.00073017844,0.00041191658,0.00004136742,0.00006517271,0.00004129326,0.0011032367,0.0000056997624,0.02322575,0.1230764,0.12374094,0.72754663],"study_design_scores_gemma":[0.0014897091,0.00034787282,0.020422436,0.00014987068,0.000012239195,0.00013689468,0.000049136575,0.7878472,0.015021156,0.06663501,0.106651,0.001237441],"about_ca_topic_score_codex":0.00040198953,"about_ca_topic_score_gemma":0.0000062857166,"teacher_disagreement_score":0.78784156,"about_ca_system_score_codex":0.000027220849,"about_ca_system_score_gemma":0.00010326031,"threshold_uncertainty_score":0.999273},"labels":[],"label_agreement":null},{"id":"W2079817983","doi":"10.1016/j.dam.2013.03.028","title":"Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Universidad Nacional de Rosario; Consejo Nacional de Investigaciones Científicas y Técnicas; Agencia Nacional de Promoción Científica y Tecnológica; University of Waterloo","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Operator (biology); Hierarchy; Set (abstract data type); Relaxation (psychology); Birkhoff polytope; Regular polygon; Convex polytope; Discrete mathematics; Convex set; Convex optimization; Mathematical optimization; Computer science","score_opus":0.020210425048021223,"score_gpt":0.24943018901719527,"score_spread":0.22921976396917404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079817983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043443784,0.00048792624,0.9185532,0.0023474444,0.0008495175,0.0023597928,0.00007534251,0.00044112297,0.03144188],"genre_scores_gemma":[0.5301964,0.000050708175,0.46856883,0.00043514196,0.00012579419,0.00018967023,0.000013394779,0.000028190192,0.00039180642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986231,0.000018310258,0.00035525855,0.0002545057,0.00048204797,0.00026682866],"domain_scores_gemma":[0.99850506,0.00031165962,0.0003140876,0.00073904544,0.00007061661,0.000059527818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001543649,0.00016826736,0.00020382057,0.000075996024,0.00026619853,0.00013544703,0.0008040375,0.000055632536,0.000057275887],"category_scores_gemma":[0.000049800827,0.00011668023,0.00010610708,0.00044258262,0.00013235451,0.00051196956,0.00029199055,0.00022240357,0.000107286614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014228582,0.00010182347,0.000030356483,0.00006829491,0.000021360764,2.260267e-7,0.0007739148,0.0003925764,0.0008859453,0.991583,0.00040040383,0.005740693],"study_design_scores_gemma":[0.00034988442,0.00006055912,0.0006154577,0.00013450635,0.00002318585,0.000008013955,0.00073515147,0.03730858,0.007760743,0.9422966,0.010341799,0.00036549108],"about_ca_topic_score_codex":0.000015045589,"about_ca_topic_score_gemma":0.000003242292,"teacher_disagreement_score":0.48675266,"about_ca_system_score_codex":0.000022922364,"about_ca_system_score_gemma":0.00004039495,"threshold_uncertainty_score":0.47580817},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"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":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","score_opus":0.03735851513923256,"score_gpt":0.2758705309087951,"score_spread":0.23851201576956255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082030917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053284755,0.00020052448,0.9869441,0.0015451192,0.0019531357,0.00032285048,0.000002121888,0.00012667394,0.0035770298],"genre_scores_gemma":[0.8245104,0.00009156752,0.17093922,0.0017798145,0.0022680121,0.000009815321,0.0000021086967,0.00002786841,0.0003712128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981299,0.000031951036,0.000590672,0.00021118688,0.00048214302,0.00055415626],"domain_scores_gemma":[0.99820286,0.0005657402,0.00038906236,0.00042649344,0.00026463208,0.00015121906],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012763261,0.00020342116,0.00022004356,0.00016920861,0.00134324,0.0010399347,0.0015923786,0.000058150294,0.0000058379205],"category_scores_gemma":[0.000083177445,0.00012709097,0.00021628874,0.0005340611,0.000054069373,0.00045342697,0.00026990712,0.0005200314,0.00003258222],"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.000029446683,0.00008942838,0.0007334592,0.000032878983,0.00009850973,0.0000749122,0.0011652695,0.023644174,0.000014231357,0.11363075,0.005762297,0.85472465],"study_design_scores_gemma":[0.0008650203,0.00036480877,0.0006813024,0.00015135108,0.0000134356005,0.0021403555,0.00018727517,0.8733663,0.000059058402,0.023153692,0.09872011,0.00029728067],"about_ca_topic_score_codex":0.0000066401103,"about_ca_topic_score_gemma":0.000004280385,"teacher_disagreement_score":0.85442734,"about_ca_system_score_codex":0.00007282432,"about_ca_system_score_gemma":0.00009814614,"threshold_uncertainty_score":0.9999971},"labels":[],"label_agreement":null},{"id":"W2082591216","doi":"10.1145/1993636.1993662","title":"Correlation testing for affine invariant properties on F <sub>p</sub> <sup>n</sup> in the high error regime","year":2011,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Affine transformation; Property testing; Invariant (physics); Correlation; Mathematics; Constant (computer programming); Correlation function (quantum field theory); Degree (music); Discrete mathematics; Combinatorics; Pure mathematics; Statistics; Computer science; Physics; Geometry","score_opus":0.09785208904460113,"score_gpt":0.23437686740069175,"score_spread":0.13652477835609061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082591216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4719441,0.000056041477,0.5097992,0.003419628,0.00046578658,0.0015888525,0.000005124204,0.00044478342,0.012276518],"genre_scores_gemma":[0.93855214,0.0000014396444,0.060396377,0.00073444,0.00008818397,0.00009804229,0.0000027766384,0.0000096321055,0.00011694902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.00010195505,0.00027724213,0.0003723102,0.00024348027,0.00030339818],"domain_scores_gemma":[0.9988769,0.00037661445,0.000086849155,0.000529466,0.000091710644,0.000038459657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069223903,0.00016093429,0.00014947672,0.00014718118,0.00022831034,0.000116525705,0.00087120535,0.00006250574,0.000009377562],"category_scores_gemma":[0.00028366403,0.00010245919,0.00005599689,0.00058904995,0.000070003356,0.00040607367,0.00015384401,0.00019027632,0.000034842593],"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.00009583752,0.00060446357,0.0008215709,0.000053467702,0.000025468924,0.000028577588,0.014558426,0.00567947,0.0023147333,0.8509028,0.002209672,0.12270554],"study_design_scores_gemma":[0.0005018419,0.00058638654,0.0063622184,0.00010479634,0.000007709657,0.000026981163,0.00028626807,0.93641424,0.009083442,0.04614321,0.0002180175,0.00026486724],"about_ca_topic_score_codex":0.0002259765,"about_ca_topic_score_gemma":0.00007194835,"teacher_disagreement_score":0.9307348,"about_ca_system_score_codex":0.00002712631,"about_ca_system_score_gemma":0.00005189141,"threshold_uncertainty_score":0.41781646},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","score_opus":0.11490132143911759,"score_gpt":0.2635967916886539,"score_spread":0.14869547024953633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083246371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020066627,0.000017972254,0.9956871,0.001567013,0.00007340178,0.0006999707,1.5873468e-7,0.00032545565,0.0014282133],"genre_scores_gemma":[0.02076829,2.6505413e-7,0.97856057,0.00010989555,0.000051320934,0.00012957906,9.28056e-7,0.000010803051,0.00036836806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.000033937376,0.00022439184,0.0003399907,0.00023088414,0.000333992],"domain_scores_gemma":[0.999185,0.00010414068,0.000043866443,0.0003868657,0.000034095225,0.0002460339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018152848,0.00014118344,0.00016907259,0.000096901014,0.00012620201,0.00047405474,0.0005880952,0.00005048281,0.00011985653],"category_scores_gemma":[0.00011152696,0.000120514924,0.000070500966,0.00052394613,0.000031254593,0.0004388316,0.0003193713,0.00011560225,0.00044577674],"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":[8.2568613e-7,0.00018416201,0.000016761502,0.000034680612,0.000016449663,0.0000018259382,0.0026007842,0.002400974,0.000008788343,0.3470771,0.00019963161,0.647458],"study_design_scores_gemma":[0.00017257073,0.000067313274,0.00006936483,0.000035657315,0.0000044703224,0.000010479356,0.00013068353,0.8930049,0.00018792707,0.10565695,0.00045324897,0.0002064075],"about_ca_topic_score_codex":0.000029051105,"about_ca_topic_score_gemma":0.0000016508055,"teacher_disagreement_score":0.89060396,"about_ca_system_score_codex":0.000027765429,"about_ca_system_score_gemma":0.000025052886,"threshold_uncertainty_score":0.5729707},"labels":[],"label_agreement":null},{"id":"W2084170146","doi":"10.1016/j.tcs.2014.07.025","title":"A second look at counting triangles in graph streams","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Streaming algorithm; Combinatorics; Mathematics; Constant (computer programming); Graph; Space (punctuation); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Computer science","score_opus":0.00985627178227796,"score_gpt":0.2302904869943695,"score_spread":0.22043421521209153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084170146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21247253,0.000025805,0.7776448,0.00043473666,0.00057328865,0.00013489791,0.0000014967434,0.00017255238,0.00853988],"genre_scores_gemma":[0.8919209,0.0000021721355,0.10728691,0.0006374636,0.00011743835,0.0000063345497,5.590311e-7,0.000006794355,0.000021403772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970539,0.00017621697,0.00037230868,0.0009122223,0.00071132724,0.0007740237],"domain_scores_gemma":[0.99805987,0.00055887114,0.00008615767,0.0009436373,0.000105038715,0.0002464394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026394436,0.0002195597,0.00028771439,0.00040677862,0.0004761862,0.00048532305,0.0029446434,0.000060551753,0.00012959643],"category_scores_gemma":[0.00011661254,0.0001911647,0.000095363415,0.0019186717,0.0027241893,0.0006892288,0.0017813802,0.00025412074,0.000082983504],"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.000005131828,0.000053024174,0.00020538601,0.0000075262237,0.0000017962947,0.000012288688,0.0003337627,0.0001008569,0.00017756589,0.9288168,0.0000384088,0.07024744],"study_design_scores_gemma":[0.00039584324,0.00013337348,0.0016389231,0.000035335033,0.0000014758632,0.000046297282,0.000004702378,0.61794776,0.001572218,0.37750435,0.00047836438,0.00024139528],"about_ca_topic_score_codex":0.0000058622595,"about_ca_topic_score_gemma":0.000020063602,"teacher_disagreement_score":0.6794484,"about_ca_system_score_codex":0.000084904175,"about_ca_system_score_gemma":0.00007162323,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W2084297766","doi":"10.5555/1283383.1283481","title":"A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths","year":2007,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Shortest path problem; Computer science; Spanning tree; Mathematics; Discrete mathematics; Graph","score_opus":0.018221203110816934,"score_gpt":0.2519232261339546,"score_spread":0.2337020230231377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084297766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007331586,0.00012059374,0.9835367,0.00025477642,0.0005594122,0.00067006756,0.000013873397,0.0007557526,0.0067572277],"genre_scores_gemma":[0.1570854,0.000010589967,0.84009045,0.00083647517,0.00016735775,0.00006951764,0.00002137903,0.000040544975,0.0016782865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972997,0.00004576025,0.00041457213,0.0008244503,0.0004966334,0.0009189199],"domain_scores_gemma":[0.9979994,0.0004318112,0.00011717168,0.00086662936,0.0003007995,0.00028418156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007303391,0.00037042407,0.00035976386,0.0004036685,0.00040717423,0.0003699839,0.0011260895,0.00013192737,0.000036341742],"category_scores_gemma":[0.000028578945,0.00029651946,0.00019040769,0.0013493914,0.00020089625,0.0005791303,0.0002306215,0.00025231688,0.000021444781],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045577654,0.0005547921,0.00095568824,0.000018762541,0.00017505397,0.00011154401,0.0010846008,0.000009156343,0.00016554791,0.15924847,0.002492471,0.8351383],"study_design_scores_gemma":[0.008288416,0.003995551,0.020641563,0.00023157154,0.00018324889,0.0009313018,0.00085069763,0.6947274,0.010647327,0.1846711,0.070790455,0.004041324],"about_ca_topic_score_codex":0.00013793688,"about_ca_topic_score_gemma":0.0006613057,"teacher_disagreement_score":0.831097,"about_ca_system_score_codex":0.00006579144,"about_ca_system_score_gemma":0.00013504128,"threshold_uncertainty_score":0.9999487},"labels":[],"label_agreement":null},{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.04795850184395449,"score_gpt":0.28200055814693564,"score_spread":0.23404205630298114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086070368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45819914,0.0002374774,0.5351335,0.0009961776,0.00077584165,0.00014864186,0.000013878313,0.00019370634,0.0043016495],"genre_scores_gemma":[0.9601241,0.0000021146993,0.039103568,0.00051678496,0.000052562555,0.000008996541,0.000026173617,0.000008213688,0.00015750469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984786,0.00008178556,0.00025086515,0.00037195015,0.000560707,0.00025609366],"domain_scores_gemma":[0.99892354,0.00040334638,0.00006517048,0.0003130068,0.00013549854,0.00015946613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034575467,0.0001538877,0.0001688417,0.00078361714,0.00007448826,0.00011897146,0.0007253351,0.00005220086,0.000024184834],"category_scores_gemma":[0.00010675118,0.00014818496,0.00007171154,0.0020769816,0.00007734434,0.000302187,0.00022467985,0.00020265064,0.00015070033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023022632,0.00026738548,0.0037152332,0.000005191102,0.000016605405,0.000039219554,0.00029470958,0.19203901,0.000005615332,0.7757293,0.0020099431,0.025854768],"study_design_scores_gemma":[0.0008159732,0.00021054319,0.051583927,0.000024626352,0.0000018406963,0.000016903456,0.000042244188,0.27869847,0.000010985198,0.667039,0.0013359571,0.00021952615],"about_ca_topic_score_codex":0.000024431307,"about_ca_topic_score_gemma":0.000024739371,"teacher_disagreement_score":0.50192493,"about_ca_system_score_codex":0.00004203895,"about_ca_system_score_gemma":0.00009499367,"threshold_uncertainty_score":0.60428077},"labels":[],"label_agreement":null},{"id":"W2086467753","doi":"10.1109/focs.2011.86","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":122,"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; Computer science; Theoretical computer science; Generalization; Pointer (user interface); Function (biology); Discrete mathematics; Mathematics","score_opus":0.053901524843162935,"score_gpt":0.2720959378801884,"score_spread":0.21819441303702544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086467753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008993297,0.00014113337,0.91157824,0.00037465658,0.0005549006,0.00027053262,0.000004971136,0.0005282698,0.08564799],"genre_scores_gemma":[0.3160688,0.00039276286,0.6817726,0.0010927694,0.000046475237,0.00010796883,0.00014903148,0.000008169464,0.00036142027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888074,0.00010450126,0.00042993596,0.00016953533,0.00024327569,0.0001720053],"domain_scores_gemma":[0.99736226,0.000066001965,0.00029731775,0.0020440805,0.0001682431,0.00006208724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046596007,0.0001687384,0.00020955336,0.00019732663,0.00012593596,0.0003908972,0.0027298625,0.00017197906,0.000116521514],"category_scores_gemma":[0.00003910668,0.00015993591,0.00012422817,0.00017575335,0.000058635873,0.001027037,0.004130815,0.0004397461,0.00026220866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026558691,0.00004116719,0.000031689742,0.000048361217,0.000029242283,3.4044646e-7,0.0028565058,0.00006327207,0.0000030499657,0.89013124,0.0038247893,0.10296767],"study_design_scores_gemma":[0.00025502837,0.000023703044,0.0013538343,0.00008810007,0.000010213915,0.0000044178755,0.00005762763,0.075758256,0.0005106397,0.9069941,0.014512662,0.00043139255],"about_ca_topic_score_codex":0.0003767522,"about_ca_topic_score_gemma":0.000018663177,"teacher_disagreement_score":0.31516948,"about_ca_system_score_codex":0.000031210144,"about_ca_system_score_gemma":0.00008987241,"threshold_uncertainty_score":0.6521997},"labels":[],"label_agreement":null},{"id":"W2086871104","doi":"10.1007/s10878-013-9673-1","title":"An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Combinatorics; Semidefinite programming; Approximation algorithm; Mathematics; Maximum cut; Theory of computation; Semidefinite embedding; Bisection; Vertex (graph theory); Discrete mathematics; Graph; Algorithm; Mathematical optimization; Computer science","score_opus":0.015056568378776166,"score_gpt":0.2445863574433526,"score_spread":0.22952978906457644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086871104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012885135,0.000071869836,0.9926343,0.00021354923,0.004796506,0.0008446702,0.0000018571584,0.00011321943,0.000035499736],"genre_scores_gemma":[0.032445017,0.00004500635,0.9666787,0.000030084915,0.0006588617,0.00008995759,0.000020829004,0.000023132017,0.000008403312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980664,0.00017064594,0.0007609035,0.0002668342,0.00041952016,0.00031564783],"domain_scores_gemma":[0.9974551,0.00016101907,0.0008777716,0.00027254698,0.0010790678,0.00015448206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132117,0.00020387785,0.0003057068,0.00058483623,0.0003786696,0.0009711463,0.0006065385,0.00012686913,0.0000058941446],"category_scores_gemma":[0.000120040684,0.00019061686,0.00018576729,0.00085485156,0.00005282599,0.0040556868,0.000060324972,0.00025114111,9.3927264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045176883,0.00077285734,0.00008809759,0.00010743442,0.00011937749,0.0000019766223,0.0014882048,0.15197183,0.0015949603,0.042557098,0.00014467537,0.8011083],"study_design_scores_gemma":[0.0013088534,0.0009285496,0.000034765024,0.000054927015,0.000020976551,0.000032814172,0.00006222641,0.82174003,0.00047050675,0.1748736,0.0002811594,0.0001916157],"about_ca_topic_score_codex":0.00002550823,"about_ca_topic_score_gemma":4.706136e-7,"teacher_disagreement_score":0.8009167,"about_ca_system_score_codex":0.00010516024,"about_ca_system_score_gemma":0.000096940166,"threshold_uncertainty_score":0.9364786},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"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":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.23880768254068685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087012565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84838426,0.002847986,0.13158035,0.00505474,0.0023242661,0.00034473347,0.000009663257,0.00003433465,0.009419691],"genre_scores_gemma":[0.9792139,0.00003357126,0.020161351,0.0004775358,0.0000887865,4.5817316e-7,4.7903697e-8,0.000003109114,0.000021256159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980303,0.00012743485,0.00089047384,0.00014069355,0.00058213656,0.00022896573],"domain_scores_gemma":[0.99766284,0.00035421315,0.0010200986,0.00049225305,0.00039133462,0.00007927986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022652948,0.00011767475,0.00037859633,0.00012285766,0.00007516644,0.000021824288,0.0016991099,0.000063990105,0.000010294302],"category_scores_gemma":[0.00021296216,0.00006933483,0.00030931976,0.0007311548,0.00070056494,0.0002485157,0.00022980807,0.00028433738,9.838288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014920472,0.0015366576,0.063765705,0.00033781907,0.00024275825,0.00008995833,0.004382393,0.0002134574,0.19006,0.6483621,0.0017752677,0.089084655],"study_design_scores_gemma":[0.0010064478,0.0007950436,0.04791941,0.00022228542,0.00005128641,0.00087365834,0.00029757895,0.00022546496,0.47771963,0.4670812,0.0035229633,0.0002850569],"about_ca_topic_score_codex":0.000035263736,"about_ca_topic_score_gemma":0.0000092835235,"teacher_disagreement_score":0.28765962,"about_ca_system_score_codex":0.000024640856,"about_ca_system_score_gemma":0.00022392998,"threshold_uncertainty_score":0.31573972},"labels":[],"label_agreement":null},{"id":"W2089329646","doi":"10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Oracle; Linear programming; Mathematics; Polynomial; Convergence (economics); Time complexity; Algorithm; Construct (python library); Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.07014629511236242,"score_gpt":0.3576475601690094,"score_spread":0.28750126505664697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09720608,0.00012250204,0.86945266,0.030017942,0.00045849083,0.0024205968,0.00013389508,0.00013191752,0.00005591966],"genre_scores_gemma":[0.30119166,0.0000632624,0.6818416,0.004704678,0.0036871196,0.0029406713,0.00016732627,0.00008050328,0.005323182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972105,0.00015792709,0.0004146176,0.00072662084,0.0004965003,0.0009938462],"domain_scores_gemma":[0.998297,0.00040291858,0.000031419517,0.0007126965,0.00035482322,0.00020119114],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011746817,0.00020601587,0.00023226073,0.00024531895,0.001784426,0.0010253702,0.0011717693,0.000102055405,0.000103727],"category_scores_gemma":[0.00012597571,0.00021190685,0.00018184968,0.00062478083,0.00022998828,0.00056078995,0.00014974075,0.00039464625,0.000030702766],"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.0003622126,0.0003754763,0.000050248367,0.00006122686,0.00015228303,0.000010809471,0.0022643148,0.30903888,0.0139826555,0.002043738,0.2178665,0.45379168],"study_design_scores_gemma":[0.00080030545,0.00024226942,0.000032691798,0.0000213352,0.0000059039335,0.0000032908217,0.000046548437,0.83615035,0.0027599707,0.000013480269,0.15969573,0.00022811991],"about_ca_topic_score_codex":0.0007700888,"about_ca_topic_score_gemma":0.0004151894,"teacher_disagreement_score":0.5271115,"about_ca_system_score_codex":0.00014657022,"about_ca_system_score_gemma":0.00035972215,"threshold_uncertainty_score":0.9995151},"labels":[],"label_agreement":null},{"id":"W2090968858","doi":"10.1007/s00493-014-3035-1","title":"On the monotonicity of a data stream","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Omega; Upper and lower bounds; Monotonic function; Alphabet; Space (punctuation); Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.04818908662102291,"score_gpt":0.26956434263017376,"score_spread":0.22137525600915084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090968858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118010916,0.0002487076,0.8051745,0.009318976,0.0019300353,0.0005643325,0.000030357583,0.00042216762,0.064299956],"genre_scores_gemma":[0.99604714,0.000007219569,0.0036444,0.00023350437,0.000015050754,0.000004258854,0.000001918146,0.0000034587326,0.00004303598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00009703652,0.00013551809,0.0002745306,0.00023346678,0.00014512346],"domain_scores_gemma":[0.9970085,0.0006156782,0.00007535079,0.0022172113,0.00004247086,0.000040781426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044072227,0.00008055996,0.00012064073,0.00003976327,0.000121990706,0.00004439914,0.0032935243,0.000026117521,0.000013199288],"category_scores_gemma":[0.00016387779,0.000054723172,0.000037032107,0.00037447765,0.00007062631,0.00016870938,0.0009848799,0.00013283032,0.000023830018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012297767,0.00011146045,0.000059824783,0.000002913663,0.0000065413283,4.2943842e-7,0.000048764006,0.0000034315053,0.0000116113815,0.97190607,0.003483025,0.024364715],"study_design_scores_gemma":[0.00022490624,0.0002308062,0.0012641173,0.000015520367,0.000003896901,0.0000016178262,0.0000060196103,0.14045614,0.0008764637,0.8356619,0.021148853,0.0001097518],"about_ca_topic_score_codex":0.000025837393,"about_ca_topic_score_gemma":0.0000012852585,"teacher_disagreement_score":0.87803626,"about_ca_system_score_codex":0.000011573855,"about_ca_system_score_gemma":0.000023773187,"threshold_uncertainty_score":0.61202425},"labels":[],"label_agreement":null},{"id":"W2091923232","doi":"10.1007/s00453-009-9334-z","title":"Location-Oblivious Distributed Unit Disk Graph Coloring","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph coloring; Unit disk; Unit disk graph; Combinatorics; Edge coloring; Upper and lower bounds; Computer science; Graph; Chromatic scale; Fractional coloring; List coloring; Theory of computation; Mathematics; Discrete mathematics; Graph power; Algorithm; Line graph","score_opus":0.019290585026594205,"score_gpt":0.250780344982305,"score_spread":0.2314897599557108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091923232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060894256,0.00029830568,0.988337,0.0026303057,0.0005681598,0.00020759922,0.000017917566,0.0006219291,0.0012293508],"genre_scores_gemma":[0.9245485,0.00003173291,0.07437801,0.00063938,0.00020031673,0.000018396799,0.000039792947,0.000010940194,0.00013292796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982053,0.000064898435,0.00031708216,0.0005273819,0.00037844962,0.00050689664],"domain_scores_gemma":[0.9985273,0.00012954338,0.00010301527,0.0008301206,0.00021590377,0.00019415391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418494,0.0002312533,0.00022947571,0.0002121578,0.00037683797,0.0002885193,0.0013845002,0.000085643835,0.000017858923],"category_scores_gemma":[0.00006254525,0.00023387527,0.00011334938,0.0019938159,0.00009806469,0.0005985094,0.00019455144,0.00026186105,0.0000882146],"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.000011239316,0.00050756877,0.00043445418,0.000019485102,0.00006823043,0.000100937694,0.0005613577,0.0006082501,0.00022005924,0.4516241,0.0029906388,0.5428537],"study_design_scores_gemma":[0.0017911738,0.0008497329,0.080161,0.0001710847,0.00005333629,0.00020098985,0.00013116952,0.30769804,0.0043373853,0.56273293,0.04016069,0.001712469],"about_ca_topic_score_codex":0.0000454704,"about_ca_topic_score_gemma":0.0000079145875,"teacher_disagreement_score":0.91845906,"about_ca_system_score_codex":0.0000438269,"about_ca_system_score_gemma":0.00007582558,"threshold_uncertainty_score":0.9537157},"labels":[],"label_agreement":null},{"id":"W2093259407","doi":"10.1016/s0166-218x(02)00598-x","title":"Approximating covering integer programs with multiplicity constraints","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplicity (mathematics); Multiplicative function; Mathematics; Row and column spaces; Integer (computer science); Combinatorics; Linear programming relaxation; Discrete mathematics; Row; Integer programming; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.02111996281326427,"score_gpt":0.2295895729394317,"score_spread":0.2084696101261674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093259407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012645833,0.000009593461,0.94391876,0.000028264329,0.00005197666,0.0005075649,0.000002118589,0.00030844452,0.042527445],"genre_scores_gemma":[0.4701184,7.614559e-7,0.52974105,0.000040290484,0.00000955236,0.00006172082,0.000002309475,0.000013347057,0.00001253203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843156,0.000018176293,0.00036284392,0.00040026766,0.00036522653,0.0004219132],"domain_scores_gemma":[0.9988561,0.00013088639,0.00019524676,0.000660264,0.000041463656,0.00011599651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039674662,0.00025577113,0.00030721372,0.000064876775,0.00020546859,0.00026552496,0.0006046424,0.00006180106,0.000019258077],"category_scores_gemma":[0.000041094787,0.00020115265,0.000068038615,0.00041157156,0.00024939422,0.00019205517,0.00017133549,0.0002335507,0.000028946903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000191458,0.00013185012,0.00004447685,0.00012331357,0.000033601336,0.000007819571,0.0025532593,0.0000709576,0.0002941372,0.98114043,0.0000060721145,0.015592145],"study_design_scores_gemma":[0.002439176,0.00023510467,0.00009984506,0.0005315922,0.00006322423,0.00032885864,0.0042632823,0.28626302,0.01612463,0.68643177,0.0013734318,0.0018460456],"about_ca_topic_score_codex":0.0000027286983,"about_ca_topic_score_gemma":0.0000035235244,"teacher_disagreement_score":0.4574726,"about_ca_system_score_codex":0.000029097717,"about_ca_system_score_gemma":0.000043799886,"threshold_uncertainty_score":0.82027674},"labels":[],"label_agreement":null},{"id":"W2093513625","doi":"10.1088/1742-6596/256/1/012006","title":"Mapping the MPM maximum flow algorithm on GPUs","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","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 Manitoba","funders":"","keywords":"Computer science; Speedup; Parallel computing; Exploit; CUDA; Parallelism (grammar); General-purpose computing on graphics processing units; Focus (optics); Algorithm; Computer graphics (images); Graphics","score_opus":0.03487252931024505,"score_gpt":0.24144227632260765,"score_spread":0.20656974701236258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093513625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009440825,0.000033435626,0.98122245,0.004463341,0.002918286,0.00007880374,0.0000063847815,0.000039665363,0.0017967878],"genre_scores_gemma":[0.6762133,0.00007900806,0.3209541,0.0006739091,0.0017927864,0.0000049525233,0.0000012856038,0.000016532013,0.0002640735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870354,0.00006184927,0.00032537043,0.0001719543,0.00048425072,0.00025301974],"domain_scores_gemma":[0.9985186,0.00013797314,0.0003317317,0.0005033138,0.00041430508,0.000094077215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040483227,0.00017111027,0.00024063041,0.0000811909,0.0002970209,0.00043832167,0.0015382315,0.000051921445,0.000033523134],"category_scores_gemma":[0.00004539871,0.00011390998,0.00017274778,0.0003783064,0.00023184494,0.00096157094,0.00020592815,0.000850053,0.000020226787],"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.0000054103466,0.00005560362,0.000016341457,0.000004631483,0.000028105007,0.000019934496,0.0013440013,0.000037266276,0.0018121979,0.19705452,0.00033559435,0.79928637],"study_design_scores_gemma":[0.00040176846,0.00043119793,0.0014995101,0.00009737093,0.000011222207,0.00030948687,0.0005432122,0.03051686,0.049390793,0.892343,0.024126306,0.00032927547],"about_ca_topic_score_codex":0.0000055679957,"about_ca_topic_score_gemma":0.000007339673,"teacher_disagreement_score":0.7989571,"about_ca_system_score_codex":0.0000126084915,"about_ca_system_score_gemma":0.00019193366,"threshold_uncertainty_score":0.4645114},"labels":[],"label_agreement":null},{"id":"W2096411231","doi":"10.1007/s10107-005-0668-2","title":"Optimal 3-terminal cuts and linear programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Minimum weight; Linear programming relaxation; Linear programming; Terminal (telecommunication); Combinatorics; Maximum cut; Minimum cut; Relaxation (psychology); Approximation algorithm; Mathematical optimization; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science","score_opus":0.027349089847701694,"score_gpt":0.28497923140448495,"score_spread":0.25763014155678327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096411231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035607576,0.00020481108,0.9609431,0.0012443612,0.00007421493,0.00040840675,6.000484e-7,0.00055697816,0.00095992174],"genre_scores_gemma":[0.14473435,0.0000034834861,0.8547391,0.00009271436,0.00018056027,0.000051021296,0.0000011153627,0.000014049067,0.00018354319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821347,0.00003963995,0.00036715582,0.00045741702,0.00035610117,0.00056618644],"domain_scores_gemma":[0.99905986,0.00015744814,0.000079450285,0.00042382814,0.000051844247,0.00022756806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004810137,0.00021889321,0.0002633114,0.00010317193,0.00026122067,0.00042555627,0.0005900282,0.00008069144,0.000028198267],"category_scores_gemma":[0.00009190659,0.00019253872,0.00009869347,0.00032527812,0.00019750456,0.000513818,0.00048562308,0.00026186497,0.00009231803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002611523,0.00020562774,0.00004837938,0.00008401298,0.000013503791,0.000034286975,0.000908608,0.000017313267,0.000018469858,0.10192646,0.000028146866,0.8967126],"study_design_scores_gemma":[0.0007389887,0.00038506757,0.00012397386,0.00023500885,0.000037052465,0.000995871,0.00020946832,0.81715876,0.0006765522,0.029173527,0.14946456,0.0008011725],"about_ca_topic_score_codex":0.0000023210578,"about_ca_topic_score_gemma":0.0000016759973,"teacher_disagreement_score":0.8959114,"about_ca_system_score_codex":0.000024268988,"about_ca_system_score_gemma":0.000023328907,"threshold_uncertainty_score":0.7851501},"labels":[],"label_agreement":null},{"id":"W2097734862","doi":"10.1007/978-3-319-14974-5_3","title":"Constant Approximation for Broadcasting in k-cycle Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Computer science; Time complexity; Vertex (graph theory); Discrete mathematics; Graph; Butterfly graph; Mathematics; Line graph; Voltage graph","score_opus":0.043736498008255215,"score_gpt":0.2718830829612063,"score_spread":0.22814658495295106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097734862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006035429,0.00055497047,0.99292785,0.00041588,0.0015237588,0.000716409,0.000012563567,0.0001443709,0.0036438445],"genre_scores_gemma":[0.05430977,0.000020649632,0.94463336,0.0005075257,0.00034768216,0.000036043766,0.000011510441,0.000032868167,0.00010059121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963724,0.000034348002,0.0006369463,0.0013967166,0.0008498828,0.0007097036],"domain_scores_gemma":[0.9975724,0.0006432705,0.0003032683,0.0009812999,0.00033696322,0.00016277158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017393872,0.00045274344,0.0005434323,0.0012891024,0.00022708256,0.00046653827,0.0025845706,0.00026294816,0.000006540227],"category_scores_gemma":[0.00019623515,0.00044796185,0.00014370932,0.0009771506,0.0006782246,0.0006809439,0.00094547373,0.0006369286,0.0000086614145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008106721,0.00003753803,0.000028697721,0.000059342157,0.000005848732,0.00003137863,0.00080131344,0.03298127,0.000034695495,0.183653,0.000025868769,0.78233296],"study_design_scores_gemma":[0.0002949993,0.00008513071,0.000014294274,0.00023661362,0.000002225303,0.000027983611,2.8063184e-7,0.4981445,0.00009818765,0.5001819,0.0005928231,0.00032103295],"about_ca_topic_score_codex":0.00003107437,"about_ca_topic_score_gemma":0.00014076258,"teacher_disagreement_score":0.7820119,"about_ca_system_score_codex":0.00030252634,"about_ca_system_score_gemma":0.0005641413,"threshold_uncertainty_score":0.9997972},"labels":[],"label_agreement":null},{"id":"W2098907131","doi":"10.1007/s00453-007-9013-x","title":"Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Vertex (graph theory); Approximation algorithm; Integer (computer science); Graph; Theory of computation; Tree (set theory); Binary logarithm; Discrete mathematics; Algorithm; Computer science","score_opus":0.011891468417320541,"score_gpt":0.23298884474574888,"score_spread":0.22109737632842835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098907131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059921805,0.0013698902,0.9080853,0.004141912,0.00080903043,0.00035788113,0.000008462656,0.0007067712,0.024598934],"genre_scores_gemma":[0.3871096,0.00003263359,0.60869706,0.0009443752,0.0005582512,0.00002090835,0.000008167101,0.000039454466,0.002589552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800855,0.000036953894,0.00040719108,0.00060303824,0.00037527297,0.0005690106],"domain_scores_gemma":[0.9987536,0.00023439714,0.00012287596,0.0006058076,0.00006859466,0.00021474675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065550423,0.00024317566,0.0002625369,0.00018728312,0.00040438867,0.00016244141,0.00078514934,0.00009892573,0.00004093852],"category_scores_gemma":[0.000052669984,0.00022270392,0.000094768984,0.000482652,0.00012284364,0.00038228507,0.0007524787,0.00021479331,0.000059232956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014557928,0.00017556544,0.0010930814,0.000039238577,0.00007919575,0.00017599635,0.0019709342,0.000011119785,0.004358932,0.08990022,0.0016323368,0.9005488],"study_design_scores_gemma":[0.0035953107,0.0007011171,0.027831798,0.00022799644,0.00007922239,0.0012453009,0.0004015835,0.5395602,0.04940075,0.067202225,0.3067721,0.0029823803],"about_ca_topic_score_codex":0.0001903817,"about_ca_topic_score_gemma":0.0004222261,"teacher_disagreement_score":0.89756644,"about_ca_system_score_codex":0.000063332525,"about_ca_system_score_gemma":0.000035160945,"threshold_uncertainty_score":0.90816027},"labels":[],"label_agreement":null},{"id":"W2099335235","doi":"10.1007/s10107-007-0106-8","title":"Approximation algorithms for general packing problems and their application to the multicast congestion problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Solver; Approximation algorithm; Mathematics; Block (permutation group theory); Steiner tree problem; Logarithm; Combinatorics; Regular polygon; Algorithm; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.04118625576138175,"score_gpt":0.2885665262119343,"score_spread":0.24738027045055255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099335235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031238857,0.00005075298,0.992243,0.001691848,0.000060692648,0.0024748717,0.0000019652266,0.00021937766,0.00013362613],"genre_scores_gemma":[0.15107733,0.0000011334105,0.84805304,0.0001161486,0.00013369914,0.00057534035,0.0000064660844,0.00001387599,0.000022958455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856627,0.00003293559,0.00037408705,0.00040014368,0.00020860018,0.00041794585],"domain_scores_gemma":[0.9988758,0.00039764756,0.0001080434,0.00036915287,0.00012382395,0.00012551477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018247295,0.00017467517,0.0001774761,0.00008630644,0.00037967833,0.00035726218,0.00042551896,0.00006688501,9.761501e-7],"category_scores_gemma":[0.000112973175,0.00011510906,0.00006336626,0.0003927211,0.00008504967,0.00023172105,0.00019696065,0.00013082224,0.000008998682],"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.0000028896366,0.00007467062,0.000010529768,0.000106136846,0.00000893914,2.2072179e-7,0.0023519357,0.00006965149,0.00035485197,0.24234362,0.000008288049,0.7546683],"study_design_scores_gemma":[0.0002560866,0.0001239984,0.00012146833,0.00007406611,0.000009316369,0.000031726348,0.00021472301,0.77224326,0.0009751397,0.21572252,0.01001575,0.0002119693],"about_ca_topic_score_codex":0.0000070993924,"about_ca_topic_score_gemma":0.00001276444,"teacher_disagreement_score":0.7721736,"about_ca_system_score_codex":0.000034219756,"about_ca_system_score_gemma":0.000009896177,"threshold_uncertainty_score":0.46940112},"labels":[],"label_agreement":null},{"id":"W2100899479","doi":"10.1109/icccn.2005.1523811","title":"A simple method for balancing network utilization and quality of routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Alberta","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Shortest path problem; Simple (philosophy); Mathematical optimization; Static routing; Variation (astronomy); Path length; Computer network; Mathematics; Routing protocol; Theoretical computer science","score_opus":0.07856902607221865,"score_gpt":0.3529619154026413,"score_spread":0.27439288933042266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100899479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045126183,0.000076340475,0.9937854,0.000064457985,0.000065573855,0.00010224751,0.00000191088,0.000059937385,0.0013315192],"genre_scores_gemma":[0.36493245,0.0000013571942,0.6349002,0.000064092994,0.000055739452,0.0000031093973,0.0000027699339,0.000001935532,0.00003831197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930954,0.00006149575,0.00022524649,0.00017216736,0.00008737231,0.00014415667],"domain_scores_gemma":[0.9992639,0.00041398845,0.00008833591,0.0001590756,0.000056833396,0.000017857374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089298986,0.000053329917,0.00012538047,0.000024560062,0.00010641798,0.00004073617,0.00014690563,0.000023697887,0.000003246428],"category_scores_gemma":[0.00004507702,0.00004943158,0.000038091363,0.00022945175,0.00001644722,0.00012825885,0.00010112878,0.000025684674,1.2587472e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021123653,0.00001243197,0.005436702,0.000021472904,0.0000034156142,5.5483596e-8,0.000057921123,0.000798153,0.0002287047,0.9475353,0.00022176951,0.045681957],"study_design_scores_gemma":[0.00017784305,0.000019758034,0.025422463,0.0000070931414,0.0000020703906,7.754862e-7,0.000017864035,0.7696336,0.001101134,0.20267606,0.00087257626,0.000068792986],"about_ca_topic_score_codex":0.00056004757,"about_ca_topic_score_gemma":0.00019502612,"teacher_disagreement_score":0.7688354,"about_ca_system_score_codex":0.000005706219,"about_ca_system_score_gemma":0.000011705801,"threshold_uncertainty_score":0.20157613},"labels":[],"label_agreement":null},{"id":"W2102501261","doi":"10.1007/978-3-642-13036-6_9","title":"On Generalizations of Network Design Problems with Degree Bounds","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Spanning tree; Degree (music); Matroid; Computer science; Relaxation (psychology); Combinatorial optimization; Mathematical optimization; Intersection (aeronautics); Network planning and design; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04049474481597431,"score_gpt":0.2365318855826842,"score_spread":0.1960371407667099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102501261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021907917,0.00018912107,0.99541855,0.00027851138,0.0012571296,0.00049058074,0.0000043456034,0.00012361075,0.0022162623],"genre_scores_gemma":[0.013139169,0.000026008996,0.9855034,0.000701624,0.00036610736,0.000014505635,0.0000046523264,0.000033536526,0.00021104015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965658,0.000047648857,0.00048625795,0.0012291468,0.001037543,0.00063359697],"domain_scores_gemma":[0.9968506,0.0006379689,0.00037531398,0.0016470836,0.0003371007,0.0001519037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008393694,0.0005000408,0.0005242057,0.0006582404,0.00042870487,0.00038419524,0.0034226563,0.00030990882,0.000025493831],"category_scores_gemma":[0.000044881413,0.00040631893,0.00011091925,0.0011531336,0.0013189274,0.00034884168,0.0007293565,0.00097483094,0.000009348316],"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.000007707898,0.00004523413,0.000021494017,0.000026870546,0.000016600308,0.000024211708,0.00032242096,0.5901599,0.00007191351,0.24691017,0.000032282715,0.16236117],"study_design_scores_gemma":[0.00020807133,0.00050874363,0.00005043828,0.00045060477,0.00000818107,0.000048397094,2.5808758e-8,0.42421973,0.00073614897,0.5724913,0.00080052525,0.0004778815],"about_ca_topic_score_codex":0.000020994827,"about_ca_topic_score_gemma":0.00021873033,"teacher_disagreement_score":0.32558107,"about_ca_system_score_codex":0.000086606546,"about_ca_system_score_gemma":0.0006358525,"threshold_uncertainty_score":0.9998389},"labels":[],"label_agreement":null},{"id":"W2103941607","doi":"","title":"Connectivity of Addable Monotone Graph Classes","year":2007,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02192203775542063,"score_gpt":0.264636965118337,"score_spread":0.2427149273629164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103941607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09406825,0.000063040745,0.8775564,0.00013215949,0.00020686004,0.00006834704,0.0000011504009,0.00012908301,0.02777471],"genre_scores_gemma":[0.8979473,0.000008442008,0.10167158,0.00011797293,0.000022408722,0.0000015733286,3.6929396e-7,0.0000027090616,0.00022764035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991754,0.000020316013,0.00018058195,0.00021380742,0.00018704105,0.00022279903],"domain_scores_gemma":[0.9991255,0.00026170062,0.000058754595,0.0004120961,0.000077607154,0.000064349115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900133,0.00007928003,0.00013883489,0.00014276606,0.000070227885,0.00002887202,0.00051436527,0.000037563488,0.0000533075],"category_scores_gemma":[0.000031878717,0.00007036509,0.000076856704,0.00062634016,0.000085038424,0.00029450696,0.000176192,0.00007968853,0.00001096475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006308116,0.0001638955,0.0032639068,0.000011029443,0.000017324615,0.000007669938,0.00013224118,0.000019185454,0.0019286624,0.9493851,0.0007444467,0.0443202],"study_design_scores_gemma":[0.00086362485,0.00037995938,0.10560883,0.000033473952,0.000009741563,0.00003798503,0.00018287923,0.026566902,0.30537954,0.54847735,0.011907937,0.00055176055],"about_ca_topic_score_codex":0.00018563935,"about_ca_topic_score_gemma":0.00013868649,"teacher_disagreement_score":0.8038791,"about_ca_system_score_codex":0.000009009484,"about_ca_system_score_gemma":0.00002406087,"threshold_uncertainty_score":0.2869405},"labels":[],"label_agreement":null},{"id":"W2105487310","doi":"10.1002/cpe.700","title":"Parallel computation on interval graphs: algorithms and experiments","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","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":"Dalhousie University","funders":"","keywords":"Computer science; Myrinet; Clique; Parallel computing; Interval (graph theory); Algorithm; Parallel algorithm; Interval graph; Interconnection; Computation; Graph; Implementation; Theoretical computer science; Mathematics; Chordal graph; Message passing; Combinatorics","score_opus":0.06738285749543127,"score_gpt":0.34179044454621843,"score_spread":0.27440758705078716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105487310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14873485,0.005485139,0.8402853,0.0019885325,0.0008314738,0.00031897475,0.000003990982,0.0001960703,0.0021556464],"genre_scores_gemma":[0.95015216,0.0012437124,0.04745019,0.0010388066,0.000037027963,0.00003842831,0.000004075331,0.000006865053,0.00002875015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842525,0.00014531592,0.00030279465,0.0006081272,0.00028081535,0.00023773106],"domain_scores_gemma":[0.99886787,0.00053311966,0.00017238273,0.00015963442,0.00010570202,0.0001612739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018514684,0.00021677295,0.00019642465,0.00013524794,0.00044884236,0.00043821777,0.00020424511,0.00006088245,0.000011548515],"category_scores_gemma":[0.000117880816,0.00021318652,0.00003124753,0.00029111476,0.00026006336,0.0017822206,0.00019927682,0.0001956031,0.000010751079],"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.000023972962,0.00024423323,0.00019691298,0.000025395144,0.000026726455,0.000027243977,0.030072138,0.000100470985,0.00004912364,0.069569014,0.0004333836,0.8992314],"study_design_scores_gemma":[0.0015136432,0.0008458076,0.0019274197,0.00011113193,0.000018921435,0.0003109009,0.0045299404,0.96345985,0.00015693376,0.019870749,0.006653933,0.00060078886],"about_ca_topic_score_codex":0.000022603508,"about_ca_topic_score_gemma":6.340219e-7,"teacher_disagreement_score":0.96335936,"about_ca_system_score_codex":0.000011461247,"about_ca_system_score_gemma":0.000009869441,"threshold_uncertainty_score":0.8693494},"labels":[],"label_agreement":null},{"id":"W2105659243","doi":"10.1007/978-3-642-31594-7_13","title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Submodular set function; Set function; Rank (graph theory); Maximization; Matroid partitioning; Combinatorics; Function (biology); Set (abstract data type); Weighted matroid; Computer science; Mathematics; Online algorithm; Competitive analysis; Constraint (computer-aided design); Discrete mathematics; Mathematical optimization; Algorithm; Graphic matroid; Upper and lower bounds","score_opus":0.03343926846114101,"score_gpt":0.2580674556177863,"score_spread":0.22462818715664531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105659243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026550688,0.00055642746,0.99357873,0.0007115085,0.0033897578,0.00097470003,0.000050808765,0.0002937023,0.00041779166],"genre_scores_gemma":[0.015072346,0.000065041786,0.98214716,0.0011927545,0.0011205213,0.00003213103,0.00018209327,0.000047138707,0.00014081986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961887,0.00004582979,0.0006887782,0.0013773341,0.00092346355,0.0007759013],"domain_scores_gemma":[0.99736595,0.00045717636,0.00044718376,0.0010624952,0.00047105653,0.00019612281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009366471,0.0005914379,0.0005493391,0.0010061784,0.0004351459,0.00049205514,0.0018607699,0.000357814,0.00005809529],"category_scores_gemma":[0.00004734509,0.00057199603,0.00021662374,0.0007415003,0.0008801202,0.0010996934,0.00059480895,0.00062287203,0.00002397388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631197,0.00007386937,0.0000069125654,0.000053045784,0.000020940675,0.0000027705335,0.00015816108,0.0067197816,0.00006824018,0.10846478,0.00001702123,0.88440186],"study_design_scores_gemma":[0.0004781167,0.00011721873,0.00011653563,0.00013912693,0.000019992687,0.00004351202,3.0986115e-7,0.6124345,0.0002508396,0.3849531,0.00096587837,0.00048084572],"about_ca_topic_score_codex":0.000008744444,"about_ca_topic_score_gemma":0.00002978328,"teacher_disagreement_score":0.883921,"about_ca_system_score_codex":0.00030135503,"about_ca_system_score_gemma":0.00033670128,"threshold_uncertainty_score":0.9996731},"labels":[],"label_agreement":null},{"id":"W2106960349","doi":"10.1109/reldis.1998.740525","title":"Practical parallel algorithms for minimum spanning trees","year":2002,"lang":"en","type":"article","venue":"","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanning tree; Minimum spanning tree; Computer science; Undirected graph; Computation; Graph algorithms; Graph theory; Parallel algorithm; Graph; Prim's algorithm; Simple (philosophy); Algorithm; Efficient algorithm; Distributed minimum spanning tree; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.13022202733975888,"score_gpt":0.3311332125426399,"score_spread":0.200911185202881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106960349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013329521,0.0001299474,0.98193306,0.008871618,0.0004061265,0.00018735958,0.0000021936125,0.00027941985,0.008056955],"genre_scores_gemma":[0.015238983,0.000018397383,0.97906166,0.00058524456,0.00019374017,0.00004244649,0.0000014285414,0.000008691052,0.004849408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987398,0.000030355284,0.00021145084,0.00040347505,0.00023030528,0.0003846149],"domain_scores_gemma":[0.9989163,0.00040153155,0.0000547827,0.00044075208,0.00006486767,0.00012171658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020017923,0.00013993432,0.00016234427,0.00008786461,0.00020976501,0.0002109787,0.00056587026,0.00006023542,0.00018082303],"category_scores_gemma":[0.000094932126,0.00012280556,0.00012939383,0.00026868796,0.00006424092,0.0005568338,0.00018348072,0.00011941855,0.00010365534],"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.000005388693,0.00028469804,0.00006458149,0.000010435808,0.00003564472,0.000029717963,0.00053426996,0.000056988505,0.000051643532,0.7242036,0.08683643,0.1878866],"study_design_scores_gemma":[0.00045103056,0.0001487261,0.00017579994,0.0000071058366,0.0000054573725,0.000048124177,0.000046723817,0.9081383,0.0001193378,0.020198127,0.07044895,0.0002123216],"about_ca_topic_score_codex":0.000010047525,"about_ca_topic_score_gemma":0.000007852241,"teacher_disagreement_score":0.9080813,"about_ca_system_score_codex":0.000014174468,"about_ca_system_score_gemma":0.0000148647005,"threshold_uncertainty_score":0.50078654},"labels":[],"label_agreement":null},{"id":"W2107526127","doi":"10.1145/1374376.1374440","title":"The VPN conjecture is true","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Conjecture; Combinatorics; Computer science; Routing (electronic design automation); Matrix (chemical analysis); Enhanced Data Rates for GSM Evolution; Graph theory; Set (abstract data type); Graph; Discrete mathematics; Undirected graph; Mathematics; Computer network","score_opus":0.02309272676516618,"score_gpt":0.22161664156401192,"score_spread":0.19852391479884574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107526127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014510905,0.0006655055,0.87355036,0.026826601,0.001258518,0.00017612822,0.0000024690144,0.00049756776,0.08251193],"genre_scores_gemma":[0.88480943,0.00028764742,0.084960066,0.008867557,0.00025688793,0.000013417228,6.881351e-7,0.0000094376155,0.020794885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994006,0.000020530868,0.00008491599,0.0001640118,0.00016058996,0.00016931823],"domain_scores_gemma":[0.9993138,0.00011687308,0.000019265706,0.00048249165,0.000025567477,0.00004202051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084249565,0.00006502679,0.00005760396,0.000020335889,0.00054855197,0.000078987505,0.0008545081,0.000025338726,0.00006806831],"category_scores_gemma":[0.000010495422,0.000037529066,0.000058266844,0.00023333666,0.000113481896,0.00011912254,0.00016804534,0.00009724651,0.000100480924],"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.0000013299706,0.000022181852,0.0002536708,0.0000012902908,0.000013680947,0.000023519386,0.001203513,0.00000578712,0.000022464255,0.8342436,0.0934692,0.07073975],"study_design_scores_gemma":[0.00030730217,0.000080259946,0.0052210684,0.0000039998026,0.0000018913178,0.00030836416,0.000043357457,0.049478125,0.003475013,0.1654084,0.7754198,0.00025247052],"about_ca_topic_score_codex":0.000025625128,"about_ca_topic_score_gemma":0.000013141701,"teacher_disagreement_score":0.8702985,"about_ca_system_score_codex":0.0000058046553,"about_ca_system_score_gemma":0.000031277654,"threshold_uncertainty_score":0.42190737},"labels":[],"label_agreement":null},{"id":"W2107613637","doi":"","title":"Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more","year":2016,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Subadditivity; Combinatorics; Bipartite graph; Partially ordered set; Mathematics; Discrete mathematics; Graph; Line graph; Matching (statistics)","score_opus":0.02192440881562315,"score_gpt":0.24638131422564905,"score_spread":0.2244569054100259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107613637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6966497,0.000120625875,0.298128,0.0037065917,0.0003125879,0.00030700836,0.0000062126464,0.00017115044,0.0005981398],"genre_scores_gemma":[0.92259735,0.000032034648,0.0769382,0.00014661819,0.000033931752,0.0000057664756,0.0000032672483,0.000006350665,0.00023647465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989987,0.000048885246,0.00020986826,0.00035631447,0.00023790982,0.00014833556],"domain_scores_gemma":[0.9991807,0.000042901658,0.000105462874,0.00048787863,0.00013081578,0.000052291507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751959,0.00011170574,0.00016019479,0.00015386357,0.00008177671,0.000045127264,0.00032280665,0.000043924298,0.000011157582],"category_scores_gemma":[0.00003626973,0.00006904333,0.000031504835,0.00042177227,0.00006478106,0.00054293504,0.00024981087,0.000054231597,0.000005392475],"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.000016300206,0.00017544835,0.0013654948,0.00021769186,0.00003715876,0.000006395573,0.0019008929,0.0000011203352,0.222619,0.5615599,0.002128731,0.20997185],"study_design_scores_gemma":[0.0022304729,0.0004786026,0.07896274,0.0010064233,0.00003512536,0.0001231573,0.00014677334,0.008191122,0.5047526,0.40048966,0.002454628,0.0011287051],"about_ca_topic_score_codex":0.000022121942,"about_ca_topic_score_gemma":0.000001575833,"teacher_disagreement_score":0.2821336,"about_ca_system_score_codex":0.000008079963,"about_ca_system_score_gemma":0.000019043115,"threshold_uncertainty_score":0.28155053},"labels":[],"label_agreement":null},{"id":"W2107744418","doi":"10.22215/etd/2011-09053","title":"Exploring the limits of GPUs with parallel graph algorithms","year":2011,"lang":"en","type":"preprint","venue":"","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":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Parallel computing; Graph; Parallel algorithm; CUDA; Graphics; Graph algorithms; Computation; General-purpose computing on graphics processing units; Theoretical computer science; Algorithm; Computer graphics (images)","score_opus":0.19433218209741415,"score_gpt":0.27407355760487867,"score_spread":0.07974137550746452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107744418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010602997,0.00036694916,0.9716113,0.0005987768,0.0016394305,0.00049789425,0.000007869091,0.00033449053,0.014340279],"genre_scores_gemma":[0.23931313,0.0008747487,0.75839293,0.00024481778,0.0002342932,0.00036355093,0.0000073629917,0.000040773582,0.0005283929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977412,0.00010341456,0.0004248002,0.0007677884,0.00055475644,0.00040800782],"domain_scores_gemma":[0.9970679,0.00016484625,0.00029080638,0.0021655867,0.00020229872,0.000108540145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041987066,0.00038484688,0.0004552682,0.00023777028,0.00017485477,0.00015974487,0.0036963427,0.00010168095,0.000024986462],"category_scores_gemma":[0.0000143162515,0.00023072957,0.00026513037,0.0005415735,0.00029282397,0.00037927498,0.0021160718,0.00074433757,0.000013741591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003477248,0.00034072748,0.00039360026,0.00020512145,0.0004597983,0.00005319411,0.006057854,0.002167303,0.000015399579,0.771983,0.0005439798,0.21774524],"study_design_scores_gemma":[0.0013666211,0.0009080069,0.024699716,0.0010707635,0.00017787538,0.0001608426,0.0006013274,0.06493224,0.009168156,0.89100283,0.003326333,0.0025852998],"about_ca_topic_score_codex":0.00057830865,"about_ca_topic_score_gemma":0.00008519652,"teacher_disagreement_score":0.22871013,"about_ca_system_score_codex":0.000016317374,"about_ca_system_score_gemma":0.00013145676,"threshold_uncertainty_score":0.94088787},"labels":[],"label_agreement":null},{"id":"W2108031738","doi":"10.5555/1496770.1496847","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"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":"Rounding; Bounded function; Approximation algorithm; Mathematics; Bottleneck; Logarithm; Linear programming; Time complexity; Multiplicative function; Discrete mathematics; Mathematical optimization; Linear programming relaxation; Dynamic programming; Randomized rounding; Combinatorics; Maximum flow problem; Computer science","score_opus":0.0520818013227625,"score_gpt":0.30581168286373545,"score_spread":0.2537298815409729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108031738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1540766,0.00035895008,0.8010649,0.024196696,0.00024616838,0.0026010734,0.0001225191,0.0014145103,0.015918566],"genre_scores_gemma":[0.80623233,0.00008988563,0.19239135,0.000055688455,0.000028869203,0.000003847389,0.000027431455,0.000009957589,0.0011606384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981045,0.000052419895,0.00019103043,0.0005376222,0.00053386315,0.00058055366],"domain_scores_gemma":[0.99844885,0.000112651534,0.000113768474,0.0008143144,0.00040728887,0.00010312465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085974386,0.00015250023,0.00027390642,0.001503883,0.00046196335,0.000037657508,0.0018124625,0.00025287055,0.000030619176],"category_scores_gemma":[0.00013074085,0.00017261578,0.00015663066,0.0020470987,0.00037726012,0.00035337108,0.00034000174,0.000548427,0.000022364136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010647984,0.000607176,0.00008488381,0.000050498504,0.000054567747,0.0001080713,0.00021087106,0.0002631828,0.0016835437,0.7724913,0.0035531255,0.22078635],"study_design_scores_gemma":[0.0022237333,0.004369976,0.0008575973,0.0001980381,0.000018866202,0.000037638514,0.00069917575,0.15973206,0.015242584,0.7986712,0.017474113,0.00047500824],"about_ca_topic_score_codex":0.000053207877,"about_ca_topic_score_gemma":0.00003218729,"teacher_disagreement_score":0.6521557,"about_ca_system_score_codex":0.000077552024,"about_ca_system_score_gemma":0.00013822953,"threshold_uncertainty_score":0.7039067},"labels":[],"label_agreement":null},{"id":"W2109533535","doi":"10.1109/sfcs.2001.959928","title":"Tight approximation results for general covering integer programs","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Linear programming relaxation; Rounding; Multiplicative function; Approximation algorithm; Mathematics; Upper and lower bounds; Integer (computer science); Randomized rounding; Discrete mathematics; Cover (algebra); Binary logarithm; Multiplicity (mathematics); Linear programming; Algorithm; Computer science","score_opus":0.04364182730979306,"score_gpt":0.270655222080916,"score_spread":0.22701339477112298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109533535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070514805,0.000014074298,0.9776914,0.000963674,0.0003145363,0.0002763744,0.0000016401405,0.00025632267,0.0134305],"genre_scores_gemma":[0.14954704,0.0000077237855,0.8467845,0.00032040657,0.00022767889,0.000082766506,0.00002649312,0.000007130986,0.0029963101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.000013711971,0.00018104604,0.00027120576,0.0001368043,0.00021593104],"domain_scores_gemma":[0.99950814,0.00004013842,0.000044979097,0.00030553015,0.00005207355,0.000049129212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021946798,0.000084858926,0.00008423375,0.000059704074,0.000112527,0.00018859349,0.00042023326,0.000033945358,0.000005728497],"category_scores_gemma":[0.000020551955,0.000071309194,0.00006556684,0.00027939337,0.00002478911,0.00038940573,0.00011540214,0.000054337157,0.000014546094],"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.000025079184,0.00010021641,0.000102569655,0.000011773135,0.000011497198,0.0000033990661,0.00041558116,0.00010450185,0.00010487617,0.6461326,0.0017060149,0.3512819],"study_design_scores_gemma":[0.000682162,0.00013261131,0.00049302366,0.000015082413,0.0000022839558,0.000016543243,0.000011682043,0.81812596,0.0011784465,0.08174228,0.09741353,0.00018636676],"about_ca_topic_score_codex":0.000028852846,"about_ca_topic_score_gemma":0.000022178721,"teacher_disagreement_score":0.8180215,"about_ca_system_score_codex":0.000019900674,"about_ca_system_score_gemma":0.000015765952,"threshold_uncertainty_score":0.29079047},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"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":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","score_opus":0.12490418339223444,"score_gpt":0.40555843590576174,"score_spread":0.28065425251352727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110504071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030798414,0.0005467168,0.9878349,0.007297743,0.0003977502,0.00041221894,0.0000031493662,0.000019879253,0.0004078431],"genre_scores_gemma":[0.9197697,0.00017487096,0.07928893,0.00005652166,0.00048110916,0.000024051136,7.530057e-7,0.000016140197,0.00018790111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655145,0.00033049827,0.00078892667,0.00027564922,0.001325693,0.000727761],"domain_scores_gemma":[0.9954527,0.002152234,0.00015182978,0.0004697648,0.0016445179,0.00012897048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007878719,0.0001306616,0.00021895996,0.00048565754,0.0006953015,0.00054044515,0.0025247142,0.00009008148,0.00003243525],"category_scores_gemma":[0.00014091814,0.00008793006,0.0002500847,0.0013386625,0.0006735318,0.00042846,0.00035989098,0.0010481116,0.000044644945],"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.00007634742,0.0001923622,0.000015726719,0.00002262247,0.000021849253,0.00003178425,0.0002881316,0.010313403,0.0010380291,0.41806814,0.0006457413,0.56928587],"study_design_scores_gemma":[0.000034588742,0.0004752713,0.00006508361,0.000041402218,0.0000037712925,0.00008445493,0.0006368437,0.39956483,0.0143422205,0.58102304,0.003634352,0.00009412937],"about_ca_topic_score_codex":0.00024413275,"about_ca_topic_score_gemma":0.00023485618,"teacher_disagreement_score":0.9166899,"about_ca_system_score_codex":0.00016175353,"about_ca_system_score_gemma":0.00048800316,"threshold_uncertainty_score":0.53477675},"labels":[],"label_agreement":null},{"id":"W2112263237","doi":"10.1007/978-3-540-31833-0_17","title":"Order-Preserving Transformations and Greedy-Like Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Greedy algorithm; Mathematical proof; Scheduling (production processes); Mathematical optimization; Graph; Class (philosophy); Set (abstract data type); Expressive power; Dominating set; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02120697823112742,"score_gpt":0.24489360703774543,"score_spread":0.22368662880661802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112263237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027606171,0.0011658008,0.9881634,0.0021883934,0.0013561081,0.00037174433,0.000012620159,0.00024222095,0.00647212],"genre_scores_gemma":[0.007883485,0.00036829239,0.98853296,0.0019139868,0.0006343077,0.000013922636,0.000008554573,0.000037702444,0.0006067889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962124,0.000033077024,0.00059412903,0.0014011618,0.0010060669,0.0007531159],"domain_scores_gemma":[0.9975208,0.00040782982,0.00019293798,0.0013493658,0.00027738718,0.00025166213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076681474,0.0005758493,0.00052526157,0.0010571005,0.0005994911,0.0008752065,0.0035762973,0.0003094902,0.000053892752],"category_scores_gemma":[0.000044987588,0.0005576965,0.00012883503,0.0009930789,0.0009172258,0.001479194,0.0016168368,0.0010035825,0.00002962575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015774863,0.000021982743,0.000010688103,0.000036059635,0.00001158665,0.000029515984,0.0011631132,0.0063766264,0.000013724814,0.032863297,0.00003453312,0.9594373],"study_design_scores_gemma":[0.00026953738,0.00009674393,0.0000931173,0.00024117978,0.000008350963,0.00015410405,3.389173e-7,0.7684569,0.00009711829,0.21909736,0.010834078,0.00065118325],"about_ca_topic_score_codex":0.00004867678,"about_ca_topic_score_gemma":0.00028278623,"teacher_disagreement_score":0.95878613,"about_ca_system_score_codex":0.00015245144,"about_ca_system_score_gemma":0.00036702395,"threshold_uncertainty_score":0.99968743},"labels":[],"label_agreement":null},{"id":"W2112512535","doi":"10.1145/1183278.1183283","title":"The strength of replacement in weak arithmetic","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Discrete mathematics; Class (philosophy); Axiom; Combinatorics; Complexity class; Polynomial; Integer (computer science); Quantifier (linguistics); Quantifier elimination; P; Time complexity; Computer science","score_opus":0.02121284245199038,"score_gpt":0.25849239291829507,"score_spread":0.2372795504663047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112512535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045189904,0.00008093148,0.9906303,0.0027557153,0.00023111665,0.00013705276,0.000008467618,0.000053485666,0.0015839044],"genre_scores_gemma":[0.8462308,0.000011226252,0.15344839,0.00009045453,0.000015383443,0.000021469465,0.000004839415,0.0000035206976,0.00017391774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886024,0.000082631035,0.00032192742,0.00023895688,0.00032896866,0.00016726044],"domain_scores_gemma":[0.99843043,0.0009773573,0.000078232864,0.0004173417,0.00007337179,0.000023271297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026333772,0.00009962591,0.00010867422,0.00015820228,0.00023217873,0.0000560423,0.00069327385,0.00003129684,0.000019536368],"category_scores_gemma":[0.000018746066,0.000078271165,0.00007809214,0.00057123246,0.000099373385,0.00010863206,0.000018266852,0.00015651324,0.000012061795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021572976,0.0004884526,0.00013411212,0.0000070518654,0.000017391,0.0000031298878,0.000057727473,0.35791957,0.000012439979,0.562892,0.00015586632,0.078290656],"study_design_scores_gemma":[0.00046169964,0.00017681651,0.014564063,0.000017223263,0.000004044231,0.000011025518,0.000033479002,0.24336492,0.00018715356,0.7396906,0.0013734257,0.000115560586],"about_ca_topic_score_codex":0.00009353099,"about_ca_topic_score_gemma":0.00012486464,"teacher_disagreement_score":0.8417118,"about_ca_system_score_codex":0.00004235187,"about_ca_system_score_gemma":0.000053557924,"threshold_uncertainty_score":0.31918055},"labels":[],"label_agreement":null},{"id":"W2112983578","doi":"10.1287/mnsc.2020.3820","title":"Maximizing Sequence-Submodular Functions and Its Application to Online Advertising","year":2021,"lang":"en","type":"preprint","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Submodular set function; Sequence (biology); Monotonic function; Greedy algorithm; Rewriting; Function (biology); Computer science; Mathematical optimization; Class (philosophy); Simple (philosophy); Online algorithm; Time complexity; Mathematics; Algorithm; Artificial intelligence","score_opus":0.04135716981506005,"score_gpt":0.28827301518375703,"score_spread":0.24691584536869698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112983578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05703111,0.00024333838,0.9374294,0.0019196441,0.0009282778,0.000666644,0.000009700707,0.00022465666,0.0015472228],"genre_scores_gemma":[0.71065503,0.00013537562,0.28774038,0.0007967521,0.00008035176,0.00012494854,0.000021952786,0.000010886466,0.00043432158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692386,0.000037036745,0.00029541313,0.0015439148,0.00075582025,0.00044393417],"domain_scores_gemma":[0.99824196,0.000020496496,0.000119694196,0.0012596603,0.00015637494,0.00020178709],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006900706,0.00023780172,0.00021158105,0.0005790356,0.0006198897,0.0010478965,0.0022795042,0.000055880573,0.0000062318186],"category_scores_gemma":[0.00003580989,0.00026283783,0.000063770494,0.0018896059,0.00015049294,0.0007076405,0.008620057,0.0002840523,0.000018641831],"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.0000030379344,0.00021780332,0.00023002364,0.00043433742,0.00005161932,0.000083534964,0.0012647818,0.024422992,0.005798549,0.101342104,0.00010672467,0.86604446],"study_design_scores_gemma":[0.00015197265,0.000035377525,0.010962315,0.00042991096,0.00003210927,0.000019864128,0.00038816652,0.97037256,0.00083832373,0.01264794,0.0034713228,0.000650137],"about_ca_topic_score_codex":0.000040451057,"about_ca_topic_score_gemma":0.00002382747,"teacher_disagreement_score":0.94594955,"about_ca_system_score_codex":0.00015959852,"about_ca_system_score_gemma":0.00007715794,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W2113703646","doi":"","title":"On the nonexistence of dimension reduction for $\\ell2_2$ metrics.","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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; Dimension (graph theory); Metric (unit); Dimensionality reduction; Combinatorics; Dimension function; Metric dimension; Reduction (mathematics); Embedding; Lemma (botany); Discrete mathematics; Effective dimension; Metric space; Euclidean distance; Hausdorff dimension; Computer science; Graph","score_opus":0.08041085738545625,"score_gpt":0.2616961247978016,"score_spread":0.18128526741234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113703646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1997704,0.00012200859,0.7744947,0.010838059,0.0018039083,0.0009789045,0.00017015872,0.00010825893,0.011713605],"genre_scores_gemma":[0.97637016,0.000009736022,0.022593334,0.0007564962,0.00004964544,0.000021056721,0.000019896861,0.000007103459,0.0001726046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859506,0.000055018532,0.00025736578,0.0003769272,0.0004346321,0.00028098928],"domain_scores_gemma":[0.9980268,0.0008193627,0.00013327923,0.00038900055,0.00043329207,0.00019828069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030308097,0.00014787528,0.00017587119,0.0007699401,0.00048817418,0.000056494635,0.0007477568,0.0000630834,0.00006424941],"category_scores_gemma":[0.0002367766,0.00012443213,0.00010065398,0.0014013938,0.0001969704,0.00012270054,0.000047296333,0.00017213976,0.00004024894],"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.000009130471,0.000042086205,0.000036136455,0.0000072774246,0.000015591926,0.000005396916,0.00016406689,0.006134881,0.000030849373,0.9826964,0.0030751633,0.0077830036],"study_design_scores_gemma":[0.00056351494,0.00069272023,0.0069783274,0.00009956221,0.000008754639,0.00009313202,0.00011164916,0.57930535,0.0010290163,0.40866247,0.0020228424,0.0004326887],"about_ca_topic_score_codex":0.0014486142,"about_ca_topic_score_gemma":0.00022766033,"teacher_disagreement_score":0.7765997,"about_ca_system_score_codex":0.00010924402,"about_ca_system_score_gemma":0.0007046491,"threshold_uncertainty_score":0.5074195},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"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","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","score_opus":0.014186560092182231,"score_gpt":0.24357122172902834,"score_spread":0.22938466163684612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14171313,0.0012680396,0.84693825,0.0060341614,0.0018258863,0.00018978385,0.0000013516844,0.000083440005,0.001945971],"genre_scores_gemma":[0.92102444,0.00005518919,0.07773907,0.0007216384,0.0003526474,2.843746e-7,9.5900894e-8,0.0000073835663,0.00009923877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998602,0.000147807,0.00038547302,0.00021561248,0.00038311753,0.0002660073],"domain_scores_gemma":[0.9987816,0.0004243081,0.00025868413,0.00030307123,0.00009092391,0.00014137251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795874,0.0001485932,0.00026938663,0.00014085596,0.00038255757,0.00023756451,0.000824835,0.00004063757,0.000018821731],"category_scores_gemma":[0.00007640564,0.000099938836,0.00016269223,0.00034544655,0.00011577071,0.0002501691,0.0002712994,0.00041582854,0.000011838955],"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.00008969784,0.00010028072,0.00040891577,0.0000144983605,0.00010041063,0.000018487735,0.0028137604,0.008232299,0.00017185173,0.09154362,0.0037424045,0.8927638],"study_design_scores_gemma":[0.004414647,0.00016013633,0.0062972615,0.0002292112,0.000014318304,0.00050895574,0.000068487774,0.95907885,0.00058101845,0.012765004,0.015624146,0.00025797085],"about_ca_topic_score_codex":0.000014930268,"about_ca_topic_score_gemma":0.000002262634,"teacher_disagreement_score":0.95084655,"about_ca_system_score_codex":0.000021239934,"about_ca_system_score_gemma":0.00007559163,"threshold_uncertainty_score":0.40753874},"labels":[],"label_agreement":null},{"id":"W2115713772","doi":"10.1016/j.disopt.2008.01.001","title":"A sequential elimination algorithm for computing bounds on the clique number of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Clique graph; Clique problem; Mathematics; Clique; Block graph; Simplex graph; Upper and lower bounds; Split graph; Branch and bound; Combinatorics; Graph; Computation; Algorithm; Discrete mathematics; Line graph; Graph power; Pathwidth","score_opus":0.03037697177775578,"score_gpt":0.28519658192086494,"score_spread":0.25481961014310917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115713772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027774707,0.000010942017,0.9948063,0.0006982392,0.00027463393,0.0003451415,0.000015080444,0.000079434794,0.000992767],"genre_scores_gemma":[0.311536,0.000027832015,0.6879593,0.00022804842,0.000093734954,0.000029535131,0.00005399735,0.000012517363,0.00005899628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.0000907933,0.0002743238,0.00027185056,0.0002692525,0.00019011846],"domain_scores_gemma":[0.9990168,0.00021787947,0.00019071321,0.00032921912,0.00021085433,0.000034497898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032297845,0.0001270241,0.00014064435,0.0000928116,0.00044408522,0.00007193668,0.0004426467,0.000059249123,0.000016534448],"category_scores_gemma":[0.00005744183,0.00010150715,0.0001355175,0.00050940504,0.00012751545,0.00027351215,0.00009547338,0.0000934137,0.0000024917283],"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.00003186111,0.00021316964,0.00020358594,0.00003468681,0.00008148729,0.0000053812155,0.0031982313,0.2544032,0.000064782325,0.67388135,0.000853181,0.06702907],"study_design_scores_gemma":[0.00030960274,0.000090237954,0.00024653214,0.000027943159,0.0000072998505,0.000018990493,0.000034607558,0.99140096,0.0008190744,0.006806163,0.0001128017,0.00012581791],"about_ca_topic_score_codex":0.000022087264,"about_ca_topic_score_gemma":0.0000015449461,"teacher_disagreement_score":0.7369977,"about_ca_system_score_codex":0.00002456526,"about_ca_system_score_gemma":0.000046796227,"threshold_uncertainty_score":0.41393414},"labels":[],"label_agreement":null},{"id":"W2116060765","doi":"10.1137/090751670","title":"Dynamic Connectivity: Connecting to Networks and Geometry","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Computer science; Bounded function; Vertex (graph theory); Sublinear function; Geometric networks; Discrete mathematics; Graph; Mathematics; Graph theory","score_opus":0.028243701256946273,"score_gpt":0.25872049542655406,"score_spread":0.23047679416960778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116060765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35577977,0.00012660274,0.64198077,0.00021711303,0.0009796217,0.000064230575,2.798736e-7,0.00010180545,0.0007497919],"genre_scores_gemma":[0.88642484,0.0000098109085,0.11258471,0.0007875398,0.00017074114,4.4442004e-7,1.621207e-7,0.000013101509,0.000008634573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984063,0.00013323005,0.0003293461,0.00039483295,0.00024906773,0.00048724422],"domain_scores_gemma":[0.998668,0.00044760155,0.00019702842,0.00029527722,0.00009619886,0.0002958675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011347994,0.00019434793,0.00025822502,0.00036237828,0.00075981347,0.0003635973,0.0006711811,0.000063038715,0.0000160282],"category_scores_gemma":[0.00015768786,0.0001852434,0.000090085836,0.00066467014,0.00003680654,0.00028889967,0.0005377204,0.00067449,0.000013384837],"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.000024917203,0.00012658292,0.0024762568,0.000013182157,0.00007255151,0.00024922937,0.002450325,0.009833244,0.00006423166,0.046482075,0.000099602505,0.9381078],"study_design_scores_gemma":[0.00045675758,0.00054932747,0.020636043,0.00022497325,0.0000076195843,0.0019966026,0.00019844255,0.9629035,0.000103976214,0.012059856,0.00046399058,0.00039892286],"about_ca_topic_score_codex":0.000011103215,"about_ca_topic_score_gemma":0.0000061454843,"teacher_disagreement_score":0.9530702,"about_ca_system_score_codex":0.000055171062,"about_ca_system_score_gemma":0.000025618116,"threshold_uncertainty_score":0.75540066},"labels":[],"label_agreement":null},{"id":"W2116123253","doi":"10.1109/ccc.2007.26","title":"Quantum t-designs: t-wise Independence in the Quantum World","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Conference on Computational Complexity/Proceedings","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":132,"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; Mitacs","keywords":"Quantum; Independence (probability theory); Computer science; Quantum mechanics; Physics; Mathematics; Statistics","score_opus":0.12154519118298181,"score_gpt":0.31888406789253726,"score_spread":0.19733887670955547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116123253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64691174,0.00015708485,0.24978162,0.0147105055,0.0021161025,0.0027764793,0.00004165952,0.0016479982,0.08185682],"genre_scores_gemma":[0.9662745,0.000015673264,0.030244935,0.0027539285,0.00042439072,0.00010584527,0.00001247463,0.000049731138,0.00011849198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922984,0.00003566898,0.0014081801,0.0018124138,0.002847677,0.0015976523],"domain_scores_gemma":[0.9957798,0.0007595666,0.0007377664,0.00034029342,0.001970143,0.00041241664],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0042226207,0.00089810713,0.00078103924,0.0016857275,0.0010119848,0.002049642,0.004925264,0.00026338067,0.00008202729],"category_scores_gemma":[0.00026736327,0.0007947434,0.000284259,0.004550585,0.0007881865,0.0023347957,0.00050906267,0.0018869935,0.00017375739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011973219,0.00045296442,0.0021879745,0.00009581679,0.000030346897,0.00002798378,0.0034661503,0.000083958555,0.0006101929,0.9869838,0.0034290943,0.0025119977],"study_design_scores_gemma":[0.0009670277,0.00044905167,0.029740287,0.00031250814,0.000015725696,0.00016952677,0.001383504,0.264187,0.0005257826,0.70012105,0.0011938852,0.000934647],"about_ca_topic_score_codex":0.00011718762,"about_ca_topic_score_gemma":0.00008792189,"teacher_disagreement_score":0.3193628,"about_ca_system_score_codex":0.00032475597,"about_ca_system_score_gemma":0.0002887473,"threshold_uncertainty_score":0.9994503},"labels":[],"label_agreement":null},{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"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; Undirected graph; Mathematics; Graph; Discrete mathematics","score_opus":0.015608472321808337,"score_gpt":0.23422185297186068,"score_spread":0.21861338065005234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117946984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10006862,0.00029157868,0.83995605,0.0028492217,0.0010056228,0.0015770304,0.000058111476,0.0023924424,0.051801335],"genre_scores_gemma":[0.7168825,0.000011549797,0.27849993,0.00083802984,0.00013603742,0.00013151327,0.00013801927,0.000032719538,0.0033296647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984124,0.000065333326,0.00033559164,0.0004966218,0.0002266161,0.000463444],"domain_scores_gemma":[0.99905527,0.00025046366,0.000056124012,0.0004803989,0.0000817253,0.00007603754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034080775,0.00019116749,0.00022707795,0.00032176648,0.00010621608,0.00013492115,0.00079547573,0.00008518482,0.00008231095],"category_scores_gemma":[0.0000211237,0.00017812254,0.00013459013,0.0011178176,0.0000646485,0.00031998556,0.00014774747,0.00011571088,0.000056645003],"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.000016834561,0.0007945734,0.0034919064,0.00001840112,0.00004925536,0.000057516914,0.00024420803,0.00018769735,0.0019591753,0.91978955,0.03086262,0.042528234],"study_design_scores_gemma":[0.0014196205,0.00020163202,0.046348974,0.00003800733,0.000013812059,0.000019981515,0.000017157596,0.5061801,0.0036984016,0.41446427,0.026829552,0.0007684978],"about_ca_topic_score_codex":0.00032947882,"about_ca_topic_score_gemma":0.0005455383,"teacher_disagreement_score":0.6168139,"about_ca_system_score_codex":0.00003846786,"about_ca_system_score_gemma":0.000042971427,"threshold_uncertainty_score":0.72636265},"labels":[],"label_agreement":null},{"id":"W2120741525","doi":"10.1007/s10586-006-9746-3","title":"Finding Hamiltonian paths in tournaments on clusters","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Tournament; Computation; Parallel computing; Computer cluster; Cluster (spacecraft); Parallel algorithm; Graph; Running time; Hamiltonian (control theory); Reuse; Theoretical computer science; Algorithm; Distributed computing; Combinatorics; Mathematical optimization; Mathematics; Operating system","score_opus":0.018802860021966208,"score_gpt":0.25354114527614796,"score_spread":0.23473828525418175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120741525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49643373,0.00006255676,0.48947307,0.0011102448,0.0014611698,0.00026107952,0.0000014675312,0.00025860313,0.010938072],"genre_scores_gemma":[0.9535709,0.0000010816756,0.04491569,0.0011019813,0.00022725333,0.0000029338498,0.0000029133162,0.000013870657,0.00016335749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980162,0.000119051445,0.0004322919,0.0005336164,0.00033377437,0.00056510454],"domain_scores_gemma":[0.9990521,0.00022504888,0.00013654982,0.00048568242,0.000029662158,0.000070962604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048271983,0.00021657626,0.00022620201,0.00036431235,0.00027005502,0.00030094976,0.00093924033,0.00007142472,0.0000058741384],"category_scores_gemma":[0.000021486208,0.000222515,0.00010050529,0.0006265608,0.000045108198,0.00026981017,0.0006223468,0.0003373004,0.000050243518],"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.00005502335,0.0012235503,0.074721076,0.00014639688,0.00005899657,0.0007670443,0.0075199613,0.18205062,0.00045548563,0.09881777,0.007958728,0.62622535],"study_design_scores_gemma":[0.0010925136,0.00008756661,0.050689485,0.00026591457,0.000002329531,0.000035516237,0.00005451193,0.93691427,0.00016638394,0.008760185,0.001549109,0.00038219034],"about_ca_topic_score_codex":0.00010693172,"about_ca_topic_score_gemma":0.00006640604,"teacher_disagreement_score":0.7548637,"about_ca_system_score_codex":0.00015294152,"about_ca_system_score_gemma":0.000028719094,"threshold_uncertainty_score":0.9073898},"labels":[],"label_agreement":null},{"id":"W2122483877","doi":"10.1016/s0304-3975(02)00643-6","title":"Almost k-wise independence and hard Boolean functions","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Discrete mathematics; Linear subspace; Upper and lower bounds; Function (biology); Polynomial; Computable function; Independence (probability theory); Circuit complexity; Affine transformation; Electronic circuit; Pure mathematics","score_opus":0.015241762987331061,"score_gpt":0.23840912940705755,"score_spread":0.22316736641972648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122483877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029276093,0.00007157617,0.9615514,0.00064856827,0.0008638747,0.0001302678,0.0000023481036,0.00018854035,0.00726731],"genre_scores_gemma":[0.78001547,0.000007776627,0.21930993,0.000567137,0.000051618175,0.000005289663,3.1909514e-7,0.000005482298,0.000037003625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733335,0.00012705776,0.00024256863,0.0009102355,0.0007659711,0.0006208284],"domain_scores_gemma":[0.9982279,0.00021325122,0.000052223597,0.00091813353,0.00017718079,0.0004113302],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015949397,0.00020547146,0.00019289687,0.00021927024,0.00089547265,0.0006990767,0.0017032246,0.00006146598,0.000078327765],"category_scores_gemma":[0.00015203892,0.0001798185,0.000058993854,0.0014056845,0.0035783749,0.00093662174,0.00088443595,0.00033106405,0.00009490754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001779139,0.000044502533,0.00020082401,0.0000035004223,0.0000028644909,0.00001202896,0.00020932409,0.000025609335,0.000151261,0.96650994,0.00006236525,0.032776024],"study_design_scores_gemma":[0.0003674182,0.00028731476,0.00539632,0.00003496048,0.0000075856315,0.00038146175,0.000022832852,0.28617272,0.0022722178,0.7017438,0.0028159155,0.00049749285],"about_ca_topic_score_codex":0.0000048848747,"about_ca_topic_score_gemma":0.000001237546,"teacher_disagreement_score":0.75073934,"about_ca_system_score_codex":0.00003483091,"about_ca_system_score_gemma":0.00015073681,"threshold_uncertainty_score":0.9991333},"labels":[],"label_agreement":null},{"id":"W2124257703","doi":"10.1007/s00224-004-1210-2","title":"A Note on MODp - MODm Circuits","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Electronic circuit; Constant (computer programming); Prime (order theory); Mathematics; Layer (electronics); Prime power; Computer science; Discrete mathematics; Arithmetic; Combinatorics; Physics; Nanotechnology; Materials science; Quantum mechanics","score_opus":0.02779862653046497,"score_gpt":0.26227526526526934,"score_spread":0.23447663873480437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124257703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06543226,0.0002551851,0.9178536,0.00016616224,0.0009993205,0.0001980942,0.0000029744638,0.00031494506,0.014777491],"genre_scores_gemma":[0.99084437,0.0000016842548,0.008376911,0.00015906309,0.00038025944,0.0000024348446,7.3462076e-7,0.000011921453,0.00022263471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981897,0.0003027254,0.0004248972,0.00036196457,0.00039818362,0.00032253377],"domain_scores_gemma":[0.9982503,0.0005796927,0.000227381,0.00077250664,0.000087675224,0.000082430975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013723677,0.00017666077,0.00032400686,0.00018847751,0.00016850467,0.000094699244,0.0011971063,0.000064106775,0.0000049792566],"category_scores_gemma":[0.00004499402,0.00016687594,0.000118225114,0.00034730876,0.00009454283,0.00016647328,0.00021635223,0.0001793758,0.00008010895],"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.0000041569306,0.00007358834,0.000010335241,0.000038393304,0.000017589608,0.0000031288776,0.0017179155,0.030318808,0.00026003874,0.80677384,0.00008705251,0.16069517],"study_design_scores_gemma":[0.00041537744,0.00015343,0.00043139275,0.00033678452,0.0000062334816,0.000047599504,0.000052743417,0.96181184,0.0010581097,0.03311513,0.002285397,0.0002859861],"about_ca_topic_score_codex":0.0000147367655,"about_ca_topic_score_gemma":7.190436e-7,"teacher_disagreement_score":0.931493,"about_ca_system_score_codex":0.000049020484,"about_ca_system_score_gemma":0.00003978353,"threshold_uncertainty_score":0.6805003},"labels":[],"label_agreement":null},{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","score_opus":0.07230848095357204,"score_gpt":0.27751235173216143,"score_spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125063528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744851,0.000051454546,0.9154986,0.0048282067,0.00048335028,0.0007097003,0.00002428863,0.0004956978,0.0034236035],"genre_scores_gemma":[0.61804664,9.3651704e-7,0.38038582,0.0012334125,0.00009493266,0.00005114231,0.000036107213,0.00001073591,0.00014028516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974001,0.00016460939,0.00053254183,0.0007836371,0.0006556235,0.0004634968],"domain_scores_gemma":[0.9979873,0.00024836633,0.00018678926,0.0007407529,0.0006344562,0.00020235676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039592542,0.0002827485,0.00029195176,0.00016155188,0.00053667946,0.00048754146,0.0012069796,0.00008986174,0.00078705605],"category_scores_gemma":[0.00006219008,0.0002850769,0.00019383337,0.0007852116,0.0002901052,0.001340584,0.00049952953,0.00027926362,0.00076635554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001132002,0.00048070666,0.0050294036,0.00009035014,0.000072002986,0.000003993822,0.00094415765,0.0053144707,0.00022477625,0.9398738,0.014283343,0.033671677],"study_design_scores_gemma":[0.0002174774,0.000044121403,0.07492627,0.0000074675004,0.000002622082,0.000011665778,0.000005288907,0.42162776,0.000054645123,0.5022903,0.0006244151,0.00018797965],"about_ca_topic_score_codex":0.00027451396,"about_ca_topic_score_gemma":0.000013477116,"teacher_disagreement_score":0.5435615,"about_ca_system_score_codex":0.00010705228,"about_ca_system_score_gemma":0.00014525991,"threshold_uncertainty_score":0.9999601},"labels":[],"label_agreement":null},{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","score_opus":0.012230006133804268,"score_gpt":0.21800448995978605,"score_spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125240990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049613267,0.000028007104,0.9879391,0.002431826,0.0039608167,0.00016970294,9.486333e-7,0.000040586223,0.00046769177],"genre_scores_gemma":[0.8414066,0.000060195496,0.15687314,0.0011288356,0.00048940483,0.000008544741,0.0000023044947,0.000021709904,0.000009262853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863595,0.00011492061,0.00034843013,0.00018034954,0.0005512044,0.0001691243],"domain_scores_gemma":[0.99880236,0.00025042752,0.00037419065,0.00025329133,0.00023451108,0.00008523315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007405863,0.00015001626,0.00018920924,0.00026431822,0.0003158328,0.00025788657,0.000417974,0.00007445179,0.000008681693],"category_scores_gemma":[0.00011103137,0.00010790567,0.00010327091,0.00050851423,0.0000631202,0.00041464684,0.000054496682,0.00031333705,0.0000015875547],"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.00009995332,0.0001801337,0.000008193223,0.000005166678,0.000017468543,0.000008809575,0.00007919567,0.6068959,0.000013343536,0.39126953,0.000101210324,0.0013210884],"study_design_scores_gemma":[0.0025679,0.0015257567,0.00011420058,0.0001162904,0.000021241187,0.00002655003,0.00001767848,0.62565297,0.0005722026,0.3690809,0.00015010027,0.00015423255],"about_ca_topic_score_codex":0.000003408626,"about_ca_topic_score_gemma":1.6932624e-7,"teacher_disagreement_score":0.8364453,"about_ca_system_score_codex":0.00008135234,"about_ca_system_score_gemma":0.00008703222,"threshold_uncertainty_score":0.44002652},"labels":[],"label_agreement":null},{"id":"W2125401464","doi":"10.1287/mnsc.49.9.1268.16570","title":"A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems","year":2003,"lang":"en","type":"article","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":205,"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; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Integer programming; Mathematical optimization; Separable space; Linear programming; Piecewise linear function; Minification; Duality (order theory); Linear programming relaxation; Piecewise; Branch and price; Lagrangian relaxation; Relaxation (psychology); Regular polygon; Envelope (radar); Convex optimization; Strong duality; Function (biology); Applied mathematics; Discrete mathematics; Optimization problem; Computer science; Mathematical analysis","score_opus":0.06693519417062954,"score_gpt":0.3225695888185658,"score_spread":0.25563439464793625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125401464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093580823,0.000055947814,0.99304235,0.00014311992,0.0004522394,0.0012215754,0.0000020026287,0.00010122347,0.004045725],"genre_scores_gemma":[0.5320796,0.000006678216,0.46753067,0.00004693522,0.00001016797,0.00013721985,0.0000019152146,0.0000056241115,0.00018122162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979295,0.000035902714,0.00039054177,0.0005958653,0.0005957953,0.00045237914],"domain_scores_gemma":[0.9988565,0.00006149553,0.00019849752,0.0005825211,0.0002031451,0.00009786531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014066,0.00014902199,0.00021255105,0.00033807222,0.00034227452,0.00020362521,0.0013567704,0.000028962528,0.0000046919695],"category_scores_gemma":[0.000052355143,0.00014186901,0.000076704215,0.0017718704,0.00034479506,0.000902725,0.00031325276,0.000071546034,0.0000050795948],"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.000004431092,0.00039726897,0.00074598746,0.00017295743,0.00001593033,0.0000012334154,0.0009993281,0.07182594,0.00007926323,0.81672776,0.00035178766,0.10867812],"study_design_scores_gemma":[0.0003750293,0.00011358481,0.00011306924,0.000057829766,0.00001075781,0.0000012048538,0.00018643754,0.96476305,0.0020969177,0.017564468,0.014537213,0.00018042729],"about_ca_topic_score_codex":0.000006737624,"about_ca_topic_score_gemma":0.0000062516133,"teacher_disagreement_score":0.8929371,"about_ca_system_score_codex":0.00004981656,"about_ca_system_score_gemma":0.00005133018,"threshold_uncertainty_score":0.578525},"labels":[],"label_agreement":null},{"id":"W2126546664","doi":"10.1109/ccc.2006.27","title":"Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Boolean function; Truth table; Reduction (mathematics); Mathematics; Combinatorics; Discrete mathematics; Function (biology); Circuit minimization for Boolean functions; Parity function; Boolean circuit; Binary logarithm; Boolean expression; Algorithm","score_opus":0.014438413559991559,"score_gpt":0.21253447467379172,"score_spread":0.19809606111380015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126546664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052198388,0.00044628195,0.8570651,0.00095184747,0.0005095541,0.00020506153,0.0000069397647,0.00044457434,0.08817226],"genre_scores_gemma":[0.91683656,0.000010003097,0.08099251,0.00024514363,0.00011914883,0.000008981703,0.000002838258,0.000008009336,0.0017767797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998972,0.00001996066,0.00016981507,0.00034384747,0.00018114195,0.0003132591],"domain_scores_gemma":[0.9994028,0.000119963996,0.000043476182,0.000323977,0.0000402894,0.00006945761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014137976,0.00012189462,0.00014356995,0.000099594276,0.00020414033,0.00025109012,0.00044583427,0.000043755474,0.000037434365],"category_scores_gemma":[0.000015555708,0.00011053425,0.000044406403,0.00036692017,0.000050530954,0.0005271462,0.00026670363,0.00008542725,0.000018449402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022386562,0.00011474028,0.0014683645,0.000032978412,0.000018048442,0.000031796757,0.000408532,0.000052663283,0.00085557037,0.8504036,0.0059752036,0.14063625],"study_design_scores_gemma":[0.002258291,0.0002942127,0.03436066,0.00009878923,0.00002331188,0.00023606973,0.00021746199,0.34822074,0.012617694,0.50903076,0.09139589,0.0012461203],"about_ca_topic_score_codex":0.00016007164,"about_ca_topic_score_gemma":0.000029987183,"teacher_disagreement_score":0.8646382,"about_ca_system_score_codex":0.000015277094,"about_ca_system_score_gemma":0.000027558945,"threshold_uncertainty_score":0.45074558},"labels":[],"label_agreement":null},{"id":"W2126874118","doi":"10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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 Alberta; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bounded function; Approximation algorithm; Bottleneck; Multiplicative function; Combinatorics; Logarithm; Time complexity; Discrete mathematics; Linear programming; Maximum flow problem; Mathematical optimization; Computer science","score_opus":0.038118541435952544,"score_gpt":0.2740565768001746,"score_spread":0.23593803536422203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126874118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029296055,0.000020653213,0.9944653,0.002364957,0.0011542009,0.00059873157,0.000058250833,0.0004963149,0.00054865633],"genre_scores_gemma":[0.060726,0.000033897995,0.9368367,0.0011329864,0.00018024167,0.0003884232,0.000029221605,0.000037226826,0.00063527544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787974,0.00009525418,0.00036858328,0.00074305286,0.00041443514,0.00049894745],"domain_scores_gemma":[0.99753755,0.0005880643,0.000100824676,0.0014609727,0.00015089626,0.0001616843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366337,0.00030948827,0.00029965694,0.00044463162,0.00062477565,0.0002062041,0.001317749,0.00015037411,0.000039134604],"category_scores_gemma":[0.00007444815,0.00030021308,0.00028689954,0.0008305187,0.000089372,0.00044758403,0.000021776652,0.00035762845,0.00009475736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032284686,0.000464935,0.0000010726762,0.000033446555,0.000047126392,0.0000013296149,0.00020167138,0.015294774,0.00007275412,0.0444834,0.00019209094,0.9391751],"study_design_scores_gemma":[0.0011083621,0.00092857686,0.00004705124,0.000046155146,0.00002176768,0.000013468405,0.000015887865,0.81824183,0.004296815,0.16589004,0.009052031,0.00033803296],"about_ca_topic_score_codex":0.000028672424,"about_ca_topic_score_gemma":0.000016237775,"teacher_disagreement_score":0.93883705,"about_ca_system_score_codex":0.00007179908,"about_ca_system_score_gemma":0.00004409605,"threshold_uncertainty_score":0.999945},"labels":[],"label_agreement":null},{"id":"W2127378345","doi":"","title":"Reductions for the stable set problem","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Independent set; Clique; Mathematics; Combinatorics; Graph; Benchmark (surveying); Set (abstract data type); Reduction (mathematics); Clique problem; Discrete mathematics; Mathematical optimization; Computer science; Pathwidth; Line graph","score_opus":0.2833151832057892,"score_gpt":0.39454671468208496,"score_spread":0.11123153147629578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127378345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038026136,0.0002777213,0.98897374,0.0034288757,0.00046602573,0.001351614,0.000041390864,0.00013768784,0.004942709],"genre_scores_gemma":[0.06816573,0.00020144795,0.91870534,0.00014755124,0.00048670656,0.0022429186,0.000022356722,0.00002654272,0.010001392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981097,0.0001905906,0.00024198146,0.00043184374,0.00046369643,0.00056216615],"domain_scores_gemma":[0.997782,0.0003731954,0.000014577323,0.00097349583,0.00075505336,0.00010169501],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019098463,0.0001131167,0.00010763872,0.0002540579,0.0025040582,0.0004522959,0.0016640805,0.000056170786,0.00014444228],"category_scores_gemma":[0.00012303151,0.0000828118,0.00008044772,0.0013767636,0.00030616933,0.00069014076,0.00041640992,0.00040250435,0.00011850872],"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.0000055006335,0.0001842463,0.000009722042,0.000011390985,0.00006292676,0.0000028803831,0.0050518666,0.000617245,0.00025863797,0.9087894,0.016269278,0.06873693],"study_design_scores_gemma":[0.00042135725,0.00030066073,0.00030636645,0.000017884799,0.000010985074,0.000054209377,0.0011159624,0.8047938,0.0024420035,0.09355835,0.09671611,0.0002623294],"about_ca_topic_score_codex":0.001015773,"about_ca_topic_score_gemma":0.00024307119,"teacher_disagreement_score":0.815231,"about_ca_system_score_codex":0.000059021928,"about_ca_system_score_gemma":0.00032500815,"threshold_uncertainty_score":0.99879456},"labels":[],"label_agreement":null},{"id":"W2127493538","doi":"10.1109/ccc.2006.12","title":"Circuit Lower Bounds via Ehrenfeucht-Fraisse Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Class (philosophy); Electronic circuit; Mathematics; Order (exchange); Discrete mathematics; Upper and lower bounds; Combinatorics; Computer science","score_opus":0.014180967402070466,"score_gpt":0.2212683814214968,"score_spread":0.20708741401942632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127493538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006926638,0.0002212399,0.89763224,0.00074037426,0.00084801315,0.00008063282,0.000001438537,0.00048894866,0.09306048],"genre_scores_gemma":[0.9469982,0.000004386445,0.04452926,0.00070914516,0.000268618,0.000010400288,0.0000033415504,0.000010760468,0.0074659176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986526,0.000027194967,0.0002239957,0.0004158822,0.0003071297,0.00037323675],"domain_scores_gemma":[0.9989938,0.00006890766,0.0000480718,0.0007418507,0.0000663923,0.000080936254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015942578,0.00016004655,0.00015250784,0.00012694848,0.00018306827,0.00032311614,0.0010233882,0.0000605119,0.0003627398],"category_scores_gemma":[0.000009099226,0.00014514691,0.00012421155,0.00051251636,0.00010062514,0.0004383771,0.00025640067,0.00012976339,0.00026646402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018203142,0.00021692408,0.00076683814,0.0000071456247,0.000012836638,0.000046108365,0.00010072094,0.000025685384,0.00063441426,0.8695302,0.018495476,0.1101618],"study_design_scores_gemma":[0.00035391538,0.00009551474,0.0111439265,0.000011730118,0.0000050694375,0.00006505347,0.000005933954,0.031119598,0.0019343793,0.84574133,0.109064564,0.00045897602],"about_ca_topic_score_codex":0.00025315513,"about_ca_topic_score_gemma":0.00010055912,"teacher_disagreement_score":0.9400715,"about_ca_system_score_codex":0.000023968243,"about_ca_system_score_gemma":0.000039364622,"threshold_uncertainty_score":0.59189194},"labels":[],"label_agreement":null},{"id":"W2127816126","doi":"10.1145/2907052","title":"Better Balance by Being Biased","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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 Toronto","funders":"","keywords":"Approximation algorithm; Conjecture; Combinatorics; Mathematics; Constraint (computer-aided design); Discrete mathematics","score_opus":0.01799228803662961,"score_gpt":0.24238463663410217,"score_spread":0.22439234859747256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127816126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021582528,0.00004000579,0.98431253,0.011514286,0.0008173372,0.00012915125,0.00005459107,0.00042604876,0.0005478132],"genre_scores_gemma":[0.47342354,0.00016600931,0.51989007,0.0037051165,0.00019796891,0.00011085324,0.0000046297387,0.00004522051,0.0024565791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982489,0.000069607304,0.00025932645,0.0005898609,0.00038445208,0.00044785696],"domain_scores_gemma":[0.99804276,0.00038498078,0.000058686983,0.0012962121,0.000060066923,0.0001572705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018257715,0.0002281778,0.00019380664,0.00017676897,0.00033820927,0.00012023664,0.0015136638,0.00009243059,0.00021166063],"category_scores_gemma":[0.000025501895,0.00017200751,0.00015859627,0.00053980836,0.0001162157,0.0006240949,0.000029101422,0.00021314766,0.00030330534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046294267,0.0001432442,0.000043480344,0.0000035939051,0.000033303993,0.000010907232,0.000092620474,0.000008340203,0.0023424947,0.0013026639,0.001398683,0.99461603],"study_design_scores_gemma":[0.008835967,0.001539794,0.00520379,0.00067304785,0.00010292862,0.00024800896,0.0000817307,0.0762827,0.2896279,0.3477734,0.2656777,0.0039530066],"about_ca_topic_score_codex":0.000024645748,"about_ca_topic_score_gemma":0.000004222102,"teacher_disagreement_score":0.99066305,"about_ca_system_score_codex":0.000061400264,"about_ca_system_score_gemma":0.000030693795,"threshold_uncertainty_score":0.70142627},"labels":[],"label_agreement":null},{"id":"W2131242765","doi":"10.1145/1064546.1180614","title":"Implementing approximation algorithms for the single-source unsplittable flow problem","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","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":"York University","funders":"","keywords":"Approximation algorithm; Heuristics; Minimum-cost flow problem; Algorithm; Mathematics; Vertex (graph theory); Multi-commodity flow problem; Flow (mathematics); Computer science; Flow network; Enhanced Data Rates for GSM Evolution; Path (computing); Mathematical optimization; Graph; Combinatorics","score_opus":0.04379081623079347,"score_gpt":0.29558070819012355,"score_spread":0.2517898919593301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131242765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023402877,0.0030041386,0.99089855,0.0023035319,0.0006947176,0.00046149,0.000010162896,0.00006612655,0.00022096948],"genre_scores_gemma":[0.032324303,0.00005470392,0.96575683,0.0004167575,0.0012526355,0.00003882059,0.000005834788,0.00002840089,0.00012173396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974276,0.000067563116,0.0008958103,0.00032243083,0.0006211237,0.0006655104],"domain_scores_gemma":[0.99774164,0.00045712083,0.00066395453,0.00067123206,0.00032150446,0.00014455279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013854259,0.00027399586,0.00032313395,0.00017377234,0.0007114047,0.00044791112,0.0023793918,0.00006215118,0.000024696998],"category_scores_gemma":[0.00008393161,0.00020776768,0.00032800637,0.00043123518,0.000103930266,0.0013567891,0.0007683491,0.00030252335,0.000005979137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028230774,0.0005190093,0.000022389477,0.000014306849,0.00014895454,0.0000051976576,0.0024271512,0.0022730664,0.007960066,0.0073548933,0.0016669485,0.9775798],"study_design_scores_gemma":[0.001653595,0.0005705261,0.000025463043,0.00005703124,0.00003992961,0.00043876038,0.0010145064,0.80470735,0.082196936,0.007336135,0.10159273,0.00036702296],"about_ca_topic_score_codex":0.000013772348,"about_ca_topic_score_gemma":0.000003675608,"teacher_disagreement_score":0.9772128,"about_ca_system_score_codex":0.00021049716,"about_ca_system_score_gemma":0.00008576299,"threshold_uncertainty_score":0.847252},"labels":[],"label_agreement":null},{"id":"W2132147722","doi":"10.1007/s10107-015-0944-8","title":"Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Parametric statistics; Rank (graph theory); Maximum cut; Polynomial; Time complexity; Pareto principle; Graph; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04022054374351302,"score_gpt":0.2952712546187547,"score_spread":0.25505071087524167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132147722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53918105,0.0008428317,0.45700854,0.0004315674,0.0002652908,0.0012668165,0.000011854255,0.00025401925,0.0007380206],"genre_scores_gemma":[0.6792136,0.0000033354036,0.32062417,0.000026930007,0.000020474854,0.00008969046,0.0000013263159,0.000007263986,0.00001319376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983958,0.000054665397,0.00032946482,0.00048385715,0.00025844356,0.00047776746],"domain_scores_gemma":[0.9989671,0.00036298262,0.00007536188,0.00025707082,0.00007494223,0.00026253524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006116635,0.00020566587,0.00032722612,0.00022278575,0.00012603,0.0003831527,0.00032359944,0.000097392396,7.644548e-7],"category_scores_gemma":[0.00039918348,0.00018791469,0.00007686193,0.0009086039,0.00026485312,0.0003419316,0.0002764362,0.00013915308,0.0000021500432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077818855,0.0006679196,0.010677754,0.00021732229,0.00006250491,0.000024558469,0.0024857079,0.000015777077,0.000010682001,0.5027271,0.00019542822,0.48283747],"study_design_scores_gemma":[0.0028806792,0.0007458851,0.0035470726,0.00009085636,0.000029962386,0.00012326916,0.00073505536,0.19504899,0.00003408129,0.7949361,0.0013152283,0.0005128231],"about_ca_topic_score_codex":0.00004225226,"about_ca_topic_score_gemma":0.00003177436,"teacher_disagreement_score":0.48232463,"about_ca_system_score_codex":0.000055188008,"about_ca_system_score_gemma":0.000052,"threshold_uncertainty_score":0.7662939},"labels":[],"label_agreement":null},{"id":"W2132274124","doi":"10.1007/s00453-004-1113-2","title":"The Power of Priority Algorithms for Facility Location and Set Cover","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Set cover problem; Facility location problem; Greedy algorithm; Theory of computation; Cover (algebra); Focus (optics); Class (philosophy); Algorithm; Approximation algorithm; Set (abstract data type); Covering problems; Computer science; Time complexity; Mathematical optimization; Dominating set; Point (geometry); Vertex cover; Mathematics; Theoretical computer science; Graph","score_opus":0.02472507854586655,"score_gpt":0.27160109436645713,"score_spread":0.24687601582059057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132274124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008330978,0.00040396312,0.9882885,0.001736914,0.00047507408,0.0004635199,0.00008915509,0.00008201376,0.00012988728],"genre_scores_gemma":[0.7977502,0.000094613635,0.20161083,0.0002286839,0.000091334805,0.00007062107,0.000017102477,0.000011332314,0.00012527755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986292,0.000044946253,0.00032169643,0.0004035989,0.00028902432,0.00031151687],"domain_scores_gemma":[0.99852175,0.00032897905,0.00013036809,0.00065302226,0.0002766805,0.00008922637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060782844,0.00016014294,0.00019837226,0.000054611068,0.0003927792,0.0001221608,0.0006895355,0.00007791161,0.0000032323442],"category_scores_gemma":[0.00012798526,0.00012425064,0.00009117654,0.00038193763,0.00030645187,0.00032487325,0.00024756347,0.00013865334,0.000009574549],"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.000052257255,0.0002991695,0.0001702947,0.000110496956,0.00014258882,0.0000050822136,0.0034882117,0.00026596698,0.00035264392,0.39684367,0.0010503685,0.5972192],"study_design_scores_gemma":[0.004881042,0.0012314427,0.01864505,0.00010439282,0.000058694975,0.00010672835,0.00048825293,0.13165407,0.021652773,0.7393107,0.08070848,0.0011583826],"about_ca_topic_score_codex":0.00007896932,"about_ca_topic_score_gemma":0.000010033738,"teacher_disagreement_score":0.78941923,"about_ca_system_score_codex":0.00004686995,"about_ca_system_score_gemma":0.00013636322,"threshold_uncertainty_score":0.5066794},"labels":[],"label_agreement":null},{"id":"W2132648308","doi":"10.1109/spdp.1990.143503","title":"The maximum weight perfect matching problem for complete weighted graphs is in PC","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Combinatorics; Matching (statistics); Mathematics; Computation; Time complexity; Parallel algorithm; Minimum weight; Graph; Binary logarithm; Running time; Algorithm; Discrete mathematics; Computer science; Parallel computing","score_opus":0.03078141394729043,"score_gpt":0.23684551531178086,"score_spread":0.20606410136449044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132648308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012502769,0.0011355913,0.92345196,0.023986107,0.0010967928,0.0016683226,0.000026046426,0.0006140771,0.03551833],"genre_scores_gemma":[0.42633796,0.00049103337,0.5637742,0.004419197,0.00021485632,0.0003979973,0.000008161904,0.000057341615,0.0042992295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981861,0.00008411744,0.00036330204,0.00049563026,0.00029464433,0.00057620194],"domain_scores_gemma":[0.99862313,0.00047803053,0.00008137242,0.00066872814,0.00006544425,0.00008327985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048546484,0.00021154383,0.00021437198,0.0001728687,0.0006507596,0.0003634969,0.0014429057,0.000060091,0.00013439056],"category_scores_gemma":[0.000008763759,0.00014395316,0.00018600492,0.00077743316,0.000104884406,0.0003697106,0.0002869711,0.00022604121,0.000063776824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008220395,0.00013274656,0.00033658746,0.000031603417,0.0000345944,0.00000841082,0.0019719887,0.000010641765,0.00013464411,0.84255034,0.012470618,0.14230959],"study_design_scores_gemma":[0.00057085213,0.000090077425,0.0003276846,0.000027122032,0.0000037372463,0.000017478063,0.000043874097,0.28477722,0.00025273205,0.6408788,0.0727559,0.00025450243],"about_ca_topic_score_codex":0.0001071667,"about_ca_topic_score_gemma":0.0001751293,"teacher_disagreement_score":0.4138352,"about_ca_system_score_codex":0.000031018735,"about_ca_system_score_gemma":0.000013451935,"threshold_uncertainty_score":0.5870239},"labels":[],"label_agreement":null},{"id":"W2132910148","doi":"10.1109/sct.1989.41812","title":"On the theory of average case complexity","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Complexity class; Nondeterministic algorithm; Time complexity; NP; Mathematics; Computational complexity theory; Structural complexity theory; Equivalence (formal languages); PH; Average-case complexity; PSPACE; Exponential function; Polynomial hierarchy; Hierarchy; Discrete mathematics; Descriptive complexity theory; Time hierarchy theorem; Counting problem; Context (archaeology); Quantum complexity theory; Algorithm; Turing machine; Computation","score_opus":0.05982840385805717,"score_gpt":0.25562887964020414,"score_spread":0.195800475782147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132910148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044402827,0.000023838797,0.8153794,0.0004580483,0.00021285859,0.00011195517,0.000002801364,0.00007066807,0.13933761],"genre_scores_gemma":[0.9780259,0.0000013925288,0.020735579,0.00079943164,0.0000071122363,0.000002892227,1.199078e-7,0.0000025177778,0.00042502492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991681,0.000246823,0.00012746069,0.0001653429,0.00015358064,0.00013866737],"domain_scores_gemma":[0.9985466,0.0007039167,0.00004133284,0.0006367037,0.0000356017,0.000035844747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827747,0.000077514625,0.000090635396,0.000040935163,0.00017333128,0.000037871087,0.0004935307,0.00001975503,0.00053744175],"category_scores_gemma":[0.00010377237,0.00004648713,0.000070598886,0.00026398315,0.00017226582,0.000078885656,0.000093643815,0.00010734404,0.00003280359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014016,0.00005163495,0.000009660566,0.000001983568,0.0000067106234,0.00006414764,0.00019923279,0.000018262352,0.000013639646,0.9962803,0.00037804412,0.0029749565],"study_design_scores_gemma":[0.00010516538,0.000053318145,0.00011401139,0.0000046074592,0.0000013569711,0.0003154338,0.00007504625,0.007279528,0.002408758,0.98833746,0.0012290918,0.00007622082],"about_ca_topic_score_codex":0.000021503325,"about_ca_topic_score_gemma":0.000013228931,"teacher_disagreement_score":0.9336231,"about_ca_system_score_codex":0.000006981521,"about_ca_system_score_gemma":0.00001981386,"threshold_uncertainty_score":0.58846104},"labels":[],"label_agreement":null},{"id":"W2133768373","doi":"10.1109/sfcs.1996.548466","title":"The optimal path-matching problem","year":2002,"lang":"en","type":"article","venue":"","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":"Matroid; Time complexity; Mathematics; Combinatorics; Generalization; Intersection (aeronautics); Weighted matroid; Equivalence (formal languages); Path (computing); Matching (statistics); Context (archaeology); Polynomial; Discrete mathematics; Matroid partitioning; Computer science; Graphic matroid","score_opus":0.022398869810922803,"score_gpt":0.22074983965924472,"score_spread":0.1983509698483219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133768373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015635636,0.00027696326,0.926607,0.0054276143,0.00027682376,0.00009345292,3.427504e-7,0.00028653542,0.06546766],"genre_scores_gemma":[0.27627447,0.000101091726,0.71544534,0.00084969506,0.00012241828,0.000020054998,2.4632715e-7,0.000007753394,0.0071789287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992807,0.000029713585,0.000114555005,0.00017482601,0.00017865165,0.000221568],"domain_scores_gemma":[0.9993918,0.0001281851,0.000026037249,0.00038623245,0.000023478175,0.00004428809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020034307,0.00006832464,0.000052949214,0.000020540354,0.00046829652,0.0003279686,0.00091953494,0.00001883875,0.00006988657],"category_scores_gemma":[0.0000068327913,0.00004181935,0.000049805505,0.00020638411,0.000047058238,0.00025307442,0.00027352496,0.0001152496,0.00015366479],"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":[2.5041712e-7,0.000024455143,0.000012569208,0.0000016359419,0.0000054217057,0.0000051580932,0.0006523585,0.00011613511,0.000023314296,0.7897387,0.006992161,0.20242785],"study_design_scores_gemma":[0.00016192057,0.000059675418,0.00017711139,0.000011140794,0.0000016723619,0.000041338168,0.00008443945,0.6738853,0.00021541718,0.16196711,0.16318643,0.00020842999],"about_ca_topic_score_codex":0.000018273817,"about_ca_topic_score_gemma":0.000004625254,"teacher_disagreement_score":0.6737692,"about_ca_system_score_codex":0.000007651584,"about_ca_system_score_gemma":0.0000049821006,"threshold_uncertainty_score":0.36018056},"labels":[],"label_agreement":null},{"id":"W2134098997","doi":"10.1145/2077336.2077337","title":"Pebbles and Branching Programs for Tree Evaluation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","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":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Boolean function; Tree (set theory); Binary decision diagram; Discrete mathematics; Algorithm","score_opus":0.06058992463226921,"score_gpt":0.31744797888938175,"score_spread":0.25685805425711256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134098997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011600171,0.00024092387,0.9861724,0.00042581483,0.00058149325,0.0005321671,0.0000036369859,0.00019084591,0.0002525867],"genre_scores_gemma":[0.78119427,0.0000066707607,0.21842445,0.00013524253,0.000060292426,0.00012431302,0.000008977365,0.000008476538,0.000037317903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.00019292737,0.00017659423,0.0002401909,0.0002410726,0.00022634091],"domain_scores_gemma":[0.9987437,0.00071117864,0.00006441456,0.00029022284,0.000106976724,0.000083513296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422454,0.0001218269,0.0001085663,0.00016007718,0.00040649777,0.00012851227,0.0002839868,0.00004718304,0.000012740252],"category_scores_gemma":[0.00004968589,0.00012003908,0.00007750523,0.00025487674,0.000059424223,0.00067106646,0.000011269235,0.000104306695,0.000007880514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015988639,0.00014054282,0.000024110295,0.000013638254,0.000022996706,5.892403e-8,0.0012227934,0.0014788568,0.00003095772,0.050020084,0.00001331389,0.94701666],"study_design_scores_gemma":[0.00093425636,0.00017614449,0.002224584,0.000035643083,0.000051414634,0.00001785215,0.0002055084,0.33148134,0.00069137476,0.6632473,0.000695185,0.0002394481],"about_ca_topic_score_codex":0.0000033780639,"about_ca_topic_score_gemma":0.000005723486,"teacher_disagreement_score":0.9467772,"about_ca_system_score_codex":0.000032060543,"about_ca_system_score_gemma":0.000027358878,"threshold_uncertainty_score":0.48950517},"labels":[],"label_agreement":null},{"id":"W2134600856","doi":"10.1016/j.jcss.2011.12.002","title":"The complexity of weighted and unweighted #CSP","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Class (philosophy); Computational complexity theory; Computation; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Algorithm; Artificial intelligence","score_opus":0.06998880825289108,"score_gpt":0.24769342942031014,"score_spread":0.17770462116741906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134600856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2812831,0.0033410764,0.7086527,0.0006639359,0.0020637673,0.0001619774,0.000002326057,0.000041102772,0.0037900421],"genre_scores_gemma":[0.8867603,0.00007681348,0.113038726,0.000029063827,0.00008612761,4.010978e-7,2.6833561e-8,0.0000017060488,0.0000068697814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985103,0.00017199115,0.0005348865,0.00017265641,0.0004251914,0.00018499079],"domain_scores_gemma":[0.99880207,0.00022015009,0.00046626554,0.0001905055,0.00021228341,0.00010870459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242553,0.00010716954,0.00028353053,0.00016061234,0.00048755918,0.00020870131,0.0010675319,0.000029462753,0.0000015575848],"category_scores_gemma":[0.000006525381,0.000058733694,0.00007442314,0.00043229465,0.0013190489,0.00046234546,0.0002780269,0.00011181166,4.8525965e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149646685,0.00004706591,0.0030902766,0.000053272048,0.00004627033,0.000019212168,0.0023431133,0.0000025642319,0.000039253915,0.94407,0.0002256827,0.05004833],"study_design_scores_gemma":[0.0016186725,0.0030275383,0.1506758,0.0007894281,0.000054276028,0.0040909075,0.0017874015,0.57055485,0.0014597442,0.26277572,0.0025911229,0.00057451194],"about_ca_topic_score_codex":0.000025656784,"about_ca_topic_score_gemma":0.000005397894,"teacher_disagreement_score":0.68129426,"about_ca_system_score_codex":0.000008483938,"about_ca_system_score_gemma":0.000065517364,"threshold_uncertainty_score":0.48600906},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"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":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","score_opus":0.012816955137912967,"score_gpt":0.24196167584555903,"score_spread":0.22914472070764605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134875769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556739,0.00018980239,0.5347059,0.0006438525,0.0010985733,0.00013981618,9.155126e-7,0.00044158302,0.007105657],"genre_scores_gemma":[0.7538295,0.000015582036,0.24423435,0.0011049346,0.00069519284,0.0000013707975,9.57411e-7,0.000029607101,0.000088503126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996392,0.00031708353,0.000978716,0.0006235789,0.00076214364,0.0009264688],"domain_scores_gemma":[0.99743015,0.0010856303,0.00045699233,0.0005731224,0.00014085794,0.000313255],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001636367,0.00039949833,0.00047620368,0.0003030262,0.0016178886,0.0010224784,0.0016738018,0.00010941328,0.00019697478],"category_scores_gemma":[0.00013123605,0.0003822527,0.000336904,0.0011398072,0.000079410194,0.0006906153,0.0002560054,0.0013230888,0.0001012411],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039461895,0.00024930868,0.00049782725,0.00004783687,0.00012343533,0.0004534766,0.00541791,0.020816635,0.0018119992,0.015442351,0.00045187632,0.9546479],"study_design_scores_gemma":[0.0016956335,0.0004563457,0.0032648996,0.0010312159,0.00002308648,0.0035027764,0.00031009532,0.896792,0.0011290305,0.0877336,0.0028928388,0.0011684835],"about_ca_topic_score_codex":0.000016584476,"about_ca_topic_score_gemma":0.0000014379078,"teacher_disagreement_score":0.9534794,"about_ca_system_score_codex":0.00008120844,"about_ca_system_score_gemma":0.000071415576,"threshold_uncertainty_score":0.9998629},"labels":[],"label_agreement":null},{"id":"W2135050820","doi":"10.1109/infcomw.2011.5928889","title":"Egalitarian stable matching for VM migration in cloud computing","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":48,"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":"Server; Cloud computing; Computer science; Matching (statistics); Virtual machine; Distributed computing; Rank (graph theory); Outcome (game theory); Work (physics); Mathematical optimization; Theoretical computer science; Computer network; Operating system; Mathematical economics; Mathematics","score_opus":0.05727396206257437,"score_gpt":0.26521181441667757,"score_spread":0.2079378523541032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135050820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0431397,0.000020079075,0.9498421,0.00027349632,0.00045651337,0.0001634893,0.0000011353155,0.00012268334,0.005980818],"genre_scores_gemma":[0.5620806,9.567128e-7,0.43757376,0.0001647493,0.00005123975,0.0000048051616,0.0000016735908,0.0000035311618,0.00011865064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999171,0.00003363207,0.00020646794,0.00024844287,0.00009840452,0.00024204285],"domain_scores_gemma":[0.99954736,0.00008569435,0.000043876993,0.00024838393,0.000035642544,0.000039013798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047571605,0.00008194052,0.00010691031,0.00010141008,0.00012747695,0.00008626321,0.00045508004,0.000033161312,0.000022393746],"category_scores_gemma":[0.000014363008,0.00007879543,0.000047626367,0.00026242217,0.000016729979,0.00040206133,0.00013871038,0.000078431316,0.000008636285],"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.0000049441337,0.00007385318,0.0010733828,0.000015468602,0.000005443354,0.00000252684,0.006862164,0.00014504559,0.00009511457,0.9733795,0.0003935708,0.017949007],"study_design_scores_gemma":[0.00044876017,0.00008389483,0.0059355404,0.000035671546,0.0000022637084,0.000005964639,0.00043730217,0.51552784,0.0017008769,0.47328928,0.0022851573,0.00024742872],"about_ca_topic_score_codex":0.0020106006,"about_ca_topic_score_gemma":0.0015256222,"teacher_disagreement_score":0.5189409,"about_ca_system_score_codex":0.000022574613,"about_ca_system_score_gemma":0.000025205274,"threshold_uncertainty_score":0.32131842},"labels":[],"label_agreement":null},{"id":"W2135134090","doi":"","title":"Uniform Hardness Amplification in NP via Monotone Codes","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Mathematics; Decoding methods; Lemma (botany); Code (set theory); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.019169918269632977,"score_gpt":0.25568251152468274,"score_spread":0.23651259325504975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135134090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06804111,0.0001221786,0.92437935,0.0026918051,0.00037494831,0.0005906581,0.000025755955,0.00037754056,0.0033966678],"genre_scores_gemma":[0.9703081,0.000005503134,0.028534552,0.00051095895,0.00013602289,0.00008913966,0.00019385434,0.000020418249,0.0002014427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664867,0.00020896793,0.0006617025,0.0008427028,0.0007893735,0.00084859575],"domain_scores_gemma":[0.9984716,0.00034926855,0.00023011243,0.00061268866,0.00023475857,0.00010152444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068023504,0.0003556739,0.00040208566,0.00050717266,0.00043686866,0.00024323892,0.0011884348,0.000103338825,0.000055125925],"category_scores_gemma":[0.000024700981,0.00039737942,0.00015344383,0.0016942087,0.00022277974,0.000470084,0.00022316769,0.00051193516,0.00010218499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052667885,0.0005127116,0.000635098,0.000012083298,0.00001713077,0.000008171767,0.00006579532,0.04185895,0.000123256,0.9523449,0.000854122,0.0035151343],"study_design_scores_gemma":[0.00070975476,0.00016399659,0.045006473,0.000012968741,0.0000032735043,0.000027271168,0.000005333489,0.38570896,0.00019410218,0.56434035,0.0035191816,0.00030831216],"about_ca_topic_score_codex":0.00067317707,"about_ca_topic_score_gemma":0.001302467,"teacher_disagreement_score":0.902267,"about_ca_system_score_codex":0.0006826065,"about_ca_system_score_gemma":0.0003928824,"threshold_uncertainty_score":0.9998478},"labels":[],"label_agreement":null},{"id":"W2136026170","doi":"10.1016/j.tcs.2009.09.033","title":"Priority algorithms for graph optimization problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"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":"Computer science; Graph; Theoretical computer science; Greedy algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.020045918708397618,"score_gpt":0.2708548621187035,"score_spread":0.2508089434103059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136026170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005057651,0.00003709225,0.99438775,0.0022894992,0.0007678637,0.0004928538,0.0000031538211,0.00041393007,0.0011020827],"genre_scores_gemma":[0.2879777,0.0000068818877,0.7110981,0.0007379367,0.00015531253,0.000012052254,0.0000018016818,0.0000047544245,0.0000055020064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720365,0.00006463123,0.00033709567,0.0009890812,0.0006783737,0.00072715484],"domain_scores_gemma":[0.99810636,0.00019350843,0.000088932335,0.00096170267,0.0003592432,0.00029023102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017472504,0.00022458233,0.00024328189,0.00028334832,0.0007859828,0.00069665146,0.0028751772,0.000067138935,0.000013667018],"category_scores_gemma":[0.00008887449,0.00019562225,0.000134005,0.0018800698,0.0015152202,0.0010381124,0.00043587704,0.00018243899,0.00000923166],"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.0000036462163,0.00009263529,0.0000038210956,0.0000048879806,0.0000021660778,0.0000016426458,0.00018510023,0.0082787955,0.00006952713,0.8575188,0.000038045295,0.13380094],"study_design_scores_gemma":[0.00020134979,0.0003282048,0.00016817183,0.000014069862,0.0000026066903,0.0000150069445,0.0000011116233,0.5764737,0.0005009174,0.42200384,0.00011856883,0.00017240507],"about_ca_topic_score_codex":0.0000014629437,"about_ca_topic_score_gemma":2.038506e-7,"teacher_disagreement_score":0.5681949,"about_ca_system_score_codex":0.000048675643,"about_ca_system_score_gemma":0.000118256234,"threshold_uncertainty_score":0.7977244},"labels":[],"label_agreement":null},{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","score_opus":0.03249075521729931,"score_gpt":0.2356156697719298,"score_spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136811867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008453712,0.00012472525,0.973694,0.0008868697,0.000106170555,0.0008399551,0.000028851067,0.00025004314,0.023224007],"genre_scores_gemma":[0.11964016,0.000027749682,0.8784306,0.00036235442,0.00011091172,0.00050517183,0.000011045716,0.000037089932,0.0008749413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985418,0.000013584589,0.0004415024,0.0003445611,0.00027562378,0.00038293525],"domain_scores_gemma":[0.9976311,0.001092624,0.00026812174,0.00087191176,0.000060921604,0.00007532629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038035048,0.00022005056,0.00023275788,0.0000775123,0.00059880636,0.00026724153,0.0010484112,0.00007135259,0.000117115254],"category_scores_gemma":[0.00005411865,0.00016073028,0.00014357126,0.00043349844,0.00009421452,0.00017183056,0.00027810724,0.00020110949,0.00007760745],"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.0000015397696,0.00009960788,0.000002022408,0.0001357894,0.000063706895,9.1892935e-7,0.005906743,0.00016009793,0.00039721082,0.9640932,0.0015350804,0.027604055],"study_design_scores_gemma":[0.00036635963,0.00003135755,0.00000843104,0.0000357588,0.000032571697,0.000013012234,0.00033361948,0.5764612,0.00070816773,0.41339242,0.008358352,0.00025874484],"about_ca_topic_score_codex":0.0000020831867,"about_ca_topic_score_gemma":0.000015405712,"teacher_disagreement_score":0.5763011,"about_ca_system_score_codex":0.000021726079,"about_ca_system_score_gemma":0.0000137284715,"threshold_uncertainty_score":0.6554391},"labels":[],"label_agreement":null},{"id":"W2137517701","doi":"10.1016/j.ejor.2015.05.082","title":"Multi-level facility location as the maximization of a submodular set function","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Set function; Facility location problem; Property (philosophy); Set (abstract data type); Representation (politics); Mathematical optimization; Combinatorial optimization; Function (biology); Maximization; 1-center problem; Mathematics; Computer science; Optimization problem","score_opus":0.3494665569867854,"score_gpt":0.38350349018324087,"score_spread":0.034036933196455454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137517701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041397784,0.00024184302,0.9549524,0.0022368745,0.0002750247,0.00013637288,0.000008539428,0.000008108623,0.00074306346],"genre_scores_gemma":[0.97406745,0.000019576833,0.025308318,0.00009884842,0.00014262291,0.0000014495621,0.000009237945,0.0000050496064,0.00034742474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622387,0.0016951658,0.00042785,0.000150914,0.0013509071,0.00015129437],"domain_scores_gemma":[0.9955129,0.00016837697,0.00014831265,0.0003051361,0.0037459382,0.00011931428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009633831,0.00007093743,0.00010042298,0.00021517352,0.0002368344,0.00019672116,0.000878625,0.000016528604,0.000029048359],"category_scores_gemma":[0.0014380349,0.000049555005,0.000054778895,0.000731617,0.00016226749,0.00064356707,0.00021275664,0.0003633376,0.00008056448],"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.0012622995,0.0020877288,0.0049352413,0.00013661647,0.00043378552,0.00029079203,0.027739966,0.20968734,0.017160483,0.31847543,0.03823015,0.37956017],"study_design_scores_gemma":[0.0054602483,0.004188435,0.27227724,0.00021828087,0.000027977329,0.0006974326,0.0021224401,0.6295755,0.0048127756,0.027594123,0.052502222,0.00052335014],"about_ca_topic_score_codex":0.000017512111,"about_ca_topic_score_gemma":0.0000040819655,"teacher_disagreement_score":0.9326697,"about_ca_system_score_codex":0.00006425878,"about_ca_system_score_gemma":0.0005210998,"threshold_uncertainty_score":0.33389127},"labels":[],"label_agreement":null},{"id":"W2137571436","doi":"10.1109/sfcs.1993.366864","title":"Time-space lower bounds for directed s-t connectivity on JAG models","year":2002,"lang":"en","type":"article","venue":"","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":"Office of Naval Research; Max-Planck-Gesellschaft; University of Toronto","keywords":"Combinatorics; Omega; Upper and lower bounds; Vertex (graph theory); Path (computing); Graph; Directed graph; Mathematics; Space (punctuation); Discrete mathematics; Physics; Computer science","score_opus":0.04273537231301884,"score_gpt":0.23970680874343367,"score_spread":0.19697143643041481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137571436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007462964,0.00006037081,0.91693956,0.0033727924,0.0005805272,0.00032836958,0.0000110569135,0.00096410065,0.07028024],"genre_scores_gemma":[0.8236124,0.000011011157,0.15113233,0.0014042875,0.00015868338,0.00006609153,0.0000039109627,0.000022142254,0.023589136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988315,0.000040792253,0.00012979351,0.00044930456,0.00022196058,0.00032663424],"domain_scores_gemma":[0.9988103,0.00037802846,0.000041749103,0.0005858803,0.00008864431,0.00009543152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017770393,0.00015564307,0.00017731274,0.00009776192,0.00023684747,0.00016833442,0.00058522174,0.000062320694,0.00023697311],"category_scores_gemma":[0.000047430585,0.00013914857,0.00012841653,0.0003685919,0.00007203583,0.00045254678,0.0001332652,0.00010715048,0.0002209963],"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.000023458755,0.00066587015,0.000005839233,0.00001157773,0.000043755517,0.000008493567,0.00050473266,0.0018500213,0.00017898917,0.87459266,0.06842293,0.053691685],"study_design_scores_gemma":[0.00034325285,0.0002720222,0.000031107913,0.000009111479,0.0000029281102,0.0000035543549,0.000003198126,0.92384696,0.0004999743,0.058377706,0.016405132,0.00020505885],"about_ca_topic_score_codex":0.000016865313,"about_ca_topic_score_gemma":0.000012615714,"teacher_disagreement_score":0.92199695,"about_ca_system_score_codex":0.000033356715,"about_ca_system_score_gemma":0.000011746946,"threshold_uncertainty_score":0.5674314},"labels":[],"label_agreement":null},{"id":"W2137594903","doi":"10.1109/ipps.1999.760446","title":"Coarse grained parallel maximum matching in convex bipartite graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Binary logarithm; Computation; Matching (statistics); Regular polygon; Mathematics; Graph; Computational complexity theory; Algorithm; Statistics","score_opus":0.022486532528354888,"score_gpt":0.2465879669221275,"score_spread":0.2241014343937726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137594903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053331513,0.00017472146,0.9153598,0.0010863831,0.00070330204,0.0002695851,0.0000017554336,0.00038060473,0.028692316],"genre_scores_gemma":[0.6838155,0.000033129545,0.31407294,0.0013172099,0.000014849917,0.000026767473,0.0000019581655,0.000011741994,0.0007059446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837863,0.0001718993,0.00031155773,0.00043274832,0.000251474,0.0004536699],"domain_scores_gemma":[0.99908125,0.00013771007,0.00005666891,0.00056693103,0.000035772726,0.0001216541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060906564,0.00017709318,0.00022035887,0.0002692195,0.00015108226,0.00016085223,0.0006931952,0.000060972066,0.00014689374],"category_scores_gemma":[0.000042840566,0.00016419111,0.00010259254,0.00092752883,0.0000829803,0.00045018713,0.00014329297,0.00025155663,0.00009581484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029250434,0.00009272531,0.0012882453,0.000007451252,0.000008202286,0.000044928798,0.0005933591,0.00018500049,0.000105009174,0.9915532,0.00048324067,0.0056357444],"study_design_scores_gemma":[0.00082034606,0.000049212016,0.0018977327,0.000020449297,0.0000022631737,0.000036041554,0.00013648177,0.030690549,0.0003668574,0.9558719,0.009769323,0.0003388793],"about_ca_topic_score_codex":0.00014407498,"about_ca_topic_score_gemma":0.00018542218,"teacher_disagreement_score":0.6304839,"about_ca_system_score_codex":0.000019723535,"about_ca_system_score_gemma":0.000045522153,"threshold_uncertainty_score":0.6695519},"labels":[],"label_agreement":null},{"id":"W2139332235","doi":"10.1007/s00454-011-9352-x","title":"Improved Approximation for Guarding Simple Galleries from the Perimeter","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Perimeter; Approximation algorithm; Polygon (computer graphics); Simple polygon; Binary logarithm; Guard (computer science); Time complexity; Dimension (graph theory); Simple (philosophy); Discrete mathematics; Algorithm; Regular polygon; Geometry; Computer science","score_opus":0.04409133552517794,"score_gpt":0.2635143971703761,"score_spread":0.21942306164519818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139332235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027997335,0.00012072396,0.96998185,0.00032347225,0.00036241522,0.0003221137,0.00008838413,0.00013867229,0.00066501444],"genre_scores_gemma":[0.64249927,0.0000013020464,0.35674042,0.000397671,0.00013427707,0.00005265754,0.00014160003,0.000010354113,0.000022452447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867976,0.000056971807,0.0002902365,0.00041576708,0.00028584315,0.00027141906],"domain_scores_gemma":[0.99864006,0.00061318773,0.00013643129,0.0003843599,0.00016441337,0.00006153269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029081668,0.00017504838,0.00017224088,0.00010981065,0.00044535284,0.00024025283,0.0008741896,0.000051762152,0.00007508951],"category_scores_gemma":[0.000092347684,0.00013498336,0.00018340627,0.00046820607,0.00011356669,0.00054135773,0.0002867473,0.00012226151,0.000014191681],"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.00014428532,0.00025137677,0.0056499955,0.00006248725,0.00048168775,0.000005147175,0.012808387,0.0040229107,0.00063213333,0.8047321,0.0034052853,0.16780424],"study_design_scores_gemma":[0.00038504196,0.000084527346,0.029959748,0.000009253992,0.000013260101,0.0000035135777,0.00024360431,0.6569326,0.0004379577,0.3098722,0.0018240354,0.00023426919],"about_ca_topic_score_codex":0.00012207143,"about_ca_topic_score_gemma":0.0000063747234,"teacher_disagreement_score":0.65290964,"about_ca_system_score_codex":0.000023946335,"about_ca_system_score_gemma":0.000050067618,"threshold_uncertainty_score":0.55044615},"labels":[],"label_agreement":null},{"id":"W2140591634","doi":"10.1007/11523468_46","title":"Cache-Oblivious Planar Shortest Paths","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Cache; Parallel computing; Planar; Operating system","score_opus":0.02048433727542831,"score_gpt":0.23870999180391878,"score_spread":0.21822565452849046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140591634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045476936,0.00104233,0.98416233,0.0012479882,0.002405135,0.00038863905,0.000017840764,0.00039249661,0.010297775],"genre_scores_gemma":[0.08787392,0.0002254288,0.9032658,0.0046421867,0.0023982325,0.000021490054,0.000021525071,0.00009420489,0.0014572361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944145,0.00004306442,0.00071623456,0.0022247108,0.0014950893,0.0011063654],"domain_scores_gemma":[0.99623823,0.00057754887,0.0003025314,0.00230893,0.00023458268,0.00033817507],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000949687,0.00081489957,0.00074651605,0.0012763533,0.000463015,0.0008559882,0.0061833616,0.00045843775,0.00006847311],"category_scores_gemma":[0.000074045296,0.00077918003,0.00026202147,0.0009827,0.0010917586,0.0008073878,0.0015922042,0.001442546,0.0001540579],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029982216,0.000059809547,0.000053109663,0.000018186032,0.000015599788,0.00028118596,0.0006099781,0.006807722,0.000038310336,0.06124154,0.000117570555,0.930754],"study_design_scores_gemma":[0.00041220066,0.00034328265,0.00033087548,0.0004982636,0.000017594553,0.0004548414,2.588568e-7,0.55206853,0.000505941,0.42105952,0.022504354,0.00180431],"about_ca_topic_score_codex":0.00005032367,"about_ca_topic_score_gemma":0.0003301305,"teacher_disagreement_score":0.92894965,"about_ca_system_score_codex":0.00036340626,"about_ca_system_score_gemma":0.0006455495,"threshold_uncertainty_score":0.99946594},"labels":[],"label_agreement":null},{"id":"W2140887702","doi":"","title":"The space complexity of recognizing well-parenthesized expressions","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"Conjecture; Parenthesis; Space (punctuation); Mathematics; Expression (computer science); Computer science; Combinatorics; Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.09921090538835141,"score_gpt":0.19820078894952414,"score_spread":0.09898988356117273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140887702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181749,0.00003648277,0.36380577,0.000866444,0.0015964742,0.00024941104,0.000008840201,0.00025867528,0.015002974],"genre_scores_gemma":[0.9892726,0.00004326418,0.010010155,0.000030514322,0.000038735994,3.9086717e-7,9.0400715e-7,0.000005844594,0.0005976011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989788,0.00010933763,0.00015129171,0.00038789934,0.00009080285,0.0002818977],"domain_scores_gemma":[0.9981967,0.00046417516,0.00015280185,0.0009520449,0.0001158615,0.00011839449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032583214,0.00013105577,0.00015945558,0.000088340224,0.00059318676,0.00006753679,0.0016702418,0.000063392814,0.00006193666],"category_scores_gemma":[0.00008503459,0.000110069544,0.00013937114,0.000678253,0.00056289847,0.0003230404,0.00055223383,0.00032030404,0.000042050076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018451297,0.00007626866,0.0011050348,0.0000059096565,0.000023036448,0.000017291197,0.0001500741,0.00021330104,0.0034393577,0.99262553,0.00042602923,0.0018997318],"study_design_scores_gemma":[0.0012267301,0.00009610955,0.008777705,0.000065359636,0.00004005469,0.00001722446,0.0004909557,0.37167916,0.016691787,0.5747113,0.02563753,0.0005660761],"about_ca_topic_score_codex":0.00008574008,"about_ca_topic_score_gemma":0.00019752924,"teacher_disagreement_score":0.4179142,"about_ca_system_score_codex":0.000014331905,"about_ca_system_score_gemma":0.00005371113,"threshold_uncertainty_score":0.45623732},"labels":[],"label_agreement":null},{"id":"W2141156487","doi":"10.1145/2650183","title":"Approximating Rooted Steiner Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Generalization; Undirected graph; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Linear programming; Graph; Mathematical optimization","score_opus":0.019291360365911194,"score_gpt":0.2397969814353036,"score_spread":0.2205056210693924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141156487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003890121,0.000039858314,0.99524754,0.0011612892,0.0010103454,0.00016943665,0.0000038685885,0.000615604,0.0013630178],"genre_scores_gemma":[0.2867214,0.000017675951,0.7117873,0.0007607356,0.00021818004,0.000056126384,0.00000413823,0.000026742771,0.0004077293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811053,0.00013121577,0.00036010664,0.0005640332,0.00036891262,0.00046518916],"domain_scores_gemma":[0.99784184,0.00035674023,0.00009557614,0.0014618973,0.00008271754,0.00016120606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045692426,0.00024951086,0.00025064894,0.0002118492,0.0005127229,0.00021830783,0.0015394023,0.00012038591,0.000063280255],"category_scores_gemma":[0.000049591665,0.00023858214,0.00017623608,0.0008808824,0.00008091196,0.00042513345,0.000042030395,0.0004859903,0.00008207116],"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.0000034577392,0.00013934392,0.000005966927,0.000006618673,0.000030506022,0.0000032782516,0.00013655375,0.019660125,0.0000270413,0.007915587,0.000076608005,0.97199494],"study_design_scores_gemma":[0.00047879294,0.000168775,0.00033165576,0.00003248665,0.000012435353,0.000026858199,0.000020515512,0.97875667,0.0005755624,0.014729457,0.0045433156,0.00032350156],"about_ca_topic_score_codex":0.000039839426,"about_ca_topic_score_gemma":0.000012939765,"teacher_disagreement_score":0.9716714,"about_ca_system_score_codex":0.000037717477,"about_ca_system_score_gemma":0.000022514274,"threshold_uncertainty_score":0.9729097},"labels":[],"label_agreement":null},{"id":"W2143722695","doi":"10.1109/focs.2013.70","title":"Average Case Lower Bounds for Monotone Switching Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Monotone polygon; Corollary; Mathematics; Boolean function; Upper and lower bounds; Computation; Discrete mathematics; Function (biology); Exponential function; Combinatorics; Applied mathematics; Algorithm; Mathematical analysis","score_opus":0.01514264386887832,"score_gpt":0.23729383755771952,"score_spread":0.2221511936888412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143722695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011107699,0.000056835775,0.9838808,0.00074547675,0.0007172288,0.00031931582,6.604743e-7,0.00021732406,0.002954642],"genre_scores_gemma":[0.83647877,0.0000055956643,0.16121724,0.0013801222,0.00015997456,0.000072068666,0.0000010040418,0.00000811992,0.00067707803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000018377417,0.00018172311,0.0003195804,0.00010693091,0.0003425582],"domain_scores_gemma":[0.99911803,0.00014917615,0.000040809493,0.0005088914,0.00007331273,0.0001097689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018520071,0.00012470718,0.00012638119,0.000063154854,0.00031595523,0.0004654578,0.0005116322,0.000053720203,0.00013374226],"category_scores_gemma":[0.000014103282,0.00010787089,0.000105597275,0.00022110762,0.000023588753,0.00066158467,0.0002419433,0.00012523818,0.000046250476],"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.000008382347,0.0002492845,0.00014643437,0.000023754366,0.00006623757,0.0004986622,0.0006556754,0.005290291,0.00024459267,0.40893185,0.024405895,0.55947894],"study_design_scores_gemma":[0.0002371959,0.000064230386,0.00009499664,0.000005627902,0.0000018546333,0.00027460343,0.000009969986,0.9433503,0.00006640106,0.04937043,0.006350003,0.00017436822],"about_ca_topic_score_codex":0.00029386982,"about_ca_topic_score_gemma":0.00004404874,"teacher_disagreement_score":0.93806005,"about_ca_system_score_codex":0.000015131996,"about_ca_system_score_gemma":0.000015933412,"threshold_uncertainty_score":0.44884202},"labels":[],"label_agreement":null},{"id":"W2144918053","doi":"10.1109/acc.2013.6580451","title":"The maximum traveling salesman problem with submodular rewards","year":2013,"lang":"en","type":"article","venue":"","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","funders":"","keywords":"Submodular set function; Travelling salesman problem; Hamiltonian path; Greedy algorithm; Combinatorics; Approximation algorithm; Mathematics; Graph; Curvature; Function (biology); Matching (statistics); Computer science; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.008415098594869191,"score_gpt":0.19089546495660148,"score_spread":0.1824803663617323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144918053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016429832,0.00010135326,0.95032763,0.005991252,0.00018072274,0.00039615098,3.8899043e-7,0.00034038615,0.026232272],"genre_scores_gemma":[0.60085356,0.000029665496,0.3963067,0.0005146425,0.00008800085,0.00008059715,0.0000010076374,0.0000140009715,0.00211184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887514,0.000039899664,0.00015953177,0.00029224562,0.0002902943,0.00034290986],"domain_scores_gemma":[0.99904937,0.00007815294,0.000043158758,0.0006421573,0.00010376681,0.00008338672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027345202,0.0001222686,0.0000961533,0.000031063828,0.00043383744,0.00049781555,0.0010804068,0.000030822666,0.000037510603],"category_scores_gemma":[0.000006464506,0.00006638018,0.000047454385,0.00033846346,0.00011464155,0.00039170944,0.00018769028,0.00014504534,0.00011956811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036232148,0.000057324716,0.0005265344,0.000013079632,0.00004157588,0.000010711716,0.00066541124,0.00011517753,0.00023040082,0.60571235,0.002672356,0.38995144],"study_design_scores_gemma":[0.00063596613,0.00033049824,0.010996932,0.000053129184,0.000008947555,0.000119848126,0.00030088957,0.21551548,0.0022078722,0.72799414,0.04120813,0.0006281535],"about_ca_topic_score_codex":0.00019811784,"about_ca_topic_score_gemma":0.00009914107,"teacher_disagreement_score":0.5844237,"about_ca_system_score_codex":0.000013918661,"about_ca_system_score_gemma":0.000040926003,"threshold_uncertainty_score":0.48004466},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","score_opus":0.023544572033005622,"score_gpt":0.23902169803769704,"score_spread":0.21547712600469143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145866065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012263502,0.0005090857,0.98865074,0.005037098,0.0008219147,0.0023662075,0.00003631702,0.00026585528,0.00108643],"genre_scores_gemma":[0.064609796,0.00019756993,0.92035073,0.0024330819,0.0010981152,0.0025480415,0.0000726058,0.00011105768,0.008578989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974835,0.00007951632,0.0004995798,0.0008207642,0.00042438865,0.00069226115],"domain_scores_gemma":[0.9975781,0.00074966234,0.00023102366,0.0009879546,0.00026762654,0.00018566899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021424,0.00039070135,0.00037101688,0.00014321979,0.0006601274,0.0009549259,0.0012833405,0.00016529528,0.00008031005],"category_scores_gemma":[0.000090752415,0.00026176698,0.00020285301,0.00051237707,0.00031500938,0.0011946124,0.00044590063,0.00028162915,0.00013133691],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011392177,0.00014088875,0.000020295749,0.000057724985,0.00013292671,0.0000017331663,0.0007339786,0.000027093964,0.00095003773,0.01432289,0.007635618,0.97596544],"study_design_scores_gemma":[0.0013662683,0.00025316197,0.0010077503,0.000023422379,0.000038715036,0.000034562745,0.000051051225,0.8953127,0.0013656714,0.06091336,0.039198857,0.00043446897],"about_ca_topic_score_codex":0.00026214513,"about_ca_topic_score_gemma":0.00002214433,"teacher_disagreement_score":0.9755309,"about_ca_system_score_codex":0.00006761979,"about_ca_system_score_gemma":0.00010112564,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2148177011","doi":"10.1109/sfcs.2001.959906","title":"Approximating directed multicuts","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Divide and conquer algorithms; Linear programming; Multi-commodity flow problem; Approximation algorithm; Flow (mathematics); Computer science; Mathematical optimization; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Flow network; Algorithm","score_opus":0.02410645982831961,"score_gpt":0.2473935594959544,"score_spread":0.2232870996676348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148177011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111745745,0.000028148255,0.92897516,0.0005362571,0.00021027411,0.00006685913,1.9436007e-7,0.0009994593,0.058009077],"genre_scores_gemma":[0.27662116,0.000005932255,0.72169745,0.0003381651,0.000049239494,0.000006294998,7.040694e-7,0.0000036802278,0.0012773555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993188,0.000022567092,0.00012811046,0.000202462,0.00013825727,0.00018980473],"domain_scores_gemma":[0.9994953,0.00006905402,0.000028402234,0.00031658442,0.0000360783,0.00005454954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012102057,0.00006890872,0.00007741326,0.000057374793,0.00011560961,0.0001021727,0.0004919853,0.000021337166,0.000071426606],"category_scores_gemma":[0.000037636928,0.000058818336,0.00003789686,0.00044719627,0.000022607072,0.00025127322,0.00018110794,0.000066505585,0.00007737091],"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.0000023835444,0.00016685686,0.002109528,0.00000875592,0.00001856482,0.00005422085,0.0008755075,0.00005836929,0.00079064997,0.37671676,0.0017806474,0.61741775],"study_design_scores_gemma":[0.00018538967,0.000018165525,0.0028815242,0.000008057541,0.0000011489587,0.000045581044,0.000021439968,0.96883863,0.00081130496,0.017319316,0.009718316,0.00015114732],"about_ca_topic_score_codex":0.000036590627,"about_ca_topic_score_gemma":0.000010213528,"teacher_disagreement_score":0.9687802,"about_ca_system_score_codex":0.000008611574,"about_ca_system_score_gemma":0.000009082587,"threshold_uncertainty_score":0.23985422},"labels":[],"label_agreement":null},{"id":"W2149512005","doi":"10.1109/spdp.1994.346125","title":"Good algorithm design style for multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Constant (computer programming); Style (visual arts); Word (group theory); Parallel computing; Algorithm; Programming language; Mathematics","score_opus":0.06461770496559291,"score_gpt":0.25339448657333097,"score_spread":0.18877678160773806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149512005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029428438,0.00015740613,0.9944834,0.0006645183,0.0002710842,0.00028574638,0.0000043049854,0.00034772282,0.0037564032],"genre_scores_gemma":[0.012112506,0.000017205744,0.98356545,0.0004458363,0.000087521665,0.00006545055,9.276338e-7,0.000009195649,0.0036958836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989069,0.000029176688,0.00016917329,0.00037277458,0.00019095186,0.00033103867],"domain_scores_gemma":[0.99912965,0.00024696975,0.000044360855,0.00039773175,0.000086096545,0.00009519235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021896786,0.00013208218,0.00013415559,0.000090375775,0.00020877432,0.00015397993,0.00086879317,0.00004997087,0.00014074326],"category_scores_gemma":[0.000035081375,0.0001173268,0.00009067373,0.00037000814,0.000040608,0.00040789106,0.00012550746,0.00007572732,0.00010554768],"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.000001397569,0.00017423573,0.0000085492875,0.000010862314,0.000018232156,0.0000043128452,0.000508068,0.00010358024,0.00004718892,0.061707783,0.008907956,0.9285078],"study_design_scores_gemma":[0.00045771553,0.00012791555,0.000024662797,0.0000051474167,0.0000030996664,0.000009986632,0.000022970306,0.9579831,0.0021551722,0.017287215,0.021729859,0.00019318327],"about_ca_topic_score_codex":0.000009711707,"about_ca_topic_score_gemma":0.000002079967,"teacher_disagreement_score":0.9578795,"about_ca_system_score_codex":0.000014989744,"about_ca_system_score_gemma":0.000010645367,"threshold_uncertainty_score":0.4784448},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"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":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.020217592333712276,"score_gpt":0.2677943535910513,"score_spread":0.24757676125733902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149565746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013021097,0.000011163203,0.98181266,0.0013026856,0.0019418383,0.00018354382,0.00006513024,0.0005058553,0.0011560129],"genre_scores_gemma":[0.7140565,0.000006974004,0.28542334,0.00026057317,0.00008961293,0.000028443581,0.000010448225,0.000016157588,0.000107941116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812734,0.000057000685,0.00031362858,0.0005903529,0.00046270224,0.00044895476],"domain_scores_gemma":[0.9973236,0.0010369299,0.00009064242,0.0012438054,0.00011281915,0.00019223618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026762582,0.00025275166,0.00020583326,0.0005424386,0.00089312263,0.00027455186,0.0014276059,0.00011770958,0.0000899077],"category_scores_gemma":[0.00014049342,0.0002533412,0.0001873156,0.0018386372,0.00010425452,0.00037214713,0.000036721358,0.00092913315,0.00017521594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003494106,0.00041108017,0.0000117466,0.000006049146,0.00003541625,0.000015465559,0.00016073484,0.0021528173,0.00016053762,0.07713312,0.00005951312,0.91985005],"study_design_scores_gemma":[0.0017430627,0.00076905853,0.0074069323,0.000100189296,0.000055367207,0.00016820451,0.00015935213,0.7894169,0.009301541,0.18506187,0.0045664986,0.0012510272],"about_ca_topic_score_codex":0.00006379855,"about_ca_topic_score_gemma":0.000034538858,"teacher_disagreement_score":0.918599,"about_ca_system_score_codex":0.000050380935,"about_ca_system_score_gemma":0.000059778235,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2151077859","doi":"10.1007/11523468_76","title":"How Well Can Primal-Dual and Local-Ratio Algorithms Perform?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner tree problem; Combinatorics; Scheduling (production processes); Approximation algorithm; Dual (grammatical number); Computer science; Mathematics; Set cover problem; Set (abstract data type); Tree (set theory); Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.01625972781171476,"score_gpt":0.22452684843186915,"score_spread":0.2082671206201544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151077859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089916386,0.00084545487,0.9907029,0.0041677607,0.0013891474,0.00041481634,0.0000137214765,0.00021247048,0.0021637727],"genre_scores_gemma":[0.115387514,0.00025948483,0.87795985,0.0027164326,0.0016671486,0.000016259077,0.000013936041,0.0000627957,0.0019165868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951402,0.00003942006,0.0004987544,0.0020799867,0.0012836378,0.0009580301],"domain_scores_gemma":[0.99727833,0.00034658908,0.00028181987,0.0014800413,0.00026539672,0.00034784185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007459827,0.000778555,0.0006805797,0.0008797436,0.0005715665,0.0017456426,0.0027737718,0.00040738218,0.000037141854],"category_scores_gemma":[0.00003994551,0.00071994506,0.00015722984,0.000676453,0.0019465331,0.00104857,0.0021209377,0.001247225,0.000020159207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026961234,0.000025588972,0.000019171164,0.000030842082,0.000012412256,0.00008086767,0.0005607199,0.0029872702,0.00001954018,0.049211603,0.000024880368,0.9470244],"study_design_scores_gemma":[0.00038662148,0.00028197316,0.00013572643,0.00021521118,0.000012048933,0.00031412364,0.0000010120932,0.86715335,0.0011440882,0.117030844,0.012286173,0.0010388301],"about_ca_topic_score_codex":0.00004446621,"about_ca_topic_score_gemma":0.00029073944,"teacher_disagreement_score":0.94598556,"about_ca_system_score_codex":0.00035631092,"about_ca_system_score_gemma":0.0006275115,"threshold_uncertainty_score":0.9995252},"labels":[],"label_agreement":null},{"id":"W2151534739","doi":"10.5555/1283383.1283519","title":"Approximation algorithms for node-weighted buy-at-bulk network design","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Approximation algorithm; Logarithm; Node (physics); Network planning and design; Computer science; Approximation theory; Constant (computer programming); Algorithm; Mathematics; Mathematical optimization; Physics; Computer network; Mathematical analysis","score_opus":0.032800880178982764,"score_gpt":0.2760675828761797,"score_spread":0.24326670269719697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151534739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022742414,0.00030580844,0.9896402,0.0018115855,0.0026209413,0.0017127601,0.00007328043,0.0008062034,0.0028017957],"genre_scores_gemma":[0.006060415,0.000090230984,0.9886528,0.0013018961,0.0017874675,0.00030774518,0.0002023399,0.000110173496,0.0014869006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99445194,0.00020686949,0.0010018118,0.0015441469,0.0010593245,0.0017359009],"domain_scores_gemma":[0.9961106,0.0010659489,0.00043340665,0.0015830799,0.00031893412,0.00048803113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026590843,0.0007302454,0.0006540345,0.00041046448,0.0011443315,0.0004155391,0.0019994401,0.00035135806,0.000040489267],"category_scores_gemma":[0.00005746933,0.0006847922,0.00046159042,0.0014460296,0.00028816005,0.0007848977,0.0005665361,0.00043331544,0.00014744094],"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.001219232,0.0014803972,0.0001828604,0.00032720086,0.0008269263,0.0002855684,0.0034952743,0.039997324,0.0065975473,0.4344666,0.045767117,0.46535394],"study_design_scores_gemma":[0.0020616371,0.0009787054,0.00020554177,0.0001165651,0.000056027064,0.00007213781,0.000036286685,0.90385675,0.016376654,0.04768504,0.027326567,0.0012280712],"about_ca_topic_score_codex":0.000027658456,"about_ca_topic_score_gemma":0.00001001879,"teacher_disagreement_score":0.8638594,"about_ca_system_score_codex":0.000335698,"about_ca_system_score_gemma":0.00011240808,"threshold_uncertainty_score":0.9995603},"labels":[],"label_agreement":null},{"id":"W2152454366","doi":"10.1109/lics.2011.12","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"article","venue":"","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":"Bipartite graph; Correctness; Lemma (botany); Blossom algorithm; 3-dimensional matching; Factor-critical graph; Algorithm; Matching (statistics); Perfect graph theorem; Computer science; Mathematics; Probabilistic logic; Theoretical computer science; Discrete mathematics; Graph; Voltage graph; Line graph; Artificial intelligence","score_opus":0.050079969346586865,"score_gpt":0.24624360883025967,"score_spread":0.1961636394836728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152454366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010388192,0.00006461424,0.887192,0.00010093371,0.00045098207,0.00014509118,3.057561e-7,0.000380959,0.1106263],"genre_scores_gemma":[0.15584378,0.000017385604,0.8431008,0.0004867231,0.00005007644,0.000020926442,5.805158e-7,0.0000065198,0.00047320037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.000081894796,0.00025930794,0.0002528657,0.00019393681,0.0002847242],"domain_scores_gemma":[0.99926525,0.00013024923,0.000063951666,0.0004170572,0.000040135772,0.000083333616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076632405,0.00012251381,0.0002625963,0.00011524671,0.00016718222,0.00010740924,0.0008698976,0.000036178197,0.00019183464],"category_scores_gemma":[0.000021512657,0.00009506506,0.0001750151,0.00025881935,0.00007785718,0.0007547367,0.00034891567,0.00011376215,0.00008979963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001498297,0.00003158093,0.000009756998,0.0000041152107,0.000021776446,0.000010902442,0.002649708,0.0000019556128,0.000014800085,0.9504569,0.000094922354,0.046553757],"study_design_scores_gemma":[0.028045816,0.00003286201,0.0001241085,0.000020204181,0.000010363626,0.000061491824,0.00014150054,0.15590122,0.002426367,0.8118025,0.0010837539,0.00034976786],"about_ca_topic_score_codex":0.00026491188,"about_ca_topic_score_gemma":0.0000073430538,"teacher_disagreement_score":0.15589927,"about_ca_system_score_codex":0.000009348936,"about_ca_system_score_gemma":0.000017927123,"threshold_uncertainty_score":0.38766405},"labels":[],"label_agreement":null},{"id":"W2153601281","doi":"10.1016/j.dam.2014.07.005","title":"About the minimum mean cycle-canceling algorithm","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Function (biology); Constructive; Mathematical optimization; Linear programming; Acceleration; Time complexity; Computer science","score_opus":0.017111570593093244,"score_gpt":0.24394862018535263,"score_spread":0.2268370495922594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153601281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012483279,0.00008055564,0.9660543,0.00044501128,0.00028236772,0.00027259433,0.000004229118,0.00026368254,0.03134894],"genre_scores_gemma":[0.09158986,0.000032073414,0.9067142,0.0010174274,0.00033947115,0.00009541346,0.0000073298625,0.00003650969,0.00016769923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998226,0.00003124325,0.0004028375,0.00040593135,0.0004896318,0.00044437518],"domain_scores_gemma":[0.9979428,0.00040297984,0.00018873202,0.0012775435,0.000049188784,0.00013875651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322417,0.0002528235,0.00029050742,0.00006752457,0.00041526795,0.00030839356,0.0017996171,0.00007025213,0.000018400871],"category_scores_gemma":[0.00004216859,0.00017564556,0.00013180939,0.00039839032,0.00016858158,0.0001425555,0.00048739536,0.0002545415,0.00013912522],"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.0000010050384,0.000041143023,8.908709e-7,0.000041140847,0.000022957513,0.0000010191222,0.004220843,0.00007665764,0.00017628222,0.8623335,0.00031317602,0.13277143],"study_design_scores_gemma":[0.00022310675,0.000023415327,0.000008023438,0.000036220703,0.000013233883,0.000009490169,0.00048522677,0.62958944,0.0006720499,0.3622665,0.0064188535,0.00025444443],"about_ca_topic_score_codex":0.0000058988094,"about_ca_topic_score_gemma":0.0000041177063,"teacher_disagreement_score":0.6295128,"about_ca_system_score_codex":0.000021312773,"about_ca_system_score_gemma":0.000032951306,"threshold_uncertainty_score":0.7162618},"labels":[],"label_agreement":null},{"id":"W2153817623","doi":"10.1016/j.dam.2015.01.004","title":"Informative path planning as a maximum traveling salesman problem with submodular rewards","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Travelling salesman problem; Greedy algorithm; Mathematical optimization; Hamiltonian path; Graph; Combinatorics","score_opus":0.029510440279979126,"score_gpt":0.2557570293357331,"score_spread":0.22624658905575395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153817623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019699564,0.000038211267,0.91304857,0.00013121161,0.000059762686,0.00051625865,0.000006201434,0.0003495529,0.06615065],"genre_scores_gemma":[0.26454023,0.0000026629261,0.7350472,0.0001652533,0.000047488036,0.00008690835,0.000016524364,0.00002851761,0.0000651868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799013,0.000018117358,0.00044634318,0.00035614823,0.0007152397,0.0004740334],"domain_scores_gemma":[0.9985652,0.000079899364,0.00026251454,0.0007256878,0.00012039882,0.00024628296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058609305,0.00031436372,0.00037319187,0.00011424874,0.00019421017,0.0002922454,0.000950488,0.00008644669,0.000004692477],"category_scores_gemma":[0.000023776834,0.0002457613,0.00006707447,0.00052190956,0.00012388108,0.00046073375,0.00034947548,0.00029176899,0.00007869601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003216083,0.00012589658,0.00003116438,0.00026285538,0.00009650222,0.000056261237,0.067803845,0.0017266724,0.00011674238,0.9226139,0.0005057195,0.0066282484],"study_design_scores_gemma":[0.0013554462,0.0003224608,0.000049213682,0.00035299317,0.00003849546,0.00016161778,0.0074175703,0.14774433,0.0015959231,0.8380698,0.0021059944,0.0007861848],"about_ca_topic_score_codex":0.000008771107,"about_ca_topic_score_gemma":0.0000016028625,"teacher_disagreement_score":0.24484067,"about_ca_system_score_codex":0.000055337616,"about_ca_system_score_gemma":0.00015618616,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2156206152","doi":"10.1109/icde.2013.6544815","title":"Scalable maximum clique computation using MapReduce","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"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; Amazon Web Services","keywords":"Scalability; Computer science; Clique; Computation; Parallel computing; Graph partition; Key (lock); Fault tolerance; Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Combinatorics","score_opus":0.034483483281057714,"score_gpt":0.26819890879772396,"score_spread":0.23371542551666624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156206152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039088435,0.000020273837,0.9482925,0.0007617023,0.00035785325,0.00015513858,3.6784712e-7,0.00023929031,0.01108445],"genre_scores_gemma":[0.3913371,0.000002096737,0.60772806,0.00049184926,0.000050207844,0.000007106538,0.0000012198402,0.000005219144,0.00037712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912965,0.00004120788,0.0001641571,0.00026487373,0.0001650549,0.00023502501],"domain_scores_gemma":[0.9994524,0.000049899194,0.000043118453,0.00027183647,0.000102380174,0.00008032719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011927135,0.00009486467,0.000098380246,0.000090441965,0.00014881749,0.0003042718,0.00045472346,0.000040429462,0.00017137354],"category_scores_gemma":[0.0000083834975,0.00008748268,0.000047242163,0.0003718578,0.000041666946,0.00081920804,0.00022837668,0.00008813038,0.000286351],"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.0000025925092,0.00028387844,0.0010933308,0.00005048397,0.00004117311,0.000012860649,0.0006850219,0.007750695,0.00690362,0.38985094,0.014504887,0.5788205],"study_design_scores_gemma":[0.00010455074,0.000020894478,0.0012211258,0.000009716412,0.0000012649236,0.000015403317,0.000019856921,0.815767,0.001359567,0.18072417,0.00062803196,0.00012842937],"about_ca_topic_score_codex":0.00043275303,"about_ca_topic_score_gemma":0.000003351153,"teacher_disagreement_score":0.8080163,"about_ca_system_score_codex":0.000026550102,"about_ca_system_score_gemma":0.00003597257,"threshold_uncertainty_score":0.36805582},"labels":[],"label_agreement":null},{"id":"W2156300926","doi":"10.1007/s00453-011-9503-8","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Vertex (graph theory); Clique graph; Unit disk graph; Clique; Upper and lower bounds; Adjacency matrix; Discrete mathematics; Unit disk; Graph; Line graph; Computer science; Graph power","score_opus":0.08879720214434278,"score_gpt":0.26280306556968097,"score_spread":0.1740058634253382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156300926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023522178,0.00015278284,0.9698039,0.0007789956,0.0009939072,0.0007407198,0.00004939874,0.00032678223,0.0036313066],"genre_scores_gemma":[0.4380871,0.000052920193,0.560497,0.000550287,0.00016193044,0.00033915698,0.000033978202,0.00003303489,0.0002445711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998183,0.000092857634,0.00040036943,0.0005743761,0.00020896882,0.0005404197],"domain_scores_gemma":[0.9988402,0.00016282816,0.00011102427,0.0006398171,0.000104768726,0.0001413192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244748,0.00022427751,0.00025824286,0.00031008504,0.00016568927,0.000085144435,0.0009977303,0.00012302626,0.000046798294],"category_scores_gemma":[0.000048706497,0.00022735645,0.00017063129,0.0008272419,0.00012677444,0.0005376314,0.00021652259,0.00022104669,0.000038071914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072104864,0.00089420885,0.0014852304,0.00006440827,0.00007367969,0.00007703573,0.00316411,0.000054637112,0.0003013097,0.81519246,0.00237837,0.17624244],"study_design_scores_gemma":[0.0016571509,0.00065161224,0.016287902,0.000111297195,0.000027603559,0.000047607464,0.00020039457,0.23648223,0.005009779,0.7262727,0.012360335,0.000891386],"about_ca_topic_score_codex":0.00020001392,"about_ca_topic_score_gemma":0.00017755922,"teacher_disagreement_score":0.41456494,"about_ca_system_score_codex":0.000029742709,"about_ca_system_score_gemma":0.000068622634,"threshold_uncertainty_score":0.9271327},"labels":[],"label_agreement":null},{"id":"W2157381209","doi":"10.1109/ccc.2011.15","title":"Approximation Algorithms for QMA-Complete Problems","year":2011,"lang":"en","type":"article","venue":"","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":"","keywords":"Approximation algorithm; Constraint satisfaction problem; Polynomial-time approximation scheme; Approximation theory; Class (philosophy); Computer science; Hamiltonian (control theory); Algorithm; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.13845659720429343,"score_gpt":0.26490266462009643,"score_spread":0.126446067415803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157381209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023393416,0.000029289631,0.97892946,0.00022017995,0.00038280382,0.00045283165,0.0000055580454,0.00035415308,0.0193918],"genre_scores_gemma":[0.028223831,0.0000039864726,0.9706812,0.00027684166,0.0000764434,0.00014017947,0.0000071355826,0.000009260592,0.00058115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989328,0.000021899625,0.00022218775,0.0003629145,0.00016883513,0.0002913726],"domain_scores_gemma":[0.9992297,0.000054697302,0.00006886414,0.00046903815,0.00010256786,0.00007512492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028237846,0.00012620776,0.00013355089,0.00010615793,0.00017035566,0.000092325936,0.0008294444,0.00004497746,0.000067056775],"category_scores_gemma":[0.000015608863,0.00011005317,0.000100167774,0.00029374048,0.000048538637,0.0005163996,0.00015439189,0.000067841764,0.0000548938],"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.0000029388275,0.0001070097,0.000030523843,0.00003017582,0.00001602878,9.404058e-7,0.0015128641,0.000007352064,0.00020885906,0.86967885,0.00088801584,0.12751646],"study_design_scores_gemma":[0.00041896635,0.00017579997,0.00058261893,0.000012240601,0.0000047312155,0.000013835869,0.000040084855,0.5173795,0.0023152598,0.46528098,0.013516127,0.00025985175],"about_ca_topic_score_codex":0.000052862953,"about_ca_topic_score_gemma":0.00001006645,"teacher_disagreement_score":0.51737213,"about_ca_system_score_codex":0.000014486,"about_ca_system_score_gemma":0.000022341781,"threshold_uncertainty_score":0.44878381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096423045,0.00023464469,0.8943897,0.00036770434,0.001710736,0.00075195706,0.00025151833,0.00014765473,0.0057230606],"genre_scores_gemma":[0.9827399,0.000054669556,0.016089987,0.0006939342,0.00011973497,0.00004386248,0.000039687424,0.000026960142,0.00019122977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968925,0.0000642487,0.0009437615,0.00019581916,0.00079792255,0.0011057232],"domain_scores_gemma":[0.9976275,0.00036736217,0.00032200877,0.0011847252,0.00022711421,0.00027130262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969456,0.00032694088,0.0003685032,0.00018456145,0.0005419841,0.00036193046,0.0019110156,0.00014861855,0.000048585996],"category_scores_gemma":[0.000047388003,0.00023915646,0.00035674713,0.00045683002,0.0003936848,0.002033169,0.0009962582,0.00044777282,0.000112763446],"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.00035303432,0.0015576113,0.012318127,0.00084485195,0.0006649791,0.000009070648,0.0423865,0.0004385396,0.00012447358,0.74350035,0.021750607,0.17605188],"study_design_scores_gemma":[0.0080641415,0.0012821533,0.020118656,0.00035095375,0.00008291144,0.0003518624,0.006268849,0.21631853,0.006044049,0.03480598,0.7042157,0.0020962157],"about_ca_topic_score_codex":0.000021483034,"about_ca_topic_score_gemma":0.0000072724856,"teacher_disagreement_score":0.8863169,"about_ca_system_score_codex":0.00009088132,"about_ca_system_score_gemma":0.00007940408,"threshold_uncertainty_score":0.97525173},"labels":[],"label_agreement":null},{"id":"W2158764863","doi":"10.1098/rspa.2005.1546","title":"Quantum computing, postselection, and probabilistic polynomial-time","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":319,"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":"Corollary; Postselection; Complexity class; Probabilistic logic; Class (philosophy); Generalization; Axiom; Mathematical proof; Quantum computer; Simple (philosophy); Intersection (aeronautics); Time complexity; Mathematics; Discrete mathematics; Polynomial; Quantum; Computation; Computer science; Algorithm; Quantum mechanics","score_opus":0.007382453605906405,"score_gpt":0.20613534197199818,"score_spread":0.19875288836609178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158764863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868341,0.00006420531,0.010718874,0.0016324461,0.00004185958,0.00013298106,7.618925e-7,0.000118464464,0.00045630286],"genre_scores_gemma":[0.9625931,0.0000020145794,0.03721175,0.0000376341,0.00009901563,0.0000030995252,2.633413e-8,0.000003994079,0.0000493603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990919,0.0000029413407,0.00015790472,0.00025989613,0.0002590584,0.00022827084],"domain_scores_gemma":[0.9996027,0.0001496061,0.000062767016,0.000062040745,0.000049100763,0.00007381652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003077265,0.00012439644,0.00019033771,0.000018237984,0.00027230702,0.00016370023,0.00047992115,0.000031063562,0.0000016416924],"category_scores_gemma":[0.00010155734,0.00008074072,0.0000995667,0.00036821334,0.00043911522,0.00022599845,0.00036450208,0.00013270322,0.0000020277203],"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.0000023752198,0.00029017098,0.0001664277,0.0004885157,0.00004074193,5.9560907e-8,0.0050226357,0.003628354,0.007203337,0.9778962,0.0010492929,0.0042118784],"study_design_scores_gemma":[0.000068037465,0.00006217595,0.0011088765,0.00006754471,0.000008330442,0.000006511405,0.000028842456,0.9513376,0.0006732549,0.046475023,0.000055219327,0.000108584965],"about_ca_topic_score_codex":0.0000032487783,"about_ca_topic_score_gemma":3.192674e-8,"teacher_disagreement_score":0.94770926,"about_ca_system_score_codex":0.000012956222,"about_ca_system_score_gemma":0.000012192368,"threshold_uncertainty_score":0.32925108},"labels":[],"label_agreement":null},{"id":"W2159111594","doi":"10.1007/11534273_3","title":"Heap Building Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heap (data structure); Computer science; Programming language","score_opus":0.020962658027573466,"score_gpt":0.2585022915845295,"score_spread":0.237539633556956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159111594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004164807,0.0009721681,0.984225,0.0015386592,0.0028670125,0.00027125617,0.000004870996,0.0003384818,0.009740902],"genre_scores_gemma":[0.031223297,0.00008825071,0.9633927,0.0027177911,0.0015807615,0.0000083680825,0.0000032611877,0.00004579169,0.00093982456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950795,0.0000319788,0.00061984564,0.001962643,0.001312626,0.0009934003],"domain_scores_gemma":[0.996846,0.00044354185,0.000268036,0.0019687947,0.00021098237,0.00026262493],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010030473,0.0006658649,0.00062555564,0.0012521741,0.00052988355,0.001130663,0.0057135215,0.0003592014,0.00006387063],"category_scores_gemma":[0.00006402631,0.0006542353,0.00024347803,0.00096596207,0.0010752415,0.00094496686,0.0024681205,0.0012398638,0.000080129335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018274674,0.000023855706,0.000012133875,0.000016951493,0.000008722234,0.00006854819,0.00027538015,0.0077029043,0.000055610006,0.18213649,0.00003898311,0.8096586],"study_design_scores_gemma":[0.00022505001,0.00012980321,0.00006306035,0.00033794195,0.0000061230003,0.00016201995,5.8589638e-8,0.45624155,0.00069911155,0.5125263,0.028718447,0.00089054386],"about_ca_topic_score_codex":0.000024237468,"about_ca_topic_score_gemma":0.000078587604,"teacher_disagreement_score":0.80876803,"about_ca_system_score_codex":0.00039837288,"about_ca_system_score_gemma":0.0005742502,"threshold_uncertainty_score":0.99990624},"labels":[],"label_agreement":null},{"id":"W2160532428","doi":"10.1007/s00446-013-0194-z","title":"No sublogarithmic-time approximation scheme for bipartite vertex cover","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Bipartite graph; Vertex cover; Vertex (graph theory); Approximation algorithm; Upper and lower bounds; Expander graph; Theory of computation; Independent set; Matching (statistics); Feedback vertex set","score_opus":0.014160740544779971,"score_gpt":0.23128453283306682,"score_spread":0.21712379228828685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160532428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952522,0.000037713216,0.98118013,0.00036986274,0.00050731987,0.00053142215,0.00005826635,0.0004804005,0.0008823738],"genre_scores_gemma":[0.59202236,0.00000205318,0.40636352,0.00048520535,0.00027361632,0.00007193625,0.00053146126,0.000024319994,0.00022552858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982789,0.000051028583,0.00036970168,0.000502197,0.0002558701,0.00054228917],"domain_scores_gemma":[0.99845284,0.0002978324,0.00016516178,0.00054530235,0.00041108608,0.00012776515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003072187,0.00021243424,0.00024757095,0.00009467448,0.00038350804,0.00052647176,0.0009382626,0.0000926891,0.00008272962],"category_scores_gemma":[0.00015011932,0.00021774344,0.00014719788,0.0005564866,0.000059955975,0.000615063,0.00029936308,0.00016233431,0.0009691842],"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.000057031593,0.0013741743,0.004042359,0.00047339918,0.0004930182,0.000020500069,0.0013487512,0.008952863,0.035415687,0.38560653,0.22440805,0.33780766],"study_design_scores_gemma":[0.00053998904,0.000063633095,0.001489666,0.00003650763,0.0000053516223,0.0000072165817,0.000007881499,0.9794848,0.0010302129,0.008858556,0.00819727,0.00027890014],"about_ca_topic_score_codex":0.000029601862,"about_ca_topic_score_gemma":2.0822583e-7,"teacher_disagreement_score":0.97053194,"about_ca_system_score_codex":0.00006426497,"about_ca_system_score_gemma":0.00004700727,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W2160909640","doi":"10.1145/1806689.1806703","title":"Hardness amplification in proof complexity","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Degree (music); Proof complexity; Discrete mathematics; Rank (graph theory); Mathematics; Resolution (logic); Tree (set theory); Structural proof theory; Proof of concept; Combinatorial proof; Combinatorics; Proof theory; Computer science; Physics; Programming language","score_opus":0.04004660596034626,"score_gpt":0.2741328864339488,"score_spread":0.23408628047360253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160909640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054893363,0.00000674386,0.9166878,0.0019385457,0.0010078002,0.00020590998,0.0000014932273,0.00020761786,0.025050744],"genre_scores_gemma":[0.8181349,5.946324e-7,0.18136957,0.00018843597,0.000038612103,0.000016570151,0.0000022983581,0.0000028225243,0.00024616375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921596,0.000024724097,0.00015658903,0.00027259297,0.00015229265,0.00017785424],"domain_scores_gemma":[0.99928147,0.00003201728,0.00003370491,0.0005514779,0.000047996156,0.000053366562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027307516,0.00007456345,0.000093420516,0.000108425585,0.00007491485,0.00011009877,0.0007957093,0.000041977513,0.00007926099],"category_scores_gemma":[0.000028271275,0.00006836188,0.00003100406,0.000454273,0.00009296226,0.0003391483,0.00016579835,0.00022230248,0.000052036823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3526825e-7,0.00008832193,0.0015667886,0.000003876187,0.0000011539137,0.0000011191194,0.00014966416,0.0000026482946,0.0014049234,0.95863867,0.00034119576,0.037800726],"study_design_scores_gemma":[0.00041940887,0.000032551798,0.17983,0.000008569681,0.0000010585732,0.000021458734,0.00002491476,0.15812057,0.008611169,0.62756526,0.025048157,0.00031688702],"about_ca_topic_score_codex":0.00013249894,"about_ca_topic_score_gemma":0.0009237227,"teacher_disagreement_score":0.7632416,"about_ca_system_score_codex":0.00000920134,"about_ca_system_score_gemma":0.00003097197,"threshold_uncertainty_score":0.27877164},"labels":[],"label_agreement":null},{"id":"W2160921566","doi":"10.1145/1497290.1497300","title":"Algorithms for distributional and adversarial pipelined filter ordering problems","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"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":"Division of Information and Intelligent Systems; National Science Foundation","keywords":"Computer science; Tuple; Filter (signal processing); Algorithm; Context (archaeology); Data stream mining; Set (abstract data type); Mathematics; Data mining; Discrete mathematics","score_opus":0.03906695759045289,"score_gpt":0.27677252201348246,"score_spread":0.23770556442302956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160921566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036906337,0.00009324116,0.99229956,0.00510885,0.0009486832,0.00054115884,0.00020045713,0.00034165697,0.00009734039],"genre_scores_gemma":[0.117250465,0.00009695293,0.88078654,0.00084910047,0.0004195649,0.00016035407,0.00005951595,0.00002460831,0.00035289157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794453,0.000043296728,0.00038878113,0.0007261795,0.00037516464,0.00052202574],"domain_scores_gemma":[0.9985237,0.00028194583,0.000085691325,0.000749845,0.0001584335,0.00020038325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029978782,0.00031195238,0.0002859304,0.00021055751,0.0006613604,0.0002432298,0.00089900894,0.00014033636,0.00004210932],"category_scores_gemma":[0.00005152037,0.0003093722,0.00020094028,0.0005175095,0.0001064762,0.00060869165,0.000030203877,0.00031788734,0.000013842345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039685896,0.0003677368,0.000003913122,0.000017740047,0.00005655806,0.0000064610404,0.0002719978,0.0012466479,0.00026441325,0.008003179,0.0002685877,0.9894531],"study_design_scores_gemma":[0.0048608608,0.001662445,0.0015148858,0.00011165419,0.00007723214,0.00016304148,0.00007384455,0.78104115,0.004053051,0.17272413,0.032530196,0.0011875363],"about_ca_topic_score_codex":0.000029771876,"about_ca_topic_score_gemma":0.000009121395,"teacher_disagreement_score":0.9882655,"about_ca_system_score_codex":0.00006725771,"about_ca_system_score_gemma":0.00007225067,"threshold_uncertainty_score":0.99993587},"labels":[],"label_agreement":null},{"id":"W2164286489","doi":"10.1109/lics.2007.47","title":"Symmetric Datalog and Constraint Satisfaction Problems in Logspace","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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; Concordia University; McGill University","funders":"","keywords":"Datalog; Complement (music); Constraint satisfaction problem; Class (philosophy); Combinatorics; Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.023498786149953117,"score_gpt":0.2538012555813005,"score_spread":0.23030246943134738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164286489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050229367,0.00012715366,0.9402986,0.00033413107,0.00017628974,0.00013290311,0.0000013818213,0.00009572209,0.008604461],"genre_scores_gemma":[0.9319998,0.000024416537,0.06777198,0.00013499458,0.000013346595,0.0000016305515,0.0000011852849,0.0000019210536,0.000050743976],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99929106,0.000016763588,0.00014231358,0.00023596684,0.00011936532,0.00019453677],"domain_scores_gemma":[0.99955684,0.00013318687,0.000029168157,0.00020522566,0.000017342343,0.00005826122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053231843,0.00006808318,0.00008092868,0.000302378,0.000046925677,0.000071375754,0.0001737016,0.000035761885,0.00001106877],"category_scores_gemma":[0.000028660843,0.00006201731,0.000013290728,0.00077408075,0.00007253993,0.00030739143,0.00015050199,0.000109469154,0.000008995685],"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":[8.277592e-7,0.00002593895,0.040012162,0.000010075699,0.0000034401319,0.000012336456,0.00017435598,0.000016043034,0.00012954965,0.47581816,0.000088098874,0.483709],"study_design_scores_gemma":[0.000638265,0.000110875924,0.8809901,0.00002890833,0.0000020715781,0.00015274715,0.00014520402,0.039428458,0.00049728405,0.07566916,0.0020351924,0.00030174054],"about_ca_topic_score_codex":0.0005292401,"about_ca_topic_score_gemma":0.0013719649,"teacher_disagreement_score":0.88177043,"about_ca_system_score_codex":0.000021866477,"about_ca_system_score_gemma":0.000015045776,"threshold_uncertainty_score":0.25289926},"labels":[],"label_agreement":null},{"id":"W2164903952","doi":"10.1007/s00453-012-9701-z","title":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Linear programming relaxation; Vertex (graph theory); Discrete mathematics; Reachability; Approximation algorithm; Packing problems; Steiner tree problem; Tree (set theory); Theory of computation; Graph; Linear programming; Mathematical optimization; Algorithm","score_opus":0.017987103305355853,"score_gpt":0.23938084254718464,"score_spread":0.22139373924182879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164903952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17878553,0.0002966765,0.8194151,0.00027105017,0.000588804,0.00015931219,0.000004851257,0.00016151945,0.00031713254],"genre_scores_gemma":[0.8519924,0.00001623175,0.14772484,0.00010985027,0.0001173377,0.0000104344645,0.000006300592,0.000007911285,0.0000146869415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988468,0.00009172147,0.00023062836,0.00027352554,0.00017630284,0.00038100194],"domain_scores_gemma":[0.9993076,0.00014902583,0.0000730448,0.00032220848,0.000033695218,0.00011447639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038948754,0.00014469151,0.00016681674,0.00015979372,0.0001319774,0.00012319522,0.00029781423,0.0000715927,0.000010026215],"category_scores_gemma":[0.00004803251,0.00014730661,0.0000365305,0.0004555464,0.000050339826,0.0010651082,0.00024585542,0.00020835288,0.000017203936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075197986,0.00022465033,0.012607458,0.000020859447,0.00002097619,0.000015902708,0.0049569146,0.00033074146,0.0010382769,0.0064115208,0.0000858398,0.97427934],"study_design_scores_gemma":[0.00048304477,0.000029218541,0.05077709,0.000038366987,0.0000037110108,0.000033157805,0.000030338771,0.94226307,0.0011202147,0.0038951775,0.0010986634,0.00022795968],"about_ca_topic_score_codex":0.000101667574,"about_ca_topic_score_gemma":0.000037662736,"teacher_disagreement_score":0.97405136,"about_ca_system_score_codex":0.000053248197,"about_ca_system_score_gemma":0.000012847913,"threshold_uncertainty_score":0.6006989},"labels":[],"label_agreement":null},{"id":"W2165743239","doi":"10.1109/ccc.2006.26","title":"Making Hard Problems Harder","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"National Institute for Materials Science","keywords":"Boolean function; Randomness; Function (biology); Discrete mathematics; Combinatorics; String (physics); Advice (programming); Mathematics; Exponential function; Pseudorandomness; Algorithm; Computer science; Pseudorandom number generator; Statistics","score_opus":0.053068382805347446,"score_gpt":0.26245395788897574,"score_spread":0.2093855750836283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165743239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001130924,0.000077823934,0.9002201,0.0011673176,0.00028590992,0.00007453742,5.126731e-7,0.00036223687,0.096680656],"genre_scores_gemma":[0.47116825,0.0000022215086,0.5205603,0.0007309885,0.00016880962,0.00001239194,0.0000014334398,0.000007152498,0.00734841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.000015555386,0.00012742699,0.00024069536,0.00017281558,0.00021145753],"domain_scores_gemma":[0.9995546,0.000023048322,0.000027993312,0.00033825776,0.000034303255,0.000021837617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114819326,0.00007827429,0.00007526735,0.000064607084,0.00011646669,0.00020436133,0.0005533059,0.000025391595,0.00010896436],"category_scores_gemma":[0.0000035743008,0.000067688445,0.000052793068,0.00027341265,0.00003028483,0.00027282746,0.00018884685,0.000070313865,0.00013004722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.464683e-7,0.000048031143,0.00086573226,0.000007452343,0.000004405612,0.0000070720184,0.000060852995,0.00024820672,0.00023308065,0.9594392,0.013371996,0.025713615],"study_design_scores_gemma":[0.00035556863,0.000048065747,0.023050679,0.000036355876,0.0000034617765,0.00004652148,0.00001084895,0.1810979,0.0013327871,0.51217955,0.281398,0.00044024177],"about_ca_topic_score_codex":0.00007135436,"about_ca_topic_score_gemma":0.000037133417,"teacher_disagreement_score":0.4700373,"about_ca_system_score_codex":0.000010764498,"about_ca_system_score_gemma":0.000014467949,"threshold_uncertainty_score":0.27602547},"labels":[],"label_agreement":null},{"id":"W2167093538","doi":"10.1109/tit.2008.924653","title":"Worst Case Nonzero-Error Interactive Communication","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Université de Montréal; University of British Columbia","funders":"","keywords":"Emphasis (telecommunications); Mathematics; Computer science; Telecommunications","score_opus":0.0233208811436139,"score_gpt":0.2516708182198281,"score_spread":0.2283499370762142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167093538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057367813,0.000012887528,0.9874546,0.00031645483,0.00055359234,0.00019049458,0.000020132697,0.00029651067,0.0054185283],"genre_scores_gemma":[0.97725064,0.000029970157,0.021563021,0.00087389944,0.00001268111,0.00005838915,0.0000056158765,0.0000055273217,0.00020026491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.00013636792,0.00034694932,0.00012689627,0.00021236415,0.00017400153],"domain_scores_gemma":[0.99856,0.00035174473,0.00014189107,0.0007231035,0.0001431703,0.00008005171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033569644,0.00014346249,0.00012003356,0.00035000133,0.0008798974,0.000103923834,0.0005481912,0.000066785884,0.00010262335],"category_scores_gemma":[0.000010088119,0.0001426169,0.0001124252,0.00047950415,0.00014991498,0.003639693,0.0000071238705,0.000359293,0.00044256306],"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.00020993651,0.00053255685,0.0000036650154,0.000037058835,0.00015479472,0.000121855635,0.05622985,0.01656152,0.000035916357,0.29834667,0.0013233952,0.6264428],"study_design_scores_gemma":[0.005083939,0.00094143755,0.00041828176,0.00032461237,0.0000969311,0.022775091,0.010045197,0.7009295,0.035259075,0.19236511,0.0293206,0.0024401823],"about_ca_topic_score_codex":0.00004049482,"about_ca_topic_score_gemma":0.00001625556,"teacher_disagreement_score":0.97151387,"about_ca_system_score_codex":0.00007811413,"about_ca_system_score_gemma":0.000049560083,"threshold_uncertainty_score":0.67675483},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":71,"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 Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","score_opus":0.08849708786235158,"score_gpt":0.3650675527512243,"score_spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167508847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5485546,0.00022592358,0.42071384,0.013924634,0.00013205314,0.0014512985,0.000023408726,0.000082872255,0.0148913795],"genre_scores_gemma":[0.8881479,0.000050545685,0.11128297,0.000054029035,0.000032739063,0.000083328116,0.0000024766873,0.000007178231,0.0003388174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983402,0.00019395044,0.00035827243,0.00021906337,0.00058068364,0.0003078404],"domain_scores_gemma":[0.9979738,0.0009296383,0.000030956766,0.00053299195,0.00048637995,0.00004623285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021184965,0.0000900999,0.00015438048,0.0002903421,0.00040619736,0.00032230723,0.0010681669,0.000042800777,0.00004357453],"category_scores_gemma":[0.0009811684,0.000055430322,0.000042852058,0.0009547812,0.00033806585,0.00028122345,0.00043391428,0.00032916592,0.000017165974],"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.000002922846,0.0003569889,0.00041930325,0.000088237,0.00001753915,0.000019220191,0.017605575,0.00132198,0.0013484034,0.9730621,0.00011281236,0.005644945],"study_design_scores_gemma":[0.0003999732,0.00011576824,0.0011659638,0.00055204425,0.0000039707556,0.000115227274,0.0071759326,0.62735766,0.0060071186,0.35666326,0.00020917955,0.00023390401],"about_ca_topic_score_codex":0.00017365467,"about_ca_topic_score_gemma":0.00070862257,"teacher_disagreement_score":0.6260357,"about_ca_system_score_codex":0.00003603493,"about_ca_system_score_gemma":0.0002386024,"threshold_uncertainty_score":0.31241828},"labels":[],"label_agreement":null},{"id":"W2168874859","doi":"10.1007/s10107-015-0912-3","title":"Stable sets and graphs with no even holes","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Decomposition; Node (physics); Polynomial; Combinatorics; Work (physics); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.04060407816370412,"score_gpt":0.26448879829109706,"score_spread":0.22388472012739294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168874859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027684815,0.00021240867,0.96452004,0.0005524306,0.0000952925,0.00039129856,0.0000013164066,0.00043138987,0.0061110076],"genre_scores_gemma":[0.20605974,0.000002053017,0.79363877,0.00007569762,0.00002249845,0.000036399368,0.0000011986281,0.000011865556,0.00015176476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.000036346926,0.0001719373,0.00029430332,0.00034805218,0.00033632695],"domain_scores_gemma":[0.99915063,0.000104067476,0.000049351536,0.00036013118,0.00009915163,0.00023667961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422751,0.00014306656,0.0001953759,0.0000669408,0.00011513001,0.00033583696,0.00038551443,0.000040565345,0.0000073732344],"category_scores_gemma":[0.00008520433,0.00010426954,0.000033075074,0.0003222469,0.00020753474,0.00035183362,0.00026222112,0.00013106033,0.000060173512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010338822,0.0002505318,0.0004491799,0.00016032343,0.000035603654,0.000047281792,0.0019249283,0.000006311758,0.000013755923,0.7960959,0.0003742282,0.20063162],"study_design_scores_gemma":[0.0007233682,0.0004783471,0.0001229469,0.00017969486,0.00001855294,0.00018132795,0.00029352988,0.063415624,0.00013231025,0.9207014,0.013329399,0.0004235264],"about_ca_topic_score_codex":0.0000073903393,"about_ca_topic_score_gemma":0.0000027828369,"teacher_disagreement_score":0.2002081,"about_ca_system_score_codex":0.000013077098,"about_ca_system_score_gemma":0.000033786255,"threshold_uncertainty_score":0.42519882},"labels":[],"label_agreement":null},{"id":"W2168958045","doi":"10.1109/focs.2008.59","title":"A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest","year":2008,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Polynomial-time approximation scheme; Scheme (mathematics); Euclidean geometry; Approximation algorithm; Combinatorics; Euclidean distance; Plane (geometry); Time complexity; Steiner tree problem; Mathematics; Polynomial; Binary logarithm; Running time; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.029652950378595926,"score_gpt":0.23294932407953242,"score_spread":0.2032963737009365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168958045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029333627,0.000025250001,0.96048236,0.0010674043,0.00019331035,0.00033667107,0.000003743142,0.00032775113,0.008229913],"genre_scores_gemma":[0.12867795,0.000003983553,0.8643501,0.00046995207,0.00019832313,0.00005560896,0.000012238698,0.000011624112,0.0062202155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990793,0.000016981774,0.00019330168,0.00029340386,0.00016854946,0.00024845073],"domain_scores_gemma":[0.9992897,0.000097591386,0.000054891578,0.0004095896,0.00007498605,0.00007325216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016418041,0.00011283664,0.00013617869,0.00010273285,0.00024611625,0.00007039283,0.0005578473,0.000044374392,0.000038485527],"category_scores_gemma":[0.000036651527,0.000100046345,0.000106194435,0.00026709551,0.000059644983,0.00045451577,0.00014945511,0.000057573514,0.00010445002],"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.00006606199,0.0006727858,0.0027335347,0.00009567108,0.000117287644,0.000028477712,0.0019855637,0.0003069346,0.009066662,0.5342843,0.35220793,0.098434776],"study_design_scores_gemma":[0.0008429908,0.00015172131,0.0017677783,0.000009839031,0.0000033042693,0.000055932003,0.000010241794,0.9430813,0.00255776,0.008644697,0.04257046,0.00030394777],"about_ca_topic_score_codex":0.000025612511,"about_ca_topic_score_gemma":0.000008727331,"teacher_disagreement_score":0.9427744,"about_ca_system_score_codex":0.00001808639,"about_ca_system_score_gemma":0.000044358858,"threshold_uncertainty_score":0.40797713},"labels":[],"label_agreement":null},{"id":"W2169488047","doi":"10.1145/2462896.2462897","title":"On the usefulness of predicates","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"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":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Predicate (mathematical logic); Mathematics; Combinatorics; Conjecture; Discrete mathematics; Randomness; Negation; Pairwise comparison; Constraint satisfaction problem; Computer science","score_opus":0.031245248534134563,"score_gpt":0.2423059758492957,"score_spread":0.21106072731516112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169488047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024143316,0.000013752051,0.9710922,0.00344901,0.00031782276,0.00023177415,0.000004914523,0.00013513233,0.0006120785],"genre_scores_gemma":[0.98236156,0.000004564886,0.01662308,0.00079902104,0.0000139262675,0.00006641715,0.0000013805274,0.000007130108,0.00012291913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989517,0.00022614477,0.00020800735,0.00021797996,0.00025975166,0.00013644797],"domain_scores_gemma":[0.9959556,0.0031787842,0.000085290136,0.0006300492,0.00010678064,0.000043482432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033934845,0.00011015048,0.00010774513,0.00014571082,0.00026076857,0.000075385535,0.0009734326,0.000039452858,0.0002805917],"category_scores_gemma":[0.000080002166,0.00007807698,0.000094293566,0.00043627134,0.00014985766,0.00024283743,0.000016982014,0.00018279419,0.00016154794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010758823,0.00022595802,0.0000028520658,0.000009463473,0.00004418337,4.7694505e-7,0.00073259714,0.01673575,0.00006446945,0.62467873,0.000527034,0.35696772],"study_design_scores_gemma":[0.0001722433,0.00013776144,0.0008291645,0.000028193,0.000006620228,0.000003576472,0.00010444877,0.07370329,0.0056000547,0.91923,0.00008595137,0.00009872704],"about_ca_topic_score_codex":0.000015146436,"about_ca_topic_score_gemma":0.0000011215654,"teacher_disagreement_score":0.9582182,"about_ca_system_score_codex":0.000014118062,"about_ca_system_score_gemma":0.00002614658,"threshold_uncertainty_score":0.31838867},"labels":[],"label_agreement":null},{"id":"W2171769876","doi":"10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Minimum weight; Path (computing); Path length; Random graph; Discrete mathematics; Computer science","score_opus":0.02440755301033561,"score_gpt":0.2437544791994999,"score_spread":0.2193469261891643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171769876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57858753,0.0027539318,0.38991532,0.012817341,0.004959644,0.0021657308,0.000006639351,0.0013750957,0.0074187694],"genre_scores_gemma":[0.9853785,0.000033036355,0.01414649,0.00032198493,0.000078097284,0.000008511158,0.0000027988633,0.00001062612,0.000019967638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964102,0.00039752672,0.0007918956,0.00089739973,0.0006011944,0.0009017753],"domain_scores_gemma":[0.9967558,0.0010301861,0.00023951636,0.0015587993,0.00023649642,0.0001792086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002246063,0.00034914573,0.00041066806,0.00018703351,0.0009504557,0.00046951786,0.00280199,0.00011734809,0.0000017246898],"category_scores_gemma":[0.00030596272,0.00029013146,0.000202605,0.0023037163,0.0002428312,0.00034941323,0.00072462537,0.00069323793,0.000015181402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007692336,0.00046305088,0.0049831285,0.00002219167,0.000009096324,0.000027906337,0.00073561165,0.00017668557,0.000030179286,0.92196697,0.00021298155,0.07136448],"study_design_scores_gemma":[0.00060077437,0.0002111236,0.042066377,0.000058220434,0.000003323604,0.00002055013,0.000021989223,0.12513016,0.000042141197,0.829596,0.0019009163,0.0003484185],"about_ca_topic_score_codex":0.000027701024,"about_ca_topic_score_gemma":0.000021730284,"teacher_disagreement_score":0.40679097,"about_ca_system_score_codex":0.00020752633,"about_ca_system_score_gemma":0.000120487435,"threshold_uncertainty_score":0.99995506},"labels":[],"label_agreement":null},{"id":"W2174409790","doi":"10.1007/s10107-012-0537-8","title":"On generalizations of network design problems with degree bounds","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spanning tree; Degree (music); Combinatorics; Matroid; Rounding; Approximation algorithm; Minimum spanning tree; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.08827442949770972,"score_gpt":0.26848629817945724,"score_spread":0.18021186868174752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174409790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088329363,0.00010114339,0.9969564,0.000098260534,0.0000704266,0.00034324225,2.704337e-7,0.00014176221,0.0014052101],"genre_scores_gemma":[0.20876929,0.0000010176352,0.7910006,0.000046938643,0.00006356508,0.000057540066,9.461931e-7,0.000010311785,0.000049756556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987555,0.0000692351,0.00024842087,0.00017080172,0.00031158343,0.00044446404],"domain_scores_gemma":[0.9990415,0.00028022449,0.00009595145,0.00040669818,0.000054706772,0.00012094397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005774708,0.00013146525,0.00019073387,0.000056536483,0.0001654964,0.00010345784,0.000420503,0.00004266359,0.000022645389],"category_scores_gemma":[0.000054359716,0.00009553636,0.000053653075,0.00058045826,0.00011495658,0.00024245356,0.00011026583,0.00010500971,0.000020654632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029293326,0.0003208946,0.00012730384,0.00006785969,0.000022717351,0.0000010683881,0.0006309762,0.0026242516,0.000008268304,0.9516194,0.00014388215,0.044430472],"study_design_scores_gemma":[0.00043093265,0.0006818081,0.00018989637,0.00041623993,0.00003847262,0.00005889398,0.000038002127,0.25694135,0.0004620342,0.73729926,0.002997805,0.00044533185],"about_ca_topic_score_codex":0.0000021323256,"about_ca_topic_score_gemma":0.000001075551,"teacher_disagreement_score":0.2543171,"about_ca_system_score_codex":0.000015470696,"about_ca_system_score_gemma":0.000021989632,"threshold_uncertainty_score":0.38958594},"labels":[],"label_agreement":null},{"id":"W2174864496","doi":"10.1007/3-540-45753-4_5","title":"On the Power of Priority Algorithms for Facility Location and Set Cover","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set cover problem; Greedy algorithm; Facility location problem; Cover (algebra); Computer science; Focus (optics); Class (philosophy); Covering problems; Set (abstract data type); Approximation algorithm; Mathematical optimization; Algorithm; Point (geometry); Time complexity; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03618592476905767,"score_gpt":0.25942953066477664,"score_spread":0.22324360589571896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174864496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002179174,0.000216059,0.9963364,0.0009728235,0.0008365582,0.00065212266,0.000060591887,0.000049753646,0.0006577493],"genre_scores_gemma":[0.60016936,0.00011265575,0.39592737,0.0028707867,0.00028583896,0.000043963166,0.000014576138,0.000034168144,0.0005412516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736184,0.000040807638,0.00041486343,0.0010608333,0.00073899305,0.00038269063],"domain_scores_gemma":[0.99654007,0.0015263981,0.00025744032,0.0012483427,0.00034082832,0.00008692201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011199393,0.00036155197,0.00040274218,0.00032000383,0.00029868502,0.00024261085,0.001939561,0.00020728633,0.000029553472],"category_scores_gemma":[0.0002111016,0.00026876573,0.00011712408,0.00046697838,0.0011023611,0.0002880412,0.0007029066,0.00050879084,0.000010444974],"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.00001659399,0.00008728087,0.00003505561,0.00012484805,0.000027583428,0.00000775485,0.0024752931,0.0060851355,0.000024414967,0.34188735,0.00020761456,0.6490211],"study_design_scores_gemma":[0.0002361372,0.00032633913,0.0002642803,0.00018248097,0.000006099396,0.000015734684,2.9168788e-7,0.54918563,0.0004786343,0.44735324,0.0015896759,0.00036143739],"about_ca_topic_score_codex":0.000013625751,"about_ca_topic_score_gemma":0.000008538748,"teacher_disagreement_score":0.64865965,"about_ca_system_score_codex":0.00010225456,"about_ca_system_score_gemma":0.00017043913,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; Graph","score_opus":0.017631252465922377,"score_gpt":0.252691496209125,"score_spread":0.23506024374320264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177638926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023226275,0.00060089095,0.9730944,0.001374168,0.0024654767,0.0003757666,0.000010201751,0.0007070472,0.019049414],"genre_scores_gemma":[0.7546618,0.00007818204,0.2402007,0.0014239681,0.0022008668,0.00012263095,0.000043820055,0.000079890124,0.0011881436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969958,0.00016988901,0.0004954635,0.00061754964,0.0006006275,0.0011206787],"domain_scores_gemma":[0.9979985,0.00018700983,0.00019785925,0.0011519208,0.00007605001,0.00038866687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471137,0.0003993743,0.00036016194,0.00019874211,0.00040935416,0.00029955918,0.0013185877,0.00015630339,0.00004054367],"category_scores_gemma":[0.000032619322,0.00034707683,0.00022213793,0.00086151157,0.00011281676,0.0010815796,0.00055030966,0.00046973562,0.00014217087],"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.000056306886,0.0012133244,0.0030234489,0.00010852907,0.00036310882,0.000067355155,0.004121207,0.015052525,0.0022176434,0.62288266,0.0071274373,0.34376645],"study_design_scores_gemma":[0.00069643557,0.00025055822,0.0019599001,0.00008608544,0.000022989625,0.000057054818,0.00006817582,0.9797342,0.0016696462,0.0028683764,0.011728911,0.00085765467],"about_ca_topic_score_codex":0.000030855084,"about_ca_topic_score_gemma":0.000001751549,"teacher_disagreement_score":0.9646817,"about_ca_system_score_codex":0.00007073064,"about_ca_system_score_gemma":0.000028585142,"threshold_uncertainty_score":0.99989814},"labels":[],"label_agreement":null},{"id":"W2178989601","doi":"10.5539/jmr.v7n4p162","title":"A Strong Class of Lifted Valid Inequalities for the Shortest Path Problem in Digraphs with Negative Cost Cycles","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inequality; Class (philosophy); Combinatorics; Path (computing); Integer (computer science); Vertex (graph theory); Simple (philosophy); Shortest path problem; Discrete mathematics; Graph; Mathematical analysis; Computer science","score_opus":0.2788467139699767,"score_gpt":0.41430463101506787,"score_spread":0.1354579170450912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178989601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20647475,0.00053605944,0.787203,0.0025837831,0.00013547597,0.0016281557,0.000031014297,0.000021232325,0.0013865418],"genre_scores_gemma":[0.81667686,0.000053632906,0.18308482,0.000012470111,0.000059728827,0.00004642627,4.6917165e-7,0.000012728651,0.00005288532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972892,0.00025827263,0.0006441637,0.00012908119,0.0013351116,0.0003441906],"domain_scores_gemma":[0.9940977,0.0036026705,0.00037574983,0.0003636058,0.0014362382,0.0001240067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006240984,0.00011495767,0.00034484992,0.00044275261,0.000109388304,0.0001793074,0.0012763855,0.000044029377,0.0000024992792],"category_scores_gemma":[0.00075446133,0.00006543795,0.00009640166,0.0008911282,0.00032605615,0.00035931444,0.00023058563,0.00050496083,6.7179866e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031894352,0.002087634,0.0058714016,0.0006630915,0.00039371807,0.00008325067,0.07383968,0.004965504,0.0002651754,0.8951566,0.0028322032,0.013522787],"study_design_scores_gemma":[0.0026685894,0.0025772918,0.0017060289,0.0013974212,0.00002655581,0.00014904267,0.034247935,0.27127758,0.0020570667,0.68304056,0.0006008632,0.0002510731],"about_ca_topic_score_codex":0.000050942705,"about_ca_topic_score_gemma":0.00009890545,"teacher_disagreement_score":0.6102021,"about_ca_system_score_codex":0.00006943139,"about_ca_system_score_gemma":0.00045665502,"threshold_uncertainty_score":0.2668482},"labels":[],"label_agreement":null},{"id":"W2183636263","doi":"","title":"Approximating Full Steiner Tree in a Unit Disk Graph.","year":2014,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Mathematics; Graph; Tree (set theory); Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.022043091202608105,"score_gpt":0.23712883532002602,"score_spread":0.2150857441174179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183636263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035344213,0.000020698748,0.9233076,0.0005534685,0.00015175021,0.00008806799,4.395736e-7,0.00019300896,0.040340733],"genre_scores_gemma":[0.6859592,0.0000024350356,0.31314883,0.0003646925,0.000057144087,0.000014530449,0.0000014581141,0.0000067243345,0.00044497018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892807,0.000081682985,0.00023030242,0.00029845774,0.00019171736,0.00026976777],"domain_scores_gemma":[0.99923265,0.00013708444,0.000047839938,0.0004910411,0.000026482112,0.000064896114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004476294,0.00011263842,0.00014697283,0.00019885061,0.000079478436,0.000118482494,0.00077255024,0.00003593294,0.000027698894],"category_scores_gemma":[0.00004609282,0.00009426315,0.00005948317,0.00079070235,0.00004618401,0.00029717342,0.00027726323,0.00014044586,0.000033305994],"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.0000021001522,0.000074656324,0.0018622646,0.000012608979,0.000004685345,0.000003465901,0.0004041636,0.000092692404,0.00018589199,0.73480767,0.00014624072,0.26240358],"study_design_scores_gemma":[0.0005183127,0.000107752196,0.006700904,0.00002990486,0.0000018487445,0.000010257605,0.00006848178,0.7961065,0.00027844272,0.19247901,0.0034374304,0.00026110985],"about_ca_topic_score_codex":0.00009740234,"about_ca_topic_score_gemma":0.00043032417,"teacher_disagreement_score":0.79601383,"about_ca_system_score_codex":0.0000075897333,"about_ca_system_score_gemma":0.000011646818,"threshold_uncertainty_score":0.384394},"labels":[],"label_agreement":null},{"id":"W2184112757","doi":"","title":"The Vital Core Connectivity Problem","year":2012,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Combinatorics; Upper and lower bounds; Approximation algorithm; Linear programming relaxation; Enhanced Data Rates for GSM Evolution; Mathematics; Core (optical fiber); Graph; Linear programming; Computer science; Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.03668245112756905,"score_gpt":0.26308185105539345,"score_spread":0.2263993999278244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184112757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027853051,0.00034879893,0.88495916,0.0025466708,0.0012554331,0.00021818519,0.0000013407239,0.00039026674,0.08242707],"genre_scores_gemma":[0.96164745,0.0000050244926,0.037275627,0.00021367859,0.00010958551,0.000010377153,2.4290736e-7,0.0000026079,0.0007354304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993464,0.000027380369,0.00007810855,0.00011661268,0.00014445673,0.00028708615],"domain_scores_gemma":[0.9992773,0.00023896252,0.000025319858,0.00035772292,0.000027872567,0.00007284623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039526695,0.000063687934,0.000053965465,0.000016497486,0.00034861863,0.00011902661,0.0005794484,0.000020039977,0.000018595432],"category_scores_gemma":[0.000021277507,0.000037982016,0.000044988807,0.00019395821,0.0000719217,0.00043599695,0.00028503226,0.00008857277,0.00008342121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5318943e-7,0.000036038906,0.0017698403,0.0000011102064,0.000004974852,3.7342193e-7,0.00018954965,7.6827064e-7,0.000056957077,0.93514514,0.0019402183,0.060854383],"study_design_scores_gemma":[0.00051989825,0.00016956679,0.047943503,0.000013347903,0.0000073724545,0.00013638625,0.00021350017,0.04408588,0.004339211,0.57144934,0.33049035,0.0006316362],"about_ca_topic_score_codex":0.000021740514,"about_ca_topic_score_gemma":0.000021596843,"teacher_disagreement_score":0.9337944,"about_ca_system_score_codex":0.00001109144,"about_ca_system_score_gemma":0.00001433643,"threshold_uncertainty_score":0.26813278},"labels":[],"label_agreement":null},{"id":"W2184467059","doi":"","title":"Bounded Arithmetic and Formalizing Probabilistic Proofs","year":2014,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"University of Toronto","keywords":"Mathematical proof; Bounded function; Probabilistic logic; Arithmetic; Mathematics; Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Statistics; Pure mathematics; Mathematical analysis","score_opus":0.014761436673336225,"score_gpt":0.23594088355066412,"score_spread":0.22117944687732788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184467059","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24795789,0.005580186,0.2552872,0.0014009096,0.0029576644,0.0023719866,0.000032289765,0.0009027894,0.4835091],"genre_scores_gemma":[0.8648542,0.00036719197,0.12038899,0.000030965046,0.00007127657,0.0000016569187,0.00008337506,0.000025325062,0.014176992],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988608,0.00005836013,0.00011484288,0.00043227247,0.00028695894,0.00024680526],"domain_scores_gemma":[0.9989623,0.00006693152,0.00025285003,0.00047223066,0.0001393966,0.00010633467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002007631,0.00020753962,0.00036014154,0.00007629567,0.0003041475,0.00007631393,0.00083389966,0.00017554093,0.00036532452],"category_scores_gemma":[0.000026986818,0.00026186244,0.00011647655,0.00009480906,0.0001127385,0.0006470108,0.00020527367,0.00016934944,0.000005666746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010115536,0.00018268857,0.000084610736,0.0017658167,0.00019375626,0.000032247255,0.049274553,0.000013172161,0.00016018211,0.3452496,0.0005189329,0.6024233],"study_design_scores_gemma":[0.0063510234,0.0027677556,0.5097737,0.0031203744,0.0010165155,0.00010865989,0.04642196,0.28624937,0.00045912262,0.10560947,0.032771863,0.0053502023],"about_ca_topic_score_codex":0.019382399,"about_ca_topic_score_gemma":0.059971258,"teacher_disagreement_score":0.61689633,"about_ca_system_score_codex":0.000115743635,"about_ca_system_score_gemma":0.00010710461,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","score_opus":0.030771538958363084,"score_gpt":0.2621209887200663,"score_spread":0.23134944976170319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185716868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45102587,0.0002848426,0.54734296,0.00008320751,0.00044325626,0.000069196554,3.5856704e-7,0.00019585679,0.00055446627],"genre_scores_gemma":[0.7849762,0.0000020100706,0.21458401,0.0002176002,0.00020501982,0.0000010312223,4.3981987e-7,0.000007512942,0.0000061663204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743664,0.00051027,0.00053686154,0.0002972402,0.00040739277,0.0008116148],"domain_scores_gemma":[0.99707824,0.0013940253,0.0003089841,0.00089522044,0.00010754788,0.00021600076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004401643,0.00021379566,0.0003624918,0.00021472834,0.00034769325,0.000062260544,0.0019843047,0.000053710057,0.0000051763977],"category_scores_gemma":[0.00014812185,0.00020753112,0.00018368477,0.00077102793,0.00024850847,0.0011576867,0.0012127417,0.00022045002,0.0000046760656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008655316,0.00014929746,0.00529656,0.000020424626,0.000024521338,0.0000011062707,0.009489251,0.00028014343,0.000967373,0.8290283,0.0000046256882,0.15472971],"study_design_scores_gemma":[0.0008901054,0.00018779551,0.1439636,0.00014551556,0.000018492665,0.00013894762,0.0009780123,0.092458665,0.03266948,0.7277459,0.00016782645,0.00063566066],"about_ca_topic_score_codex":0.000009107299,"about_ca_topic_score_gemma":3.1720805e-7,"teacher_disagreement_score":0.33395034,"about_ca_system_score_codex":0.000019440564,"about_ca_system_score_gemma":0.000026651624,"threshold_uncertainty_score":0.84628737},"labels":[],"label_agreement":null},{"id":"W2198855630","doi":"10.46298/dmtcs.591","title":"On quadratic threshold CSPs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Toronto Metropolitan University","funders":"European Commission","keywords":"Rounding; Mathematics; Predicate (mathematical logic); Constraint satisfaction problem; Discrete mathematics; Quadratic equation; Hyperplane; Combinatorics; Semidefinite programming; Algorithm; Mathematical optimization; Computer science","score_opus":0.022172371833810458,"score_gpt":0.27425426295176975,"score_spread":0.2520818911179593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198855630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015956854,0.000041213614,0.96112055,0.00074424024,0.0010645834,0.00025328767,0.0000026225262,0.00030960585,0.020507025],"genre_scores_gemma":[0.66263163,0.0000020237019,0.3365577,0.0006249142,0.00014575708,0.000011743695,7.280314e-7,0.000012101997,0.000013427336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962534,0.00007635719,0.00047071194,0.0006782397,0.0013598741,0.0011614446],"domain_scores_gemma":[0.99682695,0.000648213,0.00012933949,0.001694877,0.00012411545,0.0005765095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021682656,0.00035034743,0.0003596165,0.00028893584,0.000698663,0.00076206663,0.0036198194,0.000073005715,0.00012252398],"category_scores_gemma":[0.00017342539,0.0002651041,0.00016994089,0.0014202162,0.002388696,0.0011517288,0.0014510059,0.0003572247,0.000390182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021085668,0.00023630449,0.000021929509,0.000022034465,0.000007094212,0.00000447033,0.0016531217,0.000041221738,0.000098262375,0.9945404,0.00011897947,0.0032540623],"study_design_scores_gemma":[0.00010813155,0.0001234851,0.00008721194,0.00005407065,0.000005665872,0.000033859702,0.000020372592,0.45001343,0.00086150033,0.54838353,0.00005077038,0.00025795962],"about_ca_topic_score_codex":8.3691435e-7,"about_ca_topic_score_gemma":1.8749952e-7,"teacher_disagreement_score":0.64667475,"about_ca_system_score_codex":0.00005520764,"about_ca_system_score_gemma":0.00006909032,"threshold_uncertainty_score":0.9999801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27484766,0.0001120063,0.7159146,0.0011642687,0.00094689056,0.0039833784,0.00038405883,0.0005483934,0.0020987603],"genre_scores_gemma":[0.8253362,0.000026436708,0.17223813,0.0011306677,0.00017718588,0.00043873535,0.0004585829,0.000041589148,0.00015246685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966898,0.000054266726,0.0012306303,0.00049932045,0.00048477747,0.0010412078],"domain_scores_gemma":[0.9978512,0.0002515508,0.0005005183,0.00093617314,0.00026198293,0.00019856433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011643786,0.0004932466,0.0006221729,0.00065122277,0.0004948887,0.0007373314,0.0014880227,0.0002683275,0.000009937354],"category_scores_gemma":[0.00015146051,0.00049067463,0.00040000485,0.0008764027,0.000136114,0.003000846,0.00024283981,0.0003987584,0.00004277727],"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.0006052461,0.0047961776,0.008479201,0.0025226932,0.00050100125,0.000012426113,0.033152133,0.0011452037,0.0017020013,0.33382612,0.02173698,0.5915208],"study_design_scores_gemma":[0.008618014,0.0012607896,0.0041480702,0.0003502699,0.000042731783,0.00008470002,0.00033144967,0.79549164,0.0038213474,0.0930536,0.091118924,0.0016784844],"about_ca_topic_score_codex":0.000024074167,"about_ca_topic_score_gemma":0.000040492432,"teacher_disagreement_score":0.7943464,"about_ca_system_score_codex":0.00017628964,"about_ca_system_score_gemma":0.0001227843,"threshold_uncertainty_score":0.9997545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050580297,0.000112531496,0.9347641,0.0014344873,0.0027381426,0.0040451847,0.00041601708,0.00069063826,0.005218596],"genre_scores_gemma":[0.5866143,0.000047396825,0.40642542,0.0025042633,0.0005768128,0.0019001205,0.0003178471,0.00009552087,0.0015182976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633765,0.000049345967,0.0012426851,0.00048482275,0.0006342915,0.0012511931],"domain_scores_gemma":[0.99662983,0.0005817727,0.0004951814,0.0013631079,0.00061676576,0.00031335073],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007297412,0.0005666415,0.0006001869,0.00026031438,0.00090339925,0.0017367656,0.002462734,0.00025695996,0.00009846002],"category_scores_gemma":[0.00024917893,0.00049832376,0.00053025293,0.00047806732,0.00033542328,0.0038576906,0.00079581235,0.00039147364,0.00025350958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009719172,0.0006523243,0.0021887382,0.00089470734,0.00035594264,0.000003300118,0.011476646,0.000028922543,0.00014825266,0.8888376,0.02414098,0.07117545],"study_design_scores_gemma":[0.0064097894,0.0009606639,0.003531271,0.00024530917,0.00006286172,0.00011625772,0.0015269053,0.16010359,0.0036889552,0.5154134,0.3060643,0.0018767124],"about_ca_topic_score_codex":0.00005370679,"about_ca_topic_score_gemma":0.00004036835,"teacher_disagreement_score":0.53603405,"about_ca_system_score_codex":0.000105543346,"about_ca_system_score_gemma":0.00013307223,"threshold_uncertainty_score":0.99974686},"labels":[],"label_agreement":null},{"id":"W2246515892","doi":"10.48550/arxiv.1508.07504","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Relaxation (psychology); Mathematics; Tree (set theory); Combinatorics; Linear programming relaxation; Type (biology); Discrete mathematics; Linear programming; Algorithm","score_opus":0.14702366040205034,"score_gpt":0.21607720642098246,"score_spread":0.06905354601893213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246515892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1025926,0.00015393282,0.88999385,0.0000834155,0.0011364914,0.00061589817,0.000024213909,0.00042355343,0.0049760593],"genre_scores_gemma":[0.96562374,0.00014473469,0.032579552,0.0001084269,0.0002499154,0.000010096848,0.00006653592,0.000029841167,0.0011871541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975566,0.00024354832,0.00032885588,0.0012710422,0.00019412166,0.0004058256],"domain_scores_gemma":[0.99797237,0.000114809256,0.00041180168,0.0010803869,0.00022043679,0.00020019083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005382211,0.00039160196,0.00043034216,0.0004034072,0.0002895604,0.000285766,0.0015617335,0.00025911708,0.0000118121725],"category_scores_gemma":[0.000025857407,0.00044964137,0.00016722213,0.00081441493,0.00017567494,0.00062354637,0.0026614217,0.00060159166,0.000032284835],"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.000092707036,0.0006584955,0.004357332,0.0007967311,0.00055153074,0.000868235,0.0051907795,0.020297254,0.00007714766,0.8605098,0.003236756,0.10336319],"study_design_scores_gemma":[0.00066054333,0.000068406356,0.00031253073,0.00013047758,0.000078937155,0.00001675961,0.00028909947,0.86238897,0.00006305379,0.1343998,0.0010063468,0.00058507395],"about_ca_topic_score_codex":0.00026245284,"about_ca_topic_score_gemma":0.00008406603,"teacher_disagreement_score":0.86303115,"about_ca_system_score_codex":0.00018883357,"about_ca_system_score_gemma":0.0002200804,"threshold_uncertainty_score":0.99979556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04138949,0.00004385553,0.95120126,0.0010821908,0.0005851557,0.0018441341,0.00057425455,0.00026108854,0.0030185778],"genre_scores_gemma":[0.62099636,0.000017446906,0.37722316,0.00070616655,0.000076956385,0.00028785196,0.00056472287,0.000027812921,0.00009950136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740905,0.00009298962,0.0012213688,0.00027303142,0.0004118314,0.0005917033],"domain_scores_gemma":[0.9964936,0.0005454739,0.00061854644,0.0016312905,0.0005682071,0.0001429006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013333203,0.00032749865,0.000559474,0.00021714278,0.00040083364,0.00026689647,0.0022769887,0.00015477068,0.000012162272],"category_scores_gemma":[0.000208954,0.00030745074,0.00034688995,0.00028035085,0.0005738918,0.001386637,0.0007354017,0.00025364835,0.000014076161],"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.0000704914,0.00037808742,0.00060243066,0.0014080977,0.00012416898,1.0114157e-7,0.012269775,0.0001557542,0.000033589902,0.9656797,0.0025598176,0.016717983],"study_design_scores_gemma":[0.0031511527,0.0005704618,0.0009345625,0.00022944379,0.00004032194,0.000021563701,0.0010197066,0.5732377,0.0019627195,0.32138604,0.09678867,0.0006576151],"about_ca_topic_score_codex":0.000040050738,"about_ca_topic_score_gemma":0.00005605982,"teacher_disagreement_score":0.64429367,"about_ca_system_score_codex":0.00007122058,"about_ca_system_score_gemma":0.00006097837,"threshold_uncertainty_score":0.9999378},"labels":[],"label_agreement":null},{"id":"W2251394987","doi":"10.1016/j.ic.2016.01.005","title":"Topology recognition with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advice (programming); Topology (electrical circuits); Oracle; Computer science; Node (physics); Network topology; Computation; Upper and lower bounds; Graph; Logical topology; Theoretical computer science; Mathematics; Computer network; Combinatorics; Algorithm","score_opus":0.015775602856260954,"score_gpt":0.2353759725628819,"score_spread":0.21960036970662095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251394987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016030384,0.0000072431035,0.9790093,0.0020906522,0.00010206721,0.00006836609,0.0000022477711,0.00018037415,0.0025093772],"genre_scores_gemma":[0.8855536,0.000018191766,0.11348429,0.0008533951,0.000030417596,0.00001215217,0.000015421085,0.0000020326204,0.00003048121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958986,0.000020312968,0.0001331257,0.00007477939,0.00009946284,0.000082466344],"domain_scores_gemma":[0.9996556,0.000060582315,0.00007480381,0.00007140196,0.000103387174,0.00003420074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637387,0.0000533784,0.000048450253,0.00010286925,0.00008787307,0.000083876694,0.000084887346,0.000024691482,0.000010090169],"category_scores_gemma":[0.000007978251,0.00003473516,0.000009918739,0.00015115121,0.000038169597,0.0019437332,0.00003517844,0.000026861728,0.00007710772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069332987,0.000005433898,0.0000761485,0.000007742848,0.0000033791296,3.5695604e-7,0.0003689828,0.000018387273,0.000009212534,0.025402045,0.00018687172,0.9739145],"study_design_scores_gemma":[0.0057041994,0.0012047156,0.04646429,0.00033405222,0.000018949337,0.0005175377,0.0005402028,0.48280612,0.001530095,0.4060274,0.053860296,0.0009921432],"about_ca_topic_score_codex":0.000010366204,"about_ca_topic_score_gemma":0.0000027683607,"teacher_disagreement_score":0.9729224,"about_ca_system_score_codex":0.000011089784,"about_ca_system_score_gemma":0.00001767015,"threshold_uncertainty_score":0.14164586},"labels":[],"label_agreement":null},{"id":"W2256514854","doi":"10.4230/lipics.tqc.2015.206","title":"Round Elimination in Exact Communication Complexity","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Communication complexity; Upper and lower bounds; Alice and Bob; Chromatic scale; Mathematics; Discrete mathematics; Rank (graph theory); Hierarchy; Context (archaeology); Theoretical computer science; Computer science; Combinatorics; Alice (programming language)","score_opus":0.21052348023049255,"score_gpt":0.21842155078974124,"score_spread":0.007898070559248682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256514854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.311791,0.000048649104,0.67755246,0.0004569204,0.00014837644,0.00013172247,0.0000019510292,0.00015496496,0.009713941],"genre_scores_gemma":[0.99284035,0.00002485483,0.0066796932,0.000081027174,0.000012956757,3.8093197e-7,0.0000074888103,0.000004035705,0.00034919853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00018428787,0.00012484207,0.00032986185,0.000082756305,0.00019435107],"domain_scores_gemma":[0.9988723,0.00009064235,0.00007803563,0.0007324908,0.00011713808,0.000109424516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043133151,0.00010281912,0.00012093962,0.0002098657,0.00011630046,0.00010229737,0.0011174021,0.000054310123,0.000008844018],"category_scores_gemma":[0.000039982464,0.00012517768,0.000046299738,0.0010151735,0.00013535138,0.0014323273,0.0003881872,0.00016759973,0.000041912343],"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.000011662031,0.000120417055,0.0040454958,0.0000035526946,0.0000055752607,0.000029891376,0.00046692608,0.004379289,0.000008385458,0.9889978,0.00015921045,0.0017717707],"study_design_scores_gemma":[0.0006881573,0.00005344783,0.017023187,0.000015632031,0.0000041688068,0.0000051925417,0.00020200241,0.63762933,0.00007123731,0.34319562,0.0009344369,0.00017757282],"about_ca_topic_score_codex":0.00038561004,"about_ca_topic_score_gemma":0.00033043246,"teacher_disagreement_score":0.68104935,"about_ca_system_score_codex":0.00018508239,"about_ca_system_score_gemma":0.000060626662,"threshold_uncertainty_score":0.5104598},"labels":[],"label_agreement":null},{"id":"W2258418267","doi":"10.1109/isit.2016.7541718","title":"A linearithmic time algorithm for a shortest vector problem in compute-and-forward design","year":2016,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Dimension (graph theory); Algorithm; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Mathematics; Shortest path problem; Theoretical computer science; Combinatorics","score_opus":0.022516105161227047,"score_gpt":0.23951301191372812,"score_spread":0.21699690675250108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258418267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017263697,0.00005821285,0.9965221,0.0019045958,0.00011830201,0.0007419415,0.000012019931,0.00024543636,0.00022472613],"genre_scores_gemma":[0.0050493088,0.000015351574,0.99358016,0.00024190932,0.000095333344,0.0001276186,0.0000016528227,0.000014381644,0.00087426446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984221,0.000068167035,0.00031147024,0.0005629005,0.00019207077,0.00044330812],"domain_scores_gemma":[0.9987144,0.0006462617,0.000056018027,0.00036935782,0.0000832385,0.00013072032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005679813,0.00019939186,0.00027310406,0.00020546693,0.00010172645,0.00014102635,0.00067654083,0.000079477184,0.000028310778],"category_scores_gemma":[0.000030618336,0.00013789246,0.00008430958,0.00038814213,0.00009266836,0.00040974154,0.00030129653,0.000088187706,0.00005584642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077976465,0.00012443724,0.00006269837,0.000009696949,0.00002142167,0.000011884033,0.00015352265,0.000026756614,0.00059834926,0.02376059,0.0014083742,0.9738145],"study_design_scores_gemma":[0.001131431,0.00034290296,0.00054748397,0.00007448368,0.000004614404,0.000037346028,0.000003023903,0.9537191,0.0010984067,0.039035976,0.0036930214,0.0003122183],"about_ca_topic_score_codex":0.000032070915,"about_ca_topic_score_gemma":0.000009547424,"teacher_disagreement_score":0.9735023,"about_ca_system_score_codex":0.000045315854,"about_ca_system_score_gemma":0.000083307554,"threshold_uncertainty_score":0.56230915},"labels":[],"label_agreement":null},{"id":"W2263246245","doi":"","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2021,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"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":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Discrete mathematics; Running time; Variable (mathematics); Key (lock); Binary logarithm; Algorithm; Computer science; Statistics","score_opus":0.012097120532414572,"score_gpt":0.2434263904676279,"score_spread":0.23132926993521333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263246245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70098233,0.00689441,0.26346,0.021377975,0.0030240628,0.00072100695,0.00011010267,0.001575907,0.0018542109],"genre_scores_gemma":[0.81670177,0.00029334435,0.18233207,0.00036808883,0.00007628105,0.000041201747,0.000014921563,0.000026830216,0.00014552314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997224,0.00006591661,0.0006078679,0.0009736989,0.00047759706,0.00065093586],"domain_scores_gemma":[0.99777377,0.00013667831,0.00029904244,0.0013526416,0.00026990997,0.00016797424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031869859,0.00042510792,0.00074500364,0.00069338444,0.00040927742,0.00015639563,0.0012637316,0.0004061168,0.000015389012],"category_scores_gemma":[0.00055614946,0.0004370371,0.0002055359,0.0016641655,0.0010775867,0.000613711,0.0011882652,0.0006164668,0.000010341767],"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.00012675658,0.000654673,0.02207685,0.0003970826,0.0006731519,0.0024200245,0.0010294403,0.0001624724,0.019641709,0.5670281,0.0016083161,0.38418144],"study_design_scores_gemma":[0.026525669,0.0013010005,0.03360122,0.002028381,0.0006546432,0.0058835987,0.00088160957,0.047205932,0.1663778,0.16329609,0.546537,0.0057070814],"about_ca_topic_score_codex":0.000019997055,"about_ca_topic_score_gemma":0.000104326464,"teacher_disagreement_score":0.54492867,"about_ca_system_score_codex":0.00006278638,"about_ca_system_score_gemma":0.00034505973,"threshold_uncertainty_score":0.99980813},"labels":[],"label_agreement":null},{"id":"W2276707316","doi":"10.1007/s10107-016-0987-5","title":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Vertex (graph theory); Equivalence (formal languages); Bipartite graph; Upper and lower bounds; Relaxation (psychology); Linear programming; Graph; Algorithm","score_opus":0.03293364940603159,"score_gpt":0.24611926579887713,"score_spread":0.21318561639284556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276707316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05183529,0.0000453313,0.9343358,0.012119434,0.00010440657,0.00068445987,0.0000036387216,0.00010338215,0.0007682574],"genre_scores_gemma":[0.9222487,0.0000037030197,0.07730058,0.00009614589,0.000018085755,0.000110135654,9.208489e-8,0.0000066767634,0.00021586906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920523,0.000055223318,0.00018722053,0.00017612323,0.00020046426,0.00017574677],"domain_scores_gemma":[0.9975027,0.0018489382,0.00008647915,0.00047287854,0.00005576677,0.000033231212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036602176,0.00008407538,0.000109957815,0.0000384597,0.00020440284,0.0000524563,0.000566182,0.000029773839,0.000008756741],"category_scores_gemma":[0.00070704543,0.000033206827,0.0000908251,0.000293748,0.0002640064,0.00008265448,0.00017922393,0.000061706436,0.0000038813914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016465037,0.000049598402,0.00002899695,0.000025648375,0.0000087289545,1.18481545e-7,0.00014376335,2.5117447e-7,0.00046236507,0.8711407,0.000060231057,0.12807792],"study_design_scores_gemma":[0.00024119798,0.000121863945,0.00045325697,0.00025978487,0.000013945328,0.0000067558994,0.000029784995,0.010728368,0.0021586334,0.9844531,0.0014299668,0.00010336928],"about_ca_topic_score_codex":0.000001197084,"about_ca_topic_score_gemma":0.0000028911143,"teacher_disagreement_score":0.8704134,"about_ca_system_score_codex":0.000006647716,"about_ca_system_score_gemma":0.000012669013,"threshold_uncertainty_score":0.1572122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017815132,0.000037314945,0.9757641,0.00077963585,0.0011604987,0.0018898427,0.00024607443,0.00031362026,0.0019938066],"genre_scores_gemma":[0.18929607,0.000012256343,0.80753726,0.0010053776,0.00024329995,0.00078512117,0.00047754365,0.000050746967,0.0005923324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974708,0.00003208332,0.00093193527,0.00032313392,0.0004607889,0.0007812426],"domain_scores_gemma":[0.9980289,0.0003139435,0.00029928418,0.0007846016,0.00032494476,0.00024834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008629644,0.0003205324,0.00038054062,0.0004306459,0.00031258364,0.00040343133,0.0011749639,0.00017005333,0.0000047589133],"category_scores_gemma":[0.0003477107,0.00029761496,0.0002299125,0.00068691483,0.00009112696,0.0015825296,0.00028869996,0.00033901763,0.000059823862],"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.0004205142,0.0023945337,0.0039365576,0.0008051949,0.00022931014,0.000013853117,0.03993687,0.030911068,0.000012201138,0.59595627,0.020076888,0.30530673],"study_design_scores_gemma":[0.0034629668,0.000610637,0.00013814868,0.00015274387,0.000011904135,0.0000149089565,0.000629033,0.83222395,0.00017105576,0.020953482,0.14120641,0.00042474584],"about_ca_topic_score_codex":0.000026927382,"about_ca_topic_score_gemma":0.00011020476,"teacher_disagreement_score":0.80131286,"about_ca_system_score_codex":0.00016470713,"about_ca_system_score_gemma":0.00014715047,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null},{"id":"W2280059905","doi":"10.4086/toc.2015.v011a001","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","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":"Mathematics; Combinatorics; Independent and identically distributed random variables; Completeness (order theory); Discrete mathematics; Bounded function; Distribution (mathematics); Pairwise independence; Pairwise comparison; Joint probability distribution; Uncorrelated; Independence (probability theory); Random variable; Mathematical analysis; Statistics","score_opus":0.06171816415099145,"score_gpt":0.27406741929279277,"score_spread":0.2123492551418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280059905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40355933,0.00013117773,0.59452116,0.00020164906,0.00036425513,0.00007698518,3.8796674e-7,0.0002517801,0.0008932578],"genre_scores_gemma":[0.76032573,8.0720844e-7,0.23935513,0.00021141797,0.00008960124,8.270486e-7,4.9748814e-7,0.0000067319766,0.000009231105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973903,0.0005542217,0.0005641436,0.00044225683,0.00056688575,0.00048223714],"domain_scores_gemma":[0.99722266,0.0009022918,0.00031120353,0.0009766058,0.00031896768,0.00026829474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004707155,0.00020849331,0.00039195758,0.0002297112,0.00019770939,0.00010343378,0.0025575415,0.000051919225,0.000001163673],"category_scores_gemma":[0.0003326391,0.00020364375,0.00014485745,0.000896598,0.00028812073,0.000627015,0.0013912213,0.00020972973,0.000003850013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022784297,0.000087238535,0.0007076499,0.0000125280585,0.00002196613,0.00001035977,0.010285651,0.003613397,0.00023615712,0.85378027,0.000018933019,0.13120307],"study_design_scores_gemma":[0.00082566164,0.00022921103,0.0035937089,0.00006040636,0.000005320105,0.00006144495,0.0008626531,0.21141025,0.005142434,0.77750117,0.00006669906,0.00024101221],"about_ca_topic_score_codex":0.000022104958,"about_ca_topic_score_gemma":0.0000014031094,"teacher_disagreement_score":0.35676643,"about_ca_system_score_codex":0.000029698722,"about_ca_system_score_gemma":0.00011845901,"threshold_uncertainty_score":0.8304351},"labels":[],"label_agreement":null},{"id":"W2284184122","doi":"10.1007/978-3-642-32241-9_35","title":"Lower Bounds against Weakly Uniform Circuits","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Boolean circuit; Electronic circuit; Mathematics; Polynomial; Discrete mathematics; Constant (computer programming); Combinatorics; Time complexity; Connection (principal bundle); Circuit complexity; Boolean function; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.022416987444804165,"score_gpt":0.23848588699634032,"score_spread":0.21606889955153616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284184122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008083768,0.0012576078,0.96538836,0.00060032913,0.006072708,0.00036629703,0.000011124362,0.000340171,0.025882555],"genre_scores_gemma":[0.36063683,0.0005089211,0.6236402,0.00850545,0.003974446,0.000031892123,0.000031549658,0.00017327198,0.0024974437],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944669,0.000037520796,0.00070793973,0.0018216951,0.0015707886,0.0013951355],"domain_scores_gemma":[0.9960351,0.0004272746,0.0003607812,0.0024403997,0.0003106094,0.0004258327],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012316277,0.00083112845,0.00072249526,0.0012459181,0.00058603194,0.0010383271,0.0061506853,0.00049660815,0.000072821655],"category_scores_gemma":[0.00006628433,0.00079207635,0.00030484385,0.0011650926,0.0013519635,0.0014161298,0.0025289797,0.0014367099,0.00021305421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018651884,0.00005728115,0.000027627937,0.000030002502,0.000015573685,0.0000905594,0.00048271907,0.0019592803,0.000072206734,0.081132405,0.00005100905,0.91607946],"study_design_scores_gemma":[0.00054897345,0.000369777,0.00037967277,0.000839857,0.000022883487,0.00025150945,3.4951665e-7,0.34068462,0.0009945029,0.5893497,0.06389106,0.002667091],"about_ca_topic_score_codex":0.000017384158,"about_ca_topic_score_gemma":0.0000667005,"teacher_disagreement_score":0.9134124,"about_ca_system_score_codex":0.00044481692,"about_ca_system_score_gemma":0.0007051235,"threshold_uncertainty_score":0.9999987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027351422,0.000111013665,0.93940383,0.0022627693,0.0015137735,0.0019179784,0.00013076828,0.0006489986,0.026659446],"genre_scores_gemma":[0.75894296,0.00012788735,0.23688123,0.0022786506,0.00017818503,0.0004584155,0.0006479335,0.00003770158,0.00044706604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733156,0.00018921269,0.0011138149,0.00023456638,0.00057943154,0.00055142737],"domain_scores_gemma":[0.997073,0.00035938204,0.0004872499,0.0013126221,0.00048217876,0.00028554903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118696,0.00031088552,0.00060912856,0.00016654945,0.0003841954,0.0006161376,0.0017462778,0.00016699519,0.00002983162],"category_scores_gemma":[0.0002849656,0.00027903763,0.00034035338,0.00042758408,0.00028000574,0.0024702589,0.0006570391,0.0003595852,0.00038475692],"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.0067391936,0.0008170494,0.0015328362,0.00034750407,0.00036349063,0.0000052201076,0.031184444,0.0003756154,0.0000055296214,0.8825613,0.04669962,0.029368175],"study_design_scores_gemma":[0.14217693,0.000191418,0.00013889352,0.0001997063,0.00006597503,0.000116940566,0.0009216155,0.55914044,0.00044057114,0.13613749,0.15957972,0.00089033425],"about_ca_topic_score_codex":0.0000429431,"about_ca_topic_score_gemma":0.00001681512,"teacher_disagreement_score":0.74642384,"about_ca_system_score_codex":0.000113212096,"about_ca_system_score_gemma":0.00010018075,"threshold_uncertainty_score":0.9999662},"labels":[],"label_agreement":null},{"id":"W2296221246","doi":"","title":"The Approximability and Integrality Gap of Interval Stabbing and Independence Problems","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Mathematics; Rectangle; Combinatorics; Interval (graph theory); Linear programming; Independence (probability theory); Approximation algorithm; Set (abstract data type); Discrete mathematics; Duality (order theory); Independent set; Upper and lower bounds; Plane (geometry); Duality gap; Mathematical optimization; Optimization problem; Graph; Computer science; Statistics; Mathematical analysis","score_opus":0.058811907638360375,"score_gpt":0.2680974723676161,"score_spread":0.20928556472925575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296221246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6910842,0.0009922882,0.2989909,0.0039346474,0.0006597705,0.0004955258,0.00007425542,0.000064020365,0.003704383],"genre_scores_gemma":[0.99069184,0.000017933427,0.009044772,0.00018145022,0.000025905836,0.000008707028,0.0000041948642,0.0000037147358,0.00002146609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987242,0.00010688826,0.0002454328,0.00027712042,0.00030282378,0.00034350328],"domain_scores_gemma":[0.9985914,0.00048545015,0.00009677683,0.00025945719,0.00021925385,0.00034761825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094725186,0.00013127488,0.00015688394,0.0001968118,0.0003047664,0.00019000671,0.00046254837,0.000060181163,0.000015062016],"category_scores_gemma":[0.00016542658,0.000105880354,0.000032150663,0.00039503863,0.00039608663,0.00034992068,0.00017675576,0.00026973023,0.0000028360414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040121076,0.000030933777,0.021717098,0.000035958037,0.00001769958,8.515429e-7,0.00072533643,0.00010494849,0.0000065643912,0.867608,0.000049614682,0.109698966],"study_design_scores_gemma":[0.00037895172,0.00017056799,0.3683476,0.00012731367,0.000007818295,0.00005264189,0.0005276949,0.22893757,0.000064614316,0.39953855,0.0014544476,0.0003922605],"about_ca_topic_score_codex":0.0046037408,"about_ca_topic_score_gemma":0.0046375114,"teacher_disagreement_score":0.46806946,"about_ca_system_score_codex":0.00006459793,"about_ca_system_score_gemma":0.00032665065,"threshold_uncertainty_score":0.6959509},"labels":[],"label_agreement":null},{"id":"W2300052872","doi":"10.1016/j.dam.2015.10.014","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si26.gif\" display=\"inline\" overflow=\"scroll\"><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:math>-approximation for subcubic 2EC using circulations and obliged edges","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm","score_opus":0.03999557587375012,"score_gpt":0.26736532694127957,"score_spread":0.22736975106752944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300052872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6127259,0.001615266,0.17378624,0.00097102235,0.003124857,0.0003294948,0.0009796077,0.00059619045,0.20587143],"genre_scores_gemma":[0.90780705,0.00042307735,0.08582134,0.00081223977,0.0016403733,0.0012878227,0.0014231397,0.0005760729,0.0002089039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990785,0.00024991579,0.002229644,0.0019730262,0.002527883,0.0022345253],"domain_scores_gemma":[0.99144715,0.0019454167,0.0023884824,0.0028227333,0.0003132895,0.0010829302],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002556256,0.0010888196,0.000594616,0.0006099414,0.002079588,0.002445141,0.0023728856,0.0016599493,0.017472675],"category_scores_gemma":[0.0012564673,0.0017898818,0.001356117,0.001529603,0.0015287123,0.0018660994,0.0023282936,0.0013501907,0.00074605265],"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.00043953286,0.00047167455,0.000005493358,0.002261304,0.0009917385,0.00020112912,0.006973052,0.00257481,0.0017065695,0.94853526,0.03183788,0.004001572],"study_design_scores_gemma":[0.0019135053,0.00067937066,0.000044737884,0.0011137455,0.0012142847,0.0005885199,0.0029430138,0.74811107,0.23667036,0.003066763,0.0021133493,0.0015412866],"about_ca_topic_score_codex":0.00035522185,"about_ca_topic_score_gemma":0.00035876542,"teacher_disagreement_score":0.9454685,"about_ca_system_score_codex":0.000038133483,"about_ca_system_score_gemma":0.0013785273,"threshold_uncertainty_score":0.9996361},"labels":[],"label_agreement":null},{"id":"W2312191997","doi":"10.3138/infor.53.1.40","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems","year":2015,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Hierarchy; Combinatorics; Benchmark (surveying); Projection (relational algebra); Maximum cut; Graph; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.12726660238011808,"score_gpt":0.33624661440165216,"score_spread":0.20898001202153407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312191997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002608398,0.00016805169,0.9920095,0.0008997803,0.00037270805,0.0018791244,0.00013655654,0.000089263776,0.0018365931],"genre_scores_gemma":[0.73879784,0.00017416713,0.25405473,0.0007786367,0.00035991255,0.0037618952,0.0013452229,0.000031545533,0.00069603213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974944,0.00013134643,0.00077728136,0.00018841597,0.0011192549,0.00028928963],"domain_scores_gemma":[0.9959134,0.00047060728,0.00022400076,0.00030560876,0.0029204595,0.00016591972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028062812,0.00013264595,0.00019358794,0.0012144496,0.0005257609,0.000761803,0.00038597482,0.000093348586,0.0000033415643],"category_scores_gemma":[0.0006431554,0.00011880747,0.000071593626,0.0013163087,0.0001648196,0.0043293973,0.00010410495,0.00019360479,0.000009767183],"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.00003614263,0.000040951614,0.000502392,0.00022817084,0.00002393276,1.5141008e-7,0.0016552511,0.25936285,0.000014945945,0.73317504,0.0029456879,0.0020144838],"study_design_scores_gemma":[0.001085617,0.00032477753,0.00018513633,0.000082647166,0.0000031224101,0.000013283179,0.00037078254,0.96219355,0.000108941626,0.0065797004,0.028892878,0.00015958521],"about_ca_topic_score_codex":0.0002853565,"about_ca_topic_score_gemma":0.000009777954,"teacher_disagreement_score":0.7379548,"about_ca_system_score_codex":0.0000760226,"about_ca_system_score_gemma":0.0007864485,"threshold_uncertainty_score":0.7346084},"labels":[],"label_agreement":null},{"id":"W2338410001","doi":"10.1016/j.tcs.2016.04.005","title":"Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Edge cover; Approximation algorithm; Dual (grammatical number); Covering problems; Combinatorics; Set cover problem; Mathematical optimization; Algorithm; Computer science; Graph; Set (abstract data type)","score_opus":0.027205835633059547,"score_gpt":0.26314649833605147,"score_spread":0.2359406627029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338410001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011565758,0.000021021018,0.98565274,0.0007498789,0.000380821,0.0011270881,0.0000118454955,0.00033917086,0.00015169593],"genre_scores_gemma":[0.43619007,0.0000027893461,0.5634573,0.00014582685,0.0001118011,0.000066389344,0.0000013164558,0.000014983345,0.00000949889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963026,0.000119905926,0.00042259693,0.0011875189,0.0010551471,0.0009122028],"domain_scores_gemma":[0.99756294,0.00035934855,0.00016366462,0.0010677973,0.0005681481,0.00027808922],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002074476,0.00035344873,0.00036371808,0.00032072846,0.0007234496,0.00043273394,0.0020871537,0.00010382589,0.000021032856],"category_scores_gemma":[0.00009916071,0.00022414463,0.00011933227,0.0012439418,0.003372088,0.0016139692,0.0008871865,0.00018735867,0.00001656961],"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.000028242901,0.000119905664,0.00003750563,0.000042561245,0.00001377154,0.000008293905,0.0002618555,0.00072902243,0.008577956,0.95012575,0.000015835036,0.040039323],"study_design_scores_gemma":[0.00057287375,0.0005291128,0.00010877643,0.00017024453,0.000010193625,0.0001336038,0.000003126694,0.74291664,0.03194693,0.22303519,0.00018024033,0.00039308728],"about_ca_topic_score_codex":0.0000054325446,"about_ca_topic_score_gemma":4.5297517e-7,"teacher_disagreement_score":0.7421876,"about_ca_system_score_codex":0.00015220183,"about_ca_system_score_gemma":0.000280236,"threshold_uncertainty_score":0.9993402},"labels":[],"label_agreement":null},{"id":"W2339293751","doi":"10.1145/3087556.3087563","title":"Impact of Knowledge on Election Time in Anonymous Networks","year":2017,"lang":"en","type":"preprint","venue":"","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":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Node (physics); Computer science; Computer network; Task (project management); Simple (philosophy); Port (circuit theory); Path (computing); Sequence (biology); Distributed computing; Engineering","score_opus":0.02824446317044718,"score_gpt":0.31711142227053757,"score_spread":0.2888669591000904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339293751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112813756,0.00071275956,0.72695416,0.00020101939,0.0030804335,0.00086860097,0.00001393472,0.00043898588,0.15491635],"genre_scores_gemma":[0.98937213,0.00006709696,0.008430359,0.000015272662,0.00021471587,0.000015468813,0.000010670373,0.000012470358,0.0018618098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868953,0.000090229194,0.00027987617,0.00051332003,0.00015193805,0.00027513056],"domain_scores_gemma":[0.9981736,0.00010122712,0.00023244404,0.0013401349,0.00009154718,0.00006104967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035886513,0.0002319509,0.00038415464,0.00034189352,0.00008193998,0.00015392536,0.0016497022,0.00025163215,0.00006273626],"category_scores_gemma":[0.000033179615,0.0001996476,0.00028513075,0.00020914056,0.00006197896,0.00012575868,0.001195455,0.0006482231,0.000045046378],"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.000092970746,0.0019889344,0.0070935558,0.00013408004,0.00027576415,0.00004360956,0.0010173104,0.10320908,0.00014951703,0.03474441,0.0160745,0.8351763],"study_design_scores_gemma":[0.00020870213,0.0002869681,0.056040827,0.00017340665,0.000003936442,0.0000055786645,4.283053e-7,0.920096,0.00010292126,0.022704935,0.0001139153,0.00026236987],"about_ca_topic_score_codex":0.0006913416,"about_ca_topic_score_gemma":0.00015914283,"teacher_disagreement_score":0.87655836,"about_ca_system_score_codex":0.00013671437,"about_ca_system_score_gemma":0.00024073405,"threshold_uncertainty_score":0.8141393},"labels":[],"label_agreement":null},{"id":"W2369536682","doi":"10.1007/978-3-319-33461-5_4","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Rounding; Spanning tree; Degree (music); Approximation algorithm; Combinatorics; Minimum spanning tree; Mathematical optimization; Reduction (mathematics); Linear programming relaxation; Mathematics; Lagrangian relaxation; Computer science; Tree (set theory); Linear programming","score_opus":0.02235592030043055,"score_gpt":0.23873351660190054,"score_spread":0.21637759630147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369536682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022934475,0.00025925774,0.98876476,0.0018851958,0.0027716444,0.0012551799,0.000042606527,0.00047501433,0.0043170117],"genre_scores_gemma":[0.034118135,0.000019428919,0.9630043,0.000725755,0.001445314,0.000071047536,0.00002250626,0.000068457,0.0005250401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935329,0.0000791769,0.0010739753,0.0027917288,0.001326538,0.0011956731],"domain_scores_gemma":[0.9960756,0.0006195503,0.0005795027,0.0019350817,0.00036742413,0.00042285208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010965002,0.00091217563,0.00091293803,0.0016064887,0.00061496417,0.0008829991,0.0041813315,0.00044241908,0.00006251097],"category_scores_gemma":[0.00012134404,0.0007718617,0.00024969943,0.0015218614,0.0009082036,0.00088325364,0.0017437052,0.00097185717,0.00008452161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010387652,0.00004303599,0.000012480217,0.000029426918,0.0000332787,0.000054687265,0.0027418411,0.003312626,0.0014878776,0.028772753,0.000023582552,0.963478],"study_design_scores_gemma":[0.00057051313,0.00021270804,0.00003737367,0.0020199693,0.000014728376,0.00010830808,0.0000013839262,0.6260992,0.00246045,0.36494505,0.0023104448,0.0012198485],"about_ca_topic_score_codex":0.00007442322,"about_ca_topic_score_gemma":0.000093542876,"teacher_disagreement_score":0.96225816,"about_ca_system_score_codex":0.00046970506,"about_ca_system_score_gemma":0.00054647273,"threshold_uncertainty_score":0.9994732},"labels":[],"label_agreement":null},{"id":"W2394568608","doi":"","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Parity (physics); Electronic circuit; Binary number; Algorithm; Boolean circuit; Boolean function; Correlation; Constant (computer programming); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Physics","score_opus":0.03848540810114379,"score_gpt":0.27544994856066984,"score_spread":0.23696454045952606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394568608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013435676,0.00013587176,0.98130554,0.002093939,0.000635891,0.0006899668,0.000035353547,0.00035179063,0.0013159824],"genre_scores_gemma":[0.8580963,0.000007832383,0.1393363,0.0014688766,0.0003674046,0.00010267864,0.00013230287,0.00003186267,0.00045647056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970234,0.00021423335,0.0005002804,0.00092986476,0.00053968857,0.0007925084],"domain_scores_gemma":[0.99649143,0.0022354093,0.00023122794,0.00049331604,0.00034698882,0.00020164163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010096227,0.00037220545,0.00042127754,0.00019999147,0.00088758994,0.00029444916,0.00079787755,0.00012662179,0.000025110057],"category_scores_gemma":[0.0002703708,0.00040644337,0.00018844439,0.0006333804,0.00026049683,0.00029417983,0.0002425245,0.00042948924,0.000030965235],"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.00004189825,0.00017047496,0.00014045875,0.00002933945,0.00005216633,0.0000010145329,0.00015747479,0.010851914,0.000020528923,0.94962513,0.00053377775,0.03837582],"study_design_scores_gemma":[0.0009847746,0.0006168113,0.005784041,0.000014287481,0.000010140485,0.000025916226,0.000004907436,0.55450743,0.000024222694,0.42805272,0.009696822,0.00027791815],"about_ca_topic_score_codex":0.000026896614,"about_ca_topic_score_gemma":0.0000791904,"teacher_disagreement_score":0.8446606,"about_ca_system_score_codex":0.00024234796,"about_ca_system_score_gemma":0.00033344573,"threshold_uncertainty_score":0.99983877},"labels":[],"label_agreement":null},{"id":"W2395991959","doi":"10.1007/s00037-017-0156-0","title":"The Average Sensitivity of Bounded-Depth Formulas","year":2017,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Bounded function; Omega; Lemma (botany); Mathematics; Boolean function; Combinatorics; Upper and lower bounds; Sensitivity (control systems); Parity (physics); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.06812620353572955,"score_gpt":0.30958691097718677,"score_spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395991959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06194871,0.000060051596,0.92756474,0.002318593,0.0006636795,0.00018760272,0.000023532824,0.00011056762,0.0071225367],"genre_scores_gemma":[0.93132246,0.000005625642,0.0683644,0.00012793158,0.00008741315,0.0000046515643,0.000008480822,0.0000068174963,0.00007221602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823123,0.00019265675,0.00033815956,0.00035585833,0.00057136285,0.0003107065],"domain_scores_gemma":[0.99702406,0.000912213,0.00039456,0.0012317534,0.00034221934,0.000095196156],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001122379,0.00017103582,0.0002338026,0.000057618436,0.00295013,0.00065948133,0.0017336225,0.000044216373,0.000008612183],"category_scores_gemma":[0.00026800975,0.00013862013,0.00017921637,0.00012852886,0.0009990749,0.00060417707,0.0010556258,0.00021073225,0.000027461945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011147824,0.00006628954,0.0016667894,0.0000096908225,0.000032811015,0.000010694363,0.00012674258,0.0021607634,0.000024249,0.96677256,0.0003645722,0.028753709],"study_design_scores_gemma":[0.00017919161,0.000023004877,0.18254559,0.0000085045685,0.000001575633,0.000020702648,0.000003445038,0.3540547,0.000089782225,0.46140975,0.0015685727,0.000095179734],"about_ca_topic_score_codex":0.00017610045,"about_ca_topic_score_gemma":0.000337046,"teacher_disagreement_score":0.86937374,"about_ca_system_score_codex":0.00004022433,"about_ca_system_score_gemma":0.00013532155,"threshold_uncertainty_score":0.9983479},"labels":[],"label_agreement":null},{"id":"W2396989770","doi":"","title":"Bounded-depth Frege lower bounds for weaker pigeonhole principles","year":2002,"lang":"en","type":"article","venue":"","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":"Pigeonhole principle; Bounded function; Mathematical proof; Lemma (botany); Mathematics; Upper and lower bounds; Tautology (logic); Discrete mathematics; Argument (complex analysis); Combinatorics; Computer science; Mathematical analysis","score_opus":0.0701979948883009,"score_gpt":0.2544185079142551,"score_spread":0.18422051302595416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396989770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004916877,0.00034800067,0.9044996,0.0022802332,0.0012459155,0.00032379053,0.0000065281124,0.00054150925,0.085837536],"genre_scores_gemma":[0.53379226,0.000052036492,0.41687924,0.0022452648,0.00039753353,0.00010758787,0.0000047138697,0.000032510343,0.046488836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844956,0.000022918686,0.00025439967,0.00050101563,0.00028894248,0.00048317434],"domain_scores_gemma":[0.9987617,0.00012399466,0.00006211754,0.0008022285,0.00011769402,0.00013225262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002197063,0.00018685072,0.00018227,0.000107250744,0.0003729183,0.00044576864,0.0010768987,0.00007488621,0.0003957411],"category_scores_gemma":[0.000042929278,0.00016501613,0.0001604709,0.00044520426,0.000119382756,0.0005413759,0.0003125389,0.00012265857,0.00023388834],"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.0000032332705,0.00026274793,0.000276307,0.000017288674,0.00002862607,0.000009445858,0.0003881825,0.000032989683,0.000032440013,0.9447015,0.020684952,0.033562295],"study_design_scores_gemma":[0.0005157922,0.00017781432,0.001608387,0.000016715398,0.0000046663286,0.000021952239,0.000022147426,0.22491203,0.00036795074,0.054617874,0.7173824,0.00035231464],"about_ca_topic_score_codex":0.00002538695,"about_ca_topic_score_gemma":0.00012890813,"teacher_disagreement_score":0.8900836,"about_ca_system_score_codex":0.000034479905,"about_ca_system_score_gemma":0.000027735816,"threshold_uncertainty_score":0.67291623},"labels":[],"label_agreement":null},{"id":"W2397193627","doi":"","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms.","year":2013,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Truth table; Boolean function; Algorithm; Computer science; Upper and lower bounds; Boolean circuit; Circuit minimization for Boolean functions; Discrete mathematics; Mathematics","score_opus":0.0945715747060616,"score_gpt":0.2774951260997269,"score_spread":0.18292355139366528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397193627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017660927,0.0002337258,0.9827049,0.0016953236,0.00080541975,0.00065877876,0.0000036908536,0.00032805462,0.011804025],"genre_scores_gemma":[0.09014595,0.000004786741,0.8946386,0.0020582967,0.00028037146,0.0012342369,0.000004421266,0.000026027272,0.011607309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984441,0.000029750718,0.00027971712,0.0005147112,0.0002779982,0.00045377153],"domain_scores_gemma":[0.9987075,0.000224552,0.000073190466,0.0006671649,0.00019438162,0.000133264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225834,0.0001965285,0.0003061275,0.00011583089,0.00025308834,0.0005950544,0.001070388,0.00006288251,0.00087030634],"category_scores_gemma":[0.000047118778,0.00015295435,0.000326481,0.00035035607,0.00007432024,0.0008840049,0.00024929858,0.00009129139,0.00018244049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026916791,0.0002893964,0.000053306132,0.000046452733,0.00089650863,0.000009514972,0.0007557844,0.000023618497,0.00028870613,0.60278887,0.066737294,0.32810786],"study_design_scores_gemma":[0.0008989558,0.0004619126,0.0008439191,0.000013796356,0.00024404735,0.000049241837,0.00009614588,0.31246367,0.002980411,0.5324647,0.14850473,0.0009784658],"about_ca_topic_score_codex":0.00006365904,"about_ca_topic_score_gemma":0.00001199647,"teacher_disagreement_score":0.3271294,"about_ca_system_score_codex":0.00002023891,"about_ca_system_score_gemma":0.000051266106,"threshold_uncertainty_score":0.95292443},"labels":[],"label_agreement":null},{"id":"W2397518487","doi":"","title":"Nonuniform catalytic space and the direct sum for space","year":2015,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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":"Université de Montréal","funders":"","keywords":"Boolean function; Branching (polymer chemistry); Computation; Space (punctuation); Function (biology); Mathematics; Discrete mathematics; Literal (mathematical logic); Binary decision diagram; Combinatorics; Property (philosophy); Computer science; Algorithm; Biology","score_opus":0.03804816408237615,"score_gpt":0.2734843221984433,"score_spread":0.23543615811606716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397518487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108787,0.00094564253,0.9309195,0.036869366,0.00091723306,0.0020768035,0.000072838535,0.000488346,0.016831545],"genre_scores_gemma":[0.9650875,0.000011977195,0.032811087,0.0010264046,0.0002013546,0.00012827953,0.00004914809,0.00002251129,0.0006617951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973492,0.0002010341,0.00034570822,0.0006757715,0.0006932154,0.00073506474],"domain_scores_gemma":[0.9970249,0.0016139374,0.00018579217,0.0005827416,0.00036464765,0.00022799443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015418015,0.0003232334,0.00043232727,0.00017023596,0.000670858,0.0003477178,0.0010542438,0.000066575136,0.0000063811576],"category_scores_gemma":[0.00023828782,0.00025750892,0.00018331442,0.00072394306,0.0005921192,0.00030854277,0.0003932951,0.00035697094,0.000027301734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655428,0.000094563955,0.000028700506,0.0000132861,0.000060702307,0.0000019843171,0.00042625383,0.004731922,0.00000188217,0.98854315,0.0042848103,0.001547174],"study_design_scores_gemma":[0.0028057552,0.00037744286,0.00052020664,0.000011128837,0.000014978314,0.000037720147,0.000038764658,0.42729968,0.00004706355,0.54985064,0.018752644,0.00024399045],"about_ca_topic_score_codex":0.00015330846,"about_ca_topic_score_gemma":0.0002302324,"teacher_disagreement_score":0.95420873,"about_ca_system_score_codex":0.0003287669,"about_ca_system_score_gemma":0.0007274291,"threshold_uncertainty_score":0.9999877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015936997,0.00005332795,0.974492,0.001122285,0.0017491576,0.0014576265,0.00048481225,0.0003733931,0.004330397],"genre_scores_gemma":[0.61887944,0.00001508986,0.37582862,0.0033796793,0.00043806547,0.0003888056,0.0008086564,0.000051727366,0.00020995294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974666,0.000046701698,0.00091207045,0.00032003608,0.0005146339,0.0007399327],"domain_scores_gemma":[0.9976914,0.0002874643,0.00032159625,0.00084137707,0.0004953054,0.00036286912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009850194,0.00034733623,0.00044386237,0.00021790047,0.00038140613,0.0005831237,0.001550479,0.00019488002,0.000009771909],"category_scores_gemma":[0.00010050732,0.0003136788,0.00034018297,0.0003362433,0.00020744494,0.0016382207,0.0005066791,0.00030455104,0.00009788673],"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.00027197003,0.00060116895,0.0004907128,0.00033094746,0.00018046016,0.000005269871,0.008722396,0.00020320354,0.000045443325,0.9296737,0.028853053,0.0306217],"study_design_scores_gemma":[0.008560762,0.0010758087,0.00020571538,0.00016136165,0.000054368476,0.0001846624,0.0009262615,0.6087153,0.0015572009,0.10786338,0.26971343,0.0009817395],"about_ca_topic_score_codex":0.000008615223,"about_ca_topic_score_gemma":0.0000073009583,"teacher_disagreement_score":0.8218103,"about_ca_system_score_codex":0.00013506124,"about_ca_system_score_gemma":0.00014226291,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2398812037","doi":"","title":"Is the Valiant-Vazirani Isolation Lemma Improvable?","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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":"","keywords":"Lemma (botany); Combinatorics; Witness; Mathematics; Isolation (microbiology); Time complexity; Polynomial; Discrete mathematics; Computer science; Botany; Biology","score_opus":0.0715601453350734,"score_gpt":0.2694981997654061,"score_spread":0.19793805443033272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398812037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025911335,0.00018817058,0.95036685,0.006767227,0.0008960779,0.0009011829,0.000036497782,0.000570214,0.014362447],"genre_scores_gemma":[0.9536381,0.000009222523,0.04230213,0.0033616228,0.00016442117,0.000057704045,0.000025971947,0.000024474792,0.00041637517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966104,0.00028136247,0.0005298936,0.0008253413,0.00087669777,0.0008762923],"domain_scores_gemma":[0.9979702,0.00040067462,0.000259184,0.0009187916,0.00031222007,0.00013891066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082330196,0.0003755762,0.00031076832,0.00021715244,0.0010965131,0.00024520265,0.0019556344,0.00009642491,0.00045986564],"category_scores_gemma":[0.000040955194,0.00031459887,0.0002830304,0.0012233267,0.0003071435,0.0004989419,0.00038345152,0.00063416484,0.00027184602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006891422,0.00025019702,0.00018040904,0.000009262045,0.00008068812,0.000005012236,0.0010664852,0.00058721256,0.000039130464,0.9885446,0.0037899176,0.005378188],"study_design_scores_gemma":[0.0005914355,0.00051122624,0.017944656,0.000013570681,0.000013672042,0.000047106398,0.000028462871,0.31740776,0.00037302804,0.6553384,0.007371546,0.00035914997],"about_ca_topic_score_codex":0.00021014603,"about_ca_topic_score_gemma":0.00011801964,"teacher_disagreement_score":0.92772675,"about_ca_system_score_codex":0.00025851172,"about_ca_system_score_gemma":0.00047449203,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W2399132114","doi":"10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","year":2018,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","score_opus":0.07522345276282445,"score_gpt":0.31081136914360635,"score_spread":0.23558791638078191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06206445,0.0004944842,0.91236037,0.0054069543,0.00066866225,0.00036458633,0.000044289514,0.00034370477,0.018252524],"genre_scores_gemma":[0.83690256,0.000013806549,0.1626255,0.00024850306,0.0001076678,0.000009907353,0.00003560059,0.00000799611,0.000048471094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978736,0.00032503647,0.0005288681,0.00036319206,0.0005882421,0.00032108586],"domain_scores_gemma":[0.9965973,0.0010661159,0.0003114687,0.0010949284,0.0008328183,0.000097397446],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007708585,0.0001899841,0.000252602,0.00011418676,0.0014066026,0.0002287854,0.0024403713,0.000053728465,0.000070503884],"category_scores_gemma":[0.00012222456,0.00015323762,0.00014024496,0.00080357277,0.0023394504,0.0003630784,0.0008885439,0.00022369875,0.000069275855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018235804,0.00009554365,0.0009128219,0.000008114895,0.000034155666,5.550298e-7,0.00028262768,0.00032689577,0.00001412106,0.9854612,0.0035750214,0.009270744],"study_design_scores_gemma":[0.0002567318,0.000120957935,0.066410005,0.000016436645,0.0000042577162,0.000014626358,0.000036700963,0.28376862,0.00010917276,0.64425015,0.004873034,0.00013930503],"about_ca_topic_score_codex":0.00006752734,"about_ca_topic_score_gemma":0.00018831543,"teacher_disagreement_score":0.7748381,"about_ca_system_score_codex":0.000034317574,"about_ca_system_score_gemma":0.00014290573,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W2399132844","doi":"","title":"On Resolution Like Proofs of Monotone Self-Dual Functions.","year":2014,"lang":"en","type":"article","venue":"ISAIM","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 Lethbridge","funders":"","keywords":"Mathematical proof; Monotone polygon; Mathematics; Resolution (logic); Discrete mathematics; Boolean function; Class (philosophy); Duality (order theory); Dual (grammatical number); Combinatorics; Computer science","score_opus":0.012318350108671175,"score_gpt":0.22259884430323376,"score_spread":0.21028049419456257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043673385,0.00004596715,0.9466968,0.00052262936,0.0016163405,0.00016049776,0.0000033012898,0.00032162448,0.0069594295],"genre_scores_gemma":[0.9032305,0.0000030535691,0.09568059,0.00032047086,0.00023146263,0.000016879498,0.0000031058162,0.000007269397,0.00050671183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916,0.00006099354,0.00015403835,0.00023859732,0.00022876418,0.00015758947],"domain_scores_gemma":[0.99925303,0.00009480472,0.00006440649,0.00048306593,0.000058215643,0.000046481044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025718528,0.00008143891,0.000105618616,0.00010229282,0.00010567447,0.000031861666,0.00030450334,0.000043766697,0.000015142606],"category_scores_gemma":[0.000028178456,0.00007682771,0.000057647107,0.000300829,0.000044427183,0.00014333638,0.00011093013,0.000105252104,0.000089313595],"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.00003072747,0.0006692226,0.00020269104,0.00004102696,0.00004022142,0.0000039799743,0.0011313771,0.0016547046,0.00046480677,0.83563596,0.023950556,0.13617474],"study_design_scores_gemma":[0.0007508508,0.00090393104,0.0051566395,0.00005273164,0.000014072722,0.00001831438,0.00002011533,0.7625808,0.0018291643,0.11751277,0.11084535,0.00031522926],"about_ca_topic_score_codex":0.00002432824,"about_ca_topic_score_gemma":0.0000071584855,"teacher_disagreement_score":0.8595571,"about_ca_system_score_codex":0.000020672482,"about_ca_system_score_gemma":0.000022427983,"threshold_uncertainty_score":0.31329432},"labels":[],"label_agreement":null},{"id":"W2400880491","doi":"10.1007/978-3-662-48971-0_53","title":"Constant Query Time $$(1+\\epsilon )$$ -Approximate Distance Oracle for Planar Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Oracle; Binary logarithm; Time complexity; Graph; Constant (computer programming); Mathematics; Physics; Computer science","score_opus":0.03021250463092352,"score_gpt":0.25719653106098656,"score_spread":0.22698402643006305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400880491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001617951,0.0014745267,0.9892231,0.00072521396,0.0020504636,0.00091663696,0.00012056479,0.0003728249,0.0051004966],"genre_scores_gemma":[0.0069362014,0.00006932054,0.99030447,0.0010970766,0.00035334655,0.000050706385,0.000046076748,0.0000780977,0.0010647154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456805,0.00004856484,0.00077349105,0.0021849,0.0013156536,0.001109361],"domain_scores_gemma":[0.9958652,0.000773716,0.00046141987,0.0019816726,0.0005511465,0.00036680268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016883395,0.0008002078,0.0009230449,0.00091891945,0.0004899899,0.0007494688,0.004698549,0.00038596924,0.00002379854],"category_scores_gemma":[0.000133745,0.00074946333,0.00028853392,0.0009193732,0.0015627965,0.00082589814,0.0010140574,0.00080353295,0.000059049642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004442154,0.00009003273,0.000021361411,0.00012494308,0.000036698508,0.0001423198,0.0006143354,0.0037198213,0.00010841113,0.59911466,0.0007613104,0.39522168],"study_design_scores_gemma":[0.00036230398,0.00021567543,0.0000059479707,0.00029666972,0.000009439127,0.00006600181,2.0076992e-7,0.38412127,0.00019211444,0.605218,0.008813007,0.0006994123],"about_ca_topic_score_codex":0.00002092662,"about_ca_topic_score_gemma":0.00007130655,"teacher_disagreement_score":0.39452228,"about_ca_system_score_codex":0.00035206202,"about_ca_system_score_gemma":0.0008560335,"threshold_uncertainty_score":0.9994956},"labels":[],"label_agreement":null},{"id":"W2402204697","doi":"","title":"Lower Bounds on Interactive Compressibility by Constant-Depth Circuits.","year":2012,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Upper and lower bounds; Mathematics; Connection (principal bundle); Constant (computer programming); Compressibility; Bounded function; Electronic circuit; Compression (physics); Discrete mathematics; Combinatorics; Omega; Probabilistic logic; Computer science; Mathematical analysis; Physics; Geometry; Quantum mechanics; Statistics","score_opus":0.03066489096434945,"score_gpt":0.283515508964421,"score_spread":0.2528506180000716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402204697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056945823,0.00024230876,0.587258,0.00065097946,0.00314881,0.00028901745,0.000026974712,0.00054386945,0.3508942],"genre_scores_gemma":[0.99440426,0.000003996143,0.003640379,0.0012424203,0.00007839681,0.000008576761,0.0000036326726,0.0000066680764,0.0006116704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985624,0.000097028445,0.000213276,0.00037657554,0.00030228644,0.00044842297],"domain_scores_gemma":[0.99865156,0.00028873855,0.000072152565,0.0007284601,0.00006386853,0.00019523397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085286,0.000173115,0.00018365023,0.00006904554,0.0001728886,0.00016112214,0.00076265086,0.00005679934,0.00029869034],"category_scores_gemma":[0.000036982477,0.00014571234,0.00009658898,0.0002625593,0.0001684354,0.00091591076,0.00029546322,0.00025762935,0.00019721508],"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.000033163804,0.0026729824,0.009212889,0.00001874223,0.000102123595,0.000010977446,0.0021212022,0.000004874605,0.002024975,0.69892156,0.064838916,0.22003761],"study_design_scores_gemma":[0.005436737,0.0025492387,0.08546517,0.0003189743,0.0000621494,0.00023851116,0.0011114896,0.069831915,0.08429841,0.19397913,0.5519496,0.004758678],"about_ca_topic_score_codex":0.000046799603,"about_ca_topic_score_gemma":0.000010010631,"teacher_disagreement_score":0.93745846,"about_ca_system_score_codex":0.00006615581,"about_ca_system_score_gemma":0.000030351739,"threshold_uncertainty_score":0.5941977},"labels":[],"label_agreement":null},{"id":"W2402364738","doi":"","title":"On k-Guarding Polygons.","year":2013,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Binary logarithm; Approximation algorithm; Simple polygon; Log-log plot; Set (abstract data type); Discrete mathematics; Regular polygon; Graph; Computer science; Geometry","score_opus":0.012001003004177179,"score_gpt":0.21547174378093864,"score_spread":0.20347074077676147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402364738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018590303,0.000020062109,0.7749026,0.0033578286,0.00048127756,0.000108567976,2.3246562e-7,0.00038930884,0.20214984],"genre_scores_gemma":[0.89702433,0.0000019262857,0.09860383,0.0021059834,0.000045667468,0.0000115753355,2.3508338e-7,0.0000033857934,0.0022030612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944,0.000014521546,0.00007383791,0.00017631511,0.00013039685,0.00016491479],"domain_scores_gemma":[0.9994758,0.00007942495,0.000013863506,0.00035151475,0.00002245402,0.00005699468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000602494,0.00006081705,0.00005786701,0.00006934364,0.00009174114,0.00016749295,0.00051203894,0.0000185579,0.00044207304],"category_scores_gemma":[0.000014198761,0.000048432787,0.000043169723,0.00020347658,0.000019735295,0.00030033538,0.00014403382,0.000068636095,0.0013944358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4504562e-7,0.000017628723,0.000035693367,7.642429e-7,0.0000028894058,0.0000012447132,0.00004631374,0.000007904587,0.00009556811,0.90188074,0.012110135,0.085800976],"study_design_scores_gemma":[0.00025638446,0.00013578038,0.0064509376,0.000016783737,0.0000012739824,0.000016942256,0.00003582761,0.16586885,0.003419598,0.81438184,0.009096182,0.00031962604],"about_ca_topic_score_codex":0.00008202075,"about_ca_topic_score_gemma":0.0000015314399,"teacher_disagreement_score":0.87843406,"about_ca_system_score_codex":0.000008452337,"about_ca_system_score_gemma":0.000008364335,"threshold_uncertainty_score":0.9993831},"labels":[],"label_agreement":null},{"id":"W2402863327","doi":"","title":"Non-commutative circuits and the sum-of-squares problem.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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 Calgary","funders":"","keywords":"Commutative property; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematical proof; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.01641980183737616,"score_gpt":0.2615900276857136,"score_spread":0.24517022584833745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402863327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31283796,0.00033545552,0.657463,0.01187861,0.00092340127,0.0021129686,0.00005906296,0.00035226086,0.014037255],"genre_scores_gemma":[0.98023343,0.000008187467,0.019020561,0.0005011875,0.000081212405,0.00006444074,0.000017536824,0.000013973367,0.000059452694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975211,0.00022593777,0.00048086964,0.00055312493,0.00067453197,0.0005444537],"domain_scores_gemma":[0.9971589,0.0015372781,0.0002824414,0.0005864732,0.00032412,0.00011082963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011104767,0.00028872394,0.0004324559,0.00019884715,0.00064807956,0.00018757735,0.0013376927,0.00007823911,0.00004382607],"category_scores_gemma":[0.00007987823,0.00022743765,0.00016824962,0.0008073707,0.0012497973,0.00027120038,0.00042319935,0.0008988097,0.00001527212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006295944,0.00014753234,0.00013643704,0.000018622055,0.000065291875,0.0000019793483,0.0008816976,0.0010741062,0.00013426547,0.98777413,0.00028255302,0.009420438],"study_design_scores_gemma":[0.0018870293,0.0003155049,0.010955897,0.000018222081,0.00001133341,0.000046935664,0.000031482436,0.23069954,0.0003316256,0.754218,0.0012424792,0.0002419847],"about_ca_topic_score_codex":0.00014180694,"about_ca_topic_score_gemma":0.0003281179,"teacher_disagreement_score":0.6673955,"about_ca_system_score_codex":0.000058742666,"about_ca_system_score_gemma":0.0004485192,"threshold_uncertainty_score":0.9274638},"labels":[],"label_agreement":null},{"id":"W2403213103","doi":"","title":"A better approximation ratio for the Vertex Cover problem","year":2004,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Vertex cover; Combinatorics; Cover (algebra); Mathematics; Relaxation (psychology); Vertex (graph theory); Approximation algorithm; Set cover problem; Set (abstract data type); Edge cover; Maximum cut; Discrete mathematics; Computer science; Graph","score_opus":0.02213714143351398,"score_gpt":0.24053654038311786,"score_spread":0.2183993989496039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403213103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031400088,0.000022850878,0.98621905,0.01042113,0.00017376571,0.00038161816,0.0000011210716,0.00009413334,0.0023723317],"genre_scores_gemma":[0.17752337,0.000003987113,0.81679267,0.0046626613,0.000101356876,0.00017518747,0.0000038975686,0.0000064569,0.0007303864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946415,0.000008854339,0.00010288252,0.00016178522,0.00012922172,0.00013309198],"domain_scores_gemma":[0.9995237,0.00010011507,0.00002784114,0.00028440935,0.000043761633,0.000020176245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015545973,0.00006212551,0.00005378759,0.000025886968,0.00019406181,0.0001715794,0.00045449822,0.00002138482,0.000020235926],"category_scores_gemma":[0.000010177599,0.000038729217,0.00005465057,0.0001664811,0.000031190088,0.00033604456,0.00007944788,0.000048780712,0.000045135806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018485988,0.000031748306,0.000007746792,0.000007245412,0.000010258077,2.65983e-7,0.00038333918,0.0008369014,0.00010991823,0.9479674,0.0026045882,0.048038706],"study_design_scores_gemma":[0.00059687253,0.00006196778,0.0003348319,0.000008425112,0.0000048514353,0.0000061034957,0.000013469801,0.38326818,0.0025693455,0.59269845,0.02032131,0.00011619832],"about_ca_topic_score_codex":0.000018049353,"about_ca_topic_score_gemma":0.000008882449,"teacher_disagreement_score":0.38243127,"about_ca_system_score_codex":0.00001837457,"about_ca_system_score_gemma":0.000032501866,"threshold_uncertainty_score":0.1654544},"labels":[],"label_agreement":null},{"id":"W2404422255","doi":"10.1007/s10479-017-2448-9","title":"Computational study of valid inequalities for the maximum k-cut problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Clique; Mathematics; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Set (abstract data type); Inequality; Relaxation (psychology); Semidefinite programming; Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.5021551982509271,"score_gpt":0.5168750330118258,"score_spread":0.014719834760898665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404422255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40653253,0.00025854635,0.5639283,0.0231617,0.0002200333,0.0030651852,0.000118673306,0.000039132756,0.0026759158],"genre_scores_gemma":[0.98186827,0.000022501521,0.017525764,0.000037679965,0.000045160643,0.00015548375,0.000003827453,0.0000042992615,0.00033704203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984448,0.00019752169,0.000299102,0.00019569126,0.0006538811,0.00020901281],"domain_scores_gemma":[0.9964891,0.0007696196,0.000058478814,0.0008554382,0.0017915173,0.00003581072],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025006554,0.00006380304,0.00013751515,0.00016447705,0.0016509922,0.00041243876,0.0018281507,0.000022833163,0.0000143124],"category_scores_gemma":[0.00038567354,0.000046318994,0.00006239123,0.00021002513,0.0003311843,0.00045734938,0.0005441804,0.0001336448,0.0000031359493],"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.000025232575,0.0010311931,0.0007272792,0.00006265626,0.00013466498,0.0000014207938,0.009231118,0.05541032,0.00006567283,0.9056212,0.0032844213,0.024404846],"study_design_scores_gemma":[0.00094426115,0.0017298349,0.015707826,0.000055850844,0.0000067948413,0.0000031892278,0.0037492616,0.69452107,0.0021805656,0.2788074,0.002118882,0.0001750627],"about_ca_topic_score_codex":0.0008806332,"about_ca_topic_score_gemma":0.00039968058,"teacher_disagreement_score":0.63911074,"about_ca_system_score_codex":0.000004354118,"about_ca_system_score_gemma":0.00016511677,"threshold_uncertainty_score":0.99964875},"labels":[],"label_agreement":null},{"id":"W2405004071","doi":"","title":"Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.","year":2011,"lang":"en","type":"article","venue":"","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; Sino-Danish Center; University of Toronto; National Natural Science Foundation of China; National Research Foundation; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Upper and lower bounds; Bounded function; Combinatorics; Mathematics; Binary logarithm; Integer (computer science); Function (biology); Discrete mathematics; Log-log plot; Hash function; Computer science; Mathematical analysis","score_opus":0.0442883628984545,"score_gpt":0.2428233523704291,"score_spread":0.1985349894719746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405004071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13398646,0.00015147058,0.64799,0.00023217876,0.00084821903,0.00024356793,0.000003879451,0.0010812593,0.21546297],"genre_scores_gemma":[0.94693726,0.000004837437,0.05112911,0.0012310713,0.00008618992,0.000006029005,0.0000057508937,0.000025110741,0.0005746611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775654,0.00008649748,0.0003228818,0.00074679573,0.00045564785,0.0006316393],"domain_scores_gemma":[0.9986756,0.00020439009,0.00015493046,0.000687433,0.00008714874,0.00019051986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037448888,0.0003206478,0.00029637507,0.00016951689,0.0006222291,0.00037024613,0.0011823499,0.00008546504,0.000093559094],"category_scores_gemma":[0.000019302111,0.00026190368,0.000094082876,0.00068904005,0.00020337939,0.00055070483,0.00026456392,0.00042812686,0.000074355514],"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.000056152094,0.0014440662,0.029622782,0.00009112033,0.00030358022,0.0002866858,0.012933148,0.00007823152,0.00044328606,0.58998793,0.013055743,0.3516973],"study_design_scores_gemma":[0.005712126,0.0056787287,0.07193286,0.0014227718,0.00009593587,0.0018831354,0.0025998305,0.5617756,0.11794775,0.19368969,0.030191552,0.007070003],"about_ca_topic_score_codex":0.0003338553,"about_ca_topic_score_gemma":0.00012788031,"teacher_disagreement_score":0.8129508,"about_ca_system_score_codex":0.000052024458,"about_ca_system_score_gemma":0.00009636587,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W2405783155","doi":"","title":"Constructive Proofs of Concentration Bounds.","year":2010,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Mathematical proof; Discrete mathematics; Product (mathematics); Constructive; Constructive proof; Simple (philosophy); Chernoff bound; Random variable; Direct proof; Upper and lower bounds; Direct product; Combinatorics; Computer science; Algorithm","score_opus":0.006978116070101357,"score_gpt":0.22560664071011108,"score_spread":0.21862852464000973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405783155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17270198,0.000016309852,0.75431484,0.00049730757,0.0017793773,0.00018706074,0.0000029417174,0.00014357147,0.07035663],"genre_scores_gemma":[0.8401988,7.4231565e-7,0.15964477,0.000053913976,0.00003347706,0.0000021966541,5.090096e-7,0.00000106393,0.0000645113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995516,0.000010887987,0.000106745036,0.000127084,0.00011439766,0.00008927894],"domain_scores_gemma":[0.99957067,0.000037963113,0.000045804045,0.00022975095,0.00008469553,0.00003111342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008621072,0.00004377978,0.00006537703,0.000022422062,0.000048072758,0.000042859192,0.0003083968,0.000027067817,0.00006578567],"category_scores_gemma":[0.00001944562,0.000037922746,0.000028193585,0.00015915073,0.00016866677,0.00025193824,0.0000661863,0.000091022695,0.0000066086186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8866367e-7,0.000018765963,0.00077426026,0.0000022701936,0.000003721366,4.914561e-7,0.00017286466,5.208122e-7,0.0059935534,0.960217,0.00012098309,0.03269478],"study_design_scores_gemma":[0.0007675628,0.00016406967,0.014636982,0.0000124892595,0.000005702637,0.00006563601,0.00009057011,0.09058362,0.25844502,0.6253424,0.009567413,0.00031846925],"about_ca_topic_score_codex":0.000019562021,"about_ca_topic_score_gemma":0.00002617569,"teacher_disagreement_score":0.66749686,"about_ca_system_score_codex":0.0000028793622,"about_ca_system_score_gemma":0.00005193596,"threshold_uncertainty_score":0.15464446},"labels":[],"label_agreement":null},{"id":"W2406451447","doi":"10.1007/978-3-319-26626-8_47","title":"Approximating the Restricted 1-Center in Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Saddle point; Center (category theory); Approximation algorithm; Separable space; Vertex (graph theory); Binary logarithm; Mathematics; Matrix (chemical analysis); Scaling; Distance matrix; Shortest path problem; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.03875089561815854,"score_gpt":0.26109662159600944,"score_spread":0.2223457259778509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406451447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013739626,0.00067137566,0.9883506,0.0012978808,0.0017711333,0.00051498413,0.000006041703,0.0001658717,0.007084734],"genre_scores_gemma":[0.14093891,0.00010751104,0.8545823,0.003025187,0.00075002026,0.0000496003,0.000016298463,0.00008268438,0.00044747873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995488,0.00009322067,0.0007547145,0.0014662731,0.0013602414,0.00083753915],"domain_scores_gemma":[0.99673074,0.00062629656,0.00033909598,0.001878443,0.00025890456,0.00016652967],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001668838,0.0005446798,0.0005433346,0.0012361298,0.0003156789,0.0006912557,0.0059018224,0.00027865573,0.00001235627],"category_scores_gemma":[0.00019645203,0.00040759693,0.00015690587,0.0019720187,0.001026864,0.0005975107,0.0023961747,0.0015220119,0.000026479796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007202352,0.000081006314,0.00025775388,0.00003484757,0.000012470627,0.00016188702,0.0018833128,0.01110893,0.000018308805,0.18113925,0.0001399472,0.8051551],"study_design_scores_gemma":[0.00034283331,0.0000796564,0.00022563167,0.00030238656,0.0000027669735,0.00007944445,4.3902799e-7,0.4228304,0.00003758879,0.57345307,0.0021891356,0.0004566727],"about_ca_topic_score_codex":0.00006154587,"about_ca_topic_score_gemma":0.00020789223,"teacher_disagreement_score":0.8046984,"about_ca_system_score_codex":0.0002793081,"about_ca_system_score_gemma":0.00050778873,"threshold_uncertainty_score":0.9998376},"labels":[],"label_agreement":null},{"id":"W2407048800","doi":"10.1007/s10107-017-1111-1","title":"The bilinear assignment problem: complexity and polynomially solvable special cases","year":2017,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Rank (graph theory); Function (biology); Diagonal; Value (mathematics); Generalization; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.0806663039339923,"score_gpt":0.307690644329012,"score_spread":0.2270243403950197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407048800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031779972,0.0011579377,0.96482956,0.008291853,0.0020441387,0.0035106996,0.000028741024,0.0007130592,0.016246017],"genre_scores_gemma":[0.03697918,0.0000946195,0.9595826,0.00008359393,0.0019817154,0.00035171869,0.0000113889255,0.000047389036,0.00086776953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694675,0.0001441076,0.00065241655,0.0008574362,0.0006603608,0.00073892524],"domain_scores_gemma":[0.99664694,0.0007556449,0.00044293614,0.0018082489,0.00010789182,0.00023833576],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015252016,0.00044589886,0.00059603807,0.00007297217,0.0018018619,0.0039484315,0.0025204811,0.00022041924,0.000027975968],"category_scores_gemma":[0.00040876117,0.00031016467,0.00023639189,0.00009054469,0.0010978637,0.00021370666,0.00550909,0.00087505736,0.000039688744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012542513,0.00029262985,0.000029912888,0.000531242,0.00010143432,0.0000886813,0.0007606241,0.000013777393,0.000005138963,0.5535238,0.0010050948,0.44363517],"study_design_scores_gemma":[0.00025027702,0.00012797251,0.000049792983,0.00035457607,0.000040296964,0.000121398014,0.00006405245,0.054687627,0.000055628756,0.9024556,0.04129415,0.0004985763],"about_ca_topic_score_codex":0.00007646511,"about_ca_topic_score_gemma":0.00008031802,"teacher_disagreement_score":0.44313657,"about_ca_system_score_codex":0.000082412145,"about_ca_system_score_gemma":0.00019325003,"threshold_uncertainty_score":0.99993503},"labels":[],"label_agreement":null},{"id":"W2407347952","doi":"","title":"Compression of Boolean Functions.","year":2013,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Boolean function; Boolean circuit; Circuit complexity; Implicant; Circuit minimization for Boolean functions; Discrete mathematics; Binary decision diagram; Mathematics; Monotone polygon; Branching (polymer chemistry); Quadratic equation; Combinatorics; Function (biology); Electronic circuit; Algorithm; Boolean expression","score_opus":0.012123087489789132,"score_gpt":0.2079682523820154,"score_spread":0.19584516489222628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407347952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017409468,0.0000449424,0.9466713,0.00058263465,0.00029293433,0.00008384703,6.134595e-7,0.00010858532,0.034805648],"genre_scores_gemma":[0.87356234,0.0000038524195,0.12407091,0.00021369902,0.00002538911,0.0000072528564,0.0000010486405,0.0000022282923,0.0021133102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995645,0.000013866388,0.000106475796,0.00011484748,0.000112706264,0.00008759255],"domain_scores_gemma":[0.9995364,0.00003157059,0.000029360914,0.00030865494,0.00005631822,0.000037709495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045016786,0.00004307302,0.00006361121,0.000052561896,0.000052796437,0.000035997997,0.00036741915,0.000016917535,0.00048349524],"category_scores_gemma":[0.0000050780845,0.000033326123,0.000037382524,0.00017812374,0.000034286768,0.00029284475,0.00017162153,0.00004359914,0.00019854745],"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.0000013328092,0.0001796802,0.0013730568,0.000016750428,0.000015838734,9.3125817e-7,0.00022507874,0.000070547,0.0053301393,0.36549172,0.087905236,0.5393897],"study_design_scores_gemma":[0.00074937905,0.00027722874,0.07262361,0.000065162414,0.0000060360035,0.0000211308,0.00019159773,0.6132684,0.026366372,0.21899916,0.066960655,0.00047127888],"about_ca_topic_score_codex":0.000119774995,"about_ca_topic_score_gemma":0.0000023310365,"teacher_disagreement_score":0.85615283,"about_ca_system_score_codex":0.0000030778788,"about_ca_system_score_gemma":0.000007942966,"threshold_uncertainty_score":0.5293934},"labels":[],"label_agreement":null},{"id":"W2407565584","doi":"","title":"Computationally Limited Randomness.","year":2011,"lang":"en","type":"article","venue":"","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":"Randomness; Bounded function; Turing machine; Discrete mathematics; Logarithm; Randomized algorithm; Computer science; Mathematics; Connection (principal bundle); Algorithm; Statistics; Mathematical analysis","score_opus":0.06157817614534837,"score_gpt":0.22530044104363878,"score_spread":0.1637222648982904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407565584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024748826,0.000022738004,0.9200556,0.0002066028,0.00022003411,0.00006043248,4.2684087e-7,0.00027595385,0.076683305],"genre_scores_gemma":[0.49890062,0.0000028143231,0.49994946,0.0007274012,0.000026969648,0.000005618339,0.0000015436427,0.0000030862006,0.00038248455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938077,0.000029203267,0.00012444756,0.0001841044,0.00014858427,0.00013286462],"domain_scores_gemma":[0.9995283,0.00007361664,0.000028464567,0.00024485754,0.0000697698,0.000054988628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013151839,0.000067967405,0.00008303963,0.00008115505,0.000083795756,0.000048518345,0.0005894024,0.000021854068,0.00021045188],"category_scores_gemma":[0.000012400553,0.000057893714,0.000053418702,0.00030761005,0.00003997373,0.00026371612,0.00014790209,0.00005415078,0.00013729012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065621653,0.00007145859,0.00021461783,0.0000020390485,0.000011712315,0.000009477633,0.0006091072,0.0000115910325,0.000018673923,0.9615529,0.0008801264,0.03661172],"study_design_scores_gemma":[0.0022069814,0.00012606628,0.057648495,0.0000121392495,0.000006003195,0.000056749224,0.000042223863,0.2907493,0.0016863728,0.64009076,0.006955276,0.0004196038],"about_ca_topic_score_codex":0.000026077427,"about_ca_topic_score_gemma":0.0000051364937,"teacher_disagreement_score":0.49642575,"about_ca_system_score_codex":0.000004889696,"about_ca_system_score_gemma":0.00002280147,"threshold_uncertainty_score":0.23608372},"labels":[],"label_agreement":null},{"id":"W2408365485","doi":"","title":"Extremely uniform branching programs.","year":2014,"lang":"en","type":"article","venue":"NCMA","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":"Université de Montréal","funders":"","keywords":"Branching (polymer chemistry); Property (philosophy); Mathematics; Tree (set theory); Combinatorics; Computer science; Discrete mathematics; Materials science","score_opus":0.023012436946297888,"score_gpt":0.22771924331205864,"score_spread":0.20470680636576075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408365485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01856657,0.00005867033,0.9444792,0.0008145021,0.00058758364,0.00010760172,3.8142775e-7,0.0004538371,0.034931604],"genre_scores_gemma":[0.8494991,0.000003216545,0.1495086,0.00042959308,0.00017201784,0.00000835155,0.0000017887617,0.0000067098417,0.00037063198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991487,0.00003266265,0.00012269594,0.00024331763,0.00020260035,0.0002499799],"domain_scores_gemma":[0.99934244,0.00004285937,0.000039400755,0.0004671072,0.000033318378,0.00007488812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026726583,0.000091819646,0.00009820355,0.00006211516,0.00015425273,0.00018441756,0.0007626599,0.000034753342,0.000020090276],"category_scores_gemma":[0.000022378632,0.00008323836,0.00006222073,0.0002977714,0.000040923915,0.00031368647,0.00019362172,0.00012127595,0.00009132174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.748829e-7,0.000029727462,0.0003937911,0.0000055568144,0.0000032574312,0.0000018257278,0.00019806935,0.0000068445597,0.000047735706,0.27103153,0.0002090188,0.728072],"study_design_scores_gemma":[0.00056264474,0.00022803502,0.008520208,0.000059811733,0.0000049377327,0.00004181399,0.000019664796,0.33219412,0.0008498607,0.2626051,0.39446563,0.00044817646],"about_ca_topic_score_codex":0.000028569788,"about_ca_topic_score_gemma":0.000021151822,"teacher_disagreement_score":0.8309325,"about_ca_system_score_codex":0.0000118251755,"about_ca_system_score_gemma":0.000015812902,"threshold_uncertainty_score":0.33943617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07304386,0.00029167108,0.9013825,0.0019035323,0.0063862903,0.0068927607,0.004692351,0.0013017246,0.0041053058],"genre_scores_gemma":[0.67293984,0.00039980316,0.3094428,0.0029877257,0.0011631498,0.006421428,0.0040222663,0.00036750754,0.0022555212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99335456,0.00017607863,0.0027043943,0.0011409229,0.0008726104,0.0017514074],"domain_scores_gemma":[0.9942912,0.00067368825,0.0012573249,0.0026416099,0.00073913054,0.00039708157],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018339003,0.0011937092,0.0015775635,0.0012732174,0.00045388975,0.0012935747,0.004216314,0.00091515464,0.000025328236],"category_scores_gemma":[0.00034788047,0.0010038594,0.0011973477,0.00078857277,0.00044975535,0.0017605254,0.0029237147,0.0014810613,0.000054428332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499219,0.0054148207,0.015794002,0.011579108,0.0022840057,0.000068298665,0.03518668,0.00029884337,0.00017466668,0.5989259,0.0328142,0.29600957],"study_design_scores_gemma":[0.00999209,0.0008566579,0.0031127692,0.002733657,0.00013920927,0.00006639866,0.00043052604,0.4202644,0.00063307653,0.4844171,0.07426927,0.0030848607],"about_ca_topic_score_codex":0.00016533003,"about_ca_topic_score_gemma":0.00078915746,"teacher_disagreement_score":0.59989595,"about_ca_system_score_codex":0.0004903452,"about_ca_system_score_gemma":0.00039774936,"threshold_uncertainty_score":0.99974316},"labels":[],"label_agreement":null},{"id":"W2418872760","doi":"10.1016/j.tcs.2016.04.044","title":"Approximating the restricted 1-center in graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Saddle point; Approximation algorithm; Center (category theory); Separable space; Binary logarithm; Vertex (graph theory); Discrete mathematics; Matrix (chemical analysis); Distance matrix; Graph; Mathematical analysis; Geometry","score_opus":0.01411976057326362,"score_gpt":0.24352743115335584,"score_spread":0.22940767058009223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418872760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04564873,0.0000151945005,0.9460687,0.0049221716,0.0005149934,0.00017309556,0.0000012710099,0.00016785396,0.0024879857],"genre_scores_gemma":[0.88521945,0.000005592333,0.114146575,0.0005528351,0.000054456636,0.000010663033,1.1449316e-7,0.0000046722503,0.0000056609856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974508,0.00018107754,0.00035084592,0.0006674148,0.00067661796,0.00067323796],"domain_scores_gemma":[0.9979615,0.0006625332,0.00007232518,0.0010535183,0.00010261815,0.00014748152],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016049854,0.00016442667,0.00016545772,0.0002797515,0.00042473874,0.00035410686,0.004052106,0.000037862435,0.000023939116],"category_scores_gemma":[0.00018017815,0.00008204833,0.000070859074,0.0025637576,0.0034503725,0.0007019644,0.0015490863,0.0002018154,0.00004577482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026556017,0.000046588717,0.00037176444,0.0000016213068,0.0000012704706,0.00000789866,0.0002149494,0.0000050914464,0.00030844033,0.8801236,0.000025855965,0.11889025],"study_design_scores_gemma":[0.00042052785,0.00008614879,0.007051143,0.00007299861,0.0000010047912,0.00004578011,0.000005386055,0.22286615,0.0009608141,0.7681163,0.00017685899,0.00019688506],"about_ca_topic_score_codex":0.000004365083,"about_ca_topic_score_gemma":0.0000017826331,"teacher_disagreement_score":0.8395707,"about_ca_system_score_codex":0.000050275154,"about_ca_system_score_gemma":0.00007363737,"threshold_uncertainty_score":0.9992617},"labels":[],"label_agreement":null},{"id":"W2460637059","doi":"10.1109/focs.2016.67","title":"Extension Complexity of Independent Set Polytopes","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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 Education - Singapore; National Research Foundation Singapore; Simons Foundation; National Science Foundation","keywords":"Polytope; Extension (predicate logic); Monotone polygon; Combinatorics; Omega; Mathematics; Exponential function; Connection (principal bundle); Set (abstract data type); Graph; Discrete mathematics; Independent set; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.09488871318137443,"score_gpt":0.30173015554689386,"score_spread":0.20684144236551943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460637059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119194435,0.00025693935,0.96765596,0.0020536787,0.001797643,0.00031709034,0.000107435946,0.00034479587,0.015547007],"genre_scores_gemma":[0.86290795,0.0000693027,0.13590807,0.00030520634,0.00015497734,0.000010717546,0.000018657758,0.00001675626,0.00060836686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767077,0.00011674922,0.00049127184,0.0008060715,0.00060264266,0.00031251265],"domain_scores_gemma":[0.99737185,0.00009759513,0.00031496506,0.0018741001,0.0002192604,0.00012222725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004094804,0.0002962016,0.0005032562,0.00023958427,0.000100201236,0.00011550665,0.0025273894,0.00023453093,0.00021482471],"category_scores_gemma":[0.000031044052,0.00021935205,0.00027397575,0.00016787842,0.00033054853,0.0001805574,0.006779489,0.00041098858,0.000047651403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010135569,0.00014337015,0.00031468505,0.00012327169,0.000069986454,0.00001962179,0.0003050703,0.000025079733,0.0004956059,0.94222295,0.003128735,0.053141512],"study_design_scores_gemma":[0.00028246403,0.000061297294,0.009467217,0.00026936957,0.00001024701,0.000024577992,0.000015310983,0.01581932,0.0067070723,0.9651617,0.0017479393,0.00043351506],"about_ca_topic_score_codex":0.0002436875,"about_ca_topic_score_gemma":0.000036943085,"teacher_disagreement_score":0.8509885,"about_ca_system_score_codex":0.00004325795,"about_ca_system_score_gemma":0.00012725328,"threshold_uncertainty_score":0.8944917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07160636,0.00014487928,0.9185911,0.0014821697,0.0033298305,0.0009900447,0.00036323673,0.0009019947,0.002590412],"genre_scores_gemma":[0.75399965,0.000069709014,0.24190252,0.0011655949,0.0006271158,0.00016941015,0.00023725453,0.000064386164,0.0017643982],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968635,0.00006380792,0.00096718746,0.0004697702,0.00067446474,0.00096127077],"domain_scores_gemma":[0.99765044,0.0004143759,0.00041953218,0.00096879667,0.00029405003,0.0002527985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050729344,0.00046006203,0.00046907103,0.00027897637,0.00056145014,0.00057152694,0.0020791818,0.00020168193,0.000060770235],"category_scores_gemma":[0.00017794307,0.0003274273,0.00035056093,0.0004291332,0.00019493676,0.0028498461,0.0009048503,0.00055154413,0.00033674386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008038716,0.0003084121,0.004300504,0.00014912429,0.00030406498,0.000018507746,0.009280618,0.00003390141,0.0004508252,0.036001008,0.0044962442,0.9445764],"study_design_scores_gemma":[0.010357228,0.0010375582,0.0055596484,0.00082551414,0.00006994302,0.00015485124,0.0011193878,0.44137776,0.009256361,0.044089895,0.4835239,0.002627968],"about_ca_topic_score_codex":0.000029898447,"about_ca_topic_score_gemma":0.000014761956,"teacher_disagreement_score":0.9419484,"about_ca_system_score_codex":0.00013101475,"about_ca_system_score_gemma":0.00008376033,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2471885719","doi":"10.1007/s00454-016-9852-9","title":"Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council","keywords":"Combinatorics; Polytope; Spanning tree; Mathematics; Vertex (graph theory); Genus; Bounded function; Minimum spanning tree; Graph; Minimum degree spanning tree; Discrete mathematics","score_opus":0.04279141595860556,"score_gpt":0.31238818516437084,"score_spread":0.26959676920576525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471885719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030255845,0.00030759483,0.96494365,0.0018240304,0.0005883162,0.00035770517,0.00006447717,0.00006724293,0.0015911666],"genre_scores_gemma":[0.8562914,0.0000069163584,0.1432153,0.00014940929,0.00009913668,0.0000354721,0.000032287553,0.000011794565,0.00015829915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842244,0.000030508938,0.00037576366,0.00037768882,0.0004736849,0.00031991294],"domain_scores_gemma":[0.9975914,0.0007883277,0.00037395975,0.00088490057,0.00028011634,0.00008131225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004123578,0.00018358993,0.00022926916,0.00025614403,0.0016652661,0.00046002638,0.0018472375,0.000058309357,0.00002091781],"category_scores_gemma":[0.00018800565,0.00014611645,0.00030104356,0.00038192834,0.00030525035,0.0006192514,0.00045926502,0.00014587933,0.000006463353],"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.000019652713,0.00006367518,0.0019863374,0.000022319644,0.00013297056,0.0000021352541,0.0003273284,0.00840327,0.000024223758,0.8901002,0.00029693815,0.098620966],"study_design_scores_gemma":[0.00050018996,0.00007008274,0.2773323,0.000022837516,0.00001997932,0.000008786614,0.00004059671,0.37783018,0.000060023314,0.34233406,0.001609244,0.00017170994],"about_ca_topic_score_codex":0.000069903814,"about_ca_topic_score_gemma":0.000027160286,"teacher_disagreement_score":0.82603556,"about_ca_system_score_codex":0.00002043229,"about_ca_system_score_gemma":0.00009915623,"threshold_uncertainty_score":0.99963444},"labels":[],"label_agreement":null},{"id":"W247221977","doi":"10.1145/780591.780595","title":"Derandomizing polynomial identity tests means proving circuit lower bounds","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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":"Mathematics; Nondeterministic algorithm; Polynomial; Discrete mathematics; Corollary; Arithmetic circuit complexity; Combinatorics; Identity (music); Arithmetic; Arbitrary-precision arithmetic","score_opus":0.026337742097286513,"score_gpt":0.2543340318390336,"score_spread":0.22799628974174707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W247221977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02606983,0.0001148357,0.9205413,0.00018136739,0.0014946269,0.00019871752,8.3773494e-7,0.00031949076,0.051078983],"genre_scores_gemma":[0.93485034,0.0000053020867,0.06354721,0.00051980355,0.00011322455,0.000012673806,5.034347e-7,0.000010778827,0.0009401785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983925,0.00010526148,0.00027138568,0.00044786034,0.00035717504,0.00042578563],"domain_scores_gemma":[0.999005,0.0001664006,0.00006805442,0.000563548,0.00007148276,0.00012547988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006700033,0.00016753505,0.000208715,0.00013532257,0.00041109786,0.0007163871,0.0008427029,0.000059059133,0.00013574027],"category_scores_gemma":[0.00019652145,0.00015862983,0.00015189502,0.00052137586,0.00007617849,0.0014739358,0.00019311263,0.00018375514,0.00007122723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013310564,0.0002418268,0.0027115843,0.000021915255,0.000049872557,0.000057909627,0.0006941608,0.000043494932,0.0015882167,0.96808046,0.0021936083,0.024303619],"study_design_scores_gemma":[0.021563487,0.00066246954,0.017920956,0.0002465772,0.000106560765,0.00088306074,0.0003973378,0.11036463,0.020799676,0.70034224,0.122372545,0.0043404503],"about_ca_topic_score_codex":0.000117172385,"about_ca_topic_score_gemma":0.00023970506,"teacher_disagreement_score":0.9087805,"about_ca_system_score_codex":0.000056778197,"about_ca_system_score_gemma":0.00012771768,"threshold_uncertainty_score":0.6908138},"labels":[],"label_agreement":null},{"id":"W2475557115","doi":"10.82308/53758","title":"Circuits, communication and polynomials","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Constant (computer programming); Boolean function; Electronic circuit; Boolean circuit; Mathematics; Computation; Function (biology); Computer science; Topology (electrical circuits); Discrete mathematics; Algorithm; Combinatorics","score_opus":0.034886597454835216,"score_gpt":0.23182597817601888,"score_spread":0.19693938072118367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475557115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479352,0.0011119407,0.00028139097,0.00033613047,0.0005181604,0.00042247103,0.00012930404,0.0007376437,0.04852775],"genre_scores_gemma":[0.9799902,0.00065499195,0.018138751,0.00072242296,0.000022013905,0.000028123693,0.000009597696,0.000027082668,0.00040683194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760365,0.00034745483,0.00046034405,0.0006717127,0.00043109758,0.00048576045],"domain_scores_gemma":[0.99761903,0.00033404204,0.00018617293,0.0014336793,0.00014744427,0.0002795995],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00075915235,0.00029641564,0.00033704794,0.0002312376,0.0021070766,0.00012132638,0.001594014,0.00016363413,0.00004207356],"category_scores_gemma":[0.00021933764,0.00032081647,0.0001281271,0.0006528004,0.00025396296,0.0015495359,0.0009778471,0.0005713251,0.00012489791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042367674,0.00010565751,0.00012067296,0.000014775704,0.000032576405,0.00003397783,0.000018196677,0.000005694337,0.005664659,0.7659675,0.000018012157,0.22801402],"study_design_scores_gemma":[0.0026230551,0.00034974236,0.022410112,0.0001943627,0.000049108683,0.0015850067,0.00007243746,0.0027687848,0.06532757,0.65268165,0.24985681,0.00208134],"about_ca_topic_score_codex":0.00019945386,"about_ca_topic_score_gemma":0.00006002261,"teacher_disagreement_score":0.2498388,"about_ca_system_score_codex":0.0001267835,"about_ca_system_score_gemma":0.000027291839,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W2481918881","doi":"10.1137/1.9781611975031.138","title":"Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","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; Azrieli Foundation; University of Waterloo; Tel Aviv University; National Science Foundation","keywords":"Function (biology); Mathematics; Combinatorics; Submodular set function; Cardinality (data modeling); Time complexity; Oracle; Connection (principal bundle); Boolean function; Property testing; Isomorphism (crystallography); Discrete mathematics; Polynomial; Algorithm; Computer science","score_opus":0.07651544265797267,"score_gpt":0.24444203548777227,"score_spread":0.1679265928297996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481918881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023565384,0.00005455835,0.97218114,0.0005654372,0.00057126774,0.0022282838,0.000024156743,0.00012621706,0.00068353],"genre_scores_gemma":[0.06633014,0.000029011695,0.9306501,0.0006696452,0.0013867759,0.00068911724,0.00002142866,0.000044861885,0.00017891586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868196,0.000019395262,0.000361443,0.0005217146,0.00019557416,0.00021993091],"domain_scores_gemma":[0.998687,0.00051875645,0.00025967002,0.0003353641,0.000108497086,0.000090709334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010113175,0.00026546538,0.00038755365,0.000042686417,0.0006635516,0.00049848645,0.00025266883,0.00033974423,0.0000016807772],"category_scores_gemma":[0.000087355234,0.00020370533,0.00012123104,0.00008940013,0.00032102398,0.000042023486,0.00089711836,0.0003759849,4.6926252e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021336251,0.00011402649,0.000007981411,0.0010182584,0.00056341075,4.6708686e-7,0.017468547,0.0047406047,0.000552417,0.8139593,0.0034194898,0.15794215],"study_design_scores_gemma":[0.0021299496,0.00011273861,0.0000026758614,0.0001716577,0.0001476018,0.00001146912,0.00039663806,0.5891714,0.00032540032,0.4066304,0.0005840583,0.00031598855],"about_ca_topic_score_codex":0.0000221515,"about_ca_topic_score_gemma":0.000002110499,"teacher_disagreement_score":0.5844308,"about_ca_system_score_codex":0.000023318189,"about_ca_system_score_gemma":0.0000551017,"threshold_uncertainty_score":0.8306863},"labels":[],"label_agreement":null},{"id":"W2490234125","doi":"10.1017/cbo9781139034357.007","title":"Continuous rainbow network flow: rainbow network flow with unbounded delay","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"McMaster University; University of Regina","funders":"","keywords":"Rainbow; Computer science; Bounded function; Code (set theory); Flow (mathematics); Routing (electronic design automation); Topology (electrical circuits); Distributed computing; Algorithm; Mathematics; Computer network; Combinatorics; Physics; Programming language; Geometry","score_opus":0.021603645766595944,"score_gpt":0.17869508611007207,"score_spread":0.1570914403434761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490234125","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010590095,0.00044983352,0.23325874,0.00003380401,0.0016542546,0.00077847904,0.000113894224,0.00065242284,0.763048],"genre_scores_gemma":[0.00024035679,0.00014692146,0.0624566,0.00041762544,0.001352548,0.0000043931277,0.00008653949,0.00011263553,0.9351824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99568146,0.0001806921,0.00047712584,0.0016245026,0.00073021045,0.0013060088],"domain_scores_gemma":[0.995924,0.00025780132,0.00058710825,0.0022381775,0.0004449936,0.00054793555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045456266,0.0010780323,0.0011807404,0.00026423918,0.0010724866,0.00036304398,0.0034816996,0.00071739696,0.000023715585],"category_scores_gemma":[0.00000958069,0.0011572131,0.00055404875,0.0001033156,0.0008831627,0.00039271257,0.0020024895,0.0013507792,0.000041511677],"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.00020620655,0.000026763852,0.000006716018,0.000052863303,0.00053135504,0.0016798979,0.00020316424,0.001106937,4.4275993e-7,0.88506734,0.09446559,0.01665274],"study_design_scores_gemma":[0.0014667726,0.00031934248,0.000023401968,0.000544757,0.00028417047,0.00020046133,0.000010138085,0.01854061,0.000008830522,0.002266584,0.97478384,0.0015511196],"about_ca_topic_score_codex":0.00017886717,"about_ca_topic_score_gemma":0.00003938359,"teacher_disagreement_score":0.88280076,"about_ca_system_score_codex":0.00024423483,"about_ca_system_score_gemma":0.00038978123,"threshold_uncertainty_score":0.9990878},"labels":[],"label_agreement":null},{"id":"W2503948570","doi":"","title":"Oblivious and non-oblivious local search for combinatorial optimization","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Submodular set function; Local search (optimization); Matroid; Greedy algorithm; Mathematical optimization; Mathematics; Approximation algorithm; Combinatorial optimization; Monotone polygon; Optimization problem; Function (biology); Maximization; Algorithm; Discrete mathematics","score_opus":0.016418888897952205,"score_gpt":0.2714500496178985,"score_spread":0.25503116071994625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503948570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021886171,0.00038835919,0.98653644,0.00006979083,0.0048763994,0.00071032817,0.000012046915,0.00017412106,0.005043898],"genre_scores_gemma":[0.71223557,0.00024416597,0.27968788,0.00015799237,0.001172964,0.0002622638,0.0011650439,0.000095733754,0.0049783858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982244,0.000045309524,0.00030368567,0.00055316195,0.00040779906,0.00046566635],"domain_scores_gemma":[0.9987668,0.000208355,0.00011051758,0.00044001156,0.0002950098,0.00017931558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003755442,0.00029603948,0.00033840473,0.00023767464,0.00031457073,0.00032974652,0.00071218325,0.00033814416,0.00004057134],"category_scores_gemma":[0.000018654087,0.0002932097,0.000120411394,0.00038189968,0.00006729309,0.00045316154,0.00015181628,0.00028323708,0.000011472592],"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.00021416508,0.0008401261,0.0002426661,0.000987048,0.0002257668,0.000012265615,0.0053832233,0.005280337,0.000083513696,0.5959161,0.006470237,0.38434455],"study_design_scores_gemma":[0.0020008325,0.0005237909,0.0017029821,0.00013379291,0.00007130006,0.000019690164,0.00040928487,0.9713755,0.0013457442,0.019597348,0.001779089,0.0010406134],"about_ca_topic_score_codex":0.000130937,"about_ca_topic_score_gemma":0.000058033744,"teacher_disagreement_score":0.9660952,"about_ca_system_score_codex":0.000048392973,"about_ca_system_score_gemma":0.0001511733,"threshold_uncertainty_score":0.999952},"labels":[],"label_agreement":null},{"id":"W2505689930","doi":"10.1145/2930889.2930894","title":"Selecting Algorithms for Black Box Matrices","year":2016,"lang":"en","type":"article","venue":"","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 Calgary","funders":"","keywords":"Computation; Black box; Algorithm; Matrix (chemical analysis); Computer science; Field (mathematics); Selection (genetic algorithm); Sparse matrix; Mathematics; Artificial intelligence","score_opus":0.03722886852904583,"score_gpt":0.281986505082967,"score_spread":0.2447576365539212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505689930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014080626,0.000050100833,0.99127144,0.0023206775,0.0003357002,0.0001518136,0.0000034596476,0.0003397442,0.004118977],"genre_scores_gemma":[0.08451186,0.000032851232,0.9100288,0.00043493594,0.00031665483,0.000028343531,5.73226e-7,0.000011822221,0.004634163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989997,0.000018355131,0.00016441819,0.0003389756,0.00015673587,0.00032180187],"domain_scores_gemma":[0.99908096,0.00037730488,0.0000545833,0.00032539712,0.000091099355,0.00007065205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002661843,0.000104872364,0.0001120723,0.00009417408,0.00015702323,0.00012625344,0.00072704005,0.00003802588,0.000045877838],"category_scores_gemma":[0.000053855983,0.000066213535,0.00008912699,0.0003464135,0.000048461032,0.00045319778,0.00017698479,0.000039152314,0.000078862904],"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.0000033948909,0.000045067987,0.00017670478,0.000017221248,0.000021802829,0.0000023976866,0.00020309925,0.000004210689,0.0011263934,0.3049398,0.008130808,0.6853291],"study_design_scores_gemma":[0.0021476808,0.0005183979,0.00087484496,0.0001157441,0.0000174437,0.00005398608,0.0001027118,0.31274825,0.05523722,0.45530087,0.17182472,0.0010581102],"about_ca_topic_score_codex":0.000014349461,"about_ca_topic_score_gemma":0.0000075396374,"teacher_disagreement_score":0.684271,"about_ca_system_score_codex":0.000021210235,"about_ca_system_score_gemma":0.00003086688,"threshold_uncertainty_score":0.27001098},"labels":[],"label_agreement":null},{"id":"W2507428467","doi":"10.1109/focs.2016.57","title":"Polynomial Representations of Threshold Functions and Algorithmic Applications","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Randomized algorithm; Combinatorics; Mathematics; Degree (music); Polynomial; Discrete mathematics; Binary logarithm; Time complexity; Randomness; Hamming distance; Satisfiability; Algorithm; Physics","score_opus":0.025742850740563785,"score_gpt":0.2793138466925053,"score_spread":0.25357099595194155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507428467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050234894,0.0002978404,0.9721879,0.0019034528,0.0005211983,0.0005373779,0.000120840785,0.0002054725,0.023723593],"genre_scores_gemma":[0.62091774,0.0005166227,0.36376664,0.00027780945,0.0011349759,0.0015302366,0.0000993984,0.00005166962,0.01170488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985014,0.00003303045,0.00037970737,0.00066381553,0.00022719028,0.00019481419],"domain_scores_gemma":[0.99808365,0.00015000917,0.00019038863,0.0013276312,0.00014441098,0.00010390952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015214112,0.0001911222,0.0002589098,0.00027064796,0.00018577492,0.0001205978,0.000939018,0.00014929114,0.000048236954],"category_scores_gemma":[0.000012112734,0.00016307367,0.00014237802,0.00026387715,0.0002374716,0.00018949548,0.0020490666,0.00026877696,0.000020074145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009510115,0.00040700505,0.0018992318,0.00020614815,0.0003267292,0.0000032878918,0.000591127,0.00019557998,0.0014017243,0.6306847,0.03218642,0.33208853],"study_design_scores_gemma":[0.0016263786,0.00016536257,0.0087212045,0.0003049849,0.00017067516,0.0000965807,0.00025186795,0.16438675,0.0032842425,0.77530414,0.043916434,0.0017713712],"about_ca_topic_score_codex":0.00007692842,"about_ca_topic_score_gemma":0.000015533455,"teacher_disagreement_score":0.6204154,"about_ca_system_score_codex":0.000023620814,"about_ca_system_score_gemma":0.00014295087,"threshold_uncertainty_score":0.66499513},"labels":[],"label_agreement":null},{"id":"W2507811569","doi":"10.1016/j.disopt.2018.08.003","title":"Additive stabilizers for unstable graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Matching (statistics); Approximation algorithm; Chordal graph; Vertex cover; Maximal independent set; Edge cover; Discrete mathematics; Graph; 1-planar graph","score_opus":0.023612876139482653,"score_gpt":0.27394445528749767,"score_spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507811569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010529001,0.00012017216,0.992031,0.00038223286,0.0017751377,0.0010272482,0.000483444,0.00033835645,0.0037371162],"genre_scores_gemma":[0.008198366,0.00020322802,0.9889076,0.00019525918,0.0002441181,0.00041049015,0.0014857232,0.000044465687,0.00031078365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978424,0.00009015902,0.000374653,0.00095843186,0.00032282824,0.00041153468],"domain_scores_gemma":[0.997921,0.00014807061,0.00031139038,0.0010174351,0.00048690964,0.00011520715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033587523,0.00034341263,0.0003441891,0.00026067207,0.00031979784,0.00047735398,0.0012693639,0.00025889446,0.00011198865],"category_scores_gemma":[0.00011488952,0.00035282836,0.00028342695,0.0004391629,0.00018274492,0.00047493158,0.0010496535,0.00025646004,0.000008366823],"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.000060099672,0.00013204548,0.000043065193,0.00024690205,0.00021201305,0.0000051390834,0.001606869,0.7822602,0.000008302079,0.18651175,0.013844112,0.015069544],"study_design_scores_gemma":[0.00031436322,0.00010408056,0.000016585049,0.00009988493,0.000028480772,0.0000019024017,0.000044995213,0.88259137,0.00021158837,0.112975925,0.003185087,0.000425739],"about_ca_topic_score_codex":0.000033663047,"about_ca_topic_score_gemma":0.000010720647,"teacher_disagreement_score":0.10033122,"about_ca_system_score_codex":0.000081589475,"about_ca_system_score_gemma":0.0001893076,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W2509691293","doi":"10.1016/j.disopt.2017.10.001","title":"Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypercube; Polytope; Mathematics; Semidefinite programming; Combinatorics; Vertex (graph theory); Lift (data mining); Operator (biology); Regular polygon; Polyhedron; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.02309696272240792,"score_gpt":0.2800881309899574,"score_spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509691293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020748933,0.00028178608,0.99357885,0.0008693097,0.00053274655,0.0012697929,0.00054214057,0.00014390885,0.0007065558],"genre_scores_gemma":[0.105449684,0.00036099026,0.8915211,0.0002533452,0.00022744501,0.00030371302,0.0016893843,0.000049500217,0.00014482754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801195,0.000091931935,0.00031816427,0.0009163271,0.0003105046,0.00035114933],"domain_scores_gemma":[0.99832094,0.000105112435,0.00036375053,0.0009084482,0.00021544879,0.00008629985],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028779602,0.00040208967,0.00041346866,0.00022029523,0.0006390857,0.0011241724,0.0010474763,0.0001814696,0.000013024457],"category_scores_gemma":[0.00003535495,0.0003504372,0.000113192174,0.00013274507,0.00016567504,0.00067564443,0.0011960994,0.00033731724,8.357142e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003266572,0.00013854276,0.0012351042,0.00039991795,0.0008442619,0.00003029799,0.0031507278,0.80066925,0.000022734854,0.15080832,0.000772087,0.041602094],"study_design_scores_gemma":[0.001239601,0.0003509393,0.0006124368,0.00047584905,0.00012899736,0.000009775055,0.00011514043,0.99121326,0.00045906915,0.0043320064,0.00026344717,0.0007994758],"about_ca_topic_score_codex":0.00064840313,"about_ca_topic_score_gemma":0.00005362893,"teacher_disagreement_score":0.19054401,"about_ca_system_score_codex":0.000058889134,"about_ca_system_score_gemma":0.00021682006,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W2537901922","doi":"","title":"Better balance by being biased: A 0.8776-approximation for max bisection","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Bisection; Bisection method; Approximation algorithm; Conjecture; Mathematics; Combinatorics; Constraint (computer-aided design); Discrete mathematics; Algorithm; Geometry","score_opus":0.013430548456824001,"score_gpt":0.22544494687534308,"score_spread":0.21201439841851907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537901922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021812333,0.000017905133,0.97179466,0.0028422119,0.00033421745,0.00036815688,0.00000301381,0.00022999049,0.0025975117],"genre_scores_gemma":[0.34982848,0.000005608603,0.6455339,0.0025627778,0.00017272487,0.00030569168,0.000022612687,0.000012168173,0.0015560022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991562,0.000021009013,0.00016128887,0.00028942392,0.000147316,0.00022477888],"domain_scores_gemma":[0.9994485,0.0000840864,0.000051872707,0.00028546792,0.000078432044,0.000051686067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013631498,0.00009826147,0.00009431989,0.0000798517,0.0001640934,0.00026083158,0.000359942,0.00004470533,0.0000887784],"category_scores_gemma":[0.00001861518,0.00008826172,0.00006217318,0.00026286207,0.000023871213,0.0008411498,0.00007796778,0.00006546576,0.00007616568],"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.0000048480633,0.00016728151,0.001588682,0.00007256962,0.00003224126,7.717868e-7,0.00050028064,0.000030030022,0.013522769,0.1408622,0.16219889,0.6810194],"study_design_scores_gemma":[0.00042002357,0.00009408938,0.0017068497,0.000017637649,0.0000034052148,0.000006112524,0.000019012245,0.79644614,0.011506872,0.1700103,0.019519685,0.0002498511],"about_ca_topic_score_codex":0.000104272185,"about_ca_topic_score_gemma":0.000005042189,"teacher_disagreement_score":0.79641616,"about_ca_system_score_codex":0.0000218603,"about_ca_system_score_gemma":0.000009644376,"threshold_uncertainty_score":0.35992083},"labels":[],"label_agreement":null},{"id":"W2549040639","doi":"10.7939/r3bk17130","title":"Approximation Algorithms for Clustering Problems","year":2012,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; University of Alberta","keywords":"Approximation algorithm; Polynomial-time approximation scheme; Facility location problem; Cluster analysis; Combinatorics; Set (abstract data type); Euclidean geometry; Singleton; Time complexity; Mathematics; Euclidean distance; Constant (computer programming); Metric (unit); Cluster (spacecraft); Integer (computer science); Polynomial; Point (geometry); Mathematical optimization; Computer science; Statistics","score_opus":0.025323564580437344,"score_gpt":0.20376394250500218,"score_spread":0.17844037792456485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549040639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006847177,0.000078804966,0.98092717,0.00087134214,0.00024900373,0.00023404395,0.0000029036908,0.00009259113,0.010696991],"genre_scores_gemma":[0.15500878,0.000023681743,0.8408772,0.00011640999,0.00011076086,8.8832854e-7,0.00003174812,0.000011145529,0.0038193837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945986,0.000021402015,0.00008340145,0.0001470029,0.000088883346,0.00019947463],"domain_scores_gemma":[0.9994609,0.00013516893,0.0000727949,0.00023632238,0.000015955446,0.00007887062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007007895,0.00007416228,0.00010606341,0.00009835899,0.0001295091,0.000027851458,0.0005772838,0.000043847915,0.00004539935],"category_scores_gemma":[0.000006431834,0.000086270345,0.00008066821,0.00020643488,0.000048646958,0.0025843785,0.0003367274,0.000049012004,0.0000096924805],"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.000064810345,0.0007068078,0.008449637,0.0005604609,0.00016046868,0.0000027386584,0.047808953,0.000646984,0.00033121207,0.77209723,0.013657465,0.15551326],"study_design_scores_gemma":[0.0013990396,0.00019830487,0.0050117527,0.000110495756,0.000027623675,0.000016984442,0.00073754234,0.77222055,0.0020840373,0.020174265,0.19747238,0.00054703624],"about_ca_topic_score_codex":0.00009708654,"about_ca_topic_score_gemma":0.000011505434,"teacher_disagreement_score":0.77157354,"about_ca_system_score_codex":0.000007518405,"about_ca_system_score_gemma":0.000022653223,"threshold_uncertainty_score":0.35180026},"labels":[],"label_agreement":null},{"id":"W2555363315","doi":"10.4153/cmb-2018-005-9","title":"Connectivity in Hypergraphs","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Hypergraph; Vertex (graph theory); Bounded function; Vertex connectivity; Vertex cover; Polynomial","score_opus":0.014844905029684627,"score_gpt":0.2255064902211542,"score_spread":0.21066158519146957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555363315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26185504,0.00013232892,0.24706541,0.04261759,0.0008441271,0.0006811997,0.00001717493,0.00039106503,0.44639608],"genre_scores_gemma":[0.97164106,0.0000014451778,0.026309712,0.0015814102,0.00007803777,0.000015154658,5.75768e-7,0.000007947168,0.00036464276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883956,0.00006043059,0.00018977273,0.0003064212,0.00014673336,0.00045710464],"domain_scores_gemma":[0.9988774,0.00018615277,0.000024045137,0.00048515515,0.000051405987,0.00037583912],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039050312,0.00011737946,0.00017360007,0.00025968277,0.00012855737,0.000098255594,0.0006928016,0.00006935294,0.003402338],"category_scores_gemma":[0.0002447653,0.00011512255,0.00005560839,0.0004994956,0.00020769451,0.000056698787,0.000090299785,0.00015585122,0.007252401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.745916e-7,0.000037699723,0.00018599232,0.000010776186,0.0000041414387,0.00005236704,0.00029136476,3.7059067e-7,0.0000138936675,0.9887,0.004556433,0.0061460426],"study_design_scores_gemma":[0.00027678246,0.00008562361,0.0022661695,0.00006247161,0.000002270851,0.000058898288,0.000037858852,0.011571415,0.00021857064,0.885542,0.099568486,0.0003094753],"about_ca_topic_score_codex":0.0018947234,"about_ca_topic_score_gemma":0.010237011,"teacher_disagreement_score":0.70978606,"about_ca_system_score_codex":0.00007653572,"about_ca_system_score_gemma":0.00012930203,"threshold_uncertainty_score":0.9975087},"labels":[],"label_agreement":null},{"id":"W2556555060","doi":"10.4086/toc.2018.v014a006","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","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; Israel Science Foundation","keywords":"Communication complexity; Mathematics; Combinatorics; Omega; Order (exchange); Function (biology); Discrete mathematics; Upper and lower bounds; Physics","score_opus":0.025175251675771865,"score_gpt":0.26485716712213536,"score_spread":0.2396819154463635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556555060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43834826,0.000039493923,0.55975467,0.00014071542,0.00038301732,0.0000699212,3.885794e-7,0.00023583852,0.0010277216],"genre_scores_gemma":[0.7589562,9.507604e-7,0.24043801,0.00031943904,0.00026811898,6.410688e-7,2.8251006e-7,0.00000700285,0.0000093700155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975611,0.00042435326,0.000561372,0.0005095205,0.00040489767,0.00053878734],"domain_scores_gemma":[0.9971114,0.001028168,0.00031644746,0.0010956163,0.00032696183,0.000121411955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029154802,0.00021070366,0.00035552258,0.00024296294,0.000551288,0.00010190357,0.002743072,0.00005337318,0.000008792796],"category_scores_gemma":[0.00017030441,0.00020595027,0.00015758025,0.0010120277,0.0008683466,0.0005193312,0.0014003117,0.00017812371,0.000008133802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018474804,0.000063625506,0.00043947736,0.000012410963,0.000023464132,0.0000035378675,0.0067252126,0.000080385136,0.001739179,0.78262985,0.000008462744,0.2082559],"study_design_scores_gemma":[0.0005029091,0.0004443548,0.015005379,0.0000987941,0.0000060843317,0.00004893999,0.00028070653,0.1856836,0.037879717,0.7596957,0.00007924442,0.00027457517],"about_ca_topic_score_codex":0.000014601853,"about_ca_topic_score_gemma":0.0000029602015,"teacher_disagreement_score":0.32060793,"about_ca_system_score_codex":0.000015818398,"about_ca_system_score_gemma":0.000051166266,"threshold_uncertainty_score":0.8398409},"labels":[],"label_agreement":null},{"id":"W2557625822","doi":"","title":"Generalizing contexts amenable to greedy and greedy-like algorithms","year":2013,"lang":"en","type":"dissertation","venue":"","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 Toronto","funders":"","keywords":"Greedy algorithm; Generality; Greedy randomized adaptive search procedure; Computer science; Simple (philosophy); Set (abstract data type); Theoretical computer science; Algorithm; Approximation algorithm; Mathematical optimization; Mathematics","score_opus":0.01941707849487074,"score_gpt":0.26319220359512885,"score_spread":0.24377512510025812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557625822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21349567,0.009900836,0.6046923,0.003420765,0.025409019,0.005960736,0.00008549805,0.0032438058,0.13379139],"genre_scores_gemma":[0.020530947,0.00036444882,0.67201585,0.0055499384,0.0009907138,0.00046389725,0.00037844584,0.00015045592,0.29955533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739766,0.000056595258,0.00043820677,0.0010164855,0.0005037442,0.0005873152],"domain_scores_gemma":[0.9983426,0.00007415638,0.00016119673,0.0008114613,0.00026020608,0.00035039108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023261261,0.0004699834,0.00050278247,0.0004201381,0.00034103563,0.00081106514,0.0012723797,0.00024815448,0.00019300987],"category_scores_gemma":[0.00002121576,0.00044143098,0.0001297433,0.0005620617,0.00004365074,0.0006208369,0.00035880273,0.000341736,0.00026841962],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016215587,0.00013835488,0.00008569374,0.00024512832,0.00018498166,0.000062101186,0.004865419,0.000056469267,0.0017459042,0.14414135,0.06223702,0.7862214],"study_design_scores_gemma":[0.0043748342,0.0021771814,0.021668617,0.0018821013,0.00026020917,0.00033729334,0.0035058812,0.40857738,0.015918052,0.16909835,0.3613942,0.010805911],"about_ca_topic_score_codex":0.0019917958,"about_ca_topic_score_gemma":0.0008104848,"teacher_disagreement_score":0.7754155,"about_ca_system_score_codex":0.00004777315,"about_ca_system_score_gemma":0.000087252236,"threshold_uncertainty_score":0.9998037},"labels":[],"label_agreement":null},{"id":"W256395497","doi":"10.1007/s00037-007-0231-z","title":"New Results on the Complexity of the Middle Bit of Multiplication","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","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 Calgary","funders":"","keywords":"Combinatorics; Omega; Integer (computer science); Mathematics; Binary logarithm; Multiplication (music); Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.16132877308405602,"score_gpt":0.2907668538330652,"score_spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256395497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11704991,0.00011569647,0.82459104,0.04789259,0.00056756067,0.0009716057,0.00024427386,0.00018277201,0.008384525],"genre_scores_gemma":[0.84100866,0.0000013150512,0.15817252,0.000573756,0.00011607123,0.0000063141397,0.00001894158,0.0000070923456,0.00009531961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975874,0.00026058473,0.00069134816,0.00041846032,0.0008079082,0.00023432395],"domain_scores_gemma":[0.997036,0.0008779676,0.0005312418,0.0011200106,0.0003504868,0.00008428928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904019,0.00019945974,0.00026851575,0.00010553826,0.00038769515,0.000053489737,0.0022281422,0.000054290445,0.00004988909],"category_scores_gemma":[0.00020171017,0.00013260003,0.000239649,0.00090943376,0.00096810533,0.00019718631,0.000572719,0.00026846718,0.00003228268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039247512,0.00019444645,0.00013185907,0.000013332652,0.000026619331,1.5032306e-7,0.0006893452,0.02122849,0.00010443193,0.9651608,0.0030543283,0.009356951],"study_design_scores_gemma":[0.0006193276,0.000075507094,0.097867556,0.0000576648,0.0000064875735,0.0000063462903,0.000020558015,0.36836138,0.0021043874,0.5283886,0.0023451985,0.00014697405],"about_ca_topic_score_codex":0.00017948714,"about_ca_topic_score_gemma":0.0001032684,"teacher_disagreement_score":0.72395873,"about_ca_system_score_codex":0.00005962079,"about_ca_system_score_gemma":0.00018830193,"threshold_uncertainty_score":0.54072726},"labels":[],"label_agreement":null},{"id":"W2563982062","doi":"10.1017/s0963548320000048","title":"Estimating parameters associated with monotone properties","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","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; Combinatorics; Monotone polygon; Bounded function; Discrete mathematics; Vertex (graph theory); Graph; Graph property; Substructure; Property testing; Line graph; Voltage graph","score_opus":0.06467749679422376,"score_gpt":0.22994760726316446,"score_spread":0.1652701104689407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563982062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44365928,0.00006605419,0.5529494,0.0015037623,0.00033070392,0.00042837526,9.993589e-7,0.00082124904,0.00024012984],"genre_scores_gemma":[0.82762223,4.3017636e-7,0.171936,0.00037237635,0.000034334054,0.000010739921,0.0000026046334,0.000017170021,0.0000040989153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973097,0.00023228768,0.00049363467,0.0008548285,0.000545592,0.00056397234],"domain_scores_gemma":[0.99814767,0.0003417584,0.00027315386,0.0006291406,0.00034917306,0.0002591188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072094233,0.00031253585,0.0004279684,0.000064522734,0.00051842554,0.0003674562,0.0013852491,0.00008749912,0.0000018308052],"category_scores_gemma":[0.0012341663,0.00027522608,0.000107888525,0.0014918594,0.00020245036,0.00047142003,0.00087290414,0.0004933185,0.000010347773],"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.000105993095,0.0026284135,0.05236922,0.001100044,0.00057567505,0.00017662442,0.027752534,0.15319026,0.00068212615,0.6205103,0.0004794883,0.14042935],"study_design_scores_gemma":[0.0005554728,0.00034321554,0.0013328921,0.00012701092,0.000011244723,0.000006645811,0.00003116731,0.9103384,0.00071388046,0.08612793,0.000023490977,0.00038862016],"about_ca_topic_score_codex":0.000019298965,"about_ca_topic_score_gemma":0.0000016501568,"teacher_disagreement_score":0.7571482,"about_ca_system_score_codex":0.00015106593,"about_ca_system_score_gemma":0.00013615597,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W2564145587","doi":"10.1287/opre.2016.1549","title":"0/1 Polytopes with Quadratic Chvátal Rank","year":2016,"lang":"en","type":"article","venue":"Operations Research","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":"National Science Foundation","keywords":"Polytope; Rank (graph theory); Combinatorics; Closure (psychology); Mathematics; Quadratic equation; Mathematical optimization; Geometry; Economics","score_opus":0.08095007451776011,"score_gpt":0.3601140009281967,"score_spread":0.2791639264104366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564145587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04734139,0.00010474253,0.9251584,0.016161956,0.00011918841,0.0003633027,0.000007645129,0.00013535967,0.01060806],"genre_scores_gemma":[0.9425698,0.000032714695,0.04925945,0.000081226295,0.00010014786,0.00008637033,0.0000014600429,0.0000081517765,0.0078607015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839836,0.00019658012,0.00012574361,0.00032182192,0.00059331866,0.00036417056],"domain_scores_gemma":[0.9987268,0.00021661234,0.0000061671167,0.0006417649,0.00030063966,0.00010805067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450487,0.00007977088,0.00008837296,0.00023761138,0.000670295,0.00042651637,0.000854508,0.00003035589,0.0002203579],"category_scores_gemma":[0.00010317701,0.00004487917,0.000027396762,0.0008511173,0.00025340446,0.0007238608,0.00025031145,0.00015582214,0.0004316853],"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.000011252872,0.00013013736,0.00027300793,0.000005910139,0.00002124923,0.00002786133,0.0006174375,0.00009553278,0.007082157,0.8825418,0.0018701985,0.10732348],"study_design_scores_gemma":[0.0115718,0.006194914,0.032128032,0.001139915,0.000026321026,0.00077795127,0.0013695494,0.49962446,0.11654112,0.1126966,0.2143939,0.00353543],"about_ca_topic_score_codex":0.0001453464,"about_ca_topic_score_gemma":0.0004951979,"teacher_disagreement_score":0.8952284,"about_ca_system_score_codex":0.000040601502,"about_ca_system_score_gemma":0.00022555797,"threshold_uncertainty_score":0.5548585},"labels":[],"label_agreement":null},{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; Algorithm","score_opus":0.09899804868414189,"score_gpt":0.3208446374831788,"score_spread":0.22184658879903693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565232885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08614844,0.00038591772,0.9075696,0.0010054341,0.0011803414,0.0009573356,0.00012844722,0.00014966032,0.002474851],"genre_scores_gemma":[0.8946477,0.000002133777,0.105026506,0.00014025788,0.000067462235,0.000012679268,0.000056276072,0.00001310583,0.0000338701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712586,0.00013056507,0.0008966723,0.00047536922,0.00084230205,0.0005292429],"domain_scores_gemma":[0.9958675,0.0020367277,0.00057712063,0.00059114746,0.0007972124,0.00013031844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760705,0.0002590713,0.0004226683,0.00016295734,0.00056421227,0.000086394066,0.001629072,0.00007614165,0.0000215027],"category_scores_gemma":[0.00017546809,0.00022049797,0.00033159516,0.0007932011,0.0018359885,0.00031865056,0.0003746812,0.00026074628,0.0000034993848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043843447,0.00016425147,0.00087564305,0.00012804162,0.00008984433,0.0000012700756,0.0005792422,0.0021336162,0.00013205338,0.9847183,0.00063204137,0.010501825],"study_design_scores_gemma":[0.00072289916,0.00010287029,0.07882291,0.000039983373,0.000010305782,0.00001652312,0.000041739833,0.19217196,0.0004967083,0.72648215,0.00087578286,0.0002161941],"about_ca_topic_score_codex":0.00011776346,"about_ca_topic_score_gemma":0.00033478724,"teacher_disagreement_score":0.8084993,"about_ca_system_score_codex":0.00007735688,"about_ca_system_score_gemma":0.00015984099,"threshold_uncertainty_score":0.8991646},"labels":[],"label_agreement":null},{"id":"W2567006712","doi":"","title":"Improved Compact Linearizations for the Unconstrained Quadratic 0-1 Minimization Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Mathematics; Quadratic equation; Minification; Upper and lower bounds; Mathematical optimization; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.011528368713001955,"score_gpt":0.2189448606967072,"score_spread":0.20741649198370526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567006712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014747381,0.000094657145,0.99090445,0.0056388136,0.00029410236,0.00057377893,0.000019410536,0.00019248023,0.00080755085],"genre_scores_gemma":[0.5007994,0.000010607921,0.4969253,0.0005829211,0.00039573267,0.00008398974,0.000078093966,0.000019469473,0.0011045012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990287,0.000050674567,0.0002655351,0.00026358696,0.00014190977,0.0002495998],"domain_scores_gemma":[0.99888843,0.00046737326,0.000114479095,0.0003656722,0.00012033407,0.00004370854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019013186,0.00014341834,0.00013768495,0.00008284568,0.0007925116,0.0002914997,0.0005598017,0.00007529325,0.000009528249],"category_scores_gemma":[0.000053081763,0.0001088112,0.000111654066,0.0004828702,0.00023540834,0.00023188774,0.00003349351,0.00013770408,0.0000029060657],"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.000006875086,0.000097255,0.00023696854,0.000023816967,0.00003350534,0.000001416032,0.0008164048,0.0035882907,0.00054467225,0.9772288,0.0035178189,0.013904131],"study_design_scores_gemma":[0.0006187417,0.00007420292,0.00088139204,0.00001000669,0.000022373048,0.0000131128645,0.00008462103,0.8817461,0.0005321425,0.10643619,0.009370391,0.00021070798],"about_ca_topic_score_codex":0.00015574868,"about_ca_topic_score_gemma":0.00011411469,"teacher_disagreement_score":0.8781578,"about_ca_system_score_codex":0.00004408423,"about_ca_system_score_gemma":0.00007896251,"threshold_uncertainty_score":0.60954386},"labels":[],"label_agreement":null},{"id":"W2568886140","doi":"","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","year":2019,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"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","funders":"","keywords":"Tuple; Completeness (order theory); Property (philosophy); Time complexity; Exponential time hypothesis; Data structure; Mathematics; PSPACE; Set (abstract data type); Exponential function; Combinatorics; Class (philosophy); Order (exchange); Discrete mathematics; Computer science; Algorithm; Computational complexity theory","score_opus":0.021214219592210596,"score_gpt":0.23162304265959494,"score_spread":0.21040882306738434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568886140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07161885,0.00052545953,0.9057476,0.0149986725,0.0009152162,0.003780022,0.0001537885,0.0012498653,0.0010105594],"genre_scores_gemma":[0.64526725,0.000025803423,0.35351768,0.00022553044,0.000064337146,0.0006347229,0.000018177427,0.00003318316,0.00021330244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785614,0.000015824015,0.00038096693,0.00082803884,0.0003963379,0.0005226881],"domain_scores_gemma":[0.99754286,0.000053149735,0.00028464833,0.0016860185,0.00035583216,0.000077479555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013532596,0.00038537817,0.00053071394,0.0007261748,0.00033847967,0.00008746337,0.0020699976,0.000273211,0.000011726031],"category_scores_gemma":[0.000046495996,0.00030598076,0.000120991856,0.0014729892,0.00067742594,0.00045157893,0.00037667138,0.00036099428,0.000032228523],"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.00010528699,0.00042865996,0.0027978057,0.0004101357,0.00033307972,0.000011925997,0.0003478276,0.004767318,0.0025391679,0.9050578,0.00083724223,0.08236374],"study_design_scores_gemma":[0.004673825,0.0020765786,0.0025709006,0.0005669638,0.00010492765,0.00012969218,0.00027651817,0.06344874,0.027756056,0.086919084,0.80968046,0.0017962545],"about_ca_topic_score_codex":0.000025450607,"about_ca_topic_score_gemma":0.000091844275,"teacher_disagreement_score":0.8181387,"about_ca_system_score_codex":0.000068125984,"about_ca_system_score_gemma":0.0001549005,"threshold_uncertainty_score":0.9999392},"labels":[],"label_agreement":null},{"id":"W2570310514","doi":"10.1007/s00446-014-0211-x","title":"Randomized distributed decision","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Boosting (machine learning); Randomized algorithm; Context (archaeology); Monte Carlo method; Randomization; Distributed algorithm; Theoretical computer science; Artificial intelligence; Distributed computing; Algorithm; Randomized controlled trial; Mathematics; Statistics","score_opus":0.014558018621588415,"score_gpt":0.2548765614012152,"score_spread":0.24031854277962675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570310514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013962351,0.00008711524,0.9828699,0.00048204523,0.0008469219,0.00025591347,0.0000454239,0.00078429776,0.00066602504],"genre_scores_gemma":[0.8999703,0.0000048427723,0.09940291,0.00022842281,0.00017183792,0.0000076076844,0.0001978528,0.000011588878,0.0000046692285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971987,0.0004045025,0.00064398407,0.00065863965,0.0004891682,0.00060501957],"domain_scores_gemma":[0.9962398,0.0021287964,0.0002472227,0.0009767181,0.0002008871,0.00020658308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018225637,0.0002928848,0.0006533474,0.00013852413,0.0005083633,0.0004536189,0.0017026871,0.000106380874,0.000018301958],"category_scores_gemma":[0.00093786186,0.00026345084,0.0003371277,0.0011129419,0.0001656769,0.00026798763,0.0006008368,0.0003025366,0.000076163305],"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.0010145295,0.00017753376,0.00034234818,0.00002114749,0.00008613434,0.000019342604,0.00019803931,0.008873064,0.000067500405,0.68033653,0.0028737935,0.30599004],"study_design_scores_gemma":[0.032156523,0.000031646356,0.0007598197,0.00006377304,0.000013812041,0.000022687544,0.000010403622,0.883907,0.00026442847,0.076238655,0.0062034545,0.00032778468],"about_ca_topic_score_codex":0.000022899834,"about_ca_topic_score_gemma":0.0000014925085,"teacher_disagreement_score":0.8860079,"about_ca_system_score_codex":0.000058220918,"about_ca_system_score_gemma":0.00003691978,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W2571163292","doi":"10.1007/978-3-642-13731-0_19","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Clique graph; Adjacency matrix; Graph; Mathematics; Unit disk graph; Graph partition; Discrete mathematics; Clique; Computer science; Line graph; Graph power","score_opus":0.03375501707243674,"score_gpt":0.26118555109189284,"score_spread":0.2274305340194561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571163292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050776574,0.00020979386,0.9929474,0.0012654675,0.0029176457,0.0008680585,0.000029957144,0.0001727776,0.001081115],"genre_scores_gemma":[0.07476274,0.00008433083,0.9224043,0.0016765064,0.0006115274,0.00010314184,0.00003270604,0.000059975355,0.00026479072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556184,0.0000538951,0.00075606385,0.001868115,0.000794375,0.00096570334],"domain_scores_gemma":[0.9966865,0.000890967,0.00033234392,0.0015776645,0.0002878226,0.00022468819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013652612,0.0006422711,0.0006656382,0.0015405044,0.00039092184,0.00062611303,0.0038525858,0.00058883673,0.000025208443],"category_scores_gemma":[0.00014846731,0.00062792504,0.00027706366,0.001191043,0.0011095422,0.00076694373,0.0010986186,0.0015326424,0.00001761243],"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.000035002577,0.00019409566,0.0002698834,0.00014821094,0.000022938664,0.00012485209,0.0013755533,0.017781291,0.0006606023,0.40779907,0.0000538065,0.5715347],"study_design_scores_gemma":[0.00039409625,0.00022446127,0.00033167028,0.00034361766,0.000007136844,0.000040984993,2.859709e-7,0.33395597,0.0009212633,0.6594312,0.0036564255,0.0006928569],"about_ca_topic_score_codex":0.000058264515,"about_ca_topic_score_gemma":0.0016450359,"teacher_disagreement_score":0.57084185,"about_ca_system_score_codex":0.00013763468,"about_ca_system_score_gemma":0.00052032276,"threshold_uncertainty_score":0.9996172},"labels":[],"label_agreement":null},{"id":"W2574553255","doi":"","title":"Structure in Stable Matching Problems","year":2016,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.009597189048235795,"score_gpt":0.1948047144092679,"score_spread":0.1852075253610321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574553255","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99448204,0.00015975752,0.0025193174,0.00065959274,0.00066750706,0.00027450264,0.00005220732,0.00010581056,0.0010792548],"genre_scores_gemma":[0.23924148,0.0003245499,0.06965905,0.000040335835,0.000101993035,9.4925286e-7,0.000291604,0.000052631847,0.6902874],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987459,0.000054124215,0.00012783533,0.0004579992,0.00029918127,0.0003149296],"domain_scores_gemma":[0.9991298,0.00003473737,0.00020599629,0.00047206454,0.000091414724,0.00006602005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012184982,0.00020942384,0.00034090056,0.0004223056,0.0001670005,0.000048733727,0.0012655476,0.00022303282,0.00014315399],"category_scores_gemma":[0.000003862025,0.00021249401,0.00011013066,0.00035750773,0.00004920324,0.0005974617,0.00019285342,0.00028989615,0.000019879948],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016069395,0.00029653072,0.001612937,0.0020617847,0.00026462052,0.00031512897,0.7747161,0.00055034703,0.031197345,0.067348294,0.0019479446,0.1195283],"study_design_scores_gemma":[0.0076503237,0.0007677268,0.056723468,0.008300526,0.00019997367,0.000046933765,0.20359646,0.010723395,0.020414326,0.6764547,0.009823337,0.0052988073],"about_ca_topic_score_codex":0.02292258,"about_ca_topic_score_gemma":0.08935538,"teacher_disagreement_score":0.75524056,"about_ca_system_score_codex":0.000069842325,"about_ca_system_score_gemma":0.00009322004,"threshold_uncertainty_score":0.98358387},"labels":[],"label_agreement":null},{"id":"W2575287504","doi":"","title":"Full Cycle Extendability of Nearly Claw-Free Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Biology","score_opus":0.012734423601708593,"score_gpt":0.23253393877361603,"score_spread":0.21979951517190743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575287504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644956,0.00022196726,0.024478054,0.0025084878,0.003844862,0.00027348337,0.000026156711,0.00037566086,0.0037757207],"genre_scores_gemma":[0.98925537,0.000020353858,0.010539035,0.00006880162,0.0000078652165,0.000011769007,5.869733e-7,0.000010373015,0.00008587324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982148,0.000121422774,0.0003700019,0.00049337174,0.0004275903,0.0003728398],"domain_scores_gemma":[0.99727327,0.00032158225,0.00014727107,0.0019307387,0.00018402362,0.00014310025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058192,0.00017820117,0.00027751655,0.00012443516,0.00013033062,0.00005653947,0.002185817,0.00008644826,0.00005597867],"category_scores_gemma":[0.00019568238,0.00013486197,0.00018640331,0.00062500796,0.00031675285,0.00057221524,0.00077124557,0.00012772287,0.000044254517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014537426,0.00018481947,0.0018660533,0.0000120169425,0.000017679295,0.0000052060814,0.0001292283,4.414017e-7,0.0014973417,0.97022486,0.00087663607,0.025171177],"study_design_scores_gemma":[0.0010172692,0.00030186586,0.013697856,0.000035123354,0.000005142833,0.000007692052,0.0000064692704,0.0005291724,0.002991536,0.979856,0.0013529152,0.00019896642],"about_ca_topic_score_codex":0.00006527119,"about_ca_topic_score_gemma":0.00001157635,"teacher_disagreement_score":0.02497221,"about_ca_system_score_codex":0.000037934133,"about_ca_system_score_gemma":0.0000671923,"threshold_uncertainty_score":0.54995114},"labels":[],"label_agreement":null},{"id":"W2577805882","doi":"10.1002/rsa.20807","title":"A characterization of constant‐sample testable properties","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constant (computer programming); Mathematics; Characterization (materials science); Monotonic function; Affine transformation; Property testing; Property (philosophy); Constant function; Partition (number theory); Combinatorics; Invariant (physics); Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Piecewise; Computer science","score_opus":0.019380667144622523,"score_gpt":0.22796953370269527,"score_spread":0.20858886655807274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577805882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2999891,0.00029706777,0.69802946,0.00022156988,0.00055412663,0.00030812394,0.00006529463,0.00011464654,0.00042060358],"genre_scores_gemma":[0.9371938,0.00008918803,0.06230512,0.00012043667,0.00020996526,0.000008847704,0.000009042449,0.000008227056,0.000055355435],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989866,0.000050115963,0.0002518262,0.00028906198,0.0002018663,0.00022055052],"domain_scores_gemma":[0.99927765,0.000092660775,0.00011938624,0.00028913995,0.00015292782,0.00006825176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016745465,0.00014461097,0.0002697438,0.00009656078,0.00022828353,0.00012916468,0.00032745476,0.00005073402,0.000038371898],"category_scores_gemma":[0.00006209132,0.00010822285,0.00005069226,0.00028738682,0.0003675457,0.00031597193,0.00016772855,0.00007623892,0.0000012950758],"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.00026037064,0.00010593289,0.0011506991,0.00018249272,0.00014091552,0.000009028638,0.0043334593,0.000007279825,0.255823,0.24050239,0.00011594446,0.49736848],"study_design_scores_gemma":[0.01065349,0.0010703664,0.013079488,0.0002469682,0.00006011829,0.0002139969,0.00022461628,0.28151366,0.4152962,0.2610084,0.015448264,0.0011844258],"about_ca_topic_score_codex":0.000089069916,"about_ca_topic_score_gemma":0.000006903298,"teacher_disagreement_score":0.6372047,"about_ca_system_score_codex":0.000006255348,"about_ca_system_score_gemma":0.00004038788,"threshold_uncertainty_score":0.44131997},"labels":[],"label_agreement":null},{"id":"W2578790121","doi":"10.1145/3055399.3055478","title":"Strongly exponential lower bounds for monotone computation","year":2017,"lang":"en","type":"article","venue":"","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":"Monotone polygon; Constant (computer programming); Computation; Mathematics; Function (biology); Exponential function; Strongly monotone; Exponent; Discrete mathematics; Upper and lower bounds; Monotonic function; Combinatorics; Applied mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.042228431976782034,"score_gpt":0.31235092128707853,"score_spread":0.2701224893102965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578790121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016332302,0.000011572909,0.9774794,0.0008113571,0.0013584766,0.00018232893,0.0000036958156,0.0001243708,0.0036965164],"genre_scores_gemma":[0.77093285,0.0000012130585,0.22821623,0.000050554307,0.00012668948,0.000019281453,0.0000034997922,0.0000046499613,0.00064504216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999214,0.000010922611,0.00013450913,0.00027510815,0.00015681249,0.00020866317],"domain_scores_gemma":[0.99913925,0.000048496575,0.00009417792,0.0005800142,0.00007933083,0.00005870308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001568072,0.00009068221,0.0001033745,0.000048317514,0.00076070003,0.0008121549,0.0009721249,0.000035580542,0.000019999678],"category_scores_gemma":[0.000024888495,0.00008637241,0.0000928303,0.000036435187,0.000084036765,0.00071659137,0.0002767525,0.000053229454,0.000021932205],"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.000035358466,0.000240725,0.00032633016,0.000026953372,0.000046008434,0.000008436159,0.00027846915,0.00038539676,0.00058785046,0.8053856,0.0057762964,0.1869026],"study_design_scores_gemma":[0.001002932,0.00021341795,0.008552251,0.000014592946,0.0000061201013,0.000005323108,0.000014020276,0.87697285,0.0013327084,0.103883974,0.0077470513,0.00025475523],"about_ca_topic_score_codex":0.000056664885,"about_ca_topic_score_gemma":0.000019534564,"teacher_disagreement_score":0.87658745,"about_ca_system_score_codex":0.000013735664,"about_ca_system_score_gemma":0.00002772563,"threshold_uncertainty_score":0.78316283},"labels":[],"label_agreement":null},{"id":"W2588377248","doi":"10.1016/j.dam.2017.01.012","title":"Deterministic distributed construction of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>-dominating sets in time <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Dominating set; Combinatorics; Upper and lower bounds; Hypergraph; Disjoint sets; Graph; Discrete mathematics; Binary logarithm; Vertex (graph theory)","score_opus":0.018549315522038323,"score_gpt":0.25460526733583627,"score_spread":0.23605595181379796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588377248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640515,0.00023835427,0.028009929,0.00032875454,0.0016750536,0.0004152705,0.0013347571,0.0005719802,0.0033743938],"genre_scores_gemma":[0.93262976,0.00027981363,0.06312395,0.0004378524,0.0008356522,0.0008524445,0.0012873787,0.00046821253,0.00008493427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98872626,0.0002292698,0.0032273913,0.0024104558,0.002915464,0.0024911377],"domain_scores_gemma":[0.98834133,0.00196818,0.003993796,0.0045524356,0.00026906357,0.0008752209],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0025698864,0.0016577485,0.0013644375,0.0005413708,0.0024267535,0.0020918958,0.0044311048,0.0016419487,0.00009525734],"category_scores_gemma":[0.0014863195,0.002015822,0.0014307203,0.001090084,0.0021359173,0.0018603329,0.003860033,0.001961352,0.0013420595],"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.00045954162,0.00072097796,0.000022643799,0.0018564196,0.000657707,0.00060087733,0.0023985254,0.0011322107,0.0031589053,0.98491246,0.00042458964,0.003655142],"study_design_scores_gemma":[0.0027702209,0.00070026744,0.0001492334,0.0017532476,0.000746514,0.0009802862,0.0011868502,0.9667006,0.011347246,0.011066401,0.00088776596,0.001711353],"about_ca_topic_score_codex":0.00034475783,"about_ca_topic_score_gemma":0.00025308135,"teacher_disagreement_score":0.9738461,"about_ca_system_score_codex":0.000098532764,"about_ca_system_score_gemma":0.00093062595,"threshold_uncertainty_score":0.9996541},"labels":[],"label_agreement":null},{"id":"W2593693579","doi":"10.48550/arxiv.1702.06969","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Mathematics; Minor (academic); Graph; Alphabet; Approximation algorithm; Discrete mathematics","score_opus":0.10419736094822678,"score_gpt":0.23027748977501292,"score_spread":0.12608012882678615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593693579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2207686,0.00004921753,0.77674633,0.00004531664,0.0007105162,0.00024664245,0.000014411635,0.0002584512,0.0011605122],"genre_scores_gemma":[0.8964865,0.00007486394,0.103081025,0.00007176919,0.000107014836,0.0000012346499,0.000016586366,0.000021266418,0.00013973829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976758,0.00021228346,0.0002779544,0.0012487563,0.00013090446,0.00045432628],"domain_scores_gemma":[0.9968994,0.00012807766,0.00057930854,0.0020474726,0.00017301347,0.00017273048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003927151,0.00040556985,0.00044559635,0.0004679267,0.0006693923,0.00056211127,0.0029327965,0.00031612252,0.000014883409],"category_scores_gemma":[0.00003960922,0.00048908626,0.000402115,0.00037781373,0.00025926964,0.00080866006,0.0031231497,0.0007592371,0.000016728996],"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.00004840577,0.0005332143,0.0064187436,0.0007687249,0.0005016024,0.0012077042,0.0013649345,0.3563083,0.00068981474,0.61478573,0.0002200714,0.017152736],"study_design_scores_gemma":[0.0002230613,0.000020151501,0.00055982394,0.0003312672,0.000042980868,0.000013966234,0.000021758695,0.7364204,0.00041673658,0.2614277,0.00004184916,0.0004803476],"about_ca_topic_score_codex":0.0002727718,"about_ca_topic_score_gemma":0.00003127587,"teacher_disagreement_score":0.6757179,"about_ca_system_score_codex":0.00016886527,"about_ca_system_score_gemma":0.0001605413,"threshold_uncertainty_score":0.9997561},"labels":[],"label_agreement":null},{"id":"W2594003820","doi":"10.4086/toc.2019.v015a017","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","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; Science and Engineering Research Board; Alfred P. Sloan Foundation","keywords":"Combinatorics; Upper and lower bounds; Boolean function; Degree (music); Mathematics; Omega; Polynomial; Monotone polygon; Function (biology); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.014177357646648656,"score_gpt":0.2334054208585872,"score_spread":0.21922806321193855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594003820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50875336,0.0000598589,0.48941922,0.00009737119,0.00036574647,0.00012292966,3.5024183e-7,0.00018091533,0.0010002546],"genre_scores_gemma":[0.8660485,0.0000015238062,0.13360235,0.00025623612,0.000051620034,6.8297453e-7,5.3485286e-7,0.000008351996,0.000030156494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976003,0.0003863055,0.00054814917,0.0005270924,0.00044057413,0.00049754337],"domain_scores_gemma":[0.99680084,0.0014216983,0.00032476117,0.0012139274,0.00014054166,0.000098229095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025973695,0.00021240127,0.0004348448,0.00023232562,0.00018076805,0.000090661415,0.0026133722,0.000054328586,0.000013992003],"category_scores_gemma":[0.00006978578,0.00020862084,0.00020157154,0.000795187,0.00015926477,0.0005884005,0.0012793707,0.00023524268,0.000018142062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016549087,0.00006810852,0.003507061,0.00004050619,0.000026934631,0.0000032963758,0.0036527372,0.0028234634,0.002912821,0.87606233,0.0000022663917,0.11088394],"study_design_scores_gemma":[0.0008423936,0.00026184847,0.032106757,0.00014601002,0.000005224838,0.000041140003,0.0004203642,0.29865265,0.012535236,0.6546026,0.000049832768,0.00033596312],"about_ca_topic_score_codex":0.000011004525,"about_ca_topic_score_gemma":5.655185e-7,"teacher_disagreement_score":0.3572952,"about_ca_system_score_codex":0.000017420232,"about_ca_system_score_gemma":0.000047671685,"threshold_uncertainty_score":0.8507311},"labels":[],"label_agreement":null},{"id":"W2594925297","doi":"10.1016/j.cor.2017.02.019","title":"A strongly polynomial Contraction-Expansion algorithm for network flow problems","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Contraction (grammar); Algorithm; Flow network; Computer science; Maximum flow problem; Flow (mathematics); Polynomial; Mathematics; Mathematical optimization; Geometry; Mathematical analysis","score_opus":0.09211569102058015,"score_gpt":0.3732049175096355,"score_spread":0.2810892264890554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594925297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093276106,0.00013723972,0.99202436,0.0029786334,0.0021626435,0.0011839744,0.000026377285,0.00013952324,0.00041448534],"genre_scores_gemma":[0.06803185,0.000051169132,0.928362,0.00012134035,0.0020737818,0.00040907,0.000047320475,0.000025814454,0.0008776478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972328,0.00021392589,0.00035260915,0.0007194705,0.0006276133,0.00085360504],"domain_scores_gemma":[0.99692124,0.00040059743,0.0000590971,0.001603354,0.0007887787,0.00022690425],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016425622,0.00019758541,0.000257789,0.00023482223,0.0059783203,0.0032799242,0.0026364154,0.00011499111,0.000018313438],"category_scores_gemma":[0.0001375352,0.00019433776,0.00015116984,0.000327403,0.0003386043,0.0014275383,0.0009728722,0.0005199822,0.00005146432],"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.000011801076,0.00019182338,0.00003949705,0.000014222116,0.000056148296,0.000009861919,0.00040792392,0.08368388,0.00014097693,0.022949422,0.028777698,0.8637167],"study_design_scores_gemma":[0.0008775616,0.00027437607,0.00087712926,0.00005654548,0.00000383909,0.000014996183,0.000019684616,0.9672554,0.000104749306,0.0021987737,0.028099226,0.00021769576],"about_ca_topic_score_codex":0.000324622,"about_ca_topic_score_gemma":0.00031076657,"teacher_disagreement_score":0.88357157,"about_ca_system_score_codex":0.000113423346,"about_ca_system_score_gemma":0.00036888925,"threshold_uncertainty_score":0.99775475},"labels":[],"label_agreement":null},{"id":"W2599445248","doi":"10.1007/s11590-017-1135-8","title":"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Vertex (graph theory); Mathematics; Spanning tree; Gomory–Hu tree; Tree (set theory); Minimum spanning tree; Graph; Minimum degree spanning tree; Integer (computer science); Discrete mathematics; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.02933868493811216,"score_gpt":0.26105253950293705,"score_spread":0.2317138545648249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599445248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004056281,0.000019098956,0.9782392,0.019652786,0.00046233463,0.00059147604,0.0000038905664,0.00011892485,0.0008717738],"genre_scores_gemma":[0.001990433,0.000009340039,0.9959106,0.0013184864,0.00019959809,0.00017075779,0.00000815148,0.000013274541,0.00037939404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.000036510497,0.0002040278,0.00031150735,0.0002125842,0.00023619113],"domain_scores_gemma":[0.9986514,0.00018017102,0.00025964485,0.0007681518,0.00010319362,0.000037424677],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040402106,0.00012821866,0.00011406914,0.00007847576,0.0018661546,0.00105393,0.0011836046,0.000039267277,0.000010915138],"category_scores_gemma":[0.000087780354,0.00009874089,0.00009230833,0.00017954959,0.00008690159,0.0008417541,0.00019763222,0.00009672679,0.0000038486205],"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.000005932884,0.00005005961,0.000057191854,0.000019806132,0.00006013246,0.0000021010146,0.0008116362,0.22068961,0.00025994275,0.012265934,0.00628665,0.759491],"study_design_scores_gemma":[0.0005098505,0.000023266432,0.00013801332,0.00001527688,0.000010749977,0.0000049304167,0.000015286194,0.9954375,0.00022408855,0.0009309984,0.0025483866,0.0001416614],"about_ca_topic_score_codex":0.000024490415,"about_ca_topic_score_gemma":0.000006111174,"teacher_disagreement_score":0.7747479,"about_ca_system_score_codex":0.000034029927,"about_ca_system_score_gemma":0.000026725937,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","score_opus":0.08980382657351924,"score_gpt":0.325023209135156,"score_spread":0.23521938256163674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600683609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012287136,0.00029257068,0.9735327,0.008279321,0.0017195228,0.0006421836,0.000021617234,0.000090271686,0.0031347165],"genre_scores_gemma":[0.8497682,0.00017139167,0.14789565,0.0006615801,0.0007156909,0.00007068266,0.000002770004,0.000051309944,0.00066270184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998222,0.000050276536,0.00047413763,0.00027109997,0.0004881467,0.0004943753],"domain_scores_gemma":[0.9967091,0.0009750159,0.0006808779,0.0012513564,0.00019937815,0.00018424637],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010806576,0.00025610504,0.0003392781,0.00012424712,0.0025110655,0.0025676799,0.003053438,0.000074588774,0.000024368817],"category_scores_gemma":[0.00069757295,0.0001637998,0.00036302913,0.00014338717,0.00028668076,0.0005043403,0.00035668781,0.0004576413,0.000021644793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005678762,0.00026081846,0.0001301093,0.0001800014,0.00035932823,0.000114405935,0.0073615736,0.00011338652,0.0002132493,0.9524121,0.007646826,0.031151382],"study_design_scores_gemma":[0.0020537546,0.0005605842,0.0016539473,0.0006387714,0.00010748932,0.00069155736,0.0010806114,0.35593444,0.0009232662,0.6128197,0.022849692,0.0006862307],"about_ca_topic_score_codex":0.0000037085338,"about_ca_topic_score_gemma":0.000006360838,"teacher_disagreement_score":0.8374811,"about_ca_system_score_codex":0.00003955065,"about_ca_system_score_gemma":0.00008701995,"threshold_uncertainty_score":0.9987875},"labels":[],"label_agreement":null},{"id":"W26022181","doi":"","title":"Some Results in Computational Complexity","year":2005,"lang":"en","type":"article","venue":"TSpace","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":"Computer science","score_opus":0.059713676658355155,"score_gpt":0.33181295615322853,"score_spread":0.2720992794948734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26022181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16281703,0.0009362554,0.6460507,0.1514337,0.0011546274,0.00058984646,0.00002829261,0.0011251585,0.03586442],"genre_scores_gemma":[0.6652049,0.000007814025,0.33305508,0.00092854013,0.00022235417,0.000004724554,0.000008450187,0.0000050028552,0.00056316756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.000055648914,0.00020955005,0.00030819926,0.00025217893,0.000247984],"domain_scores_gemma":[0.9993731,0.00012811707,0.000054842378,0.00033779925,0.000036209247,0.00006993974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904092,0.000100646306,0.00012577687,0.00013744993,0.000089826994,0.00007858201,0.0006034317,0.000034946246,0.000020426813],"category_scores_gemma":[0.000031411502,0.00010527724,0.00004425661,0.0004027884,0.00009072633,0.00039427212,0.00021843992,0.00016101943,0.00015569433],"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.000014119153,0.00015134239,0.0001153794,0.000004672494,0.000005301923,0.0000141217615,0.002807595,0.012430951,0.00002357908,0.954487,0.0033434287,0.026602473],"study_design_scores_gemma":[0.0011192547,0.00004534159,0.024736946,0.000019570196,9.989373e-7,0.000018477549,0.00006587412,0.68595237,0.00016322671,0.2628515,0.024786793,0.00023965043],"about_ca_topic_score_codex":0.00010219306,"about_ca_topic_score_gemma":0.00012652094,"teacher_disagreement_score":0.69163555,"about_ca_system_score_codex":0.000054167835,"about_ca_system_score_gemma":0.000045399403,"threshold_uncertainty_score":0.42930812},"labels":[],"label_agreement":null},{"id":"W260268286","doi":"10.1007/978-3-540-45077-1_29","title":"Non-uniform Depth of Polynomial Time and Space Simulations","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"DTIME; Connection (principal bundle); Computation; Time complexity; Polynomial; Mathematics; PSPACE; Electronic circuit; Space (punctuation); Constant (computer programming); Spacetime; Linear space; Space time; Discrete mathematics; Turing machine; Computer science; Algorithm; Mathematical analysis; Computational complexity theory; Geometry; Physics; Quantum mechanics","score_opus":0.012779228881794445,"score_gpt":0.24684313871894586,"score_spread":0.23406390983715142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260268286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07406708,0.000049836595,0.92495537,0.00028937348,0.00034822786,0.00012731862,0.0000018162466,0.000038889004,0.00012210348],"genre_scores_gemma":[0.5862587,0.0000017121295,0.41358674,0.000121610676,0.000026399051,7.33594e-7,2.708734e-7,0.00000267201,0.0000011757606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985073,0.0000361705,0.00023086046,0.000516918,0.0003440157,0.00036474297],"domain_scores_gemma":[0.9988251,0.00033445275,0.000085259555,0.00055916514,0.00009190491,0.000104161874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004687861,0.0001526306,0.00020202911,0.00037244376,0.00020822759,0.00017224165,0.00094626733,0.0000560231,0.000008015533],"category_scores_gemma":[0.00011030372,0.00014052853,0.000040403687,0.0018850946,0.00049882097,0.00055505283,0.0003829698,0.0001648964,0.000004820701],"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.000008220938,0.00023077984,0.009004544,0.000032779975,0.0000136491235,0.000021072728,0.0045238063,0.48441115,0.011148019,0.013987762,0.000027187303,0.47659102],"study_design_scores_gemma":[0.00026061674,0.00009218961,0.004337156,0.000026310145,0.0000014866908,0.000028748658,4.3736915e-7,0.9629321,0.017317498,0.014770053,0.000059830876,0.00017358817],"about_ca_topic_score_codex":0.0000481748,"about_ca_topic_score_gemma":0.00007374388,"teacher_disagreement_score":0.5121916,"about_ca_system_score_codex":0.000038264432,"about_ca_system_score_gemma":0.00018276127,"threshold_uncertainty_score":0.5730587},"labels":[],"label_agreement":null},{"id":"W2605137997","doi":"10.1007/s10107-017-1140-9","title":"Matroid optimisation problems with nested non-linear monomials in the objective function","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Mathematics; Monomial; Polytope; Submodular set function; Combinatorics; Rank (graph theory); Linear inequality; Monomial basis; Quadratic equation; Discrete mathematics; Quadratic function; Time complexity; Inequality; Mathematical analysis; Geometry","score_opus":0.03847006613994907,"score_gpt":0.27778044538007934,"score_spread":0.23931037924013027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605137997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04933912,0.000011887516,0.946897,0.00091224624,0.00007990562,0.0009061051,3.4375407e-7,0.00010049086,0.001752933],"genre_scores_gemma":[0.77488846,9.132119e-7,0.2247635,0.000053265747,0.0000624849,0.00018817479,0.0000014034915,0.000008651966,0.000033152955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881804,0.00004931472,0.00025470825,0.00030264774,0.00028899708,0.00028631472],"domain_scores_gemma":[0.99875224,0.00016663868,0.00018125126,0.0007995023,0.00005572136,0.000044638986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000885311,0.0001460955,0.0001915047,0.000068310634,0.0004981658,0.0007499131,0.0009503017,0.00005418269,0.000005669478],"category_scores_gemma":[0.00010573073,0.00009187972,0.0000559384,0.0001876799,0.00014386841,0.00061774295,0.000161002,0.00020766963,0.000030792748],"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.00011831692,0.0014152691,0.0020403464,0.0004971832,0.00010755297,0.000065856926,0.01985628,0.0024380863,0.00025010502,0.42600906,0.00006520014,0.5471367],"study_design_scores_gemma":[0.0012618812,0.000863684,0.010012234,0.00036692852,0.000039315466,0.00009334233,0.0009319992,0.741179,0.00033662407,0.24359906,0.0008229877,0.0004929644],"about_ca_topic_score_codex":0.000040182258,"about_ca_topic_score_gemma":0.000028301236,"teacher_disagreement_score":0.73874086,"about_ca_system_score_codex":0.00002957121,"about_ca_system_score_gemma":0.00002774286,"threshold_uncertainty_score":0.7231429},"labels":[],"label_agreement":null},{"id":"W2605296320","doi":"10.1145/3055399.3055470","title":"A polynomial restriction lemma with applications","year":2017,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Constant (computer programming); Degree (music); Lemma (botany); Discrete mathematics; Polynomial; Upper and lower bounds; Block (permutation group theory); Random variable; Function (biology); Boolean function; Statistics; Physics; Mathematical analysis; Computer science","score_opus":0.02368693301885313,"score_gpt":0.26024729835374266,"score_spread":0.23656036533488953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605296320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013077518,0.0000066546254,0.95101666,0.0018499892,0.00009546781,0.00011127611,9.1174394e-7,0.0001397162,0.04547154],"genre_scores_gemma":[0.75636566,0.000009998645,0.24190101,0.0001442733,0.00016985419,0.00006367139,0.0000010938103,0.000004131262,0.0013403401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953324,0.000006653393,0.000059968883,0.00018769914,0.00010427326,0.00010819697],"domain_scores_gemma":[0.99897623,0.000015696653,0.00005549831,0.0008770406,0.00003103032,0.00004450873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055957033,0.000051177012,0.000048627513,0.000041562653,0.0006868804,0.00036795257,0.0008772769,0.000019073359,0.000010233326],"category_scores_gemma":[0.0000050218973,0.000040040497,0.00002142785,0.00008164358,0.00006728861,0.00041887266,0.00016811064,0.000058001595,0.000040959207],"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.000006193465,0.00007327756,0.0015188899,0.0000034383677,0.000013281497,0.000005406443,0.000060706923,0.000012460175,0.000113056194,0.6608051,0.0060688695,0.3313193],"study_design_scores_gemma":[0.0019408704,0.0004761735,0.15976158,0.000031280277,0.000020584588,0.00012923285,0.000056143257,0.13625848,0.004021168,0.051167198,0.6452127,0.00092457724],"about_ca_topic_score_codex":0.00016933159,"about_ca_topic_score_gemma":0.000053167005,"teacher_disagreement_score":0.7550579,"about_ca_system_score_codex":0.000009505059,"about_ca_system_score_gemma":0.000030334408,"threshold_uncertainty_score":0.5282998},"labels":[],"label_agreement":null},{"id":"W2607867111","doi":"10.1007/s10107-017-1150-7","title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Matroid; Mathematics; Spanning tree; Combinatorics; Degree (music); Approximation algorithm; Mathematical optimization; Minimum spanning tree; Linear programming relaxation; Reduction (mathematics); Constant (computer programming); Submodular set function; Lagrangian relaxation; Discrete mathematics; Linear programming; Computer science","score_opus":0.04325035615917717,"score_gpt":0.28487047776355545,"score_spread":0.2416201216043783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607867111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023867019,0.000041577776,0.96841204,0.0018326588,0.00035095896,0.0013606116,0.0000057700777,0.0006330786,0.0034962574],"genre_scores_gemma":[0.27921274,8.2129293e-7,0.7201294,0.00004336152,0.00021346052,0.0002413423,0.000008009367,0.00002481508,0.00012604678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997063,0.00007730083,0.0007146176,0.00083364896,0.00054045103,0.0007710275],"domain_scores_gemma":[0.99741733,0.00020235656,0.00039966372,0.0015180181,0.00012132363,0.0003413197],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082267635,0.00035583993,0.0005056498,0.00018423794,0.0012613144,0.0017438242,0.0018358009,0.00013493847,0.00005086345],"category_scores_gemma":[0.00046174356,0.00031856517,0.00018472307,0.00039401822,0.00025106184,0.00073499966,0.0007439051,0.0003547048,0.00012034981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009735445,0.00035162873,0.0000612426,0.00013280603,0.000081898164,0.000033641012,0.006703601,0.000026865371,0.0016046334,0.13631007,0.00005842494,0.85462546],"study_design_scores_gemma":[0.00081910414,0.00016903621,0.00018493937,0.0009360425,0.000039896608,0.00007947843,0.000577175,0.71057814,0.002013507,0.28025144,0.003596389,0.00075487036],"about_ca_topic_score_codex":0.00008475683,"about_ca_topic_score_gemma":0.000013544116,"teacher_disagreement_score":0.8538706,"about_ca_system_score_codex":0.000069225905,"about_ca_system_score_gemma":0.000048295333,"threshold_uncertainty_score":0.9999266},"labels":[],"label_agreement":null},{"id":"W2610939548","doi":"","title":"Communication Complexity of Set-Disjointness for All Probabilities.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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 Toronto","funders":"","keywords":"Communication complexity; Characterization (materials science); Mathematics; Class (philosophy); Bounded function; Complexity class; Set (abstract data type); Upper and lower bounds; Discrete mathematics; Simple (philosophy); Combinatorics; Structural complexity theory; Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.058259513247356814,"score_gpt":0.3010568026989903,"score_spread":0.2427972894516335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610939548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028199654,0.00012396698,0.9617241,0.0048902994,0.0003112033,0.0013284313,0.00011422952,0.00036779512,0.002940301],"genre_scores_gemma":[0.85056984,0.0000058834294,0.14806944,0.0007450297,0.00008193373,0.00015371609,0.0002709433,0.000024944498,0.00007828942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962212,0.00052649016,0.0008517771,0.0008011122,0.000788268,0.00081116165],"domain_scores_gemma":[0.9956894,0.001692167,0.0004822678,0.0012761968,0.0006980473,0.00016194498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016264502,0.0003960337,0.0006433728,0.00028120127,0.00057373976,0.00014932259,0.002104777,0.0001132326,0.000055641834],"category_scores_gemma":[0.00022380026,0.00042598223,0.00034603884,0.0007301868,0.00093041523,0.00037041283,0.0004744448,0.00042360928,0.000018316934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010492743,0.0004008588,0.00004623594,0.00008760615,0.00007610844,1.8784469e-7,0.00034852407,0.008178433,0.00004154479,0.9858613,0.0011981786,0.0036561044],"study_design_scores_gemma":[0.0009640239,0.00061239925,0.0021228476,0.000030872532,0.000011756185,0.000008985464,0.000017802087,0.37271434,0.0002555748,0.61565703,0.0073188026,0.00028556935],"about_ca_topic_score_codex":0.000105191844,"about_ca_topic_score_gemma":0.00023197889,"teacher_disagreement_score":0.8223702,"about_ca_system_score_codex":0.00033799122,"about_ca_system_score_gemma":0.00042759976,"threshold_uncertainty_score":0.9998192},"labels":[],"label_agreement":null},{"id":"W2611727281","doi":"10.1007/s40305-017-0164-4","title":"A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem","year":2017,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Steiner tree problem; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Computer science","score_opus":0.09638973414503361,"score_gpt":0.38406296238854476,"score_spread":0.28767322824351116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611727281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032443274,0.0005098702,0.9074828,0.057083715,0.00066349545,0.0013642246,0.000019750314,0.000014630311,0.00041824186],"genre_scores_gemma":[0.11291149,0.00025987023,0.8827364,0.00013202462,0.0006948293,0.000056170433,6.7301625e-7,0.000015355332,0.0031931961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777746,0.00023950203,0.00046393974,0.00017206861,0.001006557,0.00034045542],"domain_scores_gemma":[0.99710983,0.00044637884,0.0002993405,0.0008962786,0.0011733792,0.00007480317],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004843677,0.00011288651,0.00022809561,0.00006257513,0.005068144,0.0010456139,0.0031867456,0.00006037326,0.000008817118],"category_scores_gemma":[0.0005517695,0.000059353653,0.0005733344,0.0003591427,0.000502449,0.00076067896,0.0008923236,0.00067802734,6.2261637e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014809871,0.0017514906,0.0013715568,0.0003479659,0.002430004,0.000010549666,0.045330085,0.076034404,0.020688547,0.1699912,0.18188679,0.5000093],"study_design_scores_gemma":[0.0013199962,0.00028419858,0.0045926906,0.000107177366,0.000020772255,0.00006201323,0.00024342205,0.96819353,0.002059927,0.016492153,0.0065175965,0.000106550135],"about_ca_topic_score_codex":0.00018221774,"about_ca_topic_score_gemma":0.000083474544,"teacher_disagreement_score":0.8921591,"about_ca_system_score_codex":0.00008252394,"about_ca_system_score_gemma":0.0006252789,"threshold_uncertainty_score":0.9999914},"labels":[],"label_agreement":null},{"id":"W2619218210","doi":"10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Agence Nationale de la Recherche","keywords":"Leader election; Node (physics); Logarithm; Upper and lower bounds; Computer science; String (physics); Tree (set theory); Binary logarithm; Computer network; Advice (programming); Time complexity; Simple (philosophy); Multiplicative function; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Algorithm","score_opus":0.028810953609554928,"score_gpt":0.2745985513117078,"score_spread":0.24578759770215286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619218210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022512753,0.000015242859,0.9907219,0.0049255905,0.0007955822,0.00045843326,0.000035213747,0.00021853716,0.0005782453],"genre_scores_gemma":[0.6192331,0.00009318751,0.3772035,0.001022681,0.00025146524,0.0004649119,0.00003241953,0.00003719303,0.001661614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865556,0.00003596916,0.00033567587,0.0003292106,0.00026763638,0.00037594498],"domain_scores_gemma":[0.9983211,0.0001498182,0.00014641717,0.0012188664,0.00008089768,0.000082892504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028703158,0.00020238697,0.00022084513,0.00039495993,0.00089251983,0.00047305724,0.0014665471,0.0001333394,0.000038322334],"category_scores_gemma":[0.00006439346,0.00020849063,0.00016395663,0.00027615705,0.000119304364,0.0026028575,0.00001970989,0.00028268842,0.00011114156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041539173,0.00019949212,0.000011724063,0.000014686026,0.000026459476,0.0000024763335,0.0008070814,0.0009842801,0.00012239261,0.0011729187,0.0002727541,0.9963442],"study_design_scores_gemma":[0.003921564,0.0010975081,0.014898806,0.000096162024,0.00003565012,0.00007241043,0.00015146917,0.90786,0.011434965,0.027118064,0.032401085,0.00091233617],"about_ca_topic_score_codex":0.00013245438,"about_ca_topic_score_gemma":0.00014527542,"teacher_disagreement_score":0.99543184,"about_ca_system_score_codex":0.00008746435,"about_ca_system_score_gemma":0.00006306247,"threshold_uncertainty_score":0.8502001},"labels":[],"label_agreement":null},{"id":"W2623150993","doi":"10.1145/2344422.2344424","title":"All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"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":"Log-log plot; Combinatorics; Binary logarithm; Mathematics; Undirected graph; Running time; Graph; Time complexity; Discrete mathematics; Algorithm","score_opus":0.030576764379670184,"score_gpt":0.2668495776188133,"score_spread":0.2362728132391431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623150993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036938163,0.00023664035,0.9906369,0.0013799786,0.0015605495,0.0008104879,0.00015146147,0.0007793518,0.00075084023],"genre_scores_gemma":[0.407741,0.00018942979,0.5881047,0.0021414228,0.000249194,0.0006654902,0.00010151618,0.00009872697,0.0007085243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972229,0.00016898196,0.00051362836,0.00066305225,0.00044103776,0.000990403],"domain_scores_gemma":[0.9974713,0.00068667805,0.00010107709,0.001300728,0.000112429356,0.00032782299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007106406,0.0003972067,0.00040238557,0.0005798371,0.00034103234,0.00013168882,0.0015021593,0.00020335247,0.00010199895],"category_scores_gemma":[0.000044438162,0.00040470832,0.00032587742,0.0017552435,0.00012194462,0.000957133,0.00003894171,0.00045698576,0.00014298264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700149,0.0035921112,0.0003422367,0.000040276067,0.00030196414,0.000027336513,0.002219144,0.0005304038,0.0013115756,0.011781938,0.0022962932,0.9774897],"study_design_scores_gemma":[0.0130897,0.0025237615,0.025193812,0.00050647254,0.00046728185,0.00044697378,0.00048554703,0.56056654,0.054156978,0.15338756,0.18256176,0.006613622],"about_ca_topic_score_codex":0.000071172944,"about_ca_topic_score_gemma":0.000049741033,"teacher_disagreement_score":0.9708761,"about_ca_system_score_codex":0.000108415574,"about_ca_system_score_gemma":0.000066802255,"threshold_uncertainty_score":0.9998405},"labels":[],"label_agreement":null},{"id":"W2735816714","doi":"10.1145/3086464","title":"Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"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":"Submodular set function; Mathematics; Matroid; Combinatorics; Discrete mathematics; Monotone polygon; Automatic summarization; Cardinality (data modeling); Mathematical optimization; Computer science; Data mining","score_opus":0.02398333559549957,"score_gpt":0.26348549531059334,"score_spread":0.23950215971509378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735816714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007897792,0.00013388522,0.9846287,0.005297347,0.00097536366,0.00022753484,0.00005410901,0.00027267297,0.00051264156],"genre_scores_gemma":[0.8805505,0.0003461988,0.117832705,0.0001749538,0.000046681882,0.000056792844,0.000009953804,0.00001811795,0.00096407294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847955,0.00003874105,0.00022642312,0.00064665463,0.00029252304,0.0003161025],"domain_scores_gemma":[0.99714035,0.000090257185,0.00012824163,0.002387515,0.00009742387,0.00015620103],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00021473832,0.00022575192,0.00019942147,0.00022235111,0.002300173,0.00058296707,0.0017769787,0.000100940466,0.000057864694],"category_scores_gemma":[0.000032795597,0.0002332704,0.000104425555,0.00020926679,0.0002777577,0.0009383205,0.00008883,0.00029666556,0.00013128387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015223591,0.0002682248,0.00017872271,0.00001453573,0.00010794531,0.000012851131,0.0003176744,0.00018335013,0.0003134295,0.009512467,0.0001711262,0.9889045],"study_design_scores_gemma":[0.004311654,0.00070364523,0.22628866,0.00013111999,0.00024588747,0.0002332515,0.0008855778,0.5410001,0.007747826,0.19220719,0.023784585,0.002460502],"about_ca_topic_score_codex":0.00012827897,"about_ca_topic_score_gemma":0.000041011914,"teacher_disagreement_score":0.98644394,"about_ca_system_score_codex":0.000051779538,"about_ca_system_score_gemma":0.00003448296,"threshold_uncertainty_score":0.9989987},"labels":[],"label_agreement":null},{"id":"W2738777098","doi":"10.1137/1.9781611975031.136","title":"Testing Bounded Arboricity","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","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":"H2020 European Research Council; Azrieli Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Arboricity; Combinatorics; Bounded function; Treewidth; Mathematics; Omega; Dense graph; Degree (music); Upper and lower bounds; Planar graph; Graph; Discrete mathematics; Binary logarithm; 1-planar graph; Pathwidth; Chordal graph; Physics; Line graph","score_opus":0.13631702241766247,"score_gpt":0.2810234004014134,"score_spread":0.1447063779837509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738777098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03720259,0.000060038914,0.9252816,0.00023647117,0.0019497148,0.003072902,0.00013417177,0.00080107676,0.03126143],"genre_scores_gemma":[0.01113854,0.0000030492336,0.98630303,0.00018305877,0.0016886697,0.00034664094,0.000014943206,0.000038588594,0.00028348272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789685,0.0000103070815,0.00054182066,0.00074017333,0.00034336685,0.0004674788],"domain_scores_gemma":[0.9979843,0.0005500258,0.00044977418,0.0007284053,0.00014411428,0.0001433873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008578529,0.00042257292,0.00058906915,0.000046830166,0.0006036252,0.00061705866,0.0010445229,0.0006923754,0.000002318907],"category_scores_gemma":[0.00009317298,0.0003973587,0.00044360058,0.00011906343,0.00034084872,0.000040413714,0.0020731424,0.0008123675,0.0000029794396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009839869,0.00014272715,0.0000036856534,0.0007583813,0.0003254079,6.9349915e-7,0.004196934,0.000007796359,0.00046668499,0.91554594,0.006275033,0.072266854],"study_design_scores_gemma":[0.0008056351,0.00007137648,0.0000021665362,0.00019326649,0.00008570728,0.0000046417576,0.00012817554,0.030996187,0.0016498924,0.96249634,0.0030497247,0.0005169133],"about_ca_topic_score_codex":0.0000112233065,"about_ca_topic_score_gemma":0.00000120539,"teacher_disagreement_score":0.07174994,"about_ca_system_score_codex":0.000058658385,"about_ca_system_score_gemma":0.00026863843,"threshold_uncertainty_score":0.9998478},"labels":[],"label_agreement":null},{"id":"W2739627855","doi":"10.24963/ijcai.2017/363","title":"Optimizing Ratio of Monotone Set Functions","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Monotone polygon; Set function; Set (abstract data type); Mathematics; Greedy algorithm; Approximation algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Upper and lower bounds; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.05506663702558866,"score_gpt":0.2910248506300271,"score_spread":0.23595821360443842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024476587,0.000016364218,0.9762036,0.00062146905,0.00057888706,0.00004738866,0.0000021203225,0.000060727158,0.020021759],"genre_scores_gemma":[0.5496407,0.0000043549308,0.44856206,0.00006364964,0.00006439834,0.0000047306285,8.912261e-7,0.0000022667255,0.0016569094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954116,0.000010180812,0.00010573678,0.00014457903,0.00010149327,0.000096856165],"domain_scores_gemma":[0.9989862,0.00002668636,0.00007769918,0.0008267226,0.00004858214,0.000034139863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109265275,0.000049638085,0.000080259255,0.000043788823,0.0003827074,0.00016319605,0.0008009049,0.000019238607,0.00005955843],"category_scores_gemma":[0.00002393518,0.000044617194,0.00004866175,0.00005603236,0.00007278596,0.00048095718,0.00030671494,0.000050577895,0.000028782948],"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.0000044199196,0.00010384629,0.0007018211,0.000013885404,0.0000444654,0.0000063746747,0.00097447436,0.0017054201,0.0014779891,0.9122187,0.0075532133,0.0751954],"study_design_scores_gemma":[0.00034366734,0.000073158604,0.0043890434,0.00001567419,0.000005619619,0.000007982273,0.000056430283,0.9540652,0.0071309702,0.026563533,0.007171503,0.00017720749],"about_ca_topic_score_codex":0.00008664273,"about_ca_topic_score_gemma":0.00001813635,"teacher_disagreement_score":0.9523598,"about_ca_system_score_codex":0.000004620063,"about_ca_system_score_gemma":0.000020431635,"threshold_uncertainty_score":0.29435146},"labels":[],"label_agreement":null},{"id":"W2741405093","doi":"10.23638/lmcs-15(3:3)2019","title":"Subspace-Invariant AC$^0$ Formulas","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","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","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Subspace topology; Hamming weight; Upper and lower bounds; Discrete mathematics; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.11226766053009571,"score_gpt":0.402389845439322,"score_spread":0.29012218490922626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741405093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018112743,0.00028340588,0.9842668,0.001304455,0.009126912,0.00073945924,0.000005617266,0.00041771817,0.002044366],"genre_scores_gemma":[0.0305225,0.000058680453,0.9677388,0.0012094354,0.00034918627,0.00005234648,0.0000022480647,0.000017547307,0.000049251463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99212426,0.001017383,0.0009518294,0.0031337573,0.0013475323,0.0014252325],"domain_scores_gemma":[0.9936832,0.0016008642,0.00041789882,0.0035998472,0.00028970803,0.00040848475],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008532467,0.0006910733,0.0010849276,0.0010112426,0.00033854373,0.0015921675,0.0119870305,0.0005148023,0.00003220235],"category_scores_gemma":[0.00043317064,0.0005831478,0.0003784048,0.0031398118,0.0010375123,0.00089751475,0.021533476,0.002168383,0.00007677163],"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.00001096739,0.00031048918,0.00044637415,0.00012476428,0.000018826631,0.00015254538,0.0009007981,0.029817278,0.00042014627,0.31450602,0.00013982833,0.6531519],"study_design_scores_gemma":[0.00021652509,0.00015445266,0.003929472,0.00015360565,0.00000401649,0.00004180177,0.0000029647426,0.67200136,0.0007156731,0.32154283,0.0006546417,0.00058267027],"about_ca_topic_score_codex":0.0000684118,"about_ca_topic_score_gemma":0.000008925913,"teacher_disagreement_score":0.6525693,"about_ca_system_score_codex":0.00031389704,"about_ca_system_score_gemma":0.0007571205,"threshold_uncertainty_score":0.999662},"labels":[],"label_agreement":null},{"id":"W2745314127","doi":"10.1016/j.disopt.2018.06.004","title":"The generalized vertex cover problem and some variations","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Vertex cover; Mathematics; Vertex (graph theory); Generalization; Combinatorics; Cover (algebra); Edge cover; Mathematical optimization; Quadratic equation; Linear programming; Integer programming; Discrete mathematics; Approximation algorithm; Graph","score_opus":0.015549613876668566,"score_gpt":0.24941590798724567,"score_spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745314127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093290786,0.00044361103,0.99346983,0.0021847691,0.0010624505,0.00044600636,0.000028830893,0.00015918766,0.002112002],"genre_scores_gemma":[0.008376775,0.001840494,0.9874742,0.0004555397,0.00037331102,0.00017502242,0.00026625098,0.00003369043,0.0010046996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985352,0.00013774478,0.00028874955,0.0005281425,0.0002736547,0.00023652008],"domain_scores_gemma":[0.9986565,0.00010343761,0.00021616355,0.00078735413,0.00016544497,0.00007109851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003246463,0.00021413557,0.00017972729,0.00008385352,0.0006662394,0.001036474,0.0008544025,0.00015483609,0.000025311143],"category_scores_gemma":[0.000050005237,0.0001646349,0.00008183726,0.00021049725,0.00015454771,0.00042010084,0.0014180556,0.00022994913,0.000012417607],"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.000008237298,0.00002441633,0.000028731558,0.00003353745,0.000083377,0.0000012266466,0.0005884331,0.3045964,0.000004172054,0.686292,0.0031083848,0.005231073],"study_design_scores_gemma":[0.00017660127,0.000020557056,0.000093061084,0.00003315073,0.000017251548,0.0000022617355,0.0000030060341,0.79983246,0.000010073976,0.19783236,0.0017951838,0.00018403657],"about_ca_topic_score_codex":0.000042045605,"about_ca_topic_score_gemma":0.0000054150273,"teacher_disagreement_score":0.49523607,"about_ca_system_score_codex":0.00003845503,"about_ca_system_score_gemma":0.000109247376,"threshold_uncertainty_score":0.9994743},"labels":[],"label_agreement":null},{"id":"W2751154306","doi":"10.5555/3135595.3135623","title":"Distribution testing lower bounds via reductions from communication complexity","year":2017,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Simple (philosophy); Mathematics; Measure (data warehouse); Reduction (mathematics); Upper and lower bounds; Distribution (mathematics); Connection (principal bundle); Discrete mathematics; Property testing; Sample (material); Computer science; Mathematical analysis; Data mining","score_opus":0.0477911743995175,"score_gpt":0.23929163829766156,"score_spread":0.19150046389814407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751154306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29716212,0.000062746556,0.6927871,0.0030194998,0.0004478548,0.00011496251,0.00015748528,0.00014246374,0.006105768],"genre_scores_gemma":[0.91987437,0.000016695547,0.07962047,0.00002032383,0.00003967208,2.0465856e-7,0.00007800389,0.0000037784405,0.00034648844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910384,0.00007199005,0.00012409994,0.0002891887,0.00022169325,0.00018920566],"domain_scores_gemma":[0.9976471,0.00010849815,0.00031535391,0.0016368404,0.00020442803,0.00008777642],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020233578,0.000109878834,0.00018391164,0.00005506548,0.0022759826,0.00015952071,0.0020698546,0.000063907,0.000020882915],"category_scores_gemma":[0.000077604265,0.00014846849,0.000112867725,0.00020593448,0.00078062277,0.0011038273,0.0009159176,0.0001830753,0.000028022398],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088606095,0.0008887232,0.01800991,0.000045014887,0.00030322123,0.000056975667,0.0020855402,0.00007892466,0.0046249893,0.7365986,0.021880856,0.21533862],"study_design_scores_gemma":[0.0010094012,0.000116460804,0.83150387,0.00011245636,0.000060460523,0.000021900063,0.00038532057,0.10646659,0.00047906977,0.042801216,0.016574591,0.00046864836],"about_ca_topic_score_codex":0.012017782,"about_ca_topic_score_gemma":0.00039825577,"teacher_disagreement_score":0.81349397,"about_ca_system_score_codex":0.00007128945,"about_ca_system_score_gemma":0.000060013645,"threshold_uncertainty_score":0.9990229},"labels":[],"label_agreement":null},{"id":"W2752885799","doi":"10.1287/moor.2019.1034","title":"Stabilizing Weighted Graphs","year":2020,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","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; Vertex (graph theory); Matching (statistics); Cardinality (data modeling); Time complexity; Bipartite graph; Graph; Factor-critical graph; Discrete mathematics; Line graph; Computer science; Graph power","score_opus":0.22893134895133008,"score_gpt":0.4098623481194887,"score_spread":0.1809309991681586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752885799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032571398,0.0004098056,0.95489764,0.0038941444,0.00035567873,0.0012583504,0.00007255726,0.00022723319,0.006313205],"genre_scores_gemma":[0.26818073,0.00012292413,0.73125637,0.000024627661,0.00006141477,0.00014541687,0.000027051834,0.00002383993,0.00015766169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967221,0.00028284523,0.0006684405,0.00060612475,0.0013331438,0.00038736773],"domain_scores_gemma":[0.9965129,0.0004812104,0.000071287715,0.0017277756,0.001051009,0.00015581139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016674908,0.00021678215,0.00045257623,0.0006548954,0.0003938843,0.00063838315,0.0030813369,0.00017640686,0.000082737315],"category_scores_gemma":[0.0005066454,0.00020528423,0.00019439518,0.0012977533,0.0003026164,0.00022591572,0.0046639945,0.0013241661,0.000063143074],"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.0000012251795,0.00028782958,0.000007821569,0.00063339336,0.0000582497,0.000008185769,0.0047168066,0.0009017104,0.0011488358,0.9895428,0.00066856644,0.002024593],"study_design_scores_gemma":[0.00008129299,0.000051719144,0.000018621338,0.00017184258,0.0000048278507,0.0000028340455,0.0001539919,0.52827424,0.002448061,0.46846297,0.00018168917,0.00014792991],"about_ca_topic_score_codex":0.00009768786,"about_ca_topic_score_gemma":0.000044584674,"teacher_disagreement_score":0.52737254,"about_ca_system_score_codex":0.00005646398,"about_ca_system_score_gemma":0.0005264548,"threshold_uncertainty_score":0.8371248},"labels":[],"label_agreement":null},{"id":"W2760351616","doi":"10.1016/j.jcss.2023.03.001","title":"The 2CNF Boolean formula satisfiability problem and the linear space hypothesis","year":2023,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Nondeterministic algorithm; Discrete mathematics; Maximum satisfiability problem; True quantified Boolean formula; Linear space; Boolean satisfiability problem; Time complexity; Satisfiability; Space (punctuation); Polynomial; Boolean domain; Combinatorics; NP; Boolean function; Algebra over a field; Algorithm; Computer science; Pure mathematics; Two-element Boolean algebra; Turing machine; Computation","score_opus":0.024400049774708648,"score_gpt":0.2432979119986418,"score_spread":0.21889786222393318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760351616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34328,0.00397986,0.6144635,0.03204465,0.0029771815,0.0007368732,0.0000035836342,0.00019639755,0.0023179278],"genre_scores_gemma":[0.95046335,0.0002047495,0.048892293,0.00009901013,0.00028473343,0.0000031066104,2.3886766e-8,0.0000031197233,0.000049609498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824023,0.00031339997,0.00044073287,0.00020943343,0.000548207,0.0002479953],"domain_scores_gemma":[0.99742097,0.0018253594,0.00029626954,0.000246446,0.00012049214,0.000090490976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00609504,0.00011328028,0.00025599665,0.0001162539,0.0011925173,0.000811191,0.0011356403,0.000026668358,3.4166553e-7],"category_scores_gemma":[0.00004613228,0.000049864946,0.00010453613,0.0006815149,0.0007745577,0.00044446034,0.00039883878,0.00015012901,0.0000024621859],"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.00003125995,0.00002141534,0.003281841,0.000113009104,0.00006475645,0.00002436047,0.0042728377,0.00063773885,0.000011198081,0.6631645,0.0019410715,0.32643598],"study_design_scores_gemma":[0.00084648427,0.0003567013,0.016825115,0.00020119635,0.000016560085,0.0007703126,0.0010604215,0.8880677,0.000039952363,0.088439986,0.0032009198,0.0001746459],"about_ca_topic_score_codex":0.000017954542,"about_ca_topic_score_gemma":0.000009032452,"teacher_disagreement_score":0.88742995,"about_ca_system_score_codex":0.000013333634,"about_ca_system_score_gemma":0.00007300213,"threshold_uncertainty_score":0.91719997},"labels":[],"label_agreement":null},{"id":"W2766828223","doi":"10.1007/s00493-019-3897-3","title":"The Satisfiability Threshold For Random Linear Equations","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Satisfiability; Random matrix; Combinatorics; Discrete mathematics; Matrix (chemical analysis); Field (mathematics); Zero (linguistics); Multivariate random variable; Combinatorial proof; Random variable; Pure mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.06303154819406136,"score_gpt":0.3012957554934848,"score_spread":0.23826420729942344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766828223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017801044,0.0010140428,0.97559285,0.015529537,0.004457904,0.001376108,0.00004108061,0.00039235433,0.0014181216],"genre_scores_gemma":[0.93078977,0.00024127259,0.06624688,0.0005883806,0.0005273826,0.0012158136,0.000056205008,0.00004296567,0.00029130906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780864,0.0001303578,0.00047906165,0.0007919733,0.0004122537,0.00037774805],"domain_scores_gemma":[0.995222,0.0023000578,0.00023594801,0.0018066396,0.00027979587,0.00015560762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072758,0.00028825548,0.00040916502,0.000054692,0.0008930069,0.00046587831,0.0031902336,0.00018297904,0.000004919265],"category_scores_gemma":[0.0008780862,0.00022591936,0.0004203344,0.00041630527,0.00016140868,0.000109314205,0.002726251,0.0007431515,0.000022805783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017786264,0.00008423724,0.000051536117,0.00006501989,0.000059702455,0.0000016940633,0.00026855824,0.00017696043,0.0000043674204,0.9801197,0.005759022,0.013391434],"study_design_scores_gemma":[0.0005994058,0.000068685666,0.000104248225,0.000017014469,0.000016396818,4.977209e-7,0.000006117396,0.28757146,0.00004908947,0.68259084,0.028776934,0.0001992763],"about_ca_topic_score_codex":0.000020133426,"about_ca_topic_score_gemma":0.0000057194707,"teacher_disagreement_score":0.9306118,"about_ca_system_score_codex":0.00011414914,"about_ca_system_score_gemma":0.0003011891,"threshold_uncertainty_score":0.9212724},"labels":[],"label_agreement":null},{"id":"W2768340386","doi":"10.4230/lipics.itcs.2018.41","title":"Graph Clustering using Effective Resistance","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Connection (principal bundle); Conductance; Mathematics; Graph; Inverse; Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.10107644088329495,"score_gpt":0.21607731011774256,"score_spread":0.1150008692344476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768340386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06658018,0.0001752921,0.9262638,0.000049254453,0.0014855969,0.0003789618,0.000016941292,0.00027772525,0.004772217],"genre_scores_gemma":[0.97975844,0.00009761173,0.018913426,0.00004052593,0.00012742261,0.0000013402096,0.0000039131355,0.000019468416,0.0010378514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977324,0.00017464659,0.00017718635,0.0013519585,0.00012102367,0.0004427846],"domain_scores_gemma":[0.99676484,0.00013136776,0.00039873007,0.0023867537,0.00015854216,0.00015976693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032836766,0.00037568712,0.00041625762,0.00034842387,0.00074785866,0.0004001239,0.0035348893,0.0002655349,0.000008112649],"category_scores_gemma":[0.000045575653,0.0004668281,0.00034752142,0.00038697626,0.00027318433,0.00059224805,0.0046478454,0.0007388649,0.000020090625],"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.00012970314,0.00023008292,0.0024570676,0.0006823187,0.00053212687,0.0025004551,0.001092421,0.39805868,0.00015143954,0.58642995,0.00041999703,0.0073157228],"study_design_scores_gemma":[0.00038708234,0.000023146673,0.0015524357,0.00040662067,0.000054723514,0.000007570035,0.000020318952,0.69986916,0.00010681015,0.2963432,0.0006093689,0.00061957526],"about_ca_topic_score_codex":0.00023095752,"about_ca_topic_score_gemma":0.000295311,"teacher_disagreement_score":0.91317827,"about_ca_system_score_codex":0.00022305654,"about_ca_system_score_gemma":0.00013239507,"threshold_uncertainty_score":0.99977833},"labels":[],"label_agreement":null},{"id":"W2777560552","doi":"10.1137/1.9781611975031.53","title":"Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":34,"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; Mathematics; Approximation algorithm; Tree (set theory); Bundle; Combinatorics; Set (abstract data type); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.06393553489565193,"score_gpt":0.24732857111222792,"score_spread":0.183393036216576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777560552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002527458,0.00007603497,0.57429063,0.00009683082,0.000558222,0.0024861982,0.00009371306,0.00040170128,0.42174393],"genre_scores_gemma":[0.00029718466,0.000023289014,0.84891826,0.00031002203,0.0023222824,0.00033025444,0.00013917281,0.00013960607,0.14751995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768054,0.0000058335067,0.0007634539,0.00068435946,0.00046098742,0.0004048461],"domain_scores_gemma":[0.99823296,0.00027822828,0.00069317664,0.0005513775,0.00010019278,0.0001440542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005819257,0.0005356785,0.0006678784,0.000082547755,0.0005637747,0.0002786807,0.0006507331,0.0007383644,0.00003759318],"category_scores_gemma":[0.000009507971,0.0005069984,0.0005518908,0.000044968532,0.00035451842,0.00008836967,0.00044289674,0.0005232021,0.0000185201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001109763,0.00003573211,4.0875115e-8,0.00027656154,0.0002686631,6.093522e-7,0.003938602,3.1102797e-7,0.0002843028,0.835616,0.007536931,0.15203117],"study_design_scores_gemma":[0.0014972235,0.00013109938,5.3527508e-8,0.00022391306,0.00014147327,0.000012421016,0.00017352717,0.01600534,0.0013389946,0.9520742,0.02775749,0.00064425595],"about_ca_topic_score_codex":0.0000015836473,"about_ca_topic_score_gemma":0.0000021712867,"teacher_disagreement_score":0.27462763,"about_ca_system_score_codex":0.00007300894,"about_ca_system_score_gemma":0.00010732131,"threshold_uncertainty_score":0.99973816},"labels":[],"label_agreement":null},{"id":"W2784736141","doi":"10.1145/3170711","title":"Randomized Communication versus Partition Number","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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":"National Science Foundation","keywords":"Mathematics; Communication complexity; Partition (number theory); Combinatorics; Randomized algorithm; Upper and lower bounds; Discrete mathematics; Clique; Set (abstract data type); Computer science","score_opus":0.040741930199470346,"score_gpt":0.3162857808016349,"score_spread":0.2755438506021645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034321924,0.000024822353,0.9875635,0.0012433182,0.0010620748,0.00027026434,0.000003912172,0.00040845858,0.0059914663],"genre_scores_gemma":[0.8482421,0.000029779414,0.1510001,0.00038606065,0.00006243955,0.000064144624,0.000011762763,0.000010602039,0.00019302547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810797,0.0008281649,0.00031128756,0.0003048519,0.0002593797,0.00018837069],"domain_scores_gemma":[0.996501,0.0022150322,0.00011954943,0.00088557287,0.00020908422,0.000069731424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743338,0.00014984893,0.00021394744,0.00014296753,0.0006245504,0.00014866238,0.00082175626,0.00006828317,0.0003203564],"category_scores_gemma":[0.0001125941,0.00014731009,0.00016785823,0.0005150653,0.00041401986,0.00050543476,0.000027547569,0.00019691243,0.00067248434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076976875,0.00021853205,0.0000012248263,0.000005936142,0.00011138665,0.0000010103488,0.0014746026,0.0017723641,0.0000133520225,0.64012706,0.0002013864,0.34837547],"study_design_scores_gemma":[0.03767036,0.00012154749,0.000042304477,0.000029604134,0.000036799076,0.000009349107,0.000077512705,0.109388836,0.0012569958,0.8503853,0.00075663056,0.0002247409],"about_ca_topic_score_codex":0.000015809961,"about_ca_topic_score_gemma":0.000013414158,"teacher_disagreement_score":0.8448099,"about_ca_system_score_codex":0.000046669968,"about_ca_system_score_gemma":0.000036576366,"threshold_uncertainty_score":0.864365},"labels":[],"label_agreement":null},{"id":"W2787163834","doi":"10.1137/17m1136869","title":"Structure of Protocols for XOR Functions","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"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; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Boolean function; Combinatorics; Mathematics; Parity (physics); Function (biology); Discrete mathematics; Communication complexity; Binary entropy function; Reduction (mathematics); Entropy (arrow of time); Time complexity; Parity function; Computational complexity theory; Algorithm; Boolean expression; Physics; Principle of maximum entropy; Biology; Genetics; Statistics","score_opus":0.039394675873595596,"score_gpt":0.3277555133152117,"score_spread":0.2883608374416161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787163834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01727757,0.000011156626,0.97908,0.00039440123,0.0011313393,0.0014942824,0.000006594305,0.000055923785,0.00054869906],"genre_scores_gemma":[0.757471,3.059781e-7,0.24069856,0.00025677166,0.0014919167,0.000019253188,6.4230824e-7,0.000009319018,0.00005218533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988948,0.000052428575,0.00034135292,0.00020026955,0.00025395234,0.00025716398],"domain_scores_gemma":[0.99881166,0.00018644003,0.00029008204,0.00028142586,0.0003435573,0.00008682823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033144403,0.00011284475,0.00017596372,0.00016005493,0.00055218505,0.00015795266,0.0007030151,0.000044357013,0.000025889001],"category_scores_gemma":[0.00008294788,0.0000938976,0.00013601212,0.00034640558,0.00008124538,0.00017079676,0.0001315476,0.0002508145,0.0000059185077],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988369,0.00034130368,0.0007957769,0.00012623184,0.00016107135,0.000014419463,0.0019011599,0.0024590627,0.010238765,0.21192159,0.012677979,0.75923276],"study_design_scores_gemma":[0.0035026544,0.006471359,0.006191139,0.0011368183,0.000025861878,0.0009185168,0.00015714037,0.62659526,0.041431736,0.2076504,0.10510662,0.00081248424],"about_ca_topic_score_codex":0.0000010273761,"about_ca_topic_score_gemma":0.0000017154423,"teacher_disagreement_score":0.7584203,"about_ca_system_score_codex":0.000025630163,"about_ca_system_score_gemma":0.000082642604,"threshold_uncertainty_score":0.4247017},"labels":[],"label_agreement":null},{"id":"W2795727769","doi":"10.1007/s11590-018-1254-x","title":"Experiments on virtual private network design with concave capacity costs","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computational intelligence; Upper and lower bounds; Mathematical optimization; Regular polygon; Computer science; Network planning and design; Mathematics; Artificial intelligence; Computer network; Geometry","score_opus":0.03205164889556149,"score_gpt":0.2358185531798449,"score_spread":0.2037669042842834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795727769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006564764,0.0000033046117,0.99092495,0.0010726702,0.00047006708,0.00022496755,0.0000011805516,0.00016213272,0.00057596737],"genre_scores_gemma":[0.14423172,0.0000026831972,0.84676284,0.008661352,0.00026674994,0.000021758982,0.0000052463015,0.000014503555,0.000033152883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876523,0.00013138172,0.00015046574,0.00037107072,0.0002868864,0.0002949764],"domain_scores_gemma":[0.99923974,0.00008508577,0.00009822724,0.00042095152,0.00007138148,0.000084619845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017463717,0.00015922995,0.00012442374,0.000069465066,0.0003077207,0.00017743686,0.00048295953,0.000039674036,0.000050505798],"category_scores_gemma":[0.000013770125,0.00014135936,0.000028434079,0.00044171332,0.0002074114,0.00036000178,0.00008997361,0.000100548285,0.000040944225],"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.00004368195,0.000048316924,0.00007982579,0.00000108993,0.00002980364,0.000010061478,0.0004758682,0.9648818,0.00029965874,0.026581015,0.00537092,0.0021779865],"study_design_scores_gemma":[0.00070542,0.0006093776,0.000119724566,0.0000507749,0.0000052360333,0.000010627206,0.000009719539,0.990131,0.0066873026,0.00017902126,0.0011823807,0.00030937462],"about_ca_topic_score_codex":0.0000064035466,"about_ca_topic_score_gemma":8.531132e-7,"teacher_disagreement_score":0.1441621,"about_ca_system_score_codex":0.000075810225,"about_ca_system_score_gemma":0.00001901288,"threshold_uncertainty_score":0.5764468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13563283,0.000103845254,0.8566619,0.000106782674,0.004333982,0.0017801241,0.00063888374,0.0002519781,0.000489647],"genre_scores_gemma":[0.45259362,0.000056788354,0.5455556,0.00037396248,0.00042450122,0.00037003064,0.00048260597,0.000084305866,0.000058594193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961085,0.00004276357,0.0017641446,0.0006880589,0.0005626291,0.0008339088],"domain_scores_gemma":[0.995544,0.0004944075,0.0012764453,0.0013252714,0.0011596744,0.00020020596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012714257,0.00067463267,0.00093864574,0.00066036097,0.0006836349,0.00079949124,0.001741522,0.0005222992,0.000005252267],"category_scores_gemma":[0.00022180151,0.0006592574,0.00047151605,0.0005524405,0.00038370528,0.0010998987,0.002185241,0.0006796125,0.000004383841],"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.0020022443,0.0040933476,0.025583103,0.05370251,0.004200562,0.000024880383,0.060607858,0.008588837,0.0014906843,0.16024771,0.0061861,0.67327213],"study_design_scores_gemma":[0.0026781613,0.0009317487,0.0015001531,0.0017662323,0.00014425887,0.0001233704,0.00028147842,0.8492724,0.0013507257,0.13079484,0.009797125,0.001359519],"about_ca_topic_score_codex":0.00010237781,"about_ca_topic_score_gemma":0.0000328589,"teacher_disagreement_score":0.8406836,"about_ca_system_score_codex":0.00011312566,"about_ca_system_score_gemma":0.00018033723,"threshold_uncertainty_score":0.99958587},"labels":[],"label_agreement":null},{"id":"W2798465526","doi":"10.1098/rspa.2018.0283","title":"The idemetric property: when most distances are (almost) the same","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","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":"Chinese Academy of Sciences; National Natural Science Foundation of China; Royal Society","keywords":"Property (philosophy); Mathematical proof; Modulo; Range (aeronautics); Routing (electronic design automation); Graph; Contrast (vision); Network topology","score_opus":0.011395338912771712,"score_gpt":0.2034069168962521,"score_spread":0.19201157798348037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798465526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95905954,0.0008450328,0.013968159,0.020080853,0.0004598296,0.0008329026,0.0000046140235,0.00022568686,0.004523375],"genre_scores_gemma":[0.9915237,0.000016055348,0.00765292,0.00013048157,0.00008712286,0.000021716653,2.8228245e-8,0.000006133091,0.0005618794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861294,0.0000063917814,0.00018829362,0.00028093407,0.00059300597,0.0003184555],"domain_scores_gemma":[0.9990478,0.0005328327,0.00011870355,0.00016974827,0.00007524682,0.00005564685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710282,0.0001523566,0.00020851383,0.000013162897,0.0006222763,0.00042778742,0.001842213,0.000029792422,0.0000021832989],"category_scores_gemma":[0.00021541462,0.00005415179,0.00018064861,0.00085190625,0.00067857705,0.0002821295,0.00064699183,0.00023121224,0.000004738101],"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.0000027023943,0.000116474126,0.00068072206,0.00036229857,0.000054130414,8.676613e-8,0.004250118,0.0007564174,0.0006206781,0.98678476,0.0015909476,0.004780685],"study_design_scores_gemma":[0.00006682,0.000056460845,0.0015846959,0.00012404252,0.000010691781,0.0000027669848,0.0005934922,0.7976963,0.0003724915,0.19836265,0.0009986068,0.00013101312],"about_ca_topic_score_codex":0.000008514964,"about_ca_topic_score_gemma":2.1920309e-7,"teacher_disagreement_score":0.79693985,"about_ca_system_score_codex":0.000014057313,"about_ca_system_score_gemma":0.000017259505,"threshold_uncertainty_score":0.4786109},"labels":[],"label_agreement":null},{"id":"W2802356468","doi":"10.1007/s00453-018-0444-3","title":"Impact of Knowledge on Election Time in Anonymous Networks","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Conseil Régional de Picardie; Université du Québec en Outaouais","keywords":"Leader election; Node (physics); Task (project management); Computer science; Computer network; Time complexity; Simple (philosophy); Port (circuit theory); A priori and a posteriori; Algorithm; Engineering","score_opus":0.011490235596683492,"score_gpt":0.28018300704392,"score_spread":0.2686927714472365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802356468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2990163,0.0002792735,0.67436886,0.00022187774,0.0014645715,0.0004850719,0.000010368368,0.00038770292,0.023765977],"genre_scores_gemma":[0.98318636,0.00000846523,0.016064567,0.00004539436,0.0003942181,0.000007233938,0.0000033619906,0.000011592376,0.00027879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.00008479786,0.00024429124,0.0003415268,0.00014556262,0.00033742024],"domain_scores_gemma":[0.99913204,0.00012365832,0.00008144228,0.00047787034,0.00011417014,0.00007084201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024709973,0.0001509182,0.00021396855,0.00028277168,0.0000824557,0.000037599948,0.0006091321,0.00008683351,0.00007118021],"category_scores_gemma":[0.000024775272,0.00013571049,0.00012811087,0.0011645273,0.00012207394,0.0001906263,0.00014501862,0.00019043869,0.00015974416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000615322,0.0009473113,0.0012918606,0.000007821437,0.00007613297,0.00001663254,0.00082929677,0.00056187913,0.0010851097,0.010663201,0.006286031,0.9781732],"study_design_scores_gemma":[0.00047330387,0.001634421,0.035872787,0.000043001197,0.0000037341622,0.000022108981,0.0000020670548,0.95295817,0.0020160235,0.006086623,0.00065749383,0.00023026184],"about_ca_topic_score_codex":0.00013155653,"about_ca_topic_score_gemma":0.000029244888,"teacher_disagreement_score":0.97794294,"about_ca_system_score_codex":0.00009199166,"about_ca_system_score_gemma":0.00008674317,"threshold_uncertainty_score":0.5534113},"labels":[],"label_agreement":null},{"id":"W2806170931","doi":"10.1109/focs.2018.00090","title":"The Diameter of the Fractional Matching Polytope and Its Hardness Implications","year":2018,"lang":"en","type":"preprint","venue":"","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; Polytope; Mathematics; Birkhoff polytope; Matching (statistics); Path (computing); Graph; Shortest path problem; Uniform k 21 polytope; Discrete mathematics; Geometry; Computer science; Regular polygon","score_opus":0.03782070556246582,"score_gpt":0.2833110165183674,"score_spread":0.24549031095590157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806170931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011512446,0.0004242911,0.9645655,0.015569619,0.0026260563,0.0003637304,0.000037938073,0.000076915996,0.0048234956],"genre_scores_gemma":[0.9313638,0.00020517853,0.06481059,0.0008987532,0.00038742955,0.000100731646,0.000003826577,0.00001556035,0.0022140837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990496,0.00007353313,0.00020971376,0.000314454,0.00021298653,0.00013968059],"domain_scores_gemma":[0.99843365,0.00028171914,0.00016894739,0.0009373372,0.00014305877,0.00003529345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030159083,0.00011913588,0.00011946452,0.00003823039,0.0005248797,0.0002528009,0.0017153783,0.000074071366,0.00002165256],"category_scores_gemma":[0.00003929699,0.00006457644,0.00010887347,0.0001489559,0.00016464647,0.000120499484,0.0023795273,0.00031717343,0.0000063537627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023553368,0.0000501522,0.0007668316,0.0000379957,0.00008510491,1.6766295e-7,0.00061720243,0.00004834463,0.00028539836,0.96867466,0.002957974,0.026473792],"study_design_scores_gemma":[0.00008297278,0.000013640444,0.11768583,0.000074147174,0.000015358852,0.00002116835,0.000031271775,0.021043545,0.0015519804,0.85029066,0.008969152,0.000220256],"about_ca_topic_score_codex":0.000072355375,"about_ca_topic_score_gemma":0.000039496856,"teacher_disagreement_score":0.9198514,"about_ca_system_score_codex":0.000013948283,"about_ca_system_score_gemma":0.000095017764,"threshold_uncertainty_score":0.40370035},"labels":[],"label_agreement":null},{"id":"W2810907219","doi":"","title":"The Distributed Minimum Spanning Tree Problem","year":2018,"lang":"en","type":"article","venue":"Research Padua  Archive (University of Padua)","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Distributed minimum spanning tree; Minimum spanning tree; Spanning tree; Computer science; Distributed algorithm; Message passing; Node (physics); Graph; Kruskal's algorithm; Prim's algorithm; Distributed computing; Theoretical computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.058349961650733986,"score_gpt":0.2970416321890664,"score_spread":0.2386916705383324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810907219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074425195,0.00007643209,0.96975565,0.0067332154,0.00013270647,0.0003772102,0.000064349675,0.00011623519,0.015301669],"genre_scores_gemma":[0.61223346,0.00033268522,0.38408574,0.000056897257,0.00033339768,0.0000040674554,0.000045784833,0.000025560137,0.0028824236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969621,0.00063166616,0.00015500726,0.000502583,0.00095244916,0.0007962404],"domain_scores_gemma":[0.9969482,0.0012866614,0.000104030885,0.00090969575,0.0005169899,0.0002344488],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016777033,0.00014019325,0.00019600049,0.00030759678,0.0023620503,0.00014311924,0.0029531207,0.000052272342,0.000031297554],"category_scores_gemma":[0.00016856333,0.00012940484,0.00015344782,0.0013116004,0.0024001764,0.0003935642,0.002099166,0.0005185927,0.00012460892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000327164,0.0004803247,0.0020706244,0.000119846634,0.00030796367,0.00027063754,0.01658089,0.000022908338,0.02433913,0.46296495,0.109363504,0.38315207],"study_design_scores_gemma":[0.0014621918,0.0014765507,0.032724775,0.00023848625,0.000016401571,0.000029117646,0.005183976,0.3327685,0.0011080274,0.4057027,0.21876456,0.0005247084],"about_ca_topic_score_codex":0.00035406055,"about_ca_topic_score_gemma":0.00088795926,"teacher_disagreement_score":0.6047909,"about_ca_system_score_codex":0.000057282043,"about_ca_system_score_gemma":0.0002153889,"threshold_uncertainty_score":0.9989367},"labels":[],"label_agreement":null},{"id":"W2886010892","doi":"10.1137/20m1356968","title":"When Do Gomory--Hu Subtrees Exist?","year":2022,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","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; Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.04253123021233643,"score_gpt":0.29356755749711866,"score_spread":0.2510363272847822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886010892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01329498,0.003268701,0.8444574,0.00809954,0.01098092,0.0012441707,0.00024610336,0.00082204194,0.11758613],"genre_scores_gemma":[0.064637534,0.001199714,0.92555815,0.0011126554,0.0016937961,0.00013749066,0.000049916416,0.00021009032,0.0054006376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542314,0.0003006449,0.0011059527,0.0007539184,0.0017390923,0.00067727896],"domain_scores_gemma":[0.9958203,0.00039919376,0.0011376705,0.002118766,0.00016090843,0.00036316508],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001595028,0.00065299415,0.0008581247,0.00051466405,0.00075712363,0.001859976,0.0052043446,0.00022982172,0.00096719747],"category_scores_gemma":[0.00018034721,0.00056349346,0.0008029965,0.0003336819,0.00015226238,0.00031708693,0.0045652976,0.0033666615,0.00010296193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002417841,0.0007563367,0.00006735913,0.00071160163,0.00046595637,0.0008911255,0.0115849525,0.0027983037,0.000017335746,0.9450064,0.020055002,0.0176215],"study_design_scores_gemma":[0.0003297257,0.00026070434,0.00007607451,0.0006617821,0.00005322397,0.0004723848,0.00040737944,0.0201058,0.00004863728,0.95483994,0.021993076,0.0007512707],"about_ca_topic_score_codex":0.0000068867366,"about_ca_topic_score_gemma":0.0000037745453,"teacher_disagreement_score":0.112185486,"about_ca_system_score_codex":0.0002822396,"about_ca_system_score_gemma":0.00030351395,"threshold_uncertainty_score":0.99994606},"labels":[],"label_agreement":null},{"id":"W2888136048","doi":"10.1145/3233547.3233717","title":"Choosing Non-redundant Representative Subsets Of Protein Sequence Data Sets Using Submodular Optimization","year":2018,"lang":"en","type":"article","venue":"","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":"","keywords":"Submodular set function; Computer science; Optimization problem; Disjoint sets; Selection (genetic algorithm); Data mining; Sequence (biology); Redundancy (engineering); Preprocessor; Set (abstract data type); Mathematics; Algorithm; Mathematical optimization; Artificial intelligence; Biology; Combinatorics","score_opus":0.16087800647083061,"score_gpt":0.368667685748764,"score_spread":0.2077896792779334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888136048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06046285,0.00002856643,0.9382657,0.00015161883,0.00019937013,0.00031863392,0.000020507849,0.00007835177,0.0004743965],"genre_scores_gemma":[0.38770232,0.0000032375253,0.6121582,0.00003862607,0.000046483998,0.0000025551255,0.000016938411,0.0000063905486,0.000025264255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983254,0.000096128504,0.00031920374,0.0006316182,0.0003612788,0.0002663342],"domain_scores_gemma":[0.9978323,0.000040034338,0.00019088804,0.0015973231,0.00026556602,0.00007391793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047737494,0.00014112187,0.0001851542,0.00013494698,0.00022297913,0.00014007324,0.0016994452,0.000046940477,0.000048723698],"category_scores_gemma":[0.00008878702,0.00013351483,0.00003612604,0.0007726391,0.00031116206,0.0014568035,0.0011732943,0.00009669942,0.000005485273],"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.0001806077,0.0015060415,0.00463945,0.0005041739,0.00059160194,0.00024989588,0.01882728,0.11781035,0.58645475,0.10552359,0.002339088,0.16137318],"study_design_scores_gemma":[0.00017748914,0.00005337647,0.0002209003,0.000080257676,0.0000056942226,0.000019584246,0.00004388727,0.93706334,0.060063172,0.0020714132,0.00004228015,0.00015860391],"about_ca_topic_score_codex":0.00053692015,"about_ca_topic_score_gemma":0.000021668448,"teacher_disagreement_score":0.81925297,"about_ca_system_score_codex":0.000034201857,"about_ca_system_score_gemma":0.00012819326,"threshold_uncertainty_score":0.5444576},"labels":[],"label_agreement":null},{"id":"W2889518945","doi":"10.1016/j.tcs.2018.08.024","title":"Constant query time (1 + ϵ)-approximate distance oracle for planar graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Oracle; Combinatorics; Mathematics; Binary logarithm; Time complexity; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.013018652046001375,"score_gpt":0.2536365564653466,"score_spread":0.24061790441934522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889518945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036732478,0.00003741164,0.9885337,0.0009652131,0.0009758021,0.00036856605,0.000022837974,0.00042041397,0.0050028586],"genre_scores_gemma":[0.5310331,0.0000029343294,0.46801943,0.000703985,0.0001855825,0.000017807473,0.0000019122485,0.000010382834,0.000024874995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968112,0.000085029125,0.00037455268,0.0010910133,0.0006904206,0.00094778906],"domain_scores_gemma":[0.9974822,0.00045596436,0.00010743561,0.001194164,0.0004113252,0.00034890813],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017572746,0.00026850842,0.000313082,0.00023747436,0.0010960285,0.00064871507,0.0035551016,0.00006371033,0.000058230085],"category_scores_gemma":[0.00010068353,0.00022645062,0.00012973382,0.0016361689,0.008890465,0.00080073107,0.0007495952,0.00017069734,0.00014817408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022006358,0.00006922549,0.000015604195,0.000009610569,0.0000059631507,0.000006925259,0.00025238332,0.000003226289,0.000518914,0.97246706,0.00035675507,0.026272329],"study_design_scores_gemma":[0.00021047598,0.00031448004,0.000059733848,0.000028353494,0.0000033666804,0.000029279683,0.0000031426391,0.45969355,0.0026987998,0.53573203,0.0009943877,0.00023240696],"about_ca_topic_score_codex":0.0000026754335,"about_ca_topic_score_gemma":0.000001409039,"teacher_disagreement_score":0.52735984,"about_ca_system_score_codex":0.000052603988,"about_ca_system_score_gemma":0.00016714224,"threshold_uncertainty_score":0.9938068},"labels":[],"label_agreement":null},{"id":"W2897123632","doi":"10.5555/3310435.3310596","title":"Short cycles via low-diameter decompositions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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":"University of Waterloo; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Graph; Running time; Undirected graph; Time complexity; Disjoint sets; Discrete mathematics; Algorithm","score_opus":0.010860816644116018,"score_gpt":0.2537178479733224,"score_spread":0.2428570313292064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897123632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060606416,0.00019102068,0.89524,0.004101301,0.0040640365,0.0011082395,0.000087836954,0.0011020497,0.03349911],"genre_scores_gemma":[0.8753535,0.000072270304,0.12133492,0.0015241527,0.00039937985,0.00010085676,0.00006472339,0.00006753979,0.0010826704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692327,0.00013046131,0.00046466343,0.0010537677,0.00068475923,0.0007430689],"domain_scores_gemma":[0.9976774,0.0002152749,0.00009230297,0.0016262288,0.00010005613,0.00028877027],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028839483,0.0004355467,0.0004160237,0.00034059284,0.00030948396,0.00038631188,0.0017265114,0.00015073323,0.00013834103],"category_scores_gemma":[0.0000071271456,0.00040133976,0.00036515406,0.0006933651,0.00013654598,0.000804148,0.00051735784,0.0004042529,0.0012901463],"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.00018757403,0.0029202634,0.007832928,0.00036669677,0.0010759874,0.00048607128,0.0037523874,0.0086419275,0.09931277,0.34721696,0.0083130635,0.51989335],"study_design_scores_gemma":[0.0023906056,0.001970044,0.024824418,0.00048847287,0.00009128029,0.00032340764,0.0001309589,0.8389057,0.057185847,0.054455154,0.015611079,0.0036230537],"about_ca_topic_score_codex":0.000033793753,"about_ca_topic_score_gemma":0.0000056227004,"teacher_disagreement_score":0.83026373,"about_ca_system_score_codex":0.0000889564,"about_ca_system_score_gemma":0.000046867164,"threshold_uncertainty_score":0.99984384},"labels":[],"label_agreement":null},{"id":"W2897485334","doi":"10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Deterministic algorithm; Submodular set function; Monotone polygon; Binary logarithm; Matching (statistics); Combinatorics; Approximation algorithm; Simple (philosophy); Online algorithm; Discrete mathematics; Greedy algorithm; Algorithm; Graph","score_opus":0.02794348708303992,"score_gpt":0.290670138379534,"score_spread":0.2627266512964941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897485334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22634995,0.00000528246,0.7722778,0.0007100421,0.00036606207,0.00014094975,0.000009292081,0.000039554965,0.000101086196],"genre_scores_gemma":[0.7328291,8.8365624e-7,0.26635283,0.0007456337,0.00005805608,0.0000028229852,2.0339596e-7,0.0000037979596,0.0000066883235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851525,0.00004588771,0.00022221185,0.0004853365,0.00038542022,0.0003458745],"domain_scores_gemma":[0.9983593,0.00048421902,0.00006999472,0.00077539944,0.00018436283,0.00012667196],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006608687,0.00012865454,0.00016179532,0.000101499565,0.00063761947,0.0001464031,0.001742294,0.000030255616,0.0000033557828],"category_scores_gemma":[0.0001298885,0.00008328736,0.00006674298,0.00054504233,0.004611971,0.00019623627,0.0012499585,0.000116181174,0.0000035097505],"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.000007377145,0.000051269242,0.0000065633676,0.000006316211,0.0000015944446,5.1238334e-7,0.0004589111,0.00046385996,0.0005104323,0.9821997,0.000012040095,0.016281374],"study_design_scores_gemma":[0.000080414844,0.00014855253,0.0003981829,0.00003518811,0.000002695215,0.000009280998,0.0000018362522,0.5357492,0.00060102856,0.46290615,0.000005258852,0.00006220143],"about_ca_topic_score_codex":0.0000012882613,"about_ca_topic_score_gemma":0.000002495661,"teacher_disagreement_score":0.53528535,"about_ca_system_score_codex":0.000012925,"about_ca_system_score_gemma":0.00007743221,"threshold_uncertainty_score":0.9980969},"labels":[],"label_agreement":null},{"id":"W2899019281","doi":"10.4230/lipics.itcs.2020.22","title":"Distribution-Free Testing of Linear Functions on ℝⁿ","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Function (biology); Business; Biology; Evolutionary biology","score_opus":0.12103650175288105,"score_gpt":0.20058192696216043,"score_spread":0.07954542520927937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899019281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12499599,0.000013758204,0.8685676,0.00009065358,0.0010139282,0.00015804329,0.00023298177,0.00025351217,0.0046735285],"genre_scores_gemma":[0.9882588,0.000012596812,0.010698341,0.000037443268,0.00019622849,6.500194e-7,0.00005233497,0.000009839114,0.00073379604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985107,0.00008277141,0.00021452842,0.00080386456,0.00012192168,0.000266212],"domain_scores_gemma":[0.99710685,0.0002900216,0.00026407122,0.0018637708,0.00036160558,0.00011370402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022372686,0.00023326429,0.00026183078,0.00018650472,0.0002983607,0.00005002566,0.002294151,0.00018588448,0.00003234611],"category_scores_gemma":[0.00025226374,0.00027090605,0.00020593381,0.0010056533,0.00026159713,0.00017077832,0.0027737378,0.00048629392,0.00007965951],"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.000056901634,0.00064957666,0.00653353,0.00019176005,0.00024663753,0.00016677838,0.00020930542,0.14492288,0.00002986468,0.83352065,0.007826257,0.0056458465],"study_design_scores_gemma":[0.00047366606,0.00026973124,0.005057148,0.00024681527,0.00006220862,0.0000051336833,0.00003132668,0.7848072,0.00028998702,0.20588025,0.0024068505,0.00046965995],"about_ca_topic_score_codex":0.0001528984,"about_ca_topic_score_gemma":0.000021482472,"teacher_disagreement_score":0.8632628,"about_ca_system_score_codex":0.00010677064,"about_ca_system_score_gemma":0.00016515833,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null},{"id":"W2900444034","doi":"10.1145/3431922","title":"Uniform, Integral, and Feasible Proofs for the Determinant Identities","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","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":"National Natural Science Foundation of China","keywords":"Mathematical proof; Mathematics; Axiom; Bounded function; Discrete mathematics; Polynomial; Class (philosophy); Proof complexity; Algebra over a field; Pure mathematics; Computer science","score_opus":0.03872084732340131,"score_gpt":0.27971918533816037,"score_spread":0.24099833801475906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900444034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39622873,0.012022463,0.46266046,0.11931792,0.008488669,0.0005932155,0.000012417261,0.000042123254,0.0006339923],"genre_scores_gemma":[0.69537264,0.001064587,0.2964652,0.0020258273,0.00077599246,0.000012148676,2.3053649e-7,0.000016684082,0.0042667086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994312,0.000037522525,0.00017610822,0.000069572925,0.0001748563,0.00011071762],"domain_scores_gemma":[0.9987018,0.0002884033,0.00015737141,0.0006579488,0.00016574151,0.000028719307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041810502,0.000056523397,0.00010129162,0.000032381406,0.00025760013,0.00026294493,0.002114569,0.000017589275,0.000003971973],"category_scores_gemma":[0.00055856,0.00002654857,0.00013900663,0.00016720554,0.00007291853,0.00030635815,0.0010029539,0.00015026788,4.9327855e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009128705,0.000364184,0.005799604,0.0002387755,0.0004893479,0.00020374006,0.0068674674,0.00023026801,0.003813523,0.2804457,0.08966103,0.61179507],"study_design_scores_gemma":[0.0005727462,0.00018109294,0.0104761375,0.00018161756,0.00005363383,0.0023382045,0.00057511247,0.012683702,0.0138140675,0.9251754,0.03381696,0.00013131334],"about_ca_topic_score_codex":0.0000030808021,"about_ca_topic_score_gemma":0.000018511744,"teacher_disagreement_score":0.64472973,"about_ca_system_score_codex":0.000013960245,"about_ca_system_score_gemma":0.000094507595,"threshold_uncertainty_score":0.39294308},"labels":[],"label_agreement":null},{"id":"W2903710486","doi":"10.1145/3459096","title":"Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":true,"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; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Rounding; Hyperplane; Semidefinite programming; Mathematics; Approximation algorithm; Constraint satisfaction problem; Mathematical optimization; Brownian motion; Constraint (computer-aided design); Computer science; Combinatorics","score_opus":0.03982695069133185,"score_gpt":0.27301035340206586,"score_spread":0.233183402710734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903710486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00257695,0.000087124645,0.99243885,0.0029534528,0.00051985215,0.0007857459,0.00009623519,0.0003254999,0.00021630393],"genre_scores_gemma":[0.7957032,0.000048884936,0.20186962,0.00068843446,0.00006669696,0.0013133038,0.000005902401,0.000022976832,0.00028101477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982536,0.000092527815,0.00027607422,0.00061039795,0.00042821566,0.00033919915],"domain_scores_gemma":[0.9987417,0.00022940528,0.000066306566,0.00068271265,0.00006369554,0.00021617017],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000302062,0.00019298274,0.00017308594,0.00037426403,0.0014947684,0.00019156502,0.0007431643,0.000041923635,0.00016609556],"category_scores_gemma":[0.000017266275,0.00022242144,0.000077571734,0.0010706495,0.00005264797,0.00034413312,0.00009316365,0.00044307156,0.000045802044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051283455,0.00015420506,0.000020546991,0.000016714817,0.000039708902,0.0000050445224,0.00091143325,0.00856865,0.00057742494,0.022107167,0.000036506357,0.9675575],"study_design_scores_gemma":[0.0040646493,0.0033596496,0.011157982,0.00016207634,0.00019659444,0.0018933114,0.0036954528,0.6152342,0.005371873,0.16443466,0.1867664,0.0036631278],"about_ca_topic_score_codex":0.00011435026,"about_ca_topic_score_gemma":0.00005187804,"teacher_disagreement_score":0.96389437,"about_ca_system_score_codex":0.00016078862,"about_ca_system_score_gemma":0.00006670437,"threshold_uncertainty_score":0.99980515},"labels":[],"label_agreement":null},{"id":"W2903949188","doi":"10.1007/s00453-018-0484-8","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation","keywords":"Theory of computation; Generalization; Function (biology); Computational complexity theory; Characterization (materials science); Protocol (science); Information theory; Average-case complexity; Descriptive complexity theory","score_opus":0.027498376083014142,"score_gpt":0.2541167767715941,"score_spread":0.22661840068857997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903949188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49203223,0.00017940502,0.49536455,0.008672953,0.0010012047,0.00086457236,0.000035294095,0.00011592455,0.0017338457],"genre_scores_gemma":[0.9595381,0.0000069193347,0.03917866,0.0011810211,0.00006960561,0.000009738178,0.000002793164,0.000002696019,0.0000104665705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991214,0.000119769466,0.00023486314,0.0001458764,0.0002098027,0.00016824904],"domain_scores_gemma":[0.9992794,0.00010409351,0.00012086194,0.00038575105,0.000080031175,0.000029901548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056334265,0.00010025291,0.000114105234,0.00006701289,0.0002676166,0.00010997992,0.00047420978,0.000036994123,0.0000049390005],"category_scores_gemma":[0.000046290756,0.0000612852,0.000031984473,0.00042808428,0.000607483,0.0006299728,0.00032692953,0.0001604098,0.000004815282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324376,0.00019408298,0.0068091108,0.00007686858,0.000039839277,0.0000012677674,0.022435997,0.000010095871,0.00044405775,0.25328812,0.0022981113,0.7143692],"study_design_scores_gemma":[0.0016375985,0.0002432395,0.31089035,0.000059715294,0.000019203082,0.0000718187,0.00085416285,0.5821041,0.0019472088,0.08279558,0.019096652,0.0002803559],"about_ca_topic_score_codex":0.0001660289,"about_ca_topic_score_gemma":0.00010459537,"teacher_disagreement_score":0.71408886,"about_ca_system_score_codex":0.0000097614975,"about_ca_system_score_gemma":0.000022044736,"threshold_uncertainty_score":0.2499138},"labels":[],"label_agreement":null},{"id":"W2905953446","doi":"10.1007/978-3-030-18126-0_2","title":"A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Partition (number theory); Approximation algorithm; Vertex cover; Partition problem; Combinatorics; Vertex (graph theory); Cover (algebra); Graph partition; Path (computing); Mathematics; Set cover problem; Computer science; Graph; Algorithm; Discrete mathematics; Set (abstract data type)","score_opus":0.026756811572567152,"score_gpt":0.25850266820173423,"score_spread":0.23174585662916708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905953446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043059904,0.00038619878,0.99375093,0.001612132,0.0016412812,0.0015772093,0.000022001555,0.00014380175,0.0008621259],"genre_scores_gemma":[0.008159294,0.00005607931,0.98956597,0.0009863992,0.000548553,0.00007313189,0.000020772,0.000037375263,0.0005524264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599445,0.000050655206,0.0005372618,0.0014763924,0.0011702267,0.00077102974],"domain_scores_gemma":[0.99653876,0.0011839271,0.00024181014,0.0015021152,0.000413434,0.00011995219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017852468,0.00047141334,0.00044193649,0.0005090599,0.00055914634,0.0007552033,0.0035103767,0.00029156066,0.000014650921],"category_scores_gemma":[0.00003376868,0.00035755246,0.00022537085,0.00069410086,0.0009916406,0.0006472945,0.0011681322,0.00080713653,0.000046402572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004130108,0.00002686204,0.0000016870914,0.000052570063,0.000012221735,0.000006452719,0.0005092943,0.020213574,0.00001469558,0.05572501,0.000053598316,0.9233799],"study_design_scores_gemma":[0.0002570904,0.00022097319,0.000015926405,0.00022112697,0.000008592446,0.000034918474,6.177453e-7,0.7740415,0.00035603857,0.22213846,0.0023435666,0.0003612197],"about_ca_topic_score_codex":0.000025396681,"about_ca_topic_score_gemma":0.00003465777,"teacher_disagreement_score":0.9230187,"about_ca_system_score_codex":0.00026464733,"about_ca_system_score_gemma":0.00072988466,"threshold_uncertainty_score":0.99988765},"labels":[],"label_agreement":null},{"id":"W2908273849","doi":"10.1007/s10878-018-00372-z","title":"An improved approximation algorithm for the minimum 3-path partition problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Approximation algorithm; Disjoint sets; Partition (number theory); Partition problem; Vertex cover; Theory of computation; Vertex (graph theory); Set cover problem; Discrete mathematics; Graph; Algorithm; Set (abstract data type); Computer science","score_opus":0.013819542233862584,"score_gpt":0.25850726343418323,"score_spread":0.24468772120032065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908273849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019568797,0.00004136748,0.9936192,0.00057177653,0.005064058,0.0003927434,0.0000030725184,0.000040812116,0.000071281625],"genre_scores_gemma":[0.046177838,0.000025587817,0.9516367,0.00009410567,0.0020136016,0.000021617243,0.000007745248,0.000012004743,0.000010826167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872065,0.00010619064,0.00049525243,0.00016701901,0.0003263915,0.00018452384],"domain_scores_gemma":[0.99769187,0.00015515552,0.0006076342,0.00029602082,0.0011687558,0.000080561236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644589,0.000119938784,0.00017288745,0.000121763645,0.0003725111,0.0003274039,0.0007109864,0.00007939062,0.000008718799],"category_scores_gemma":[0.00007497685,0.00008815218,0.0001121642,0.00040520582,0.00008122086,0.0014160092,0.000047881735,0.00012933672,0.000001161786],"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.0003080864,0.0014747091,0.000027287357,0.00005129258,0.00020545267,0.0000038538265,0.0033805415,0.06476787,0.001675933,0.31362948,0.0033619595,0.61111355],"study_design_scores_gemma":[0.0012647626,0.0014044713,0.000020278207,0.00002034323,0.000026832546,0.000017693836,0.000034510937,0.925954,0.0011939082,0.068853654,0.0011032568,0.00010630755],"about_ca_topic_score_codex":0.0000034462962,"about_ca_topic_score_gemma":3.0802994e-7,"teacher_disagreement_score":0.8611861,"about_ca_system_score_codex":0.000053115513,"about_ca_system_score_gemma":0.00013178361,"threshold_uncertainty_score":0.35947415},"labels":[],"label_agreement":null},{"id":"W2912359042","doi":"10.1145/1806689.1806768","title":"QIP = PSPACE","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"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; Perimeter Institute","funders":"Centre for Quantum Technologies; National Research Foundation Singapore; National Science Foundation","keywords":"PSPACE; Mathematics; Multiplicative function; Class (philosophy); Mathematical proof; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm","score_opus":0.00786021869120312,"score_gpt":0.2268176467357108,"score_spread":0.21895742804450768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912359042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014980557,0.000007854725,0.86925423,0.003517705,0.001193527,0.00003959462,2.7874398e-7,0.00034523552,0.11066099],"genre_scores_gemma":[0.4976727,0.000001418768,0.49841154,0.00069093966,0.00010317375,0.0000027214573,2.2095318e-7,0.0000026170153,0.003114656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995616,0.0000065105396,0.00005179014,0.00015123781,0.00010271768,0.00012615057],"domain_scores_gemma":[0.99945307,0.00003464219,0.000011854358,0.00042202426,0.000022962317,0.00005545682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009766872,0.0000463413,0.000043192365,0.000037781927,0.00007089319,0.00009337898,0.000640346,0.000025226735,0.00019255863],"category_scores_gemma":[0.000014627535,0.00003857276,0.000031859265,0.00019148315,0.00003392793,0.00019463769,0.00017358905,0.00013870043,0.00020849897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.3912937e-7,0.000014192693,0.00014243044,6.072922e-7,0.0000013189594,0.000002304101,0.00006415937,5.24559e-7,0.0015773935,0.954803,0.002943323,0.040450618],"study_design_scores_gemma":[0.00030384274,0.00005818312,0.009021865,0.000003408451,0.0000018320768,0.00007423072,0.00002116667,0.108097464,0.016168615,0.4361458,0.42972773,0.00037581692],"about_ca_topic_score_codex":0.000024309735,"about_ca_topic_score_gemma":0.000066916844,"teacher_disagreement_score":0.51865715,"about_ca_system_score_codex":0.0000015671851,"about_ca_system_score_gemma":0.00001465253,"threshold_uncertainty_score":0.2679902},"labels":[],"label_agreement":null},{"id":"W2912789966","doi":"10.48550/arxiv.1902.02459","title":"On Mean Estimation for General Norms with Statistical Queries","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Normed vector space; Distribution (mathematics); Combinatorics; Oracle; Norm (philosophy); Mathematics; Space (punctuation); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.061229172841652656,"score_gpt":0.20077742118817232,"score_spread":0.13954824834651966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912789966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073588386,0.0000052936666,0.9243467,0.000076211574,0.00045450608,0.0004151766,0.00008504989,0.00015805876,0.0008706363],"genre_scores_gemma":[0.84283084,0.000008995662,0.15599522,0.00010518581,0.00005046221,0.000002817237,0.00007761275,0.000014902516,0.00091396784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985408,0.000053728694,0.00013470612,0.0008717276,0.000113480826,0.0002855558],"domain_scores_gemma":[0.9984891,0.00025707504,0.00014575507,0.0008748622,0.00012998658,0.00010321946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000139005,0.0002622847,0.0002792057,0.00018298687,0.00016599555,0.00015299949,0.0009957448,0.00014322448,0.00001732035],"category_scores_gemma":[0.000025232723,0.00024954492,0.00010608023,0.0002393224,0.00014144873,0.00025903332,0.0005804294,0.00032478693,0.000038470444],"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.00005639669,0.000046419747,0.000114445946,0.00005781067,0.000037334903,0.000028611916,0.00010054978,0.27700877,9.735181e-7,0.72103596,0.00022169198,0.0012910349],"study_design_scores_gemma":[0.00035750293,0.00021681012,0.0005060439,0.00005033246,0.000023920953,0.0000023180867,0.000011392946,0.68579173,0.000033281834,0.31259087,0.00015832706,0.00025748406],"about_ca_topic_score_codex":0.00009375236,"about_ca_topic_score_gemma":0.00006962137,"teacher_disagreement_score":0.76924247,"about_ca_system_score_codex":0.00011517747,"about_ca_system_score_gemma":0.0001703553,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2914551285","doi":"10.1007/978-3-642-33090-2_64","title":"Succinct Posets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Reachability; Transitive closure; Combinatorics; Transitive reduction; Mathematics; Oracle; Data structure; Transitive relation; Discrete mathematics; Directed graph; Graph; Computer science; Line graph; Voltage graph","score_opus":0.02168753748394431,"score_gpt":0.24535246687479478,"score_spread":0.22366492939085048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914551285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003609065,0.0016948887,0.9843715,0.00081815314,0.003552574,0.00030378095,0.0000073699994,0.00028237145,0.008933296],"genre_scores_gemma":[0.13083872,0.00017431466,0.8632104,0.002957587,0.0018428084,0.000012296942,0.000011064438,0.00007196718,0.0008808322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955563,0.000038644655,0.00054190273,0.0015584613,0.0012239363,0.0010807383],"domain_scores_gemma":[0.9966611,0.00045932352,0.00026492725,0.0020822997,0.00020578103,0.0003265591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010542087,0.0006480042,0.00059961807,0.0010615421,0.0003827835,0.0005980547,0.005254863,0.00036310015,0.000102922626],"category_scores_gemma":[0.00005748378,0.00060370396,0.00022540861,0.00080452836,0.0008472628,0.0009803541,0.0025300204,0.0010988213,0.00021912968],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021257597,0.000034161872,0.00006217162,0.000021867485,0.000009989589,0.000068042114,0.0003966287,0.0009624982,0.000032290183,0.104539715,0.00003925823,0.89383125],"study_design_scores_gemma":[0.00037997498,0.00021284218,0.0007485012,0.00039632726,0.000014833716,0.0003222972,9.650576e-8,0.22077075,0.0010735147,0.7550288,0.019482454,0.0015696406],"about_ca_topic_score_codex":0.000028324113,"about_ca_topic_score_gemma":0.000060687504,"teacher_disagreement_score":0.8922616,"about_ca_system_score_codex":0.00025914964,"about_ca_system_score_gemma":0.0004222984,"threshold_uncertainty_score":0.9996414},"labels":[],"label_agreement":null},{"id":"W2914834722","doi":"10.1145/3305270","title":"Distribution Testing Lower Bounds via Reductions from Communication Complexity","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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; Mathematics; Simple (philosophy); Measure (data warehouse); Connection (principal bundle); Distribution (mathematics); Upper and lower bounds; Property testing; Reduction (mathematics); Communication complexity; Identity (music); Discrete mathematics; Interpolation (computer graphics); Operator (biology); Sample (material); Combinatorics; Computer science; Mathematical analysis","score_opus":0.039012390185488285,"score_gpt":0.2696844975486102,"score_spread":0.23067210736312188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914834722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040074654,0.000055219574,0.9558597,0.0011212694,0.0011938196,0.00030612078,0.00008833563,0.00053699844,0.0007638394],"genre_scores_gemma":[0.8160328,0.000007046086,0.18331975,0.00022629858,0.000042915024,0.000026765787,0.00018242965,0.000014719574,0.0001472379],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801356,0.00043049586,0.0004012464,0.0005329894,0.00035150014,0.0002702368],"domain_scores_gemma":[0.99650174,0.0015227537,0.00018205219,0.0014368787,0.00025582078,0.000100761914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005058676,0.00022494252,0.0002182623,0.00016164126,0.0008476854,0.0002500356,0.0011740654,0.00010222517,0.00021070596],"category_scores_gemma":[0.00007184614,0.00024883938,0.0001473752,0.0009757881,0.00022047495,0.00077308953,0.000059397782,0.00044947665,0.0003787909],"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.00009878689,0.0009836112,0.00014003048,0.00002085104,0.00016508526,0.0000031383634,0.0011206918,0.049607772,0.00081501744,0.20601904,0.00025339043,0.7407726],"study_design_scores_gemma":[0.0005131739,0.00015670095,0.005327256,0.00005920656,0.00002476291,0.000017687698,0.000110905574,0.22685933,0.00065893045,0.7652123,0.0007460005,0.0003137769],"about_ca_topic_score_codex":0.00016379071,"about_ca_topic_score_gemma":0.000020037374,"teacher_disagreement_score":0.7759582,"about_ca_system_score_codex":0.00015016858,"about_ca_system_score_gemma":0.000067688416,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W2915860730","doi":"10.1007/s00453-020-00785-5","title":"Travelling on Graphs with Small Highway Dimension","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Dimension (graph theory); Steiner tree problem; Theory of computation; Combinatorics; Mathematics; Graph; Polynomial; Approximation algorithm; Scheme (mathematics); Time complexity; Tree (set theory); Polynomial-time approximation scheme; Shortest path problem; Metric dimension; Discrete mathematics; Pathwidth; Line graph; Algorithm","score_opus":0.025253173343176734,"score_gpt":0.21924888036828835,"score_spread":0.19399570702511162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915860730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07679539,0.00045829534,0.91374236,0.0027418872,0.001105149,0.00021877384,0.000017813933,0.0006450865,0.0042752423],"genre_scores_gemma":[0.20421264,0.0000943082,0.7925908,0.002022875,0.00021577433,0.00001834502,0.000034004108,0.000038998725,0.0007722447],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998203,0.00008435948,0.00021587101,0.0007025713,0.00037570545,0.00041848692],"domain_scores_gemma":[0.99859196,0.00017898786,0.000070256305,0.00085218705,0.0001515753,0.00015502963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013335634,0.00023276292,0.00023443466,0.00014343006,0.0002619102,0.0001735875,0.000648452,0.00007587926,0.000032579144],"category_scores_gemma":[0.000015768232,0.00019731812,0.00011517465,0.0010011012,0.00008245984,0.0001762827,0.00019734545,0.00030749635,0.000056724926],"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.000022282398,0.0006170163,0.00007012867,0.000023186183,0.000106097956,0.00096324965,0.00069799245,0.0002599748,0.001613867,0.39468676,0.00064783194,0.6002916],"study_design_scores_gemma":[0.005236468,0.0026221273,0.011783706,0.0008653505,0.00012136654,0.0015515058,0.00052519696,0.30000883,0.30128133,0.2680196,0.10428565,0.0036988517],"about_ca_topic_score_codex":0.000021848811,"about_ca_topic_score_gemma":0.000025087282,"teacher_disagreement_score":0.5965927,"about_ca_system_score_codex":0.000026421383,"about_ca_system_score_gemma":0.000090176385,"threshold_uncertainty_score":0.80463994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008958111,0.00009621263,0.9708291,0.00094748684,0.008080494,0.004220867,0.0025045415,0.0006357767,0.0037274004],"genre_scores_gemma":[0.20000756,0.0001375002,0.7933145,0.0010981171,0.0011301418,0.0012861687,0.0020333515,0.00015908832,0.0008335721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946288,0.00006697222,0.0019784793,0.0010035234,0.00091235107,0.0014099062],"domain_scores_gemma":[0.99448836,0.00043092572,0.0009805465,0.0026289485,0.0010421169,0.0004291061],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010265289,0.00097367127,0.0011757958,0.00063545775,0.0006592686,0.0015050392,0.004038143,0.0008806888,0.000029412377],"category_scores_gemma":[0.00040598525,0.00097534346,0.0012104354,0.00042364188,0.00025724253,0.0016998796,0.0031469283,0.001643554,0.0001504604],"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.0005756281,0.004842426,0.0011219409,0.018951176,0.0046576746,0.00003758767,0.039795406,0.047136504,0.00016098787,0.29578915,0.044386078,0.54254544],"study_design_scores_gemma":[0.0029015832,0.0004759328,0.0003467939,0.0006132704,0.00017032228,0.00013708089,0.0005789432,0.8945641,0.0008334947,0.008602835,0.089203745,0.0015719334],"about_ca_topic_score_codex":0.000035711586,"about_ca_topic_score_gemma":0.00001638556,"teacher_disagreement_score":0.84742755,"about_ca_system_score_codex":0.00031870016,"about_ca_system_score_gemma":0.000732039,"threshold_uncertainty_score":0.9995315},"labels":[],"label_agreement":null},{"id":"W2919078879","doi":"10.1145/3404860","title":"Circuit Lower Bounds for MCSP from Local Pseudorandom Generators","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudorandom number generator; Upper and lower bounds; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Truth table; Boolean circuit; Binary logarithm; Function (biology); Parity function; Algorithm; Boolean expression","score_opus":0.04122917108285918,"score_gpt":0.2584555555495299,"score_spread":0.21722638446667075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919078879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030364029,0.0000941903,0.9925052,0.0023093072,0.0011334984,0.00031237476,0.000077620985,0.00040032968,0.0001311089],"genre_scores_gemma":[0.8595466,0.000009288259,0.13667233,0.0034477836,0.00018095034,0.000059453945,0.000024701876,0.000022086513,0.000036800622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984345,0.00016794095,0.00031501296,0.0005589334,0.00027505957,0.00024854517],"domain_scores_gemma":[0.99805564,0.0010944041,0.00008378217,0.00046766177,0.00011953847,0.00017896533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024890143,0.00020878222,0.00023307194,0.00011772652,0.0004566093,0.00020856467,0.0008904076,0.00008996283,0.00011168017],"category_scores_gemma":[0.00004539921,0.0002171725,0.000240246,0.0005075455,0.00012869587,0.00036260075,0.000020284378,0.00022434913,0.00008564003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024146843,0.00023020802,0.0000032317157,0.000021974447,0.00014405049,0.000008363829,0.0018470105,0.06103642,0.00018706468,0.07629918,0.0005210148,0.85946],"study_design_scores_gemma":[0.0018631385,0.00032858358,0.00004316983,0.000016264803,0.000037071608,0.000004153711,0.00011849137,0.4032846,0.0027650709,0.58813655,0.00307924,0.00032365177],"about_ca_topic_score_codex":0.000012765751,"about_ca_topic_score_gemma":0.0000051494367,"teacher_disagreement_score":0.85913634,"about_ca_system_score_codex":0.000044254088,"about_ca_system_score_gemma":0.00008280271,"threshold_uncertainty_score":0.8856038},"labels":[],"label_agreement":null},{"id":"W2940838630","doi":"10.1016/j.cie.2019.04.040","title":"An extension of adaptive multi-start tabu search for the maximum quasi-clique problem","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Clique problem; Tabu search; Clique; Extension (predicate logic); Clique percolation method; Mathematics; Cardinality (data modeling); Benchmark (surveying); Heuristic; Algorithm; Mathematical optimization; Graph; Computer science; Combinatorics; Complex network; Pathwidth; Line graph; Data mining","score_opus":0.07725742536160617,"score_gpt":0.2692865235304725,"score_spread":0.19202909816886632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940838630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027543604,0.00007545533,0.96919906,0.00021874075,0.0017892815,0.0009843211,0.000010335809,0.00016753319,0.00001169001],"genre_scores_gemma":[0.6994063,0.0000070916976,0.300052,0.00005872629,0.0003859161,0.00003616599,0.00000645207,0.00002697383,0.000020336642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984306,0.000060368093,0.0003448882,0.00046670923,0.00028844722,0.00040899336],"domain_scores_gemma":[0.99830157,0.0005648472,0.0000911469,0.00077168626,0.0001585342,0.000112195325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072441855,0.00021616998,0.0003041626,0.00017492281,0.00011360594,0.000112678674,0.0012790653,0.00014328148,0.000004677443],"category_scores_gemma":[0.00002390224,0.00017973159,0.00014982275,0.00048081923,0.00004781839,0.00039295672,0.00032422974,0.00042103633,0.000005611218],"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.00010372891,0.00032973322,0.00019011665,0.00007684868,0.00014725413,0.000008007441,0.0016467276,0.68279666,0.007610056,0.060464032,0.00029951692,0.2463273],"study_design_scores_gemma":[0.0012017416,0.0005804849,0.00029163403,0.000119276025,0.000008169277,0.000007852175,0.00006498013,0.99230784,0.0034361577,0.00023216089,0.0015254648,0.00022423743],"about_ca_topic_score_codex":0.000082780156,"about_ca_topic_score_gemma":0.0000025921195,"teacher_disagreement_score":0.6718627,"about_ca_system_score_codex":0.000050690476,"about_ca_system_score_gemma":0.00010093441,"threshold_uncertainty_score":0.73292416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24371348,0.00007997978,0.74795336,0.0010815692,0.0016662612,0.0032759095,0.00019570599,0.00034970997,0.0016840157],"genre_scores_gemma":[0.4554339,0.00000929173,0.54216605,0.0015431615,0.0001951044,0.00016693749,0.00014668217,0.000046466004,0.0002923964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730545,0.000047100148,0.0010180868,0.0004063606,0.0004270892,0.0007959101],"domain_scores_gemma":[0.9969767,0.00025386273,0.00044106087,0.0017578548,0.00038467319,0.00018586806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103189,0.00036143532,0.00043924194,0.0003934266,0.0005694631,0.00065889506,0.0021567615,0.0001318605,0.000013905304],"category_scores_gemma":[0.000185612,0.0003477712,0.00026714866,0.00067114655,0.00007145342,0.0022599215,0.0009649714,0.00034332668,0.00012884114],"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.0005329413,0.0018185788,0.025847578,0.0045768428,0.0009305395,0.0000043791924,0.083248675,0.009688656,0.0036102303,0.36793315,0.015449035,0.4863594],"study_design_scores_gemma":[0.0026322396,0.00035073297,0.0008334983,0.00044667494,0.000034373774,0.00005212511,0.0007674552,0.82365704,0.003546779,0.0071152123,0.15952934,0.0010345515],"about_ca_topic_score_codex":0.000031878142,"about_ca_topic_score_gemma":0.000015550135,"teacher_disagreement_score":0.81396836,"about_ca_system_score_codex":0.00013940758,"about_ca_system_score_gemma":0.00011218865,"threshold_uncertainty_score":0.9998974},"labels":[],"label_agreement":null},{"id":"W2945389025","doi":"","title":"Stronger Linear Programming Relaxations of Max-Cut","year":2002,"lang":"en","type":"article","venue":"","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":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Linear programming; Maximum cut; Discrete mathematics; Inequality; Mathematical optimization; Graph; Mathematical analysis","score_opus":0.04279685047705614,"score_gpt":0.2500863312182562,"score_spread":0.20728948074120004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945389025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004973757,0.000106788786,0.97159874,0.0010424819,0.00019993406,0.00012624564,0.0000014591321,0.00021771189,0.021732872],"genre_scores_gemma":[0.3633063,0.0000088500265,0.63418466,0.000065344575,0.000044973098,0.000007839727,7.988773e-7,0.0000040238015,0.0023772265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933386,0.000018006427,0.00016170871,0.00016470873,0.00016775583,0.00015395906],"domain_scores_gemma":[0.9994358,0.000046261073,0.00005569562,0.0003590748,0.000058742848,0.000044427623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009038578,0.000062002335,0.00008354004,0.00007683129,0.000079376325,0.000035810874,0.0004369171,0.000026992937,0.0002489062],"category_scores_gemma":[0.000022180422,0.000054858723,0.000060128103,0.00039549393,0.000053323984,0.00023279259,0.00013093301,0.000078248486,0.00006357586],"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":[6.076184e-7,0.00023588409,0.0006822472,0.000013087491,0.000021090744,0.0000045179913,0.0007987351,0.0001047471,0.000087904,0.5443381,0.0017429726,0.4519701],"study_design_scores_gemma":[0.00040027272,0.00020981781,0.001801876,0.00002504509,0.000009353349,0.000021312522,0.00010335581,0.89485747,0.0027384886,0.011543083,0.087977745,0.00031218093],"about_ca_topic_score_codex":0.000022235025,"about_ca_topic_score_gemma":0.000012224036,"teacher_disagreement_score":0.89475274,"about_ca_system_score_codex":0.000006980951,"about_ca_system_score_gemma":0.0000058768214,"threshold_uncertainty_score":0.27253485},"labels":[],"label_agreement":null},{"id":"W2946229976","doi":"10.1016/j.cca.2019.03.1564","title":"Improved sample quality and decreased turnaround time by implementing BD Barricor™ plasma tubes on Beckman-Coulter AU5800 and DXI","year":2019,"lang":"en","type":"article","venue":"Clinica Chimica Acta","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Minimum weight; Vertex (graph theory); Mathematics; Approximation algorithm; Graph; Submodular set function; Weight function; Vertex connectivity; Discrete mathematics; Statistics","score_opus":0.030005969423616975,"score_gpt":0.3113355950685631,"score_spread":0.2813296256449461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946229976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949052,0.000029097208,0.0006166151,0.0026502567,0.0003133091,0.00039145912,0.00013367478,0.00016188718,0.00079850503],"genre_scores_gemma":[0.986989,0.00006296807,0.010503319,0.002042132,0.00011414576,0.00001366366,0.000039578175,0.000025446354,0.00020972584],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711674,0.000213411,0.00073550706,0.0010211472,0.00030144808,0.0006117527],"domain_scores_gemma":[0.99542993,0.0029818492,0.00022831108,0.0009747319,0.000068531546,0.0003166388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010830729,0.00033104606,0.00051298516,0.00010580023,0.00032599553,0.00045765666,0.00086457696,0.00014563228,0.00017796905],"category_scores_gemma":[0.0005467612,0.00030112758,0.00014512142,0.00021438365,0.00017877459,0.00048111632,0.00081585685,0.0004160591,0.00003084378],"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.0014472111,0.004337934,0.20241506,0.0008764394,0.0016606239,0.00002003823,0.007327576,0.0000046315713,0.44229236,0.040827677,0.066914745,0.2318757],"study_design_scores_gemma":[0.015163806,0.0041536777,0.26407897,0.00046511326,0.0001732319,0.000066162786,0.00038532887,0.44687393,0.017653076,0.036539994,0.20999505,0.0044516693],"about_ca_topic_score_codex":0.00014783457,"about_ca_topic_score_gemma":0.000026843638,"teacher_disagreement_score":0.44686928,"about_ca_system_score_codex":0.0000242619,"about_ca_system_score_gemma":0.00006406485,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W2947949186","doi":"10.48550/arxiv.1905.11635","title":"Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Mathematical proof; Soundness; Operator (biology); Upper and lower bounds; Completeness (order theory); Gas meter prover; Mathematics; Discrete mathematics; Value (mathematics); Complexity class; Class (philosophy); Combinatorics; Gap theorem; Time complexity; Computer science","score_opus":0.07326202935955649,"score_gpt":0.22702933477742474,"score_spread":0.15376730541786826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947949186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32678616,0.000023975555,0.6703538,0.00017188626,0.0012381928,0.00090337964,0.00004838799,0.00010340138,0.00037084564],"genre_scores_gemma":[0.9348033,0.000010732287,0.06464461,0.00022946268,0.00012000596,0.0000027122157,0.000018228633,0.000026408206,0.00014452476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971211,0.00023631274,0.0004935368,0.0013204421,0.00023826862,0.00059035624],"domain_scores_gemma":[0.9959701,0.00081744033,0.0004307818,0.0021862173,0.00042352776,0.00017194805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010753946,0.00045945373,0.0007254915,0.00027603,0.0005676277,0.00029228907,0.0045990804,0.00027020337,0.000012382929],"category_scores_gemma":[0.0000865181,0.0004187022,0.00045742304,0.0008348997,0.00041597147,0.000270435,0.0065968907,0.0007142454,0.000023735744],"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.00010435283,0.00023828952,0.000568043,0.00026645456,0.00013889727,0.000016019669,0.0008735674,0.59063536,0.00006809681,0.3994867,0.00040588455,0.0071983673],"study_design_scores_gemma":[0.00060717255,0.0002017582,0.0023581053,0.00034120967,0.00004663519,0.0000035833054,0.00020180146,0.9359284,0.0005412893,0.058779344,0.0005067018,0.00048397505],"about_ca_topic_score_codex":0.0005954289,"about_ca_topic_score_gemma":0.000037231934,"teacher_disagreement_score":0.60801715,"about_ca_system_score_codex":0.00020237119,"about_ca_system_score_gemma":0.00025301665,"threshold_uncertainty_score":0.9998265},"labels":[],"label_agreement":null},{"id":"W2949074211","doi":"10.48550/arxiv.1705.02385","title":"The Salesman's Improved Tours for Fundamental Classes","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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 Ottawa","funders":"","keywords":"Travelling salesman problem; Metric (unit); Conjecture; Combinatorics; Linear programming relaxation; Class (philosophy); Upper and lower bounds; Mathematics; Integer (computer science); Relaxation (psychology); Discrete mathematics; Integer programming; Computer science; Mathematical optimization; Artificial intelligence","score_opus":0.12536529880018904,"score_gpt":0.22334406803306686,"score_spread":0.09797876923287782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949074211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05685282,0.00050781085,0.92248476,0.0016300987,0.010635197,0.002540118,0.00025831515,0.00032246686,0.004768406],"genre_scores_gemma":[0.97959965,0.00167752,0.0044571557,0.00012914128,0.00058957055,0.000011356582,0.000029036712,0.000048643236,0.013457908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951584,0.0002606181,0.0005202797,0.0025155284,0.0002085364,0.0013366459],"domain_scores_gemma":[0.9923997,0.0011593876,0.001155429,0.00433784,0.00051008567,0.00043758788],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010233063,0.00086143496,0.00072494353,0.00024298855,0.0059309085,0.0021416033,0.009517097,0.0005275181,0.000035562396],"category_scores_gemma":[0.0001804454,0.00084088015,0.0012019777,0.00041281004,0.0018881073,0.00097291375,0.006161014,0.00118576,0.000079343554],"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.00042868766,0.00041601123,0.0013643457,0.00021766078,0.0007757721,0.0001862013,0.00049658044,0.0065583093,0.00007962741,0.953407,0.0021339548,0.03393588],"study_design_scores_gemma":[0.001444105,0.00033446128,0.0012464175,0.00016455927,0.00020889616,0.000013973321,0.00038275233,0.66897357,0.0001137135,0.2817783,0.044340324,0.0009989354],"about_ca_topic_score_codex":0.00031085216,"about_ca_topic_score_gemma":0.00073464285,"teacher_disagreement_score":0.92274684,"about_ca_system_score_codex":0.00043371416,"about_ca_system_score_gemma":0.00078672817,"threshold_uncertainty_score":0.9994042},"labels":[],"label_agreement":null},{"id":"W2949074990","doi":"10.48550/arxiv.1012.2291","title":"Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McGill University; Université de Montréal","funders":"","keywords":"Mathematics; Upper and lower bounds; Min entropy; Entropy (arrow of time); Discrete mathematics; Bitwise operation; Binary logarithm; Quantum; Decoding methods; Combinatorics; Entropy rate; Statistical physics; Joint quantum entropy; Principle of maximum entropy; Statistics; Quantum mechanics; Mathematical analysis; Physics; Computer science","score_opus":0.1536613408288277,"score_gpt":0.2483281426718979,"score_spread":0.09466680184307019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949074990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16809486,0.00018911339,0.8284216,0.00031885097,0.0020238743,0.00053575577,0.00003711047,0.0002065135,0.00017231003],"genre_scores_gemma":[0.9622338,0.0004541565,0.03552887,0.00017997417,0.0004095487,0.0000032105781,0.000025041109,0.00002852565,0.0011368791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775153,0.00008701263,0.00024554195,0.0012719837,0.000120557066,0.00052336266],"domain_scores_gemma":[0.99746776,0.000548334,0.00025868943,0.0011512275,0.00020415716,0.00036983378],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004209201,0.00038394387,0.0005037893,0.00038648685,0.0006515765,0.00136399,0.0026711992,0.00039039212,0.000029865638],"category_scores_gemma":[0.00011963123,0.0004451398,0.00032036586,0.0004171602,0.00037150423,0.00069980515,0.0027588448,0.0007489765,0.000006438384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000358675,0.00017684393,0.00162648,0.0001940494,0.00019823427,0.00011319225,0.00052005984,0.008729553,0.00009647694,0.9807631,0.00096928305,0.0062540956],"study_design_scores_gemma":[0.0023430965,0.00006643512,0.0006709707,0.00012379956,0.00009859737,0.000005882482,0.00002788441,0.47072542,0.00009687365,0.5077385,0.01747861,0.0006239614],"about_ca_topic_score_codex":0.0008063235,"about_ca_topic_score_gemma":0.0004759917,"teacher_disagreement_score":0.7941389,"about_ca_system_score_codex":0.00007865635,"about_ca_system_score_gemma":0.0005345332,"threshold_uncertainty_score":0.9998},"labels":[],"label_agreement":null},{"id":"W2949563967","doi":"10.1007/978-3-030-17953-3_21","title":"An Efficient Characterization of Submodular Spanning Tree Games","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Shapley value; Characterization (materials science); Game tree; Computer science; Convexity; Mathematical economics; Spanning tree; Tree (set theory); Cooperative game theory; Time complexity; Core (optical fiber); Mathematics; Game theory; Regular polygon; Combinatorics; Sequential game; Economics","score_opus":0.016765882172677958,"score_gpt":0.257172427004477,"score_spread":0.24040654483179905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949563967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31906775,0.000061074934,0.67807347,0.00018191442,0.0021414673,0.00033894542,0.000007716989,0.00011715165,0.000010515627],"genre_scores_gemma":[0.6981218,0.0000072552275,0.30147678,0.00018430111,0.0001737538,0.000009124513,0.000014627611,0.00001198704,3.9095312e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572,0.00017041173,0.00062267814,0.0017561975,0.0010767136,0.0006539656],"domain_scores_gemma":[0.9963592,0.00019323308,0.00047063048,0.0025028558,0.00032765506,0.00014637568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012859781,0.0004357027,0.00060942216,0.0010617481,0.00016169068,0.0006269913,0.00536252,0.00025240052,0.000004966936],"category_scores_gemma":[0.00007864294,0.0004212535,0.00015800934,0.0020794047,0.0005316467,0.0005251365,0.003183532,0.0007754614,0.0000061284913],"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.0000043526848,0.00016160063,0.0015230478,0.00009889405,0.00000667019,0.000011029323,0.0022026037,0.6581351,0.012927315,0.0011683943,3.118199e-7,0.32376066],"study_design_scores_gemma":[0.00017912863,0.0001377226,0.025926845,0.0004019552,0.000004124785,0.000011558393,5.3550116e-7,0.9338801,0.029105933,0.009911696,0.000009945497,0.00043047406],"about_ca_topic_score_codex":0.00006525268,"about_ca_topic_score_gemma":0.000013619423,"teacher_disagreement_score":0.37905404,"about_ca_system_score_codex":0.00014097699,"about_ca_system_score_gemma":0.0005329454,"threshold_uncertainty_score":0.9998239},"labels":[],"label_agreement":null},{"id":"W2949571619","doi":"10.48550/arxiv.1209.3759","title":"The Maximum Traveling Salesman Problem with Submodular Rewards","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Submodular set function; Oracle; Travelling salesman problem; Combinatorics; Graph; Mathematics; Set (abstract data type); Function (biology); Computer science; Path (computing); Discrete mathematics; Mathematical optimization","score_opus":0.06363039629362593,"score_gpt":0.17586027185452957,"score_spread":0.11222987556090364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949571619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06367926,0.00028818572,0.9285143,0.00033886972,0.0007568321,0.00048302245,0.000010643971,0.00039158555,0.0055372906],"genre_scores_gemma":[0.9844102,0.0002501912,0.014200918,0.000058509777,0.000161351,0.0000027170004,0.000009080112,0.00002610254,0.00088090374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768925,0.000182397,0.0002220404,0.0010261949,0.00019834148,0.000681767],"domain_scores_gemma":[0.9972835,0.0001398868,0.0002642697,0.0019043913,0.00018476225,0.000223171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006255764,0.00039985141,0.00031708516,0.00013314102,0.0007109405,0.00032178263,0.003291271,0.00023136647,0.000010060779],"category_scores_gemma":[0.00001095583,0.00032439877,0.00022791889,0.00069325033,0.00033055304,0.000398894,0.0021594756,0.0009412957,0.00004721914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058610134,0.00016745616,0.002527834,0.00013055975,0.00029497707,0.00032013777,0.0009406329,0.045079026,0.000015804884,0.9371675,0.0002206789,0.013076772],"study_design_scores_gemma":[0.00086038996,0.00013871519,0.0035742144,0.0003048842,0.00017387688,0.00005864584,0.00022790318,0.35909668,0.00018262384,0.6225035,0.01149667,0.0013819025],"about_ca_topic_score_codex":0.00014762965,"about_ca_topic_score_gemma":0.00015212776,"teacher_disagreement_score":0.92073095,"about_ca_system_score_codex":0.00014396556,"about_ca_system_score_gemma":0.00022111779,"threshold_uncertainty_score":0.9999208},"labels":[],"label_agreement":null},{"id":"W2949581528","doi":"10.1007/s00446-015-0245-8","title":"Linear-in- $$\\varDelta $$ Δ lower bounds in the LOCAL model","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Helsingin Yliopisto","keywords":"Logarithm; Graph; Upper and lower bounds; Matching (statistics); Degree (music); Theory of computation; Strength of a graph; Range (aeronautics); Graph bandwidth","score_opus":0.0492260071130564,"score_gpt":0.2853473280723429,"score_spread":0.2361213209592865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949581528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048475523,0.000087793065,0.9490056,0.0010803875,0.00032066766,0.00012603342,0.00001410458,0.00011492225,0.00077494053],"genre_scores_gemma":[0.9687892,0.0000013398201,0.030629346,0.00045303538,0.00007983597,0.0000045759193,0.000030414316,0.0000067663627,0.000005471976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981045,0.00014825158,0.00038093427,0.0004184137,0.00043297195,0.000514911],"domain_scores_gemma":[0.9988987,0.00017570329,0.00007710551,0.00065509387,0.00009444818,0.00009893492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245524,0.00017907459,0.00021333047,0.00013395057,0.00012794262,0.00021268602,0.0017834072,0.000078558645,0.0000014335013],"category_scores_gemma":[0.000079831414,0.00014847601,0.00007922305,0.0014414676,0.00010267995,0.00021706126,0.00041348772,0.00044909597,0.000018017956],"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.00001638069,0.0004676733,0.0044688033,0.000013467297,0.000012247096,0.00025779728,0.0045241076,0.8247268,0.0000089113055,0.11060939,0.0027554948,0.05213891],"study_design_scores_gemma":[0.00053146126,0.000039974606,0.0019021543,0.000033068423,0.0000013948885,0.000022713679,0.00029546206,0.9684577,0.0000129716345,0.027193038,0.0013244125,0.00018565962],"about_ca_topic_score_codex":0.00013288563,"about_ca_topic_score_gemma":0.00005047692,"teacher_disagreement_score":0.9203137,"about_ca_system_score_codex":0.000115043156,"about_ca_system_score_gemma":0.00016653363,"threshold_uncertainty_score":0.6054676},"labels":[],"label_agreement":null},{"id":"W2949842650","doi":"","title":"Multivariate Submodular Optimization.","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","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":"University of British Columbia","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Combinatorics; Mathematics; Disjoint sets; Discrete mathematics; Approximation algorithm; Greedy algorithm; Maximization; Mathematical optimization","score_opus":0.029781064638663552,"score_gpt":0.28081359571158415,"score_spread":0.2510325310729206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949842650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006307043,0.00001842168,0.92621964,0.0030446567,0.0012102881,0.00012929861,0.0000058188766,0.00027656855,0.06278824],"genre_scores_gemma":[0.930521,0.0000171473,0.066034816,0.00035345537,0.00006979838,0.0000068291097,0.000040812687,0.000009941017,0.0029462061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875295,0.000089640176,0.00018350173,0.00038869726,0.00040402304,0.00018116059],"domain_scores_gemma":[0.9992957,0.000082782775,0.000108614484,0.00028109946,0.0001740998,0.000057664693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021695158,0.00014029117,0.00012508484,0.00018976923,0.00010714345,0.0002847865,0.0010390935,0.000044666765,0.0015544017],"category_scores_gemma":[0.0000846075,0.00013520372,0.00006828524,0.00018151966,0.0000229201,0.0004019107,0.0002615393,0.00038957465,0.00047367925],"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.000013104739,0.00005204717,0.0036085101,0.0000033330693,0.000031095467,0.000008775877,0.00020196178,0.25447813,0.0003949382,0.72651386,0.00002138208,0.014672878],"study_design_scores_gemma":[0.00039468874,0.00008354028,0.001358352,0.000030254467,0.0000012964529,0.000007672326,0.0000138878395,0.98667765,0.000109204615,0.0063270293,0.004831494,0.00016494756],"about_ca_topic_score_codex":0.00007994252,"about_ca_topic_score_gemma":0.0000030851143,"teacher_disagreement_score":0.92421395,"about_ca_system_score_codex":0.000036909565,"about_ca_system_score_gemma":0.000035933772,"threshold_uncertainty_score":0.9993583},"labels":[],"label_agreement":null},{"id":"W2949889202","doi":"10.1007/s10107-019-01394-z","title":"The matching augmentation problem: a $$\\frac{7}{4}$$-approximation algorithm","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Matching (statistics); Zero (linguistics); Cover (algebra); Approx; Reduction (mathematics)","score_opus":0.014087274261470255,"score_gpt":0.25610141803367553,"score_spread":0.2420141437722053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949889202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035935694,0.00005472006,0.9913352,0.00089930557,0.00021308823,0.00086571823,5.187834e-7,0.00035137084,0.0026865192],"genre_scores_gemma":[0.052594103,0.0000029225314,0.94657874,0.00009053049,0.000059117756,0.00015143908,0.0000044020535,0.000016313976,0.00050240697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981881,0.000086042266,0.00041058194,0.00035428992,0.00052488426,0.00043611097],"domain_scores_gemma":[0.9987402,0.00039814803,0.0001480099,0.00056013674,0.00007112342,0.00008237363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010160891,0.00017123393,0.00017976867,0.00006443233,0.00044876576,0.00088587985,0.00081934454,0.000058439757,0.000030137397],"category_scores_gemma":[0.000039751576,0.00011948214,0.00010900422,0.00037795134,0.00007400921,0.00061260804,0.00030041026,0.00023474383,0.00039158663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.524015e-7,0.000054398173,0.0000063148213,0.000055998506,0.000011727699,0.0000013976309,0.00086324447,0.000008805092,0.000047363526,0.4790004,0.000018077133,0.5199313],"study_design_scores_gemma":[0.00021849085,0.000053956905,0.00002474138,0.000072197756,0.000006415373,0.000025578274,0.00023630161,0.30544412,0.0002055766,0.6913245,0.0022209904,0.00016717018],"about_ca_topic_score_codex":0.0000074741642,"about_ca_topic_score_gemma":0.0000011206113,"teacher_disagreement_score":0.5197642,"about_ca_system_score_codex":0.00005026421,"about_ca_system_score_gemma":0.000027693764,"threshold_uncertainty_score":0.854256},"labels":[],"label_agreement":null},{"id":"W2949995719","doi":"10.48550/arxiv.1408.0828","title":"Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Discrete mathematics; Mathematics; Disjoint sets; Deterministic finite automaton; Graph; Algorithm; Finite-state machine","score_opus":0.06393270973561822,"score_gpt":0.1876688978864426,"score_spread":0.12373618815082436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949995719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6454217,0.00006858311,0.3521442,0.00009523617,0.00064258353,0.00041935488,0.000003777082,0.00023736825,0.0009672068],"genre_scores_gemma":[0.9889256,0.000103115824,0.010207425,0.000012236137,0.00011705111,0.0000022256315,0.0000093198405,0.00001698786,0.00060607947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978073,0.00024234907,0.00028191612,0.0012289132,0.0001515342,0.0002879571],"domain_scores_gemma":[0.9981493,0.000080915794,0.00048477322,0.0009272679,0.00026416255,0.000093576404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050468516,0.00031646644,0.00041213853,0.00040737313,0.00028441552,0.00014498609,0.0010577104,0.00017644525,0.0000045406814],"category_scores_gemma":[0.00013321715,0.00033481306,0.00012395569,0.0007158091,0.0002768444,0.00040350226,0.0012551784,0.00075067877,0.0000052873092],"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.00017242889,0.0007070473,0.004706946,0.0032447635,0.0003472647,0.00006667934,0.0055915033,0.45947242,0.0015562496,0.49006903,0.00023500943,0.03383065],"study_design_scores_gemma":[0.00088114897,0.00074992614,0.0031691089,0.0012537738,0.00014412786,0.00003816712,0.0005277803,0.86366284,0.005252,0.12213005,0.00094269385,0.0012483733],"about_ca_topic_score_codex":0.00011500814,"about_ca_topic_score_gemma":0.0000035023081,"teacher_disagreement_score":0.40419042,"about_ca_system_score_codex":0.00004906549,"about_ca_system_score_gemma":0.00011046923,"threshold_uncertainty_score":0.9999104},"labels":[],"label_agreement":null},{"id":"W2950188498","doi":"10.48550/arxiv.math/0112257","title":"The computational complexity of the local postage stamp problem","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Integer (computer science); Combinatorics; Mathematics; Postage Stamps; Time complexity; Discrete mathematics; Turing; Computational complexity theory; Set (abstract data type); Computer science; Algorithm","score_opus":0.07116568959009759,"score_gpt":0.2758229870363237,"score_spread":0.2046572974462261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950188498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21547955,0.00043041102,0.77005655,0.008146463,0.0018043262,0.0008787794,0.00009586624,0.00020677813,0.002901279],"genre_scores_gemma":[0.9762623,0.00004838781,0.022719275,0.0004362827,0.00013490455,0.000031859614,0.000024019297,0.000018402021,0.0003245831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972196,0.00030833608,0.0006189314,0.0006512658,0.0007609701,0.0004408628],"domain_scores_gemma":[0.9970101,0.00040909776,0.0004966333,0.0016628179,0.0003291853,0.000092125585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006700077,0.00032997955,0.00035708476,0.000072002375,0.00071347057,0.00019527292,0.0041631754,0.00016511398,0.000027457412],"category_scores_gemma":[0.000044963712,0.00021104477,0.00035897008,0.00051631045,0.0015059293,0.00013484861,0.0047409944,0.0010149103,0.0000299028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004186535,0.00057456247,0.13185036,0.0002924798,0.00036990477,0.000031603904,0.0022291697,0.063531086,0.000045358924,0.7572291,0.0037705258,0.040033977],"study_design_scores_gemma":[0.00034170298,0.00005941096,0.3099316,0.00017972315,0.000021119942,0.00002881777,0.000087699176,0.14118452,0.00017598702,0.5403142,0.007263097,0.00041213047],"about_ca_topic_score_codex":0.00032658986,"about_ca_topic_score_gemma":0.00018120087,"teacher_disagreement_score":0.7607827,"about_ca_system_score_codex":0.00009073778,"about_ca_system_score_gemma":0.00037439688,"threshold_uncertainty_score":0.86061555},"labels":[],"label_agreement":null},{"id":"W2950333589","doi":"10.48550/arxiv.1303.4897","title":"Maximum Edge-Disjoint Paths in $k$-sums of Graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"McGill University","funders":"","keywords":"Disjoint sets; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Computer science; Telecommunications","score_opus":0.01771570312206111,"score_gpt":0.22504832219765056,"score_spread":0.20733261907558945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950333589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.142637,0.0020272792,0.8104688,0.006932452,0.0010094868,0.0009972109,0.00006472259,0.0004303806,0.035432696],"genre_scores_gemma":[0.67635435,0.0007307806,0.32103956,0.00011328681,0.000019966843,0.00014732275,0.00012562828,0.000042363055,0.0014267375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933894,0.0034378967,0.00093685265,0.0011015127,0.0006214529,0.00051287015],"domain_scores_gemma":[0.99251556,0.0010535549,0.0007019765,0.0039225942,0.001604277,0.00020203122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004585864,0.00042635793,0.0006265186,0.00061111915,0.00018365317,0.00044689866,0.0041514435,0.00033664107,0.000112972426],"category_scores_gemma":[0.000636399,0.00045752834,0.0003735743,0.0010214392,0.0003916394,0.00032428117,0.004627734,0.00096708856,0.000046579746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004734276,0.0008588208,0.0023905477,0.00031970016,0.00006689841,0.000013044187,0.012437082,0.000103803235,0.0010491722,0.7600161,0.0010280033,0.2217121],"study_design_scores_gemma":[0.0010867694,0.0000017731467,0.019622678,0.004140574,0.000029749792,0.000021767039,0.00018573603,0.20841327,0.038495287,0.72127146,0.0054592406,0.00127171],"about_ca_topic_score_codex":0.00286061,"about_ca_topic_score_gemma":0.0012736102,"teacher_disagreement_score":0.5337174,"about_ca_system_score_codex":0.00009415341,"about_ca_system_score_gemma":0.00031122204,"threshold_uncertainty_score":0.9997876},"labels":[],"label_agreement":null},{"id":"W2950392347","doi":"","title":"A Second Look at Counting Triangles in Graph Streams","year":2014,"lang":"en","type":"preprint","venue":"Warwick Research Archive Portal (University of Warwick)","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Streaming algorithm; Mathematics; Space (punctuation); Graph; Constant (computer programming); Discrete mathematics; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.04329996312900055,"score_gpt":0.27491724017738917,"score_spread":0.2316172770483886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950392347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295949,0.00081791886,0.10877271,0.0013223834,0.000813172,0.0019990515,0.0007772135,0.0003358168,0.055566825],"genre_scores_gemma":[0.9422103,0.0005088605,0.054037698,0.000054218242,0.00017978961,0.000007604381,0.0003471422,0.00005136224,0.0026029844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933965,0.0010604986,0.00061671046,0.0017397577,0.0018097566,0.0013767739],"domain_scores_gemma":[0.99545175,0.0010889053,0.0005445776,0.001988684,0.00043783276,0.0004882596],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003224594,0.0005151647,0.0010626655,0.0024109166,0.0007477577,0.0001651127,0.0050872397,0.00037401254,0.00075967715],"category_scores_gemma":[0.00021477453,0.0006373246,0.000630596,0.001283271,0.0017967833,0.0005021056,0.011893158,0.00263794,0.0001157318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002502589,0.0057519707,0.04413162,0.01016401,0.0028650216,0.018111698,0.107491724,0.007365878,0.0048754476,0.3457383,0.12649955,0.3245022],"study_design_scores_gemma":[0.0066424347,0.001357629,0.045836132,0.0029276928,0.00009261381,0.00022087582,0.008332598,0.29437667,0.00071061216,0.6092953,0.027029002,0.0031784084],"about_ca_topic_score_codex":0.003712031,"about_ca_topic_score_gemma":0.018955192,"teacher_disagreement_score":0.32132378,"about_ca_system_score_codex":0.00019465646,"about_ca_system_score_gemma":0.00086541707,"threshold_uncertainty_score":0.999663},"labels":[],"label_agreement":null},{"id":"W2950427777","doi":"10.4230/lipics.approx-random.2017.37","title":"Sample-Based High-Dimensional Convexity Testing","year":2017,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","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":"National Science Foundation","keywords":"Combinatorics; Monotonic function; Constant (computer programming); Characterization (materials science); Mathematics; Constant function; Partition (number theory); Property testing; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.3264675902913521,"score_gpt":0.4352698718725549,"score_spread":0.10880228158120281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950427777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857265,0.00078265334,0.6721266,0.2193003,0.0041421517,0.0043785833,0.0049173124,0.0026046017,0.003175125],"genre_scores_gemma":[0.3337301,0.000034258384,0.65371937,0.0017415038,0.0014260223,0.0005225867,0.00754892,0.00008837736,0.0011888787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921575,0.0009129244,0.0007998015,0.0019383836,0.0030828288,0.0011085161],"domain_scores_gemma":[0.98268795,0.0029281632,0.0006467062,0.005855918,0.007333784,0.0005474512],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.006080206,0.0004732852,0.000566749,0.0011313776,0.0014954915,0.0030829867,0.008141756,0.00047544908,0.00022626221],"category_scores_gemma":[0.012325644,0.00047479678,0.0002399862,0.0012848654,0.00065663486,0.0010331133,0.009581332,0.0030689817,0.00018668895],"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.00009494103,0.0045319926,0.016695824,0.0011338297,0.0003794012,0.00008124734,0.00032780677,0.0035885205,0.00023846923,0.5699143,0.08993354,0.31308016],"study_design_scores_gemma":[0.0007853109,0.00012034289,0.08618635,0.00028212817,0.000010474448,0.000006459363,0.000006617046,0.6934743,0.00020792075,0.18091808,0.037306532,0.0006954664],"about_ca_topic_score_codex":0.0038252359,"about_ca_topic_score_gemma":0.0002376111,"teacher_disagreement_score":0.6898858,"about_ca_system_score_codex":0.00032535486,"about_ca_system_score_gemma":0.003153892,"threshold_uncertainty_score":0.99980444},"labels":[],"label_agreement":null},{"id":"W2950544775","doi":"10.1137/1.9781611973105.112","title":"Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Subadditivity; Partially ordered set; Combinatorics; Bipartite graph; Mathematics; Graph; Discrete mathematics; Matching (statistics); Line graph; Clique-width; Voltage graph","score_opus":0.03013979455064652,"score_gpt":0.26043619659048856,"score_spread":0.23029640203984203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950544775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77824074,0.0007034141,0.21368873,0.002541018,0.0015901994,0.0016580232,0.000026829564,0.00041329252,0.0011377386],"genre_scores_gemma":[0.6293498,0.000181063,0.36943012,0.00029193546,0.0001433256,0.00007270417,0.0001344391,0.000029376857,0.00036721845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777806,0.0001145042,0.00048672527,0.00091335375,0.00046819603,0.00023918066],"domain_scores_gemma":[0.99777365,0.000041408828,0.00039829698,0.001332114,0.00036160322,0.00009293986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043672553,0.00032653467,0.00048544686,0.00037032468,0.000116636395,0.00025635867,0.0009540368,0.00023286649,0.000019394447],"category_scores_gemma":[0.000041495623,0.0002738472,0.0000953893,0.00045982632,0.00009578271,0.0004411836,0.0024125944,0.00048687565,0.000008281518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027835109,0.0008156488,0.00096344127,0.006946958,0.0003738151,0.000023743381,0.013354137,0.00022319742,0.027515365,0.77459824,0.013169509,0.16198811],"study_design_scores_gemma":[0.0008525376,0.00021757204,0.025968553,0.0020605854,0.000090240224,0.000076615856,0.00017289935,0.1201126,0.043686137,0.80414575,0.00079639733,0.0018200886],"about_ca_topic_score_codex":0.0002677778,"about_ca_topic_score_gemma":0.0000027793787,"teacher_disagreement_score":0.16016802,"about_ca_system_score_codex":0.000019295343,"about_ca_system_score_gemma":0.00007217233,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W2950683345","doi":"10.1007/978-3-642-32512-0_10","title":"Approximating Minimum-Cost Connected T-Joins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Rounding; Steiner tree problem; Degree (music); Undirected graph; Mathematics; Discrete mathematics; Graph; Connected dominating set; Computer science; Physics","score_opus":0.031683213939091584,"score_gpt":0.252427819317922,"score_spread":0.22074460537883045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007185571,0.0008816129,0.9873773,0.00053514645,0.0027769718,0.00063248206,0.000012104836,0.00039585435,0.0073166564],"genre_scores_gemma":[0.06895236,0.0000569562,0.9276145,0.0016824829,0.0012417862,0.000029290051,0.00001609653,0.00006510987,0.0003414043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483347,0.000057935027,0.00082976336,0.0017666967,0.0012510881,0.0012610421],"domain_scores_gemma":[0.99599934,0.00086470164,0.0004791261,0.0020164493,0.0002874776,0.00035290828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013391026,0.000756795,0.0007770144,0.0011125946,0.0005315674,0.00077712163,0.004881083,0.00041708088,0.00008002095],"category_scores_gemma":[0.0001795857,0.000725149,0.00023814003,0.0011152384,0.0010278164,0.0010043235,0.0024200159,0.0012995154,0.00013243523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030203923,0.000053272634,0.000040322866,0.00005143563,0.000016185762,0.000051092567,0.0010855122,0.0018217954,0.00013060498,0.094887964,0.000031706895,0.9018271],"study_design_scores_gemma":[0.00042354394,0.00013501059,0.00014463488,0.0005170791,0.00001495475,0.00020171635,4.3307452e-7,0.70517206,0.0012686441,0.2845777,0.006208533,0.001335731],"about_ca_topic_score_codex":0.000022820095,"about_ca_topic_score_gemma":0.000052993262,"teacher_disagreement_score":0.90049136,"about_ca_system_score_codex":0.00028132685,"about_ca_system_score_gemma":0.0004601554,"threshold_uncertainty_score":0.99951994},"labels":[],"label_agreement":null},{"id":"W2950757391","doi":"10.48550/arxiv.1903.11980","title":"Probabilistic Analysis of Facility Location on Random Shortest Path Metrics","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; RWTH Aachen University; Fédération Wallonie-Bruxelles; Deutsche Forschungsgemeinschaft; Freistaat Sachsen; National Foundation for Science and Technology Development","keywords":"Facility location problem; Shortest path problem; Heuristic; Mathematical optimization; Probabilistic logic; Metric (unit); Mathematics; Computer science; Path (computing); Euclidean geometry; Probabilistic analysis of algorithms; Metric space; Euclidean distance; Greedy algorithm; Upper and lower bounds; Combinatorics; Discrete mathematics; Statistics; Artificial intelligence; Engineering","score_opus":0.08636848891975024,"score_gpt":0.2005369723349278,"score_spread":0.11416848341517755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950757391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20147777,0.00004009115,0.7967085,0.00002004906,0.0003574188,0.00038786288,0.00011109236,0.00009854156,0.00079866895],"genre_scores_gemma":[0.9986402,0.000058421938,0.0009714036,0.000025577367,0.00001363376,0.0000010867373,0.000085411004,0.0000049632545,0.00019931293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978284,0.00022643963,0.00032712708,0.0011589462,0.00021297167,0.00024609736],"domain_scores_gemma":[0.99650866,0.00055008463,0.00037978348,0.0020142368,0.0004424844,0.00010473483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005840548,0.0002833321,0.0006844222,0.0012663263,0.00009108711,0.000072646566,0.0017989759,0.00022081126,0.000026417476],"category_scores_gemma":[0.00021571292,0.00030915334,0.00050065276,0.0053914785,0.00014782803,0.00017976247,0.0011004502,0.00045184043,0.000030752864],"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.000041542546,0.00023946777,0.006938095,0.00008755964,0.0005479888,0.00001702053,0.00012871197,0.9063522,0.0000019560139,0.08442591,0.000027200755,0.0011923073],"study_design_scores_gemma":[0.00043733369,0.0000774198,0.014029346,0.00004577409,0.0006573133,2.8248198e-7,0.000021305084,0.96166176,0.000022664535,0.022693682,0.000055517423,0.0002976047],"about_ca_topic_score_codex":0.00022819925,"about_ca_topic_score_gemma":0.00005815531,"teacher_disagreement_score":0.7971624,"about_ca_system_score_codex":0.00020126895,"about_ca_system_score_gemma":0.00020840095,"threshold_uncertainty_score":0.99993604},"labels":[],"label_agreement":null},{"id":"W2950837701","doi":"10.1109/lics.2004.1319620","title":"The strength of replacement in weak arithmetic","year":2004,"lang":"en","type":"article","venue":"","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":"Combinatorics; Sigma; Mathematics; Discrete mathematics; Bounded function; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.014709696871692804,"score_gpt":0.24429171867311833,"score_spread":0.22958202180142553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950837701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08037774,0.0005005657,0.82087356,0.009917296,0.00082574127,0.0004054057,0.0000017644774,0.00016892445,0.08692898],"genre_scores_gemma":[0.9055448,0.000048539714,0.09370481,0.000099480654,0.000014129676,0.000008042543,2.470972e-7,0.0000023699163,0.0005775387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993514,0.00002111956,0.00017486887,0.00014282428,0.00016902354,0.00014077603],"domain_scores_gemma":[0.9994082,0.00009037397,0.000035901103,0.00042098374,0.000021466285,0.000023079185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028354878,0.000050834107,0.000067542336,0.000052879263,0.000068177,0.000040097188,0.00058193534,0.000014345346,0.000009281794],"category_scores_gemma":[0.00002322917,0.00003322526,0.0000322836,0.000348751,0.000064237356,0.00008461039,0.00017647595,0.0000693679,0.000006532836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023153673,0.00007114182,0.00020970148,0.0000023896519,0.0000037899665,0.0000012843191,0.00016184949,0.00012803593,0.000024214041,0.9641509,0.00008752798,0.03515684],"study_design_scores_gemma":[0.002109816,0.0005053383,0.019069193,0.0000821483,0.0000039031383,0.000019232359,0.0005086452,0.05002525,0.013996474,0.8883856,0.02496543,0.00032895597],"about_ca_topic_score_codex":0.00017358852,"about_ca_topic_score_gemma":0.0003042033,"teacher_disagreement_score":0.8251671,"about_ca_system_score_codex":0.000022869317,"about_ca_system_score_gemma":0.00004019032,"threshold_uncertainty_score":0.13548867},"labels":[],"label_agreement":null},{"id":"W2951424111","doi":"10.2168/lmcs-2(1:3)2006","title":"Theories for TC0 and Other Small Complexity Classes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Mathematics; Complexity class; Natural number; Mathematical proof; Discrete mathematics; Bounded function; Polynomial; Isomorphism (crystallography); Boolean function; Function (biology); Class (philosophy); Binary number; Multiplication (music); Algebraic number; Time complexity; Combinatorics; Computer science; Arithmetic","score_opus":0.13670777818402702,"score_gpt":0.3898902504278553,"score_spread":0.2531824722438283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951424111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076152966,0.00014424337,0.98925406,0.0006176208,0.00074074464,0.0002917043,0.0000043931327,0.00017055328,0.0011614081],"genre_scores_gemma":[0.045489464,0.0000031798959,0.95326173,0.0010124176,0.0001807527,0.00002984926,3.4527042e-7,0.0000057676302,0.000016495416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974381,0.00032455137,0.0003797204,0.000972368,0.0002815941,0.0006036711],"domain_scores_gemma":[0.9973901,0.0016849887,0.000101317266,0.0005916973,0.00011304449,0.00011886125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034282126,0.00021983568,0.00033341558,0.0002456983,0.000421317,0.0005747312,0.0019085697,0.00007748901,0.0000061427263],"category_scores_gemma":[0.00017910256,0.00017339729,0.00008127017,0.0012956006,0.0019585586,0.00041250215,0.0011289428,0.00019813467,0.0000018665356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004697639,0.000071744944,0.00085029315,0.00000994532,0.0000013988401,0.0000030634742,0.00009273279,0.00013599069,0.00032333322,0.80551964,0.000012914969,0.19297425],"study_design_scores_gemma":[0.00023290701,0.00011958641,0.012436963,0.000014090989,0.000001311101,0.000020028647,0.000003940998,0.30455488,0.0009988982,0.67966974,0.001758277,0.00018940722],"about_ca_topic_score_codex":0.00008039413,"about_ca_topic_score_gemma":0.00004187601,"teacher_disagreement_score":0.3044189,"about_ca_system_score_codex":0.00003900874,"about_ca_system_score_gemma":0.000065699416,"threshold_uncertainty_score":0.7216391},"labels":[],"label_agreement":null},{"id":"W2951607788","doi":"10.1007/s40305-019-00255-y","title":"A Note on Submodularity Preserved Involving the Rank Functions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Intersection (aeronautics); Rank (graph theory); Computer science; Function (biology); Combinatorics; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.05601398994931464,"score_gpt":0.33576066152842743,"score_spread":0.2797466715791128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951607788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8136194,0.00054921134,0.09077699,0.091619074,0.0012506122,0.00078455993,0.000011826626,0.000020640495,0.0013677359],"genre_scores_gemma":[0.98404557,0.00014191121,0.013666488,0.00023504655,0.0001800302,0.000005600507,4.7493313e-7,0.000006388554,0.0017185038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974127,0.0006149165,0.00034506206,0.00014800375,0.0012380052,0.00024132172],"domain_scores_gemma":[0.99777603,0.00047888418,0.0001030963,0.000875835,0.00070152787,0.00006462298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040797177,0.00008629386,0.00016671793,0.00007956617,0.0011180693,0.0002999102,0.0023413822,0.000055754444,0.00004711562],"category_scores_gemma":[0.00039916908,0.0000458439,0.00047763548,0.0009608922,0.0002624387,0.000587641,0.000609844,0.0012238675,0.000012035529],"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.00021573101,0.002876911,0.008405145,0.00033411387,0.0011366357,0.0000065447216,0.051134553,0.35102662,0.07505989,0.30738497,0.18307397,0.019344926],"study_design_scores_gemma":[0.00110271,0.0005901078,0.07554003,0.00025600448,0.00001635667,0.000038535145,0.00074307027,0.88509053,0.0038585572,0.023860307,0.008739137,0.00016467983],"about_ca_topic_score_codex":0.00014643467,"about_ca_topic_score_gemma":0.0000559292,"teacher_disagreement_score":0.5340639,"about_ca_system_score_codex":0.000086517226,"about_ca_system_score_gemma":0.0003765657,"threshold_uncertainty_score":0.8599398},"labels":[],"label_agreement":null},{"id":"W2951668131","doi":"10.48550/arxiv.1106.3595","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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":"Communication complexity; Computer science; Theoretical computer science; Generalization; Function (biology); Discrete mathematics; Pointer (user interface); Mathematics","score_opus":0.11629711189004634,"score_gpt":0.19422643861284197,"score_spread":0.07792932672279564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951668131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0453584,0.000072445284,0.93728113,0.00007255768,0.00047933045,0.0002938576,0.00001374715,0.00044284988,0.015985657],"genre_scores_gemma":[0.98742944,0.00036240905,0.011692115,0.00015650493,0.000021596179,0.0000016973784,0.00005724311,0.000006556892,0.00027241616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988313,0.00018427624,0.00027633645,0.000364176,0.00009388114,0.00025004425],"domain_scores_gemma":[0.99708104,0.00008868367,0.00040341757,0.0021002814,0.00021333469,0.00011322315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036291103,0.00023133014,0.00026037093,0.00032502454,0.00022847216,0.000192857,0.0031089871,0.00023309789,0.00005487814],"category_scores_gemma":[0.00003549255,0.00027845873,0.00019518871,0.0005173207,0.0001351755,0.0014411949,0.003466146,0.000554609,0.00023859207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015109041,0.00006516769,0.00029676384,0.000049715607,0.000059991155,0.000010871397,0.0013047868,0.007287016,0.000002959535,0.98549277,0.0005756171,0.0048392382],"study_design_scores_gemma":[0.00048617428,0.00003398524,0.0015619898,0.000094628056,0.000039118284,0.0000034183774,0.0001112652,0.35542995,0.00011034812,0.6387686,0.0028712896,0.00048920035],"about_ca_topic_score_codex":0.00034709126,"about_ca_topic_score_gemma":0.000030799107,"teacher_disagreement_score":0.9420711,"about_ca_system_score_codex":0.00010181507,"about_ca_system_score_gemma":0.0001247168,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W2951684049","doi":"10.1002/rsa.20598","title":"Improved bounds for the randomized decision tree Complexity of recursive majority","year":2015,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Decision tree; Computer science; Tree (set theory); Recursive partitioning; Theoretical computer science; Mathematics; Machine learning; Combinatorics","score_opus":0.041386304586397284,"score_gpt":0.2870490232514411,"score_spread":0.24566271866504383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951684049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00511101,0.0030151012,0.98766947,0.0009894739,0.0014944401,0.0014016307,0.00006369272,0.00006879949,0.00018637753],"genre_scores_gemma":[0.37549376,0.00038239406,0.6230624,0.00027986028,0.0005022366,0.0001517627,0.000018605428,0.000023833143,0.00008520904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794,0.00022281421,0.00056938425,0.00048549008,0.00042221582,0.0003600894],"domain_scores_gemma":[0.99575853,0.0027356027,0.0003061967,0.000649792,0.0003610741,0.00018879383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019342538,0.00028364506,0.0009045404,0.00010936021,0.00040040136,0.00023289889,0.0009795751,0.00010939991,0.0000073488713],"category_scores_gemma":[0.00072291953,0.00016873576,0.00038322603,0.00032103187,0.0010167274,0.00026054893,0.00034412794,0.00020891814,3.862754e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.024724184,0.00007127596,0.000017932174,0.000049420178,0.00030260903,0.0000035350022,0.0019332322,0.00009823069,0.00008416204,0.42738676,0.0012821503,0.5440465],"study_design_scores_gemma":[0.11261919,0.00014244395,0.00019312112,0.000016795404,0.00006140623,0.00002792462,0.00010920546,0.27559605,0.00043895643,0.6093004,0.0013074367,0.0001871232],"about_ca_topic_score_codex":0.00026616195,"about_ca_topic_score_gemma":0.00006059196,"teacher_disagreement_score":0.54385936,"about_ca_system_score_codex":0.00002460853,"about_ca_system_score_gemma":0.00009697856,"threshold_uncertainty_score":0.6880844},"labels":[],"label_agreement":null},{"id":"W2951762341","doi":"10.48550/arxiv.1301.2731","title":"A Characterization of Approximation Resistance for Even $k$-Partite CSPs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; University of Toronto; National Science Foundation","keywords":"Constraint satisfaction problem; Conjecture; Characterization (materials science); Predicate (mathematical logic); Mathematics; Combinatorics; Constraint (computer-aided design); Discrete mathematics; Computer science; Physics","score_opus":0.07332870082273674,"score_gpt":0.18630274616892767,"score_spread":0.11297404534619093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951762341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24017312,0.000013960589,0.75842786,0.00009704088,0.0003110612,0.0004944494,0.000046837602,0.00009307355,0.00034256958],"genre_scores_gemma":[0.97777283,0.000056152574,0.02028199,0.000034778794,0.00006347064,0.000008712026,0.0000919587,0.000011512239,0.0016785886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987588,0.00007176888,0.00023591728,0.00064406235,0.00008214695,0.00020731318],"domain_scores_gemma":[0.9982945,0.00007481992,0.0004343979,0.0008422739,0.00028815606,0.000065889726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019267443,0.00018660359,0.00027098772,0.00021014846,0.00010735333,0.00007910566,0.0011374799,0.00016597346,0.000012521079],"category_scores_gemma":[0.000029126852,0.00022534248,0.00017764125,0.00043192817,0.000080872414,0.0004992672,0.00065565814,0.00017634251,0.00001225714],"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.00004012791,0.00013115352,0.00026686356,0.00051625475,0.00007361866,0.0000054217826,0.00046735897,0.004776986,0.003610861,0.9885029,0.00017600984,0.0014323966],"study_design_scores_gemma":[0.00036871457,0.000036601377,0.0024295377,0.00018395149,0.000034410386,5.2370507e-7,0.00001319988,0.71617746,0.002980516,0.27591756,0.0015295454,0.0003279491],"about_ca_topic_score_codex":0.000027588656,"about_ca_topic_score_gemma":0.000021001195,"teacher_disagreement_score":0.7381459,"about_ca_system_score_codex":0.00006769455,"about_ca_system_score_gemma":0.000087887165,"threshold_uncertainty_score":0.9189199},"labels":[],"label_agreement":null},{"id":"W2952164293","doi":"10.48550/arxiv.1204.4526","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Submodular set function; Matroid; Mathematics; Greedy algorithm; Combinatorics; Monotone polygon; Approximation algorithm; Randomized rounding; Rounding; Matroid partitioning; Weighted matroid; Maximization; Discrete mathematics; Constraint (computer-aided design); Function (biology); Algorithm; Mathematical optimization; Computer science; Graphic matroid","score_opus":0.06039290440074062,"score_gpt":0.19785044080560052,"score_spread":0.13745753640485991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952164293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009278133,0.000050447434,0.9842657,0.00017190659,0.0041218516,0.0011394378,0.00013953328,0.0003651734,0.00046781288],"genre_scores_gemma":[0.8105079,0.000039198458,0.18821713,0.00018836497,0.00056837645,0.00001577452,0.000095515745,0.00003993396,0.00032783087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746144,0.00015294734,0.00029851432,0.0012434727,0.00016978511,0.0006738271],"domain_scores_gemma":[0.99758536,0.00016041436,0.00024697278,0.0012862918,0.00033653318,0.00038442636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049105665,0.0004450229,0.0004974445,0.00044531346,0.00030054737,0.0002366459,0.0020738486,0.00036174193,0.00003479825],"category_scores_gemma":[0.000044484474,0.00054396584,0.00040177396,0.00078529416,0.00014411965,0.00040161135,0.0018846958,0.00047001324,0.000060077236],"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.000048364094,0.00032594585,0.00023707314,0.00010839323,0.0001821971,0.00009256843,0.00046011846,0.01680616,0.000029346294,0.96061206,0.0007949627,0.020302787],"study_design_scores_gemma":[0.0012239367,0.0001399913,0.00026230427,0.00008157156,0.00009573723,0.000014495215,0.00003850655,0.74278975,0.0002855731,0.24991192,0.00434713,0.0008090962],"about_ca_topic_score_codex":0.00009535429,"about_ca_topic_score_gemma":0.000013969789,"teacher_disagreement_score":0.8012297,"about_ca_system_score_codex":0.00027906278,"about_ca_system_score_gemma":0.0002556701,"threshold_uncertainty_score":0.9997012},"labels":[],"label_agreement":null},{"id":"W2952270608","doi":"","title":"Separating OR, SUM, and XOR Circuits","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Monotone polygon; Electronic circuit; Boolean circuit; Corollary; Discrete mathematics; Modulo; Rewriting; Combinatorics; Circuit complexity; Boolean function; Arithmetic; Computer science","score_opus":0.11889906994911413,"score_gpt":0.20505596337945128,"score_spread":0.08615689343033715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952270608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44887882,0.00016281224,0.5439471,0.00014506558,0.0008522237,0.00037553848,0.000013964366,0.00040633013,0.0052181785],"genre_scores_gemma":[0.9920037,0.00018105119,0.0048887227,0.0001340492,0.00008822203,0.0000013469927,0.000005461312,0.000013161107,0.002684301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981391,0.00010912252,0.00018455637,0.0011024654,0.00009313303,0.00037162157],"domain_scores_gemma":[0.9982956,0.00017239118,0.00018694627,0.0010231341,0.00012169352,0.00020021379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018754987,0.00030648243,0.00032759714,0.000231206,0.00026741074,0.0003297131,0.0015876744,0.00023200104,0.000072934956],"category_scores_gemma":[0.000033435008,0.0003195059,0.00012769173,0.0005078003,0.00016652222,0.0005038566,0.0030090099,0.0005697435,0.00008554696],"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.000013670762,0.00016429026,0.0032140368,0.00028319086,0.00021207488,0.00083138957,0.0012180924,0.015415089,0.00006161127,0.94604385,0.0019931581,0.030549565],"study_design_scores_gemma":[0.00044101806,0.00007503178,0.0021931974,0.00014857348,0.000039553088,0.000029641571,0.00007893275,0.8081594,0.000070460235,0.18615328,0.0019118974,0.00069897954],"about_ca_topic_score_codex":0.00025072956,"about_ca_topic_score_gemma":0.00007649312,"teacher_disagreement_score":0.79274434,"about_ca_system_score_codex":0.000068392525,"about_ca_system_score_gemma":0.0001464419,"threshold_uncertainty_score":0.9999257},"labels":[],"label_agreement":null},{"id":"W2952406394","doi":"10.48550/arxiv.1204.5508","title":"Relativizing Small Complexity Classes and their Theories","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Toronto","funders":"","keywords":"Oracle; Bounded function; Stack (abstract data type); Hierarchy; Class (philosophy); P; Function (biology); Mathematics; Limit (mathematics); Combinatorics; Constant (computer programming); Discrete mathematics; Zero (linguistics); Complexity class; Pure mathematics; Computer science; Time complexity; Mathematical analysis","score_opus":0.1537423186904452,"score_gpt":0.19774910077712748,"score_spread":0.044006782086682295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952406394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18257535,0.00051600795,0.8086431,0.00017123217,0.0007679225,0.00021967298,0.000029227898,0.00038081824,0.00669665],"genre_scores_gemma":[0.9878784,0.00024274482,0.0112594925,0.000088973975,0.00012094001,8.5867606e-7,0.000010972074,0.000016089884,0.00038152968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803007,0.00025749448,0.00019867544,0.0009743427,0.00006527024,0.00047416103],"domain_scores_gemma":[0.99785477,0.0003940145,0.0002338106,0.001193572,0.00011229787,0.00021153022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041488695,0.00041467993,0.0004282674,0.00022187979,0.00041920127,0.00024111655,0.0016396028,0.00026765163,0.000023311384],"category_scores_gemma":[0.000036452435,0.00041164507,0.00020283545,0.0004513139,0.00061455864,0.00052616885,0.004419524,0.00083613495,0.000021499824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092246755,0.00006297296,0.0038917332,0.00006510063,0.00008175897,0.000027646118,0.0010143205,0.0007762696,0.000009935153,0.99146676,0.000030939504,0.0025633522],"study_design_scores_gemma":[0.0002203786,0.000026181919,0.0057787835,0.00009152573,0.00003141584,0.000012885388,0.00021407213,0.12859568,0.000090527945,0.8632973,0.0011312921,0.000509984],"about_ca_topic_score_codex":0.00014586122,"about_ca_topic_score_gemma":0.00011610791,"teacher_disagreement_score":0.80530304,"about_ca_system_score_codex":0.00008387928,"about_ca_system_score_gemma":0.00009693296,"threshold_uncertainty_score":0.9998335},"labels":[],"label_agreement":null},{"id":"W2952497380","doi":"10.4230/lipics.itcs.2020.6","title":"Local max-cut in smoothed polynomial time","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Blavatnik Family Foundation; Israel Science Foundation; Microsoft Research","keywords":"Mathematical proof; Mathematics; Bounded function; Polynomial; Time complexity; Combinatorics; Applied mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.04791971121089802,"score_gpt":0.17871762462540225,"score_spread":0.13079791341450422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952497380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09094866,0.000043874592,0.8936153,0.00039381484,0.0009224107,0.00028560395,0.000029679399,0.0003268764,0.013433759],"genre_scores_gemma":[0.9949743,0.00003984073,0.0012313129,0.000121693796,0.00011170574,9.4426923e-7,0.000006441604,0.000018090122,0.0034956527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977103,0.00017471654,0.00024414848,0.001239333,0.00011619799,0.0005153025],"domain_scores_gemma":[0.99805087,0.00014446263,0.000172451,0.0013832645,0.00007036629,0.00017856843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002751482,0.00035414918,0.00041611894,0.0005080867,0.000109998844,0.00010701606,0.002821122,0.00034650514,0.00012772567],"category_scores_gemma":[0.000017394348,0.00037051676,0.0002635313,0.00060792995,0.00029581628,0.00035241773,0.0031759809,0.00061323517,0.00052284816],"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.00031412215,0.0008656555,0.0063431533,0.00018552922,0.00034107303,0.004368014,0.0009680123,0.042085655,0.00029228147,0.8842606,0.007641996,0.052333895],"study_design_scores_gemma":[0.0015015054,0.00008419675,0.0037600882,0.00026677002,0.000028644348,0.000014550782,0.000026061096,0.6899126,0.0003538747,0.29914013,0.0038581453,0.0010534215],"about_ca_topic_score_codex":0.00022910774,"about_ca_topic_score_gemma":0.00012876843,"teacher_disagreement_score":0.9040257,"about_ca_system_score_codex":0.000303471,"about_ca_system_score_gemma":0.00024776894,"threshold_uncertainty_score":0.99987465},"labels":[],"label_agreement":null},{"id":"W2952920300","doi":"10.1145/3013516","title":"Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","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":"Université de Montréal","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Upper and lower bounds; Sublinear function; Branching (polymer chemistry); Computation; Boolean function","score_opus":0.03216755379160711,"score_gpt":0.3231520444204931,"score_spread":0.290984490628886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952920300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038340114,0.000014766007,0.9604437,0.0003656574,0.0003428026,0.00013000579,0.000012026863,0.000114745395,0.00023618307],"genre_scores_gemma":[0.78052104,0.000008279434,0.21925849,0.00010227093,0.000021507414,0.0000071099803,0.0000015120542,0.000008108087,0.000071689596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998873,0.00014337974,0.00029223535,0.00032790855,0.00021053846,0.00015291575],"domain_scores_gemma":[0.99820215,0.0009949587,0.00013125401,0.0004927993,0.00009768893,0.00008115031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059193163,0.00013372184,0.0001523156,0.00022771905,0.00019448559,0.000064661384,0.0003934183,0.000067767076,0.00005567747],"category_scores_gemma":[0.000025479965,0.00010615674,0.00007728391,0.00021157878,0.00008543737,0.00088119996,0.000015494978,0.00009185685,0.0000096816675],"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.00003776724,0.0001343848,0.000006244747,0.00000920945,0.00002117682,0.0000019494014,0.0004559146,0.0012662485,0.0017280403,0.06569683,0.0000037754746,0.9306385],"study_design_scores_gemma":[0.0008648668,0.00047717316,0.005645551,0.000056730478,0.000020744043,0.000023016699,0.000053575706,0.05374703,0.010461002,0.9282351,0.0001623681,0.00025279843],"about_ca_topic_score_codex":0.000008862082,"about_ca_topic_score_gemma":0.000006507683,"teacher_disagreement_score":0.93038565,"about_ca_system_score_codex":0.000021680777,"about_ca_system_score_gemma":0.000037742717,"threshold_uncertainty_score":0.43289462},"labels":[],"label_agreement":null},{"id":"W2953059252","doi":"10.48550/arxiv.1308.2617","title":"Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Nanyang Technological University; McGill University; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; National Science Foundation","keywords":"Exponential time hypothesis; Combinatorics; Parameterized complexity; Hypergraph; Mathematics; Bipartite graph; Bounded function; Hardness of approximation; Upper and lower bounds; Approximation algorithm; Matching (statistics); Time complexity; Constant (computer programming); Discrete mathematics; Independent set; Vertex cover; Graph","score_opus":0.06756875288534187,"score_gpt":0.1935105022347591,"score_spread":0.12594174934941724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953059252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6505227,0.000036392015,0.34797505,0.00010519182,0.00039457754,0.0002932034,0.000007651519,0.00017368405,0.0004915299],"genre_scores_gemma":[0.9953236,0.00010704478,0.0038422388,0.000043201933,0.00006904312,0.0000028523784,0.000017695336,0.000013139143,0.00058118074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831843,0.00013282536,0.00019622697,0.0009718446,0.00011844348,0.000262229],"domain_scores_gemma":[0.9987542,0.000100003504,0.00022883485,0.0006219209,0.00012638416,0.00016864031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020723794,0.00029440518,0.0003033325,0.00036046968,0.0003830775,0.0004187129,0.0006883668,0.00025897316,0.000049924758],"category_scores_gemma":[0.000018768884,0.00033340335,0.00008416481,0.00034024144,0.00012250332,0.0006729254,0.0021628088,0.00055067026,0.00003799863],"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.00003870672,0.00036917484,0.0030615337,0.00050887483,0.00040692076,0.00017780665,0.005178043,0.009077152,0.002386745,0.9723891,0.00066394615,0.0057419706],"study_design_scores_gemma":[0.000746264,0.00008347944,0.0076447646,0.00015394682,0.00009881161,0.000046730936,0.00020270752,0.64042497,0.00048539994,0.3489551,0.00039685334,0.00076099415],"about_ca_topic_score_codex":0.00046437874,"about_ca_topic_score_gemma":0.000030491645,"teacher_disagreement_score":0.63134784,"about_ca_system_score_codex":0.00007250129,"about_ca_system_score_gemma":0.00008955993,"threshold_uncertainty_score":0.9999118},"labels":[],"label_agreement":null},{"id":"W2953316317","doi":"10.48550/arxiv.1302.2127","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Undirected graph; Graph; Approximation algorithm; Node (physics); Tree (set theory); Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.07647743396466734,"score_gpt":0.21161926812160353,"score_spread":0.1351418341569362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953316317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03875178,0.000033445307,0.9571442,0.00012539078,0.000959597,0.0011004411,0.00005202204,0.00055015745,0.0012829459],"genre_scores_gemma":[0.43390125,0.000051087718,0.5626625,0.00017723996,0.00036924536,0.000027418953,0.00014872439,0.00005403535,0.002608507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970867,0.00020186113,0.00036040752,0.0015949346,0.00016840933,0.0005876996],"domain_scores_gemma":[0.9970031,0.0002432623,0.00043102764,0.0016029557,0.0004687465,0.00025093945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041694698,0.00047785952,0.00050599955,0.00052172603,0.0005361684,0.0004395218,0.0025573415,0.0004152763,0.000039787967],"category_scores_gemma":[0.000032957814,0.00054580986,0.00033208277,0.0010263582,0.00013511389,0.00094552187,0.0012738637,0.0005936085,0.00003777332],"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.000081555154,0.0013374727,0.0007185909,0.0004908017,0.0006465783,0.00018490973,0.0021715884,0.05136395,0.0004925105,0.64036435,0.0026699905,0.29947773],"study_design_scores_gemma":[0.00079433183,0.000121942714,0.00023327279,0.00006750425,0.000054330405,0.0000048666266,0.0000798274,0.8553624,0.00033076757,0.1417882,0.0005886979,0.000573859],"about_ca_topic_score_codex":0.0002450323,"about_ca_topic_score_gemma":0.000054952125,"teacher_disagreement_score":0.8039985,"about_ca_system_score_codex":0.00024981142,"about_ca_system_score_gemma":0.00023296397,"threshold_uncertainty_score":0.99969935},"labels":[],"label_agreement":null},{"id":"W2957416585","doi":"10.1109/focs.2019.00021","title":"Approximating Constraint Satisfaction Problems on High-Dimensional Expanders","year":2019,"lang":"en","type":"preprint","venue":"","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; University of Chicago; National Science Foundation","keywords":"Combinatorics; Arity; Constraint satisfaction problem; Mathematics; Hypergraph; Rank (graph theory); Expander graph; Constraint (computer-aided design); Degree (music); Measure (data warehouse); Discrete mathematics; Parameterized complexity; Computer science; Physics; Graph","score_opus":0.03487265559203002,"score_gpt":0.2509935924655586,"score_spread":0.21612093687352857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957416585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03121597,0.000038631497,0.9540576,0.0010751706,0.0034492034,0.0008422694,0.000015554166,0.00060553197,0.008700123],"genre_scores_gemma":[0.75276625,0.000006449306,0.24633068,0.00047986122,0.000105717394,0.000050507704,0.00002619594,0.0000147478295,0.00021961969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974999,0.00009698285,0.00045879756,0.0009667855,0.00062560575,0.0003519648],"domain_scores_gemma":[0.9982941,0.00019974698,0.00028907743,0.0010206285,0.00009905359,0.00009737825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043211336,0.00035232608,0.0003842452,0.00022950707,0.00016758317,0.00033678405,0.0007565944,0.00024917317,0.00013165362],"category_scores_gemma":[0.000029454977,0.00031582967,0.00017953961,0.00016149596,0.000103024366,0.00018332123,0.0013584662,0.00087906065,0.00014650406],"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.000007855597,0.00015038128,0.00041984583,0.0003182039,0.00013648014,0.000010978618,0.0005829903,0.14733337,0.00021780236,0.5908868,0.001622153,0.25831318],"study_design_scores_gemma":[0.00049827265,0.0001402451,0.0029815796,0.00047634036,0.000010657636,0.000026982592,0.000046820645,0.7739631,0.00056227035,0.2204323,0.00015743407,0.0007039885],"about_ca_topic_score_codex":0.00041370632,"about_ca_topic_score_gemma":0.00003110505,"teacher_disagreement_score":0.7215502,"about_ca_system_score_codex":0.00011177087,"about_ca_system_score_gemma":0.0001977483,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W2960183494","doi":"10.1007/978-3-030-25005-8_31","title":"Maximum Clique Exhaustive Search in Circulant k-Hypergraphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Clique; Circulant matrix; Computer science; Enhanced Data Rates for GSM Evolution; Pruning; Clique problem; Necklace; Combinatorics; Hypergraph; Algorithm; Binary number; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Arithmetic","score_opus":0.02460252876132622,"score_gpt":0.25770618981072924,"score_spread":0.23310366104940303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960183494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048812333,0.0005548349,0.98810226,0.00077280466,0.002364427,0.0007139048,0.000010912735,0.00016378125,0.0068289735],"genre_scores_gemma":[0.46687737,0.00036461517,0.52717954,0.0036205794,0.00082882046,0.000031731222,0.000021864647,0.0001220822,0.00095340115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410087,0.00007300393,0.0007294884,0.0024209674,0.0014698217,0.0012058385],"domain_scores_gemma":[0.9965665,0.0005906224,0.0002145464,0.0021143446,0.00028121937,0.0002327899],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015349374,0.0007304975,0.0008660584,0.0023455517,0.00022614599,0.000582476,0.005411704,0.0005053627,0.000045079254],"category_scores_gemma":[0.000051776562,0.0007042629,0.00025824577,0.0017021231,0.001042591,0.00070502004,0.002567983,0.002000456,0.0001385573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000188463,0.00012846422,0.001216648,0.00014076241,0.000029705798,0.0007361816,0.0019989312,0.042789,0.00016703093,0.19939665,0.000028690403,0.75334907],"study_design_scores_gemma":[0.0005888621,0.00029548234,0.0020158524,0.0008298939,0.000006175169,0.00018297072,8.4338325e-7,0.4856455,0.000623194,0.5072906,0.001269271,0.0012513656],"about_ca_topic_score_codex":0.00014087062,"about_ca_topic_score_gemma":0.00024980077,"teacher_disagreement_score":0.7520977,"about_ca_system_score_codex":0.00044959178,"about_ca_system_score_gemma":0.0012052149,"threshold_uncertainty_score":0.9999695},"labels":[],"label_agreement":null},{"id":"W2962731772","doi":"10.1145/2984450.2984455","title":"Algebraic proof complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"Mathematical proof; Proof complexity; Algebraic number; Mathematics; Circuit complexity; Upper and lower bounds; Connection (principal bundle); Discrete mathematics; Algebraic number theory; Polynomial; Computer science; Algebra over a field; Pure mathematics; Electronic circuit","score_opus":0.057058056298150514,"score_gpt":0.2720437758751473,"score_spread":0.21498571957699675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962731772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026791489,0.00023271589,0.92784226,0.03141686,0.0013301241,0.00040887008,0.000015761298,0.00073751825,0.011224412],"genre_scores_gemma":[0.7996475,0.000035179,0.19554926,0.002635543,0.00035623755,0.00004318518,0.0000030893282,0.000020607325,0.0017093667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984026,0.000090514564,0.00025218408,0.0005234629,0.00029514794,0.00043606682],"domain_scores_gemma":[0.99760026,0.00032284632,0.00008813331,0.0017731246,0.00006660753,0.00014904518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021403813,0.00018107775,0.00020841675,0.00010251591,0.00017972192,0.00010094082,0.002688618,0.00006773772,0.00020271912],"category_scores_gemma":[0.0002781397,0.00012134632,0.00011894014,0.00041814742,0.00022937998,0.0005361457,0.0011574378,0.00011048956,0.00041803543],"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.0000052906466,0.000095252675,0.00202492,0.000007761511,0.000020077636,0.000020376374,0.00017040962,5.754468e-7,0.0020424495,0.46271622,0.01571061,0.51718605],"study_design_scores_gemma":[0.00064684736,0.00014156605,0.009464577,0.00003574492,0.0000045880156,0.000039084614,0.000009266736,0.00059300486,0.0055411183,0.89455986,0.08860291,0.00036141605],"about_ca_topic_score_codex":0.00006351264,"about_ca_topic_score_gemma":0.000095940915,"teacher_disagreement_score":0.77285606,"about_ca_system_score_codex":0.00003812105,"about_ca_system_score_gemma":0.000058842754,"threshold_uncertainty_score":0.53731394},"labels":[],"label_agreement":null},{"id":"W2962832012","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift &amp; 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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.141915,0.000076612916,0.81657964,0.0017226948,0.0067067402,0.0033973956,0.00030124438,0.00071930315,0.028581375],"genre_scores_gemma":[0.98487544,0.00002327193,0.010034484,0.0030505476,0.0005490531,0.0002960681,0.000121658624,0.00005049164,0.0009989787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968169,0.00012390716,0.00096259575,0.0003742654,0.0008022301,0.0009201425],"domain_scores_gemma":[0.99713355,0.0005800728,0.00040384682,0.0015135327,0.00020179425,0.0001671929],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014151735,0.00044973576,0.0004588788,0.00025637101,0.00093719736,0.0011498694,0.0021736878,0.000179515,0.000028239481],"category_scores_gemma":[0.00023870898,0.00031167318,0.00031439462,0.00048500515,0.00017217087,0.0013617073,0.00061858434,0.0005731788,0.00056780624],"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.00020340446,0.0006829305,0.002205654,0.0008397796,0.00037678197,0.0000048686643,0.020562628,0.0013641049,0.00005810022,0.86528856,0.06186861,0.046544585],"study_design_scores_gemma":[0.00108737,0.00031199006,0.00016041005,0.00019506297,0.000018760516,0.000050366474,0.00030552686,0.5071486,0.00023072923,0.0010149868,0.48901272,0.00046348342],"about_ca_topic_score_codex":0.00005766367,"about_ca_topic_score_gemma":0.0000112225935,"teacher_disagreement_score":0.86427355,"about_ca_system_score_codex":0.00009534596,"about_ca_system_score_gemma":0.000106555024,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2962852933","doi":"10.5539/cis.v12n3p81","title":"Modeling the Parallelization of the Edmonds-Karp Algorithm and Application","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Maximum flow problem; Algorithm; Computation; Minimum cut; Maximum cut; Graph; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.008319934742299261,"score_gpt":0.21917534822446408,"score_spread":0.21085541348216483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962852933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026456133,0.00003634236,0.9720054,0.00054457283,0.00025222934,0.00020535913,9.700443e-7,0.00002323007,0.00047574542],"genre_scores_gemma":[0.9418949,0.000047310386,0.057352528,0.0006687132,0.000023143863,0.0000056482127,0.0000010049628,0.0000010736773,0.0000056727367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921525,0.000017663886,0.0002039792,0.00013493474,0.0003174721,0.000110700385],"domain_scores_gemma":[0.9993058,0.000033380635,0.00009030678,0.00037623907,0.00016292185,0.000031370942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051141187,0.00006172802,0.00006553808,0.000089022775,0.00032687257,0.0002689843,0.00075975026,0.000018662951,8.6416543e-7],"category_scores_gemma":[0.000009030425,0.00003622486,0.000019214367,0.000713667,0.00021941519,0.0035932641,0.00053734134,0.00006577808,0.000004830046],"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":[8.609908e-7,0.0000074059735,0.00044023767,0.000017871762,0.0000022690174,1.1744129e-8,0.0027524573,0.025290627,0.000067391025,0.27879223,0.000031674204,0.692597],"study_design_scores_gemma":[0.000100894715,0.000016639156,0.0063996115,0.000010318644,0.0000010195365,0.000007605988,0.000038801252,0.98794925,0.000118842996,0.0042668893,0.0010376511,0.000052465228],"about_ca_topic_score_codex":0.000013041436,"about_ca_topic_score_gemma":3.603145e-7,"teacher_disagreement_score":0.96265864,"about_ca_system_score_codex":0.000008602095,"about_ca_system_score_gemma":0.000045533587,"threshold_uncertainty_score":0.26050296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1582344,0.000023286188,0.83732873,0.00023234256,0.0010897459,0.0007283602,0.00011901403,0.00024490998,0.0019991864],"genre_scores_gemma":[0.4957594,0.00001705956,0.50321835,0.00060692104,0.00016730433,0.00006825552,0.00008411692,0.000034399072,0.000044202356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971889,0.00005426996,0.0010564885,0.00038873954,0.0004907754,0.0008208216],"domain_scores_gemma":[0.9965937,0.00015370504,0.00095536053,0.0018016739,0.00027510355,0.00022046143],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007965812,0.00043285458,0.00049411785,0.00035961103,0.0018325464,0.0021674274,0.0026027097,0.0002061454,0.000013027076],"category_scores_gemma":[0.00013353847,0.0004125692,0.00039088124,0.00022457709,0.00028218285,0.00423251,0.0010646152,0.00044242368,0.000031496565],"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.00029378358,0.0026683582,0.03784581,0.0052360133,0.0014082398,0.00009481721,0.04900193,0.003206762,0.0031726412,0.4046797,0.004351717,0.48804024],"study_design_scores_gemma":[0.0021469358,0.00017012033,0.002109928,0.00056300045,0.0000400123,0.00014392848,0.00034541928,0.956163,0.0048702154,0.028882567,0.0036182487,0.00094662956],"about_ca_topic_score_codex":0.00004766012,"about_ca_topic_score_gemma":0.00001652929,"teacher_disagreement_score":0.95295626,"about_ca_system_score_codex":0.00010172894,"about_ca_system_score_gemma":0.0000702415,"threshold_uncertainty_score":0.99983263},"labels":[],"label_agreement":null},{"id":"W2963142939","doi":"","title":"Tight Approximation Results for General Covering Integer Programs","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"McMaster University","funders":"","keywords":"Rounding; Combinatorics; Linear programming relaxation; Multiplicative function; Mathematics; Approximation algorithm; Integer (computer science); Upper and lower bounds; Discrete mathematics; Multiplicity (mathematics); Binary logarithm; Cover (algebra); Linear programming; Algorithm; Computer science","score_opus":0.11593665052495218,"score_gpt":0.18446464519539707,"score_spread":0.06852799467044489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963142939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05783258,0.000017158345,0.93669397,0.00016845779,0.00025387932,0.00025036364,0.0000058564365,0.00021852892,0.004559193],"genre_scores_gemma":[0.9693697,0.00001497888,0.028173482,0.000071363815,0.00007607933,0.000001873753,0.000009315317,0.000006400507,0.0022767736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990485,0.000031540232,0.00013009463,0.00046944013,0.000059039416,0.0002614162],"domain_scores_gemma":[0.9992799,0.00005701983,0.00008080446,0.0004342194,0.00006627234,0.00008177432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001430385,0.00012001855,0.00011302813,0.000113507085,0.00019279677,0.000101823425,0.0006474954,0.00005643262,0.000010250976],"category_scores_gemma":[0.000020299196,0.00013042091,0.000108312954,0.0005779739,0.00006201726,0.00060590554,0.00017055946,0.0000953351,0.00004035019],"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.000029442093,0.00016715527,0.00023176926,0.000022240638,0.000029100967,0.000031583037,0.0005208181,0.0058686226,0.00004342227,0.97157794,0.0009855976,0.020492308],"study_design_scores_gemma":[0.0007487041,0.00009854774,0.00018822937,0.000015159384,0.000007740762,0.0000035321582,0.000016018028,0.94775033,0.00020622737,0.042447172,0.008336001,0.00018235378],"about_ca_topic_score_codex":0.000019255,"about_ca_topic_score_gemma":0.000012732271,"teacher_disagreement_score":0.9418817,"about_ca_system_score_codex":0.000055883138,"about_ca_system_score_gemma":0.000009876317,"threshold_uncertainty_score":0.5318411},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019836044,0.000043302905,0.97084224,0.00061903725,0.0010730244,0.0010841242,0.00013554543,0.0010599173,0.0053067794],"genre_scores_gemma":[0.42872733,0.000032413885,0.56826735,0.0008410543,0.00038455456,0.00037881732,0.000116845935,0.00008975038,0.0011619139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963069,0.00006004211,0.0014061109,0.00046344486,0.0006720675,0.0010914434],"domain_scores_gemma":[0.9972976,0.00034401505,0.0006039109,0.0011522238,0.0003316218,0.00027063242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008410525,0.0005025861,0.0005517677,0.0003887255,0.00054934376,0.0005445779,0.0019079616,0.00020355398,0.000038699185],"category_scores_gemma":[0.00016707624,0.00035728363,0.00033377137,0.0006586308,0.00017045974,0.0028627366,0.0008526907,0.00032162122,0.00015455717],"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.00007793717,0.0007698891,0.003536782,0.0012351446,0.0004646193,0.000014363358,0.0166173,0.00033084545,0.0023221977,0.07467748,0.0057409764,0.8942125],"study_design_scores_gemma":[0.0045278366,0.00036954752,0.0004997989,0.00075131695,0.000035681733,0.00013289173,0.00028431995,0.9186072,0.0030156802,0.017505452,0.05302197,0.0012483228],"about_ca_topic_score_codex":0.000013533623,"about_ca_topic_score_gemma":0.000017830751,"teacher_disagreement_score":0.9182763,"about_ca_system_score_codex":0.00013977973,"about_ca_system_score_gemma":0.00006197705,"threshold_uncertainty_score":0.99988794},"labels":[],"label_agreement":null},{"id":"W2963428578","doi":"10.1007/s00453-016-0270-4","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Linear programming relaxation; Mathematics; Relaxation (psychology); Combinatorics; Approximation algorithm; Tree (set theory); Type (biology); Integer programming; Discrete mathematics; Algorithm","score_opus":0.03793119707476595,"score_gpt":0.2855363821876297,"score_spread":0.24760518511286378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963428578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013092515,0.00021570658,0.9745067,0.001434364,0.0015727873,0.00060286315,0.000016340375,0.0003808224,0.008177936],"genre_scores_gemma":[0.28152823,0.00007861943,0.7157683,0.000444743,0.0009443607,0.00024780587,0.000027473421,0.000043980053,0.00091653585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980791,0.00008520246,0.00037832928,0.00064179057,0.0003899976,0.00042553278],"domain_scores_gemma":[0.9981139,0.00011203418,0.0003507387,0.0012108876,0.00008951643,0.00012294287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043964098,0.0002441303,0.00028368266,0.00014484953,0.001274393,0.0008981061,0.0014895607,0.000092041264,0.000013934519],"category_scores_gemma":[0.00005608294,0.00023480893,0.00009489994,0.00019167215,0.00021297431,0.0011487685,0.00076454063,0.0002313544,0.000039297982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039523748,0.00008169811,0.000277073,0.000030684496,0.00004210726,0.000030307483,0.0006609777,0.0000012594218,0.00021420614,0.036734372,0.00059766433,0.9613257],"study_design_scores_gemma":[0.0018695837,0.00024677807,0.00911468,0.00015001166,0.000058092573,0.00018666951,0.00024637082,0.9021272,0.004755171,0.06335167,0.016839894,0.0010539049],"about_ca_topic_score_codex":0.00019819355,"about_ca_topic_score_gemma":0.000031618245,"teacher_disagreement_score":0.9602718,"about_ca_system_score_codex":0.000035203404,"about_ca_system_score_gemma":0.000052350533,"threshold_uncertainty_score":0.98017293},"labels":[],"label_agreement":null},{"id":"W2963453098","doi":"10.26421/qic16.9-10-7","title":"Optimal bounds on functions of quantum states under quantum channels","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","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":"University of Waterloo; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Unitary state; Quantum channel; Quantum capacity; Quantum; Quantum relative entropy; Quantum operation; Amplitude damping channel; Quantum state; Quantum discord; Quantum information; Quantum mechanics; Physics; Quantum network; Quantum entanglement; Quantum dynamics","score_opus":0.02441186057763021,"score_gpt":0.2592676610873413,"score_spread":0.23485580050971108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15075044,0.00002877404,0.8465825,0.0013802638,0.00071516907,0.00014377864,0.000020952652,0.00015515312,0.00022299371],"genre_scores_gemma":[0.99638367,0.000052961197,0.0031143036,0.0003100124,0.000034650595,0.000014444766,0.000043112053,0.000005962942,0.00004089886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985982,0.00006387912,0.00053283054,0.00019785723,0.00036993352,0.00023727491],"domain_scores_gemma":[0.9988876,0.0002461778,0.00029673186,0.00023674667,0.0002370079,0.00009573683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003128705,0.00017423472,0.000188881,0.0003803611,0.00026000116,0.00021650651,0.00025457796,0.0000702005,0.000022970826],"category_scores_gemma":[0.000032748212,0.00013230814,0.00007203436,0.00041783415,0.00012813942,0.0020877416,0.00010252538,0.00009316325,0.00012364844],"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.0000415396,0.00008794906,0.000047590358,0.00005421605,0.00002725863,5.227718e-7,0.0012758448,0.020049475,0.000070017006,0.91891146,0.0012454994,0.05818865],"study_design_scores_gemma":[0.00069860055,0.00051801983,0.0020326125,0.00009510595,0.0000059274485,0.000012445154,0.00043535032,0.90520626,0.00023780322,0.08823558,0.0023188961,0.00020337121],"about_ca_topic_score_codex":0.000030534582,"about_ca_topic_score_gemma":0.0000010741971,"teacher_disagreement_score":0.8851568,"about_ca_system_score_codex":0.00003864515,"about_ca_system_score_gemma":0.00006314036,"threshold_uncertainty_score":0.5395369},"labels":[],"label_agreement":null},{"id":"W2963480423","doi":"10.1007/s40305-019-00260-1","title":"Approximation Algorithms for Vertex Happiness","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; China Scholarship Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Hypergraph; Vertex (graph theory); Approximation algorithm; Inverse; Upper and lower bounds; Mathematics; Linear programming relaxation; Physics; Discrete mathematics; Graph; Algorithm; Linear programming; Mathematical analysis","score_opus":0.06820800589132216,"score_gpt":0.3611336697797232,"score_spread":0.2929256638884011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963480423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08253057,0.00024936456,0.8979488,0.017195644,0.00088924915,0.00071383535,0.0000102486,0.0000114700315,0.00045081944],"genre_scores_gemma":[0.5361577,0.00012824805,0.46164823,0.00013808615,0.00022660891,0.0000171519,0.0000020261903,0.000010827723,0.0016710933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983616,0.00016045093,0.0003495664,0.00012472527,0.0008058182,0.00019784301],"domain_scores_gemma":[0.9982214,0.0002124293,0.00010470798,0.00042602967,0.000983654,0.000051796684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025961983,0.000070896516,0.00017489807,0.00008613673,0.00042474564,0.00017621784,0.001482557,0.00005020203,0.00001699332],"category_scores_gemma":[0.0001769186,0.000046156838,0.0003778102,0.00067965424,0.00013546368,0.000682252,0.00026731053,0.00038027967,0.0000035726985],"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.00009186992,0.0017195159,0.00078907923,0.0008311611,0.0007706267,0.0000014486826,0.028507335,0.08806143,0.06800262,0.5606829,0.0993642,0.15117785],"study_design_scores_gemma":[0.00067131297,0.00023164366,0.0027009498,0.000098482815,0.000005221534,0.00002083143,0.00026990936,0.958759,0.004465964,0.029459385,0.003242755,0.000074543386],"about_ca_topic_score_codex":0.000021844395,"about_ca_topic_score_gemma":0.00000298664,"teacher_disagreement_score":0.87069756,"about_ca_system_score_codex":0.00006223299,"about_ca_system_score_gemma":0.00029926162,"threshold_uncertainty_score":0.3266843},"labels":[],"label_agreement":null},{"id":"W2963521484","doi":"","title":"On the Reducibility of Submodular Functions","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","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 Alberta","funders":"","keywords":"Submodular set function; Scalability; Mathematical optimization; Usability; Computer science; Perturbation (astronomy); Optimization problem; Mathematics","score_opus":0.1532288713078988,"score_gpt":0.3317812565828719,"score_spread":0.17855238527497308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963521484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007306006,0.000004383073,0.9804753,0.007422011,0.0006339787,0.00008644837,0.00018455413,0.000023558856,0.003863768],"genre_scores_gemma":[0.9909254,0.000050207622,0.008521056,0.00019812844,0.00004334339,0.0000089720215,0.0000030558842,0.0000030432955,0.00024684405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.0000809977,0.00028775734,0.0002982993,0.00033008662,0.00012656096],"domain_scores_gemma":[0.99805,0.0011214287,0.00009889346,0.00037551325,0.0003066368,0.000047538913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038938204,0.00010067509,0.00009927182,0.00008549402,0.00012020831,0.00009297356,0.0005972759,0.00003146265,0.00042436484],"category_scores_gemma":[0.0007304926,0.000059270547,0.000034778925,0.00012195433,0.0003343026,0.00011077611,0.00009998847,0.0000977831,0.00008166711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022682294,0.000065140746,0.000017679598,0.0000012302355,0.000010611856,0.0000016918733,0.00009806718,0.000012367337,0.00070141646,0.7749533,0.00025196798,0.22386386],"study_design_scores_gemma":[0.000018195791,0.00018478966,0.0003690553,0.000045061628,0.0000024781764,0.0000029229468,0.00010197117,0.04886131,0.0064358814,0.9436188,0.00027313814,0.00008641237],"about_ca_topic_score_codex":0.000026545726,"about_ca_topic_score_gemma":0.00003429215,"teacher_disagreement_score":0.98361933,"about_ca_system_score_codex":0.000021306318,"about_ca_system_score_gemma":0.00005180224,"threshold_uncertainty_score":0.46464974},"labels":[],"label_agreement":null},{"id":"W2963693432","doi":"10.5555/2634074.2634192","title":"Parameters of two-prover-one-round game and the hardness of connectivity problems","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Soundness; Connection (principal bundle); Hardness of approximation; Gas meter prover; Constant (computer programming); Class (philosophy); Task (project management); Mathematics; Computer science; Discrete mathematics; Approximation algorithm; Combinatorics; Artificial intelligence; Mathematical proof","score_opus":0.019540559395912687,"score_gpt":0.24631809929912094,"score_spread":0.22677753990320826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963693432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301285,0.0003210069,0.7836266,0.0040233093,0.001442125,0.0013695388,0.000059822774,0.00017452597,0.0059701926],"genre_scores_gemma":[0.97671026,0.00006669393,0.022808895,0.0001893177,0.00006880421,0.00005306448,0.0000033650083,0.000017886556,0.00008172526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975179,0.00042045696,0.0005107301,0.00059940276,0.0005795207,0.00037200993],"domain_scores_gemma":[0.99746615,0.00079218735,0.00039044052,0.0010980447,0.00014024072,0.0001129182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332168,0.00027803626,0.0006036627,0.00014021197,0.00014735057,0.00013190614,0.0010915875,0.00007792374,0.000004549904],"category_scores_gemma":[0.000103965926,0.00019821644,0.00021144573,0.00046499498,0.0010258444,0.00038043354,0.0004511625,0.00025489047,0.000003775311],"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.00019573998,0.0004271864,0.000724755,0.0003302798,0.0003106373,0.000002478567,0.0038145308,0.0018540814,0.007122255,0.915807,0.00008344292,0.06932762],"study_design_scores_gemma":[0.0074463254,0.0014898368,0.0029380198,0.0003378767,0.000109751316,0.00003277498,0.00011569372,0.71623385,0.03435123,0.23519726,0.00096757564,0.0007798054],"about_ca_topic_score_codex":0.00040533257,"about_ca_topic_score_gemma":0.00002246969,"teacher_disagreement_score":0.7736974,"about_ca_system_score_codex":0.000022283744,"about_ca_system_score_gemma":0.000041318133,"threshold_uncertainty_score":0.8083032},"labels":[],"label_agreement":null},{"id":"W2963978854","doi":"10.1016/j.dam.2019.03.016","title":"Polynomial size linear programs for problems in P","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Disjoint sets; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Logarithm; Graph","score_opus":0.021778639285503373,"score_gpt":0.25186257221554487,"score_spread":0.23008393293004148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963978854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052819602,0.000046582634,0.9222224,0.00041641787,0.0004207036,0.0042383196,0.000012371747,0.00039917463,0.019424438],"genre_scores_gemma":[0.26655677,0.0000035535447,0.73258203,0.00009847813,0.000072665614,0.0003443708,0.000009287708,0.000024324263,0.00030850322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986823,0.0000068627364,0.00035039184,0.0003588576,0.00022101721,0.0003805665],"domain_scores_gemma":[0.99895257,0.00023873996,0.00011600067,0.0006013864,0.000028460725,0.000062816085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003187224,0.00017813769,0.0002879711,0.0000677016,0.00005278189,0.00011457247,0.00079921813,0.000076938646,0.0000133129215],"category_scores_gemma":[0.000022756163,0.00015734218,0.00009834616,0.0003386687,0.000044195367,0.00013636032,0.00023273824,0.00013627605,0.000076849006],"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.0000306584,0.0010122311,0.0004102764,0.0016377415,0.000074893855,0.0000034543273,0.009639678,0.00069160236,0.0060600843,0.910799,0.0012621055,0.068378225],"study_design_scores_gemma":[0.003397882,0.0003284614,0.00027764813,0.00025484303,0.000020234225,0.000012491665,0.00061628217,0.6627471,0.0027330872,0.3096931,0.018865015,0.0010538638],"about_ca_topic_score_codex":0.0000051750794,"about_ca_topic_score_gemma":0.00000870622,"teacher_disagreement_score":0.6620555,"about_ca_system_score_codex":0.000024841922,"about_ca_system_score_gemma":0.000036522793,"threshold_uncertainty_score":0.6416228},"labels":[],"label_agreement":null},{"id":"W2964263868","doi":"10.4086/toc.2017.v013a020","title":"","year":2017,"lang":"en","type":"article","venue":"Theory of Computing","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","keywords":"Combinatorics; Mathematics; Approximation algorithm; Bottleneck; Omega; Cardinality (data modeling); Upper and lower bounds; Hardness of approximation; Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.039146009935173795,"score_gpt":0.2882293159106371,"score_spread":0.2490833059754633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964263868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44068518,0.00004423339,0.5569849,0.00036710818,0.00038802993,0.00007362053,5.4144795e-7,0.00013938131,0.0013169915],"genre_scores_gemma":[0.83658195,0.0000027043482,0.16315824,0.00012224741,0.00011158415,8.760542e-7,2.391954e-7,0.0000071369577,0.000015024637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997852,0.00026625142,0.00049645104,0.0004948903,0.00039698763,0.0004933674],"domain_scores_gemma":[0.99517715,0.000800454,0.00081439246,0.002920229,0.00016499874,0.00012278737],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031689166,0.00021243587,0.00040860116,0.00014463402,0.0021511025,0.0005187141,0.0070241704,0.00005447683,0.0000027562899],"category_scores_gemma":[0.00046345592,0.00020924436,0.00020450454,0.00014271906,0.0006863706,0.0011452155,0.0030632794,0.00022905764,0.0000025097634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111647605,0.00005249522,0.002082599,0.000017426848,0.000023548973,0.000010372716,0.0023005563,0.00026246405,0.0006856754,0.73432165,0.0000027841934,0.26022926],"study_design_scores_gemma":[0.00060152594,0.00010585914,0.13220106,0.00012067754,0.0000061608357,0.00003222588,0.00013058749,0.12834236,0.010064512,0.7281151,0.000028540888,0.00025143535],"about_ca_topic_score_codex":0.00004122144,"about_ca_topic_score_gemma":0.0000036292736,"teacher_disagreement_score":0.3958968,"about_ca_system_score_codex":0.000013252061,"about_ca_system_score_gemma":0.000046127443,"threshold_uncertainty_score":0.99914795},"labels":[],"label_agreement":null},{"id":"W2964762712","doi":"","title":"On Mean Estimation for General Norms with Statistical Queries.","year":2019,"lang":"en","type":"article","venue":"Conference on Learning Theory","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":"Normed vector space; Combinatorics; Distribution (mathematics); Mathematics; Oracle; Norm (philosophy); Space (punctuation); Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.018141449130913694,"score_gpt":0.26121175711567746,"score_spread":0.24307030798476376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964762712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0423775,0.000004035401,0.94824594,0.00021802823,0.00020070122,0.00022443186,0.0000046164923,0.00016534145,0.008559431],"genre_scores_gemma":[0.86948067,0.0000020783837,0.12786165,0.00027792333,0.000033908524,0.00002926502,0.000019863155,0.000013138168,0.0022815291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989041,0.00011156396,0.00012574387,0.00038348895,0.00022841289,0.00024665936],"domain_scores_gemma":[0.9987463,0.00066009536,0.00007757813,0.00035993184,0.000086445274,0.00006970174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045079147,0.00014842775,0.00016339937,0.00008456104,0.00017185493,0.00016253765,0.00041998952,0.000047016547,0.00017783814],"category_scores_gemma":[0.00014076638,0.00011434466,0.000034917768,0.00011650948,0.000103032384,0.00017212042,0.00006229209,0.000270363,0.00017172766],"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.00011124828,0.000030524167,0.000056114164,0.000012595682,0.0000093044455,0.0000020625605,0.00042389447,0.004311434,0.00004007486,0.8995537,0.000046485486,0.09540257],"study_design_scores_gemma":[0.00040978892,0.0011720941,0.00071096816,0.00006245098,0.0000036995007,0.0000036642998,0.000052914595,0.53743404,0.00017335513,0.4591208,0.0006741246,0.00018209194],"about_ca_topic_score_codex":0.000005341674,"about_ca_topic_score_gemma":0.0000030370188,"teacher_disagreement_score":0.82710314,"about_ca_system_score_codex":0.000027485366,"about_ca_system_score_gemma":0.0000845219,"threshold_uncertainty_score":0.46628398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23521507,0.00006732503,0.7462919,0.0007061192,0.0018781191,0.0014874851,0.00037570274,0.0003226826,0.013655618],"genre_scores_gemma":[0.8645991,0.000014985151,0.13391599,0.00086841703,0.0000832442,0.000042427644,0.00009792131,0.000025736348,0.0003521624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719447,0.00003813767,0.0011327773,0.0003034715,0.0006301861,0.0007009401],"domain_scores_gemma":[0.99742705,0.00023104927,0.00032522358,0.0014346073,0.000389419,0.0001926407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007368809,0.00031318594,0.0005365694,0.000244877,0.0001788467,0.00022386112,0.0017936478,0.00018628291,0.00006645596],"category_scores_gemma":[0.000097762495,0.00028805758,0.00038783244,0.00045468533,0.00017651115,0.0018140436,0.0007127272,0.00032260743,0.00016805252],"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.00007490972,0.0005713291,0.0054570343,0.0015248164,0.00018021547,0.000004991843,0.004808635,0.00009906101,0.0002996864,0.95803845,0.0029602232,0.02598064],"study_design_scores_gemma":[0.008473298,0.0015005134,0.0072390805,0.0006355774,0.00008048188,0.00020526943,0.0014889662,0.58953893,0.021603083,0.16361521,0.20364144,0.0019781296],"about_ca_topic_score_codex":0.000014469969,"about_ca_topic_score_gemma":0.0000033487158,"teacher_disagreement_score":0.7944232,"about_ca_system_score_codex":0.00006123246,"about_ca_system_score_gemma":0.0000691957,"threshold_uncertainty_score":0.99995714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417025,0.000086859734,0.82540435,0.00037637216,0.0013685027,0.003912152,0.00041755947,0.0002846982,0.0039792843],"genre_scores_gemma":[0.686546,0.00004465157,0.31099674,0.0006760921,0.00019559497,0.0004613044,0.00052701926,0.000042059004,0.00051049556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973978,0.000084952684,0.0010292191,0.00039601617,0.00040246986,0.0006895885],"domain_scores_gemma":[0.9976817,0.0007025231,0.0004418004,0.0007205809,0.00027302318,0.00018040792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013869047,0.0003963455,0.00088545843,0.00024822043,0.00041644444,0.0006713561,0.0008673752,0.00016799865,0.000022972017],"category_scores_gemma":[0.00011320464,0.00035169846,0.00042267467,0.0002382149,0.0002713783,0.0020811653,0.00045073306,0.0002647233,0.000040779592],"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.012838786,0.00080388127,0.0033931376,0.002401411,0.0010559644,0.0000036861363,0.023565717,0.0026246072,0.00012757626,0.922,0.006959768,0.024225468],"study_design_scores_gemma":[0.054960046,0.0002910754,0.00026699007,0.000099742254,0.000048048125,0.000026767037,0.00047384875,0.91963035,0.00040965943,0.0063625355,0.016847828,0.0005831228],"about_ca_topic_score_codex":0.00003054435,"about_ca_topic_score_gemma":0.000018244587,"teacher_disagreement_score":0.9170057,"about_ca_system_score_codex":0.00006915165,"about_ca_system_score_gemma":0.00007213917,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W2965739697","doi":"10.1137/1.9781611975994.125","title":"Testing convexity of functions over finite domains","year":2019,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","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":"Agence Nationale de la Recherche","keywords":"Convexity; Upper and lower bounds; Omega; Dimension (graph theory); Combinatorics; Mathematics; Exponential function; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.11022867870056438,"score_gpt":0.2708677481782521,"score_spread":0.16063906947768772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965739697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032210473,0.000041733696,0.94682145,0.000080201615,0.0012585862,0.0023234657,0.00040150498,0.00022393065,0.016638665],"genre_scores_gemma":[0.1451903,0.0000068325894,0.8520695,0.00018780722,0.0008543525,0.00038346965,0.000056273908,0.000058312635,0.0011931579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828196,0.000010529508,0.00057544134,0.0005199133,0.00030417662,0.00030799408],"domain_scores_gemma":[0.99731064,0.0012270488,0.00056887994,0.0006922227,0.0001144562,0.00008673638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006318371,0.00032240615,0.00062357023,0.00005332816,0.00025813395,0.00016726521,0.0006529852,0.00056446326,0.0000045013635],"category_scores_gemma":[0.00008684734,0.00030372365,0.00051077356,0.0001113363,0.0002531193,0.00003705863,0.0014157217,0.0007223487,0.0000021291578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024540564,0.0003001352,0.000046759484,0.0026384245,0.00077600504,4.953238e-7,0.00667478,0.000862415,0.0013690727,0.9315581,0.0051289042,0.05062042],"study_design_scores_gemma":[0.0022843792,0.00013352977,0.000019307834,0.00047509198,0.00021991911,0.0000034639445,0.0005948436,0.14119443,0.0015555759,0.8497176,0.0030956005,0.00070621766],"about_ca_topic_score_codex":0.000012886457,"about_ca_topic_score_gemma":0.000001059757,"teacher_disagreement_score":0.14033201,"about_ca_system_score_codex":0.00003226899,"about_ca_system_score_gemma":0.00025030164,"threshold_uncertainty_score":0.99994147},"labels":[],"label_agreement":null},{"id":"W2966301123","doi":"10.48550/arxiv.1904.13056","title":"Query-to-Communication Lifting Using Low-Discrepancy Gadgets","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; University of Haifa; National Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Entropy (arrow of time); Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Physics; Geometry","score_opus":0.061439192178204836,"score_gpt":0.19053401698626188,"score_spread":0.12909482480805703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966301123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67199785,0.000028791195,0.3238008,0.00009001248,0.00019483546,0.00014305228,0.000001320335,0.00015892119,0.0035844487],"genre_scores_gemma":[0.9736434,0.000017088894,0.025546279,0.00018003372,0.00002553626,2.0788504e-7,0.0000018135636,0.000009181596,0.0005764474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988451,0.000103526065,0.00013977384,0.0005251705,0.00007944276,0.00030700493],"domain_scores_gemma":[0.9983676,0.00010217986,0.00009580184,0.0012066888,0.00009602383,0.00013171323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023225264,0.00014240459,0.0001581045,0.00021273113,0.0002522775,0.00009771857,0.0014247919,0.000059836406,0.00004109453],"category_scores_gemma":[0.000024624156,0.0001704414,0.000100842284,0.0010996847,0.00004633114,0.00076443097,0.00084371725,0.00017593706,0.00030149598],"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.000018964878,0.00012983056,0.015573102,0.00003443638,0.000039976538,0.00005544548,0.00094643666,0.04367847,0.001121879,0.934754,0.00008281364,0.0035646195],"study_design_scores_gemma":[0.00040660048,0.000045757162,0.0034648716,0.000117583404,0.00001142997,0.000008903687,0.00015979033,0.960959,0.000567857,0.03282786,0.0010606782,0.00036966175],"about_ca_topic_score_codex":0.00017291155,"about_ca_topic_score_gemma":0.000030260744,"teacher_disagreement_score":0.91728055,"about_ca_system_score_codex":0.0000927933,"about_ca_system_score_gemma":0.000055527686,"threshold_uncertainty_score":0.69503987},"labels":[],"label_agreement":null},{"id":"W2966778654","doi":"10.48550/arxiv.1907.12152","title":"Faster asynchronous MST and low diameter tree construction with sublinear communication","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Sublinear function; Asynchronous communication; Spanning tree; Combinatorics; Time complexity; Tree (set theory); Binary logarithm; Minimum spanning tree; Node (physics); Discrete mathematics; Distributed algorithm; Communication complexity; Computer science; Algorithm; Mathematics; Distributed computing; Computer network; Physics","score_opus":0.04062886627540778,"score_gpt":0.1706604096371833,"score_spread":0.13003154336177553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966778654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.299785,0.00007624251,0.6976048,0.0001197195,0.0002611202,0.00026247356,0.000014698909,0.00013406636,0.0017419424],"genre_scores_gemma":[0.9672364,0.0002235416,0.032112032,0.00007352863,0.000035229732,0.0000010070247,0.000028010863,0.000013769074,0.00027649174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985494,0.00014817061,0.00015415809,0.0008193437,0.000091394446,0.0002375525],"domain_scores_gemma":[0.9977892,0.00012337219,0.00022054669,0.0016221739,0.00014268851,0.00010202535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016075364,0.0002664567,0.0002925251,0.00025742786,0.00019197303,0.0002511741,0.0012322322,0.00019538235,0.000018745055],"category_scores_gemma":[0.000008076641,0.00027483806,0.00009351535,0.00037351545,0.00040458492,0.00053077476,0.0017585689,0.0005427598,0.000033426295],"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.0002748976,0.0005949707,0.08287898,0.0007505723,0.00079168373,0.00027903053,0.00239079,0.103457585,0.000069036934,0.7249714,0.000499067,0.08304199],"study_design_scores_gemma":[0.0011976522,0.00017771193,0.009580114,0.00027318165,0.000081185666,0.000050377854,0.00015915354,0.9498504,0.00012476814,0.037334062,0.00045398032,0.000717454],"about_ca_topic_score_codex":0.00011511496,"about_ca_topic_score_gemma":0.00012183183,"teacher_disagreement_score":0.84639275,"about_ca_system_score_codex":0.00008895234,"about_ca_system_score_gemma":0.00011622182,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W2971016812","doi":"10.5802/ojmo.2","title":"Revisiting a Cutting-Plane Method for Perfect Matchings","year":2020,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","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":"Carleton University; University of Toronto","funders":"","keywords":"Counterexample; Linear programming; Uniqueness; Mathematics; Cutting-plane method; Matching (statistics); Algorithm; Mathematical optimization; Point (geometry); Polynomial; Sequence (biology); Time complexity; Applied mathematics; Discrete mathematics; Integer programming; Mathematical analysis; Geometry","score_opus":0.06268050422370516,"score_gpt":0.3521685173705242,"score_spread":0.28948801314681905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971016812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025817704,0.00010482453,0.99062175,0.0066355257,0.0003270529,0.0007026628,0.000011218329,0.000036863,0.0015342695],"genre_scores_gemma":[0.00059393153,0.00004558173,0.99851346,0.00036349843,0.00037450573,0.000020583564,0.000012613711,0.000028051634,0.000047765494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974601,0.00027688482,0.001152502,0.00040320976,0.00047075195,0.00023651616],"domain_scores_gemma":[0.9963263,0.0010514881,0.001529633,0.00043623373,0.00046904886,0.00018726074],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003229328,0.00027225335,0.0009072928,0.00014998148,0.00017742554,0.0014622988,0.0030152858,0.0001613391,0.000097667566],"category_scores_gemma":[0.0013405619,0.00023286903,0.0003549017,0.00024210192,0.000026523643,0.00060705765,0.0021685904,0.00070413377,0.0000065955774],"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.00013062873,0.00028710737,0.000006269733,0.0028140235,0.0004378123,0.0000852058,0.003550644,0.5277005,0.00011622767,0.37114656,0.0030141298,0.09071092],"study_design_scores_gemma":[0.00035792435,0.00011086106,0.0000012067809,0.0010501577,0.000071279675,0.00018745747,0.000031429692,0.7308016,0.00012354975,0.26682493,0.00025109752,0.00018852345],"about_ca_topic_score_codex":0.0000024397125,"about_ca_topic_score_gemma":7.305916e-8,"teacher_disagreement_score":0.20310113,"about_ca_system_score_codex":0.000058483234,"about_ca_system_score_gemma":0.0002191826,"threshold_uncertainty_score":0.9995743},"labels":[],"label_agreement":null},{"id":"W2971886964","doi":"10.1145/3444942","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","year":2021,"lang":"en","type":"preprint","venue":"Journal of the ACM","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Exploratory Research for Advanced Technology; National University of Singapore; Japan Society for the Promotion of Science; Indian Institute of Science","keywords":"Parameterized complexity; Combinatorics; Mathematics; Norm (philosophy); Integer (computer science); Discrete mathematics; Lattice problem; Algorithm; Computer science","score_opus":0.041255141436941915,"score_gpt":0.28014397014508674,"score_spread":0.23888882870814482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971886964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787478,0.0007198859,0.012548312,0.0061446405,0.0015593001,0.00020964773,0.000017099255,0.000012123955,0.000041207317],"genre_scores_gemma":[0.7843086,0.000104166276,0.21538948,0.00006768022,0.00011264232,0.0000023305352,6.835394e-7,0.0000056425993,0.000008760292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823356,0.0002865103,0.0006593584,0.00024340134,0.0004284812,0.00014870161],"domain_scores_gemma":[0.9961891,0.00040162986,0.0009490786,0.002074699,0.00030631933,0.000079169695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177108,0.00016239373,0.00051729527,0.00007602086,0.00006125718,0.00018894621,0.0044568595,0.000118695876,0.000013741948],"category_scores_gemma":[0.0012053447,0.000108522065,0.0003465359,0.00020450554,0.00013977182,0.00019990501,0.007295216,0.000905686,2.1584293e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010022526,0.007628332,0.14255062,0.00792205,0.007855835,0.00090439373,0.06259004,0.010455668,0.10621963,0.016566763,0.016220177,0.6200842],"study_design_scores_gemma":[0.0011398094,0.00046930683,0.2958778,0.002158125,0.0002539462,0.0011652786,0.00020257903,0.014964115,0.011047311,0.6707721,0.001269555,0.0006800817],"about_ca_topic_score_codex":0.000028210467,"about_ca_topic_score_gemma":0.000010071308,"teacher_disagreement_score":0.6542053,"about_ca_system_score_codex":0.0000425473,"about_ca_system_score_gemma":0.0003056786,"threshold_uncertainty_score":0.9092965},"labels":[],"label_agreement":null},{"id":"W2975606440","doi":"10.48550/arxiv.1909.11147","title":"Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Combinatorics; Vertex connectivity; Mathematics; Randomness; Graph; Conjecture; Binary logarithm; Vertex (graph theory); Simple graph; Connected component; Discrete mathematics; Statistics","score_opus":0.0752443634174639,"score_gpt":0.19537591121422587,"score_spread":0.12013154779676197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975606440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15063965,0.00024566104,0.8386034,0.00025629386,0.003791885,0.0005454911,0.000034697612,0.000530916,0.005352001],"genre_scores_gemma":[0.9920809,0.00037522835,0.0032170764,0.00017970841,0.00018304473,0.0000016006246,0.000026332817,0.00003073009,0.003905326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966146,0.00030158536,0.0003854165,0.0018456528,0.00020154998,0.00065122085],"domain_scores_gemma":[0.9963363,0.00032845745,0.00037858522,0.0024917885,0.0002064333,0.00025845645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004234614,0.0006214898,0.0007732268,0.0007023788,0.00025618495,0.00036035362,0.0044626296,0.00038968417,0.00007197612],"category_scores_gemma":[0.000034519006,0.00069192797,0.00078144984,0.00064361165,0.00031390824,0.00052514573,0.0048424234,0.0011566121,0.00043783407],"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.00049221877,0.0012175946,0.020047158,0.0007274212,0.0013127972,0.0014251614,0.0034110707,0.099234104,0.00020998933,0.8373877,0.006952077,0.027582727],"study_design_scores_gemma":[0.005893478,0.0003382841,0.006972222,0.0009284908,0.00028491695,0.000057859546,0.00035188513,0.6809342,0.0013630571,0.2843243,0.015301732,0.0032495682],"about_ca_topic_score_codex":0.00020423144,"about_ca_topic_score_gemma":0.00013503029,"teacher_disagreement_score":0.84144133,"about_ca_system_score_codex":0.00017441847,"about_ca_system_score_gemma":0.0003119257,"threshold_uncertainty_score":0.9995532},"labels":[],"label_agreement":null},{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"McGill University","funders":"","keywords":"Combinatorics; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","score_opus":0.024085918305266994,"score_gpt":0.25529014395202443,"score_spread":0.23120422564675744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979731478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046779832,0.0001548828,0.9916678,0.003282127,0.001637303,0.0018824085,0.00008714333,0.00049616076,0.00032434342],"genre_scores_gemma":[0.025593853,0.0001088588,0.97118866,0.0007640984,0.00015746611,0.00080862705,0.000023551354,0.000048994498,0.0013058634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975579,0.000101400015,0.00046219357,0.00079828495,0.0004995586,0.0005806553],"domain_scores_gemma":[0.9962992,0.0012672751,0.0001591542,0.0018780342,0.00026602254,0.00013028507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057470973,0.00034776318,0.0003202496,0.00031818345,0.0007119039,0.00030951775,0.0021642004,0.00016128464,0.000107629035],"category_scores_gemma":[0.000030884486,0.00027252754,0.00037711338,0.0013198232,0.00013082926,0.0006264315,0.000043566884,0.0004310375,0.00015649058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016197157,0.00025720545,0.000004070602,0.00002666123,0.00012524726,0.0000018773735,0.0005488644,0.0004112536,0.00016079823,0.007714827,0.0002776414,0.9904553],"study_design_scores_gemma":[0.0018805917,0.0006007573,0.0003354047,0.00006236994,0.000059524187,0.000046835536,0.000218679,0.9365811,0.0034797236,0.043087315,0.0131043475,0.0005434007],"about_ca_topic_score_codex":0.000049596965,"about_ca_topic_score_gemma":0.000015152867,"teacher_disagreement_score":0.989912,"about_ca_system_score_codex":0.00006750351,"about_ca_system_score_gemma":0.00009802377,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W2981503891","doi":"10.48550/arxiv.1910.10571","title":"Faster p-norm minimizing flows, via smoothed q-norm problems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Norm (philosophy); Combinatorics; Omega; Mathematics; Running time; Upper and lower bounds; Binary logarithm; Solver; Discrete mathematics; Algorithm; Physics; Mathematical optimization; Mathematical analysis","score_opus":0.07377797125953126,"score_gpt":0.18078153014842865,"score_spread":0.1070035588888974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981503891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08279797,0.00013058823,0.9038306,0.00018859291,0.002274727,0.00066937966,0.00002276483,0.00049753475,0.009587844],"genre_scores_gemma":[0.9843522,0.0001263008,0.01145013,0.00022057151,0.00016877428,0.0000026983678,0.00002592108,0.000039718892,0.0036136915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676526,0.00014851314,0.00036873564,0.0017947253,0.00021305938,0.00070968823],"domain_scores_gemma":[0.9966489,0.00014924156,0.00037123766,0.0024002967,0.00019631164,0.0002340321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035321378,0.00057801604,0.00060047454,0.0005045262,0.00025912278,0.00031696353,0.0037982466,0.000439183,0.0001009327],"category_scores_gemma":[0.000016194976,0.00065780606,0.0004794102,0.00084860943,0.00014815449,0.00066610466,0.0046122554,0.0010240297,0.0004106826],"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.00011143288,0.00090633275,0.008344298,0.0012699071,0.0009053034,0.0009948112,0.0038579514,0.64256847,0.00037823818,0.31142133,0.002108134,0.027133824],"study_design_scores_gemma":[0.0007241253,0.0000831958,0.00075654633,0.00024167549,0.00006216764,0.0000150954775,0.000056592104,0.90287864,0.00011840607,0.089399554,0.0047214055,0.0009425812],"about_ca_topic_score_codex":0.0002617413,"about_ca_topic_score_gemma":0.00013017275,"teacher_disagreement_score":0.9015542,"about_ca_system_score_codex":0.00022582986,"about_ca_system_score_gemma":0.00021633868,"threshold_uncertainty_score":0.9995873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33579358,0.00009952407,0.6583152,0.0018882196,0.00047594385,0.0023324385,0.0005414812,0.00015396926,0.0003996366],"genre_scores_gemma":[0.82018083,0.000036040765,0.17783457,0.0014735354,0.00011142906,0.00017133648,0.00014091158,0.00003511286,0.000016203434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734867,0.000047759484,0.0011081187,0.00038393147,0.0004409993,0.00067051157],"domain_scores_gemma":[0.99852943,0.0001652522,0.00029292653,0.0004876679,0.00025295815,0.00027174136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076175266,0.0003293445,0.00058838667,0.00029779456,0.00023488798,0.00033533806,0.0013160001,0.00014017458,0.000009178654],"category_scores_gemma":[0.00009629143,0.00031554644,0.00018005488,0.0006675742,0.00027534753,0.0012375369,0.00096262567,0.00033853066,0.000007708535],"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.00030713677,0.0011646999,0.051888637,0.0105541805,0.00046886344,0.000014836676,0.11055731,0.0015570928,0.00096020766,0.76578534,0.004577898,0.052163813],"study_design_scores_gemma":[0.0063807433,0.00089749444,0.0037367453,0.00032244602,0.000026771086,0.000043376112,0.0010687618,0.9404,0.006061665,0.026688872,0.013507634,0.0008654775],"about_ca_topic_score_codex":0.0000506192,"about_ca_topic_score_gemma":0.000044877623,"teacher_disagreement_score":0.9388429,"about_ca_system_score_codex":0.000048352864,"about_ca_system_score_gemma":0.000109777095,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W2984743818","doi":"10.1007/978-3-030-45771-6_26","title":"The Integrality Number of an Integer Program","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Einstein Stiftung Berlin","keywords":"Unimodular matrix; Integer (computer science); Combinatorics; Mathematics; Constraint (computer-aided design); Relaxation (psychology); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Computer science; Symmetric matrix; Physics; Nonnegative matrix; Geometry","score_opus":0.033214859811090756,"score_gpt":0.32660962435792634,"score_spread":0.2933947645468356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984743818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597138,0.00011531575,0.97645074,0.0034741657,0.0029894656,0.0006197923,0.000006439409,0.0003060569,0.00006667212],"genre_scores_gemma":[0.5144983,0.000011664431,0.48490113,0.0003636464,0.00017996044,0.000034007455,0.0000027534577,0.000008191565,3.3981672e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956207,0.00028813272,0.00069400546,0.0016175047,0.0010756223,0.00070398615],"domain_scores_gemma":[0.99584603,0.0006505736,0.0003651262,0.0025274323,0.0003857032,0.00022514345],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018015284,0.00044048412,0.0005281157,0.00020268053,0.00037488452,0.00125741,0.00994016,0.00022375963,0.000005520244],"category_scores_gemma":[0.00035485358,0.00030852115,0.00022357437,0.0025061844,0.0018473561,0.00053667463,0.007688959,0.001730216,0.000008980156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007374502,0.00016171292,0.00052583026,0.00005012205,0.000011673937,0.00001718845,0.0015445823,0.0067145685,0.000034879366,0.010157998,0.000008639084,0.9807654],"study_design_scores_gemma":[0.00009014886,0.0001082344,0.0015109128,0.00010702544,0.0000031148484,0.000021326676,0.0000011756435,0.6517712,0.0017889739,0.34416875,0.00016565678,0.00026347526],"about_ca_topic_score_codex":0.0002658335,"about_ca_topic_score_gemma":0.00018731138,"teacher_disagreement_score":0.98050195,"about_ca_system_score_codex":0.0001260181,"about_ca_system_score_gemma":0.0007178959,"threshold_uncertainty_score":0.9999367},"labels":[],"label_agreement":null},{"id":"W2991205088","doi":"10.4230/lipics.approx/random.2020.63","title":"A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Mathematics; Approximation algorithm; Discrete mathematics; Tree (set theory); Algorithm; Graph","score_opus":0.13189287200090385,"score_gpt":0.22326503097789277,"score_spread":0.09137215897698892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991205088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17921424,0.000107290565,0.81820154,0.000056996912,0.00055361603,0.00048718555,0.00017566273,0.00012817672,0.0010753138],"genre_scores_gemma":[0.9782777,0.00012672995,0.020546023,0.000024558733,0.000034979963,0.0000031883346,0.00005211541,0.000012276231,0.0009224374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998316,0.00015511063,0.00038872156,0.00076542597,0.00011644434,0.0002582948],"domain_scores_gemma":[0.9974588,0.0002048849,0.0005474681,0.0012067719,0.00050517207,0.00007690372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026690727,0.00026201818,0.00057056156,0.00037452302,0.00008198927,0.000036629364,0.0016939472,0.00020666663,0.0000149579],"category_scores_gemma":[0.00006326362,0.00028223818,0.00038044673,0.0008950704,0.0002461031,0.00026855353,0.0009809503,0.00025207544,0.000003090965],"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.00006863002,0.00046523724,0.008493449,0.0005516935,0.00025702384,0.000008603013,0.00047796278,0.08159453,0.00019176197,0.9058724,0.00036385327,0.0016548311],"study_design_scores_gemma":[0.0007475019,0.00016382789,0.0028057117,0.00023339868,0.00009015969,9.554491e-7,0.000057618912,0.85968834,0.0008617303,0.13428223,0.0006897871,0.00037871732],"about_ca_topic_score_codex":0.00041727073,"about_ca_topic_score_gemma":0.0006326924,"teacher_disagreement_score":0.79906344,"about_ca_system_score_codex":0.000081766186,"about_ca_system_score_gemma":0.00023991766,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W2993653833","doi":"10.1145/3374857.3374866","title":"PODC 2019 Review","year":2019,"lang":"en","type":"article","venue":"ACM SIGACT News","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Banquet; Operations research; Library science; Art history; Mathematics; History","score_opus":0.01974455852597813,"score_gpt":0.26767471253115865,"score_spread":0.24793015400518054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993653833","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077046506,0.19703415,0.19174862,0.1987347,0.024237907,0.006921761,0.000058739013,0.0042843944,0.29993322],"genre_scores_gemma":[0.18665567,0.06153664,0.54747194,0.15308161,0.0017804482,0.00012567012,0.000081230035,0.0001531284,0.049113687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988257,0.00005754957,0.00021291533,0.00037029077,0.00025894277,0.0002745512],"domain_scores_gemma":[0.99768376,0.00017100177,0.00008084876,0.0019311751,0.000042793246,0.000090439185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002312259,0.00013618813,0.00023552189,0.000058423542,0.000057713154,0.0000851486,0.0022239569,0.00004071176,0.0003992722],"category_scores_gemma":[0.00011364258,0.00011767642,0.00013444778,0.00044127862,0.0000217788,0.00044812067,0.00069577905,0.00016547258,0.0033345753],"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.000003518443,0.00011403931,0.002584472,0.0003701892,0.00003950017,0.000024420526,0.00019782419,0.000006102569,0.0007986772,0.08391059,0.3515088,0.56044185],"study_design_scores_gemma":[0.0003522239,0.00014085651,0.0037862477,0.0006306954,0.00001123302,0.000040127357,0.0000077551385,0.0011116893,0.0005065179,0.032816153,0.96016115,0.00043536242],"about_ca_topic_score_codex":0.00006925173,"about_ca_topic_score_gemma":0.0000061521305,"teacher_disagreement_score":0.60865235,"about_ca_system_score_codex":0.000017069338,"about_ca_system_score_gemma":0.000050188315,"threshold_uncertainty_score":0.9974415},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088743,0.000031921358,0.17765145,0.00018934527,0.0012454767,0.0017894878,0.00038671712,0.0004331053,0.009398212],"genre_scores_gemma":[0.79235995,0.0000042578918,0.2067785,0.00045921808,0.00005483909,0.000042396197,0.00013174293,0.00003395764,0.00013512107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661505,0.00005701636,0.0011946342,0.00043517075,0.00081496505,0.0008831876],"domain_scores_gemma":[0.9966793,0.00039434835,0.0007615519,0.0013947069,0.0005433104,0.00022676788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070711935,0.00047985083,0.0007079611,0.00042272452,0.00035442066,0.0004432112,0.0016076245,0.00019872347,0.000026226673],"category_scores_gemma":[0.00010790142,0.00041120368,0.0002581883,0.0009967727,0.00023831097,0.0018517926,0.0006997121,0.00049783575,0.000049711536],"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.0013625933,0.0036261952,0.30333504,0.009586053,0.00265937,0.00010601773,0.09305971,0.0033989113,0.0013431592,0.47220597,0.006703404,0.102613576],"study_design_scores_gemma":[0.015858809,0.0038326215,0.016182402,0.0014097955,0.00017119508,0.0007269961,0.0038596238,0.89469326,0.005171048,0.041752134,0.013363266,0.002978844],"about_ca_topic_score_codex":0.000087664775,"about_ca_topic_score_gemma":0.00006618215,"teacher_disagreement_score":0.89129436,"about_ca_system_score_codex":0.00007787592,"about_ca_system_score_gemma":0.00018579962,"threshold_uncertainty_score":0.999834},"labels":[],"label_agreement":null},{"id":"W2998979141","doi":"10.5539/cis.v13n1p51","title":"Sort Integers into a Linked List","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; sort; Constant (computer programming); Parallel computing; Arithmetic; Algorithm; Mathematics; Information retrieval; Programming language","score_opus":0.019639163476565337,"score_gpt":0.2427598706734659,"score_spread":0.22312070719690058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998979141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007698111,0.000023389595,0.9843996,0.004136735,0.00041640474,0.0000944165,0.0000010526613,0.00018697002,0.0030433023],"genre_scores_gemma":[0.7756004,0.00003263904,0.21201825,0.01222779,0.00010843729,0.000004307291,0.000002701186,0.0000017578706,0.0000037359177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.000013081123,0.00025777714,0.00022947398,0.00038701782,0.0002061533],"domain_scores_gemma":[0.9992217,0.00003489946,0.00007762317,0.00024770937,0.00017619938,0.00024187454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035442956,0.00010043119,0.00010724133,0.00019029003,0.0003826559,0.000963157,0.0011726995,0.000025147747,0.000008647404],"category_scores_gemma":[0.000052288502,0.00008908734,0.000033140153,0.0013550235,0.00036906093,0.010454702,0.000818396,0.00012749761,0.000065662396],"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.000003006141,0.000009158887,0.00019192038,0.000027041766,0.0000031130007,0.0000013273207,0.014245889,0.00015692652,0.000101239995,0.24858171,0.0014139835,0.73526466],"study_design_scores_gemma":[0.0001806911,0.00009741113,0.0027580813,0.000013494077,8.9825517e-7,0.000012441801,0.00006201802,0.94719493,0.0002518335,0.002472613,0.046805818,0.00014977831],"about_ca_topic_score_codex":0.000010891949,"about_ca_topic_score_gemma":4.0119193e-7,"teacher_disagreement_score":0.947038,"about_ca_system_score_codex":0.000019056806,"about_ca_system_score_gemma":0.000110131936,"threshold_uncertainty_score":0.9287745},"labels":[],"label_agreement":null},{"id":"W3000089047","doi":"","title":"Improving the linear relaxation of maximum \\(k\\)-cut with semidefinite-based constraints","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Cutting-plane method; Mathematics; Maximum cut; Linear programming; Combinatorics; Relaxation (psychology); Semidefinite embedding; Vertex (graph theory); Linear programming relaxation; Graph; Interior point method; Feasible region; Set (abstract data type); Facet (psychology); Mathematical optimization; Integer programming; Computer science; Quadratically constrained quadratic program","score_opus":0.012720356515452589,"score_gpt":0.20983289194795843,"score_spread":0.19711253543250584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000089047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1787528,0.000032640626,0.81861967,0.00086456555,0.00023308472,0.00014262195,0.0000067702836,0.0001025446,0.0012452805],"genre_scores_gemma":[0.8121702,0.0000029752675,0.18709217,0.00054853474,0.00012219297,0.000007252628,0.0000034418854,0.0000085781485,0.000044670527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893564,0.00008198124,0.00020999768,0.00027565565,0.00027608327,0.00022065698],"domain_scores_gemma":[0.9987828,0.00025343295,0.0002017861,0.00053684466,0.00017260807,0.000052502626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019522,0.00013118016,0.00013876302,0.00009674082,0.0003774553,0.000067429544,0.0006253893,0.00007838758,0.00002171945],"category_scores_gemma":[0.000093018876,0.00009019976,0.0000644742,0.00046421977,0.0014140435,0.00017179537,0.00006954426,0.00023375617,0.000012409111],"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.000106091975,0.00017480929,0.0042718532,0.000091445494,0.000099590136,0.000040893174,0.0070668245,0.00024454374,0.0038938748,0.6290427,0.0005410861,0.35442632],"study_design_scores_gemma":[0.004660724,0.0025537827,0.012885005,0.00033189077,0.00011052206,0.0002545748,0.001169985,0.7379526,0.099234916,0.12918383,0.010127436,0.0015347382],"about_ca_topic_score_codex":0.00008796185,"about_ca_topic_score_gemma":0.000034924844,"teacher_disagreement_score":0.73770803,"about_ca_system_score_codex":0.00003354553,"about_ca_system_score_gemma":0.00010897862,"threshold_uncertainty_score":0.5210102},"labels":[],"label_agreement":null},{"id":"W3006858192","doi":"10.1137/18m1169710","title":"A notion of total dual integrality for convex, semidefinite, and extended formulations","year":2020,"lang":"pt","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"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; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Polyhedral combinatorics; Generalization; Linear programming; Rank (graph theory); Duality (order theory); Maximum cut; Linear programming relaxation; Integer programming; Convex analysis; Regular polygon; Dual (grammatical number); Discrete mathematics; Cutting-plane method; Convex optimization; Mathematical optimization; Convex set; Graph","score_opus":0.04571706200810552,"score_gpt":0.2681223265057611,"score_spread":0.2224052644976556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006858192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10683556,0.0015088398,0.79719293,0.07081798,0.0020225476,0.0028246858,0.00077956123,0.00074352004,0.01727439],"genre_scores_gemma":[0.9785954,0.00005765877,0.020132402,0.0003501444,0.00044114763,0.00013328677,0.00014866011,0.000035707602,0.00010558903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603057,0.0003278173,0.0011389432,0.0010654951,0.000747913,0.00068926567],"domain_scores_gemma":[0.9964999,0.0007114333,0.00066383305,0.0005988204,0.0008801938,0.00064583664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006116548,0.000527298,0.0007595989,0.00035090244,0.00066971354,0.00034220028,0.0006205838,0.00048798468,0.000018163631],"category_scores_gemma":[0.0012188447,0.0005513986,0.000405263,0.0010965014,0.00007349953,0.0009717195,0.0006032555,0.0006126207,0.0000033831861],"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.0002743408,0.00071380776,0.00016537635,0.00041696077,0.00018779922,0.00002874755,0.0053299833,0.00010544173,0.0024288706,0.98121834,0.00056957675,0.008560738],"study_design_scores_gemma":[0.007394688,0.0021077404,0.030378772,0.00080553413,0.00048480803,0.0018397404,0.0014668867,0.3212649,0.0062956563,0.013368919,0.61238164,0.002210748],"about_ca_topic_score_codex":0.0000024442577,"about_ca_topic_score_gemma":0.000056955887,"teacher_disagreement_score":0.96784943,"about_ca_system_score_codex":0.00021956519,"about_ca_system_score_gemma":0.00053106074,"threshold_uncertainty_score":0.99969375},"labels":[],"label_agreement":null},{"id":"W3007478560","doi":"10.48550/arxiv.2003.00336","title":"Three-dimensional matching is NP-Hard","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Reduction (mathematics); Matching (statistics); Exponential function; Mathematics; Combinatorics; Algorithm; Discrete mathematics; Computer science; Statistics; Geometry; Mathematical analysis","score_opus":0.11420512199009139,"score_gpt":0.19829965095764798,"score_spread":0.08409452896755659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007478560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07283978,0.00007989716,0.9219795,0.001772447,0.0011654623,0.00021938577,0.000045898414,0.00050748466,0.0013901492],"genre_scores_gemma":[0.9587692,0.000036975955,0.03863176,0.0018270554,0.0002165816,8.4985464e-7,0.000019944788,0.000025892268,0.00047175513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758476,0.000071524766,0.00022207228,0.0015247824,0.00019387867,0.0004029855],"domain_scores_gemma":[0.99797195,0.000118414995,0.00020939558,0.0013132516,0.0001222746,0.0002646822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018120976,0.00038494077,0.00039989394,0.00021990901,0.00028981493,0.00020668475,0.0028259193,0.00024802194,0.00014066372],"category_scores_gemma":[0.000014538821,0.00046119464,0.00039461037,0.0006786961,0.00013159946,0.00036321237,0.005454502,0.0009990566,0.0003520833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003931725,0.00016214313,0.0012733304,0.00015108984,0.00029697487,0.0013639306,0.0007108302,0.06524974,0.00008575913,0.9163051,0.011670513,0.002691228],"study_design_scores_gemma":[0.00022294467,0.000027985041,0.0008571822,0.000060061993,0.000029328598,0.000009395491,0.000009673019,0.46813866,0.000059074613,0.5286908,0.0014807334,0.0004141814],"about_ca_topic_score_codex":0.00032593994,"about_ca_topic_score_gemma":0.000054902943,"teacher_disagreement_score":0.8859294,"about_ca_system_score_codex":0.00010759076,"about_ca_system_score_gemma":0.00020639763,"threshold_uncertainty_score":0.999784},"labels":[],"label_agreement":null},{"id":"W3008284578","doi":"10.4230/lipics.approx/random.2020.28","title":"A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Combinatorics; Composition (language); Measure (data warehouse); Conjecture; Type (biology); Function (biology); Connection (principal bundle); Characterization (materials science); Discrete mathematics; Physics; Geometry","score_opus":0.13096740427841497,"score_gpt":0.21243351031132288,"score_spread":0.08146610603290791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008284578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00847029,0.00008340347,0.9868357,0.001476891,0.0010301262,0.0011411215,0.00012715212,0.00018432175,0.00065098674],"genre_scores_gemma":[0.99228454,0.00006922958,0.007173255,0.00015017114,0.00015806255,0.000011610034,0.00005388075,0.000011467468,0.000087802735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981412,0.00041030443,0.0003344571,0.00074396265,0.00011892138,0.0002511229],"domain_scores_gemma":[0.99701804,0.0012457492,0.00040466903,0.0009993819,0.00022717017,0.00010501604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006015597,0.00027142058,0.00065357966,0.00013408922,0.00040611567,0.00009897188,0.0017579052,0.00015448638,0.000035453948],"category_scores_gemma":[0.000064355634,0.00022885657,0.0008191954,0.0004898846,0.0010078491,0.00018309537,0.0013696698,0.0004558673,0.000013098151],"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.002737548,0.00010136962,0.000022463348,0.000066170374,0.00029857966,0.000009631981,0.0003463379,0.021742411,0.0000321026,0.9739004,0.00037785585,0.00036515828],"study_design_scores_gemma":[0.008343994,0.000036017078,0.000064691005,0.00004396087,0.00018498464,0.0000017298918,0.000053594587,0.6277807,0.00019513856,0.36283603,0.00027346678,0.00018574962],"about_ca_topic_score_codex":0.00017867744,"about_ca_topic_score_gemma":0.00002111688,"teacher_disagreement_score":0.98381424,"about_ca_system_score_codex":0.000058485242,"about_ca_system_score_gemma":0.00015079841,"threshold_uncertainty_score":0.93325},"labels":[],"label_agreement":null},{"id":"W3008826217","doi":"10.1145/3470861","title":"Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Product (mathematics); Mathematics; Upper and lower bounds; Boolean function; Physics; Mathematical analysis; Geometry","score_opus":0.02419060904223568,"score_gpt":0.28754416750045253,"score_spread":0.26335355845821684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008826217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019796375,0.0005196274,0.97749144,0.0008233011,0.0006122552,0.00046467173,0.000053536434,0.00016657816,0.00007220006],"genre_scores_gemma":[0.58893013,0.00019988863,0.41044024,0.00015770443,0.000027639719,0.00009451327,0.00005972503,0.000022067305,0.00006810771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817425,0.00028702518,0.00047693547,0.00056152116,0.0002490738,0.00025121938],"domain_scores_gemma":[0.99655294,0.0014487559,0.00027397246,0.0012720433,0.00036082114,0.00009145262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007994735,0.00027986013,0.0003711378,0.0003129374,0.00038177264,0.00029530845,0.00117836,0.00023333095,0.000020706242],"category_scores_gemma":[0.00008446842,0.0003152728,0.00025997666,0.00031690497,0.00021035071,0.00031656201,0.00017380196,0.00049485225,0.0000016067027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109301094,0.00081651885,0.000010574376,0.00066078536,0.00037224405,0.000004260258,0.006354635,0.102541745,0.0003210295,0.046490315,0.000047162583,0.84227145],"study_design_scores_gemma":[0.0005584902,0.0001437286,0.00025774617,0.00032225353,0.00006019802,0.00001735585,0.0002893489,0.37207597,0.0072705406,0.6186092,0.00007058869,0.0003246165],"about_ca_topic_score_codex":0.000034404173,"about_ca_topic_score_gemma":0.000018383385,"teacher_disagreement_score":0.8419468,"about_ca_system_score_codex":0.00008514158,"about_ca_system_score_gemma":0.00023176875,"threshold_uncertainty_score":0.99992996},"labels":[],"label_agreement":null},{"id":"W3008901784","doi":"10.1145/3626514","title":"A New Minimax Theorem for Randomized Algorithms","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","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":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":"Minimax; Mathematics; Randomized algorithm; Discrete mathematics; Algorithm; Bounded function; Computer science; Mathematical optimization","score_opus":0.034693137456230955,"score_gpt":0.2916385897286021,"score_spread":0.2569454522723712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008901784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039397976,0.000364327,0.9420024,0.04828059,0.004471095,0.0004334807,0.0000033994197,0.000077489494,0.00042738643],"genre_scores_gemma":[0.014455123,0.00012679808,0.97953296,0.0010513085,0.0014248211,0.000011943964,3.884073e-7,0.000018503868,0.003378139],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988493,0.00013162923,0.00037408757,0.000111105386,0.00033293816,0.00020097494],"domain_scores_gemma":[0.9971985,0.0013137546,0.00033476102,0.0009438921,0.0001240576,0.00008498694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019554778,0.000092510614,0.00033096896,0.00013617192,0.0001423397,0.00012402917,0.00468275,0.000034065404,0.000012321706],"category_scores_gemma":[0.002166603,0.000051090123,0.00061831466,0.0005763993,0.00006413827,0.0002221558,0.0009270383,0.00016231142,0.000013050658],"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.00405268,0.00008742767,0.000039292867,0.000028764385,0.00041894542,0.000039427723,0.003079365,0.00032716148,0.0005891382,0.23117566,0.36918533,0.3909768],"study_design_scores_gemma":[0.026879886,0.00006589701,0.00016429542,0.00004711061,0.000031146235,0.00010760424,0.0000345293,0.028321384,0.0009203627,0.9292282,0.014110679,0.00008891014],"about_ca_topic_score_codex":0.000004660043,"about_ca_topic_score_gemma":9.419235e-7,"teacher_disagreement_score":0.6980525,"about_ca_system_score_codex":0.000017458793,"about_ca_system_score_gemma":0.00013256016,"threshold_uncertainty_score":0.87017924},"labels":[],"label_agreement":null},{"id":"W3013656193","doi":"10.1007/s00453-022-00972-6","title":"Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Linear programming relaxation; Theory of computation; Combinatorics; Randomized rounding; Approximation algorithm; Vertex (graph theory); Binary logarithm; Time complexity; Mathematics; Minification; Linear programming; Steiner tree problem; Polynomial-time approximation scheme; Tree (set theory); Discrete mathematics; Running time; Graph; Computer science; Mathematical optimization; Algorithm","score_opus":0.014571129644288744,"score_gpt":0.23388604405281202,"score_spread":0.21931491440852327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013656193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015425651,0.00008945093,0.99320567,0.0026646878,0.00047081753,0.001430445,0.00013665092,0.00022464174,0.00023508306],"genre_scores_gemma":[0.035814643,0.0000026742455,0.95779943,0.0011461021,0.000595263,0.0021717697,0.0005776376,0.00005170676,0.0018407612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982854,0.00009061118,0.00034768364,0.00053958053,0.00035223167,0.00038449198],"domain_scores_gemma":[0.99881864,0.00036666726,0.00017869055,0.00046790083,0.000084029074,0.00008408699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926285,0.00018086797,0.00023110303,0.00011654622,0.000828469,0.00013075751,0.0008344679,0.000053403637,0.000050950213],"category_scores_gemma":[0.00007316404,0.00020751765,0.00017692355,0.00034838388,0.000046436224,0.00024531034,0.00036284744,0.00012613447,0.000010455671],"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.0003130083,0.0013730831,0.000025368223,0.00015387923,0.00021756577,0.000006444032,0.0026842218,0.0029582193,0.0012673384,0.09241436,0.12107853,0.77750796],"study_design_scores_gemma":[0.001175188,0.0005596405,0.000018608602,0.000006754557,0.000013994768,0.000011912922,0.0000869351,0.8614079,0.0006746474,0.0059569757,0.12984459,0.00024287848],"about_ca_topic_score_codex":0.000007813062,"about_ca_topic_score_gemma":5.3943427e-7,"teacher_disagreement_score":0.85844964,"about_ca_system_score_codex":0.00017975281,"about_ca_system_score_gemma":0.00009079654,"threshold_uncertainty_score":0.8462324},"labels":[],"label_agreement":null},{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; Graph; Computer science","score_opus":0.04865152016433313,"score_gpt":0.2558573971456671,"score_spread":0.20720587698133394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014010934","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02849229,0.00008459063,0.95721835,0.009097549,0.0008454704,0.0002164223,0.00004632601,0.00018094556,0.0038180568],"genre_scores_gemma":[0.462085,0.000056336223,0.536808,0.0007121191,0.00025635186,0.000003611521,0.0000014009951,0.00001771054,0.000059467286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987148,0.000054516644,0.0004386513,0.00025396253,0.00029161054,0.0002464408],"domain_scores_gemma":[0.99891573,0.0001656068,0.00026370946,0.00028460304,0.00008647793,0.00028389957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032895914,0.0001717609,0.0002472527,0.00008757406,0.00039771877,0.000494639,0.00051976315,0.000051283463,0.000010179363],"category_scores_gemma":[0.00033813764,0.00013991482,0.00010296404,0.00027419796,0.0001381228,0.0003724005,0.0001949401,0.0004637947,0.000013797665],"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.00008091947,0.00028402708,0.0000903383,0.00037795413,0.0003195949,0.0002038203,0.033342253,0.00025936705,0.0037260975,0.89912206,0.002856341,0.059337243],"study_design_scores_gemma":[0.0022464418,0.0005453036,0.00021589492,0.00036801817,0.00004499173,0.0014455453,0.0015947659,0.8379981,0.0015272128,0.14696728,0.006432264,0.0006141934],"about_ca_topic_score_codex":0.000001753726,"about_ca_topic_score_gemma":0.0000014272147,"teacher_disagreement_score":0.83773875,"about_ca_system_score_codex":0.000021625223,"about_ca_system_score_gemma":0.00003775081,"threshold_uncertainty_score":0.57055604},"labels":[],"label_agreement":null},{"id":"W3016445400","doi":"10.1109/focs46700.2020.00134","title":"Resolving the Optimal Metric Distortion Conjecture","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"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; National Science Foundation","keywords":"Mathematics; Distortion (music); Metric (unit); Conjecture; Matching (statistics); Lemma (botany); Ranking (information retrieval); Combinatorics; Discrete mathematics; Set (abstract data type); Metric space; Parameterized complexity; Point (geometry); Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.03973471895494322,"score_gpt":0.26466869704226104,"score_spread":0.22493397808731783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016445400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003453362,0.0007829828,0.98025125,0.011860791,0.0015661238,0.00024725797,0.0000066167195,0.00040689085,0.004532778],"genre_scores_gemma":[0.69775164,0.000088500885,0.29908645,0.001717065,0.00070140057,0.000050529954,0.000022779383,0.000020470305,0.0005611545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983429,0.00011110275,0.00025443285,0.0006491424,0.00041271793,0.00022972922],"domain_scores_gemma":[0.9984686,0.00019394452,0.00014905386,0.0010453296,0.00005863494,0.00008447498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952066,0.0002242289,0.00023214985,0.00013771681,0.00024846764,0.0005181114,0.0025744904,0.00015009748,0.00005944532],"category_scores_gemma":[0.000111112735,0.00014888805,0.00022576895,0.0007243749,0.00007828521,0.000120606004,0.0038110507,0.0009651054,0.000036381214],"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.000011134444,0.000099790515,0.00015453846,0.00017032036,0.00023164273,0.000092560455,0.0035828208,0.017578032,0.0000393582,0.7605025,0.04593506,0.17160223],"study_design_scores_gemma":[0.0001652693,0.00007578087,0.002002594,0.00005593216,0.000035347293,0.000026671707,0.000051528186,0.8299144,0.0003894749,0.12524663,0.04146656,0.0005698008],"about_ca_topic_score_codex":0.000106749925,"about_ca_topic_score_gemma":0.000012995998,"teacher_disagreement_score":0.8123364,"about_ca_system_score_codex":0.000058925154,"about_ca_system_score_gemma":0.00010895703,"threshold_uncertainty_score":0.6071478},"labels":[],"label_agreement":null},{"id":"W3018088442","doi":"10.1137/1.9781611976465.75","title":"Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications","year":2021,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","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 Toronto","funders":"","keywords":"Probabilistic logic; Tree (set theory); Pruning; Algorithm; Computer science; Binary logarithm; Embedding; Combinatorics; Time complexity; Approximation algorithm; Probabilistic analysis of algorithms; Dynamic problem; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.032878644806735836,"score_gpt":0.2499828280805961,"score_spread":0.21710418327386027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018088442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02405314,0.000066784916,0.96871084,0.0001523322,0.0001579028,0.0034702276,0.0001650668,0.00016665802,0.003057028],"genre_scores_gemma":[0.123665705,0.000019393041,0.87377846,0.00005677556,0.0001254054,0.001910427,0.000071161616,0.000044169145,0.00032849578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800026,0.000008720945,0.0005837426,0.0007244162,0.0003322362,0.0003506184],"domain_scores_gemma":[0.9979957,0.00029347042,0.00056722626,0.0008389614,0.00019950556,0.00010516096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003827364,0.00038059062,0.0006985053,0.000044396522,0.00021129294,0.0002457817,0.0008617806,0.00044019983,0.0000026764412],"category_scores_gemma":[0.000021512586,0.00032605222,0.00041003872,0.00015591193,0.00040719222,0.00003867208,0.00094938604,0.0006369704,3.574226e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029582507,0.0004386552,0.000002027117,0.0050056735,0.00059686217,0.000001291558,0.0113039175,0.0003199693,0.0008352422,0.877983,0.00042371108,0.10306007],"study_design_scores_gemma":[0.002517965,0.00015285,0.0000036266083,0.0016357647,0.00031660532,0.000021306265,0.0038084083,0.1777831,0.0025532737,0.8095703,0.00060080475,0.0010359568],"about_ca_topic_score_codex":0.0000046942637,"about_ca_topic_score_gemma":0.000008243086,"teacher_disagreement_score":0.17746313,"about_ca_system_score_codex":0.00006183952,"about_ca_system_score_gemma":0.00035793768,"threshold_uncertainty_score":0.9999192},"labels":[],"label_agreement":null},{"id":"W3019550124","doi":"10.1016/j.dam.2020.04.004","title":"Matroid optimization problems with monotone monomials in the objective","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Mathematics; Submodular set function; Monomial; Polytope; Rank (graph theory); Combinatorics; Monomial basis; Polynomial; Polyhedron; Monotonic function; Monotone polygon; Discrete mathematics","score_opus":0.022588330717927436,"score_gpt":0.22246510055214663,"score_spread":0.1998767698342192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019550124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002763418,0.00002074757,0.98662025,0.0015952105,0.000015986827,0.00078726077,0.0000036502495,0.00010956325,0.008083922],"genre_scores_gemma":[0.37176716,0.000012392337,0.62723917,0.00071696454,0.000040452673,0.00019593662,0.0000063814036,0.000016011592,0.0000055109267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.000025424051,0.00027113795,0.0002997778,0.00027047028,0.00021856948],"domain_scores_gemma":[0.99923277,0.0001302463,0.00013599407,0.00042252225,0.000025450156,0.00005302276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023822593,0.0001671156,0.00022416312,0.000049698705,0.00010150647,0.00019138426,0.000872037,0.00004009457,0.00000779646],"category_scores_gemma":[0.000015337391,0.00010869675,0.000039611026,0.0006161566,0.00006490845,0.00018698897,0.00015455522,0.0001687044,0.00001796647],"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.000018354063,0.00014783753,0.000018848232,0.00014644311,0.000035022284,0.000008837542,0.03921639,0.14128838,0.00036680186,0.8169257,0.00015443207,0.0016729303],"study_design_scores_gemma":[0.00054690416,0.00011237521,0.0000610075,0.000030875482,0.00001426192,0.000009655164,0.0019043023,0.9280029,0.0007591643,0.068166636,0.00012683622,0.00026509556],"about_ca_topic_score_codex":0.0000057565853,"about_ca_topic_score_gemma":0.000004542331,"teacher_disagreement_score":0.7867145,"about_ca_system_score_codex":0.000018117638,"about_ca_system_score_gemma":0.000029522827,"threshold_uncertainty_score":0.4432525},"labels":[],"label_agreement":null},{"id":"W3020969699","doi":"10.1137/1.9781611976465.132","title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"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":"Treewidth; Tree decomposition; Algorithm; Computer science; Hierarchy; Dynamic problem; Graph; Mathematics; Theoretical computer science; Combinatorics; Pathwidth; Line graph","score_opus":0.06587450508378731,"score_gpt":0.2717993298694636,"score_spread":0.20592482478567628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020969699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009009497,0.002172025,0.8648192,0.0017096214,0.0006274649,0.0069558467,0.00034704362,0.0003524434,0.122926205],"genre_scores_gemma":[0.00063906127,0.0015721114,0.5446129,0.0014333022,0.0018646498,0.0043037105,0.00013159291,0.0002708847,0.4451718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981308,0.0000048831357,0.00047617167,0.00066320883,0.0003429732,0.00038198088],"domain_scores_gemma":[0.99817884,0.0006844142,0.00022723552,0.00058730075,0.00011478034,0.00020742438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004575599,0.00041401692,0.00047867405,0.000056792163,0.0010936579,0.00047111514,0.0006746002,0.00045822706,0.0000036010815],"category_scores_gemma":[0.000014237608,0.00033111926,0.00037973872,0.00006918407,0.00024109773,0.00003806387,0.0007125335,0.00056027557,0.0000038368385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027228484,0.000012338192,7.3083046e-9,0.00007873901,0.00014843661,3.2143413e-7,0.0006835829,8.5927377e-7,0.00006303012,0.84697884,0.00086869666,0.1511624],"study_design_scores_gemma":[0.0005944316,0.000052409585,8.3432475e-8,0.00011174446,0.000093556955,0.000013983574,0.00027028436,0.0025653485,0.00016283525,0.79058963,0.20507778,0.00046790746],"about_ca_topic_score_codex":7.112951e-7,"about_ca_topic_score_gemma":0.000004082785,"teacher_disagreement_score":0.3222456,"about_ca_system_score_codex":0.000036916983,"about_ca_system_score_gemma":0.00012765272,"threshold_uncertainty_score":0.9999141},"labels":[],"label_agreement":null},{"id":"W3021430041","doi":"10.1080/10556788.2020.1864370","title":"Sparktope: linear programs from algorithms","year":2021,"lang":"en","type":"preprint","venue":"Optimization methods & software","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 New Brunswick; McGill University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Algorithm; Polynomial; Matching (statistics); Bipartite graph; Extension (predicate logic); TRACE (psycholinguistics); Time complexity; Linear programming; Exponential function; Graph; Programming language; Theoretical computer science; Mathematics","score_opus":0.06472395234384083,"score_gpt":0.3537934815381213,"score_spread":0.2890695291942805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021430041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039133352,0.0021410326,0.9910559,0.0005355574,0.0039735427,0.0006137078,0.00006244987,0.0013719567,0.00020670691],"genre_scores_gemma":[0.000019067234,0.00051281304,0.99655807,0.00039205176,0.00053879723,0.00018126558,0.0014559763,0.00007122213,0.00027071315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948321,0.0012554326,0.00079492014,0.0018661388,0.0006899954,0.0005614193],"domain_scores_gemma":[0.9954471,0.0005629772,0.0005163986,0.002449766,0.0007432008,0.00028058418],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001153813,0.0006436518,0.00085349026,0.0002394739,0.00033385816,0.00134913,0.0026060487,0.00066201686,0.0003591493],"category_scores_gemma":[0.00067680393,0.00069169933,0.0004756084,0.0011025942,0.0001373508,0.0005435194,0.0043492867,0.0012161417,0.000016193331],"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.0000033030162,0.00016954982,0.00015743157,0.000066412606,0.00012264997,0.000041367763,0.0007042774,0.2696024,0.0000041223107,0.00029291908,0.00018394916,0.72865164],"study_design_scores_gemma":[0.0002960733,0.00003913993,0.0001111327,0.00030123268,0.00006692334,0.000011405801,0.000056063513,0.9799572,0.00040380633,0.011780197,0.006143112,0.0008337041],"about_ca_topic_score_codex":0.00024556278,"about_ca_topic_score_gemma":0.000010993032,"teacher_disagreement_score":0.72781795,"about_ca_system_score_codex":0.00011211041,"about_ca_system_score_gemma":0.00045118824,"threshold_uncertainty_score":0.99968755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044149425,0.000065044704,0.91596323,0.003046587,0.003930927,0.0015384958,0.00040872168,0.0006296377,0.030267922],"genre_scores_gemma":[0.81188315,0.00007629106,0.1840866,0.0017647346,0.00049898005,0.00017251268,0.00014993513,0.00006434536,0.001303461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678904,0.000030621988,0.00097109575,0.00042950455,0.000672154,0.0011075755],"domain_scores_gemma":[0.9954281,0.00014852533,0.00077972707,0.0029770096,0.00031560112,0.00035107607],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082428515,0.00049322005,0.0005451316,0.00027915192,0.0021019257,0.0024635768,0.004750837,0.000252922,0.000039822793],"category_scores_gemma":[0.00021305545,0.00044564248,0.00043794146,0.00020526076,0.00028838613,0.004620519,0.0017704146,0.0005160811,0.00029267132],"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.00015609348,0.0007675586,0.006787698,0.0007588207,0.00046473477,0.00006038767,0.015144942,0.0000998575,0.0001128767,0.8445785,0.021608852,0.10945965],"study_design_scores_gemma":[0.00768445,0.0007983401,0.009038672,0.00039632784,0.00007543004,0.00030555087,0.0007662657,0.5027496,0.0030928727,0.05774924,0.4152245,0.0021187332],"about_ca_topic_score_codex":0.000054789038,"about_ca_topic_score_gemma":0.00007353832,"teacher_disagreement_score":0.7868293,"about_ca_system_score_codex":0.00010227479,"about_ca_system_score_gemma":0.00012172872,"threshold_uncertainty_score":0.99979955},"labels":[],"label_agreement":null},{"id":"W3021945058","doi":"10.48550/arxiv.2005.02368","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Mathematics; Combinatorics; Vertex (graph theory); Shortest path problem; Omega; Path (computing); Time complexity; Metric space; Binary logarithm; Discrete mathematics; Logarithm; Graph; Computer science; Physics","score_opus":0.03936896967354345,"score_gpt":0.1834978566868087,"score_spread":0.14412888701326526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021945058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06234302,0.00064956315,0.931903,0.00037769214,0.0010411803,0.00047016793,0.000055395947,0.0003511048,0.0028088423],"genre_scores_gemma":[0.99378073,0.0005805951,0.0050623543,0.00010228683,0.00003313401,0.000002464716,0.000015339217,0.00001616819,0.00040692984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749076,0.00019134858,0.00019571243,0.0015908846,0.00014224669,0.00038905162],"domain_scores_gemma":[0.998321,0.0002379746,0.00023204609,0.0008685448,0.00008956473,0.00025088043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001647131,0.00041332617,0.0004771453,0.00020453506,0.00032956322,0.00023085054,0.0017888501,0.00020766325,0.000009804594],"category_scores_gemma":[0.000029454977,0.00047429715,0.00020781445,0.00073389336,0.0004394315,0.00044358955,0.002100099,0.0006962966,0.000024847766],"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.00038105634,0.00028279223,0.0040796995,0.0010097268,0.0008916909,0.002130326,0.0031077263,0.023803746,0.00018434164,0.90203273,0.0013472788,0.060748897],"study_design_scores_gemma":[0.0004276389,0.00010292805,0.005059969,0.0001768298,0.00007107433,0.000005912367,0.00016738105,0.615468,0.000040989973,0.37662867,0.0012226849,0.0006279108],"about_ca_topic_score_codex":0.00010787305,"about_ca_topic_score_gemma":0.00023739452,"teacher_disagreement_score":0.93143773,"about_ca_system_score_codex":0.00017652025,"about_ca_system_score_gemma":0.0000962273,"threshold_uncertainty_score":0.9997709},"labels":[],"label_agreement":null},{"id":"W3022052004","doi":"10.4230/lipics.itcs.2021.61","title":"Communication Memento: Memoryless Communication Complexity","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Ottawa","funders":"","keywords":"Communication complexity; Alice and Bob; Bipartite graph; Bounded function; Logarithm; Discrete mathematics; Alice (programming language); Computer science; Models of communication; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.19462432414981565,"score_gpt":0.22901080656897504,"score_spread":0.0343864824191594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022052004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02640784,0.0004933395,0.95222086,0.003615497,0.00049366814,0.00073679135,0.00006219071,0.0009857791,0.014984019],"genre_scores_gemma":[0.9671906,0.00073928724,0.03117076,0.00038365257,0.00004130634,0.0000034818577,0.00018351944,0.000020980893,0.00026640086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973139,0.0006766899,0.00036490808,0.0010984255,0.00018707494,0.00035900416],"domain_scores_gemma":[0.99438703,0.00021839298,0.00048354207,0.0044059115,0.00027100652,0.0002341127],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00049723824,0.00039656396,0.00047684237,0.00021257786,0.0006179075,0.00033710053,0.007537463,0.00026257397,0.000075598284],"category_scores_gemma":[0.00004278554,0.0005133635,0.0002984873,0.0008939733,0.00049069215,0.000582907,0.010022602,0.0012172118,0.00012825643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018338482,0.00020213751,0.0002928298,0.00009096722,0.00012648063,0.000032285883,0.0008716801,0.009489773,0.000021232998,0.98587114,0.0014462526,0.001536874],"study_design_scores_gemma":[0.0003956999,0.000026964717,0.0010785954,0.00010321289,0.000048541275,0.0000026744185,0.0001161925,0.49480718,0.00012521054,0.5011969,0.0016567495,0.00044202709],"about_ca_topic_score_codex":0.0005785966,"about_ca_topic_score_gemma":0.00018818646,"teacher_disagreement_score":0.9407828,"about_ca_system_score_codex":0.00024833836,"about_ca_system_score_gemma":0.0001693565,"threshold_uncertainty_score":0.9997318},"labels":[],"label_agreement":null},{"id":"W3022167047","doi":"","title":"Computational study of valid inequalities for the maximum \\(k\\)-cut problem","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Clique; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Maximum cut; Inequality; Set (abstract data type); Semidefinite programming; Relaxation (psychology); Discrete mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.029454336079702333,"score_gpt":0.26497901753134984,"score_spread":0.2355246814516475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022167047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03308294,0.00020180616,0.9592138,0.005434726,0.00013516136,0.0014119518,0.00005617744,0.00035881557,0.000104604245],"genre_scores_gemma":[0.7748175,0.00001996666,0.22356659,0.00047768146,0.00007614834,0.0007560079,0.0000028580596,0.000021355998,0.00026187272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787587,0.00016456572,0.00056255,0.0004270344,0.00049582846,0.000474141],"domain_scores_gemma":[0.99718153,0.0012260393,0.0002764007,0.00094075454,0.00026688076,0.00010837554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450821,0.00024070947,0.00030754972,0.00026866057,0.00036412827,0.0001528195,0.001581937,0.0000877733,0.000011635847],"category_scores_gemma":[0.00012320478,0.00015147583,0.0001739171,0.0005176111,0.00014776218,0.00042913487,0.0004865474,0.00013998295,0.0000035484975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008737405,0.0011605289,0.0101234205,0.00006179988,0.0002005408,0.000009835673,0.0030202405,0.007845658,0.0005416529,0.81508267,0.0024668192,0.15939945],"study_design_scores_gemma":[0.0025964768,0.0014339815,0.023906166,0.00011011067,0.00005373431,0.00006435871,0.00089501945,0.37716702,0.0030045817,0.5866034,0.0035269922,0.00063814846],"about_ca_topic_score_codex":0.0019201527,"about_ca_topic_score_gemma":0.00094628276,"teacher_disagreement_score":0.74173456,"about_ca_system_score_codex":0.00010571596,"about_ca_system_score_gemma":0.00016334617,"threshold_uncertainty_score":0.6177005},"labels":[],"label_agreement":null},{"id":"W3033460939","doi":"10.1137/1.9781611976465.63","title":"Beyond Submodular Maximization via One-Sided Smoothness","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","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 British Columbia","funders":"","keywords":"Submodular set function; Multilinear map; Matroid; Mathematics; Parameterized complexity; Set function; Rounding; Discrete mathematics; Polytope; Function (biology); Combinatorics; Extension (predicate logic); Monotone polygon; Mathematical optimization; Set (abstract data type); Pure mathematics; Computer science","score_opus":0.0661011885999601,"score_gpt":0.23213632313503543,"score_spread":0.16603513453507535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033460939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006527119,0.000179914,0.7929792,0.00019110204,0.0006531299,0.0016601235,0.00012458324,0.0002461266,0.20390059],"genre_scores_gemma":[0.000507186,0.00010048595,0.8055805,0.0006930863,0.0022173899,0.00036591885,0.00045108196,0.00022715564,0.18985717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775916,0.000006270945,0.0006312359,0.00073607184,0.0004835719,0.00038369547],"domain_scores_gemma":[0.9982508,0.0002940065,0.0004482551,0.0007071152,0.00014917043,0.00015068892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043914816,0.00050265715,0.00077695225,0.00006844645,0.00044917018,0.0003455545,0.0006335208,0.00090779486,0.00003029534],"category_scores_gemma":[0.000019346327,0.0005248792,0.00063367846,0.000055381744,0.00023430919,0.0000698109,0.0005296003,0.00060334813,0.0000061371434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052152477,0.00003818802,3.6998706e-8,0.00021673892,0.0002448877,0.0000013351375,0.00069912925,0.0000046466416,0.00017950768,0.9433398,0.00095104135,0.05431946],"study_design_scores_gemma":[0.0012324539,0.000054212986,9.103286e-8,0.00026184294,0.00019774878,0.000014007016,0.000073450494,0.0052458947,0.0016296388,0.9694469,0.021162143,0.00068164803],"about_ca_topic_score_codex":0.000002176594,"about_ca_topic_score_gemma":0.0000025908882,"teacher_disagreement_score":0.053637814,"about_ca_system_score_codex":0.000060029717,"about_ca_system_score_gemma":0.00017642697,"threshold_uncertainty_score":0.9997203},"labels":[],"label_agreement":null},{"id":"W3035379790","doi":"","title":"On the unreasonable effectiveness of the greedy algorithm: Greedy adapts to sharpness","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Submodular set function; Greedy algorithm; Cardinality (data modeling); Mathematical optimization; Convexity; Monotone polygon; Computer science; Constraint (computer-aided design); Maximization; Convergence (economics); Algorithm; Function (biology); Greedy randomized adaptive search procedure; Mathematics; Data mining","score_opus":0.01826483245907823,"score_gpt":0.22512493244021567,"score_spread":0.20686009998113744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035379790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033860732,0.0002166331,0.94239795,0.020748664,0.0003033607,0.0014238396,0.000059183305,0.0004392499,0.0005503794],"genre_scores_gemma":[0.92667335,0.000013884343,0.06471863,0.007809688,0.00013765914,0.0004802141,0.000003381101,0.00004574766,0.00011744083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683636,0.00060816295,0.00040866178,0.00069852016,0.0007773545,0.0006709214],"domain_scores_gemma":[0.9966575,0.0009112483,0.00020774179,0.0016972056,0.000191629,0.0003346949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012562927,0.0003836788,0.00043163213,0.00017155438,0.0004925443,0.00023746754,0.0038693147,0.00015262711,0.000024885863],"category_scores_gemma":[0.00048346253,0.0002551641,0.00031156783,0.0023487683,0.00017213184,0.000326232,0.0014480846,0.0005835384,0.000030778217],"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.00015421532,0.00039528124,0.002618308,0.00011316313,0.0001162276,0.000040012637,0.0010927946,0.006349419,0.0060549066,0.90054137,0.0037276999,0.07879663],"study_design_scores_gemma":[0.00079160463,0.00080324354,0.06991349,0.00040383587,0.000037563528,0.000058352765,0.000114865616,0.7871346,0.069039136,0.0677317,0.0031769907,0.0007946086],"about_ca_topic_score_codex":0.0029001131,"about_ca_topic_score_gemma":0.00026633323,"teacher_disagreement_score":0.8928126,"about_ca_system_score_codex":0.00016607146,"about_ca_system_score_gemma":0.00021144774,"threshold_uncertainty_score":0.99999005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007319637,0.00014137386,0.97243756,0.007202311,0.0021080356,0.0072054947,0.0022358221,0.0004495038,0.00090023543],"genre_scores_gemma":[0.27954572,0.00019558193,0.699079,0.007667136,0.0006130561,0.0035061082,0.009199172,0.00012269868,0.000071571536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442714,0.00022766239,0.002786753,0.00090871693,0.00074481824,0.00090492726],"domain_scores_gemma":[0.9951174,0.0009087654,0.0015278944,0.0016241225,0.00053852575,0.000283271],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018139327,0.000859042,0.0020505688,0.00073547673,0.00043243752,0.0012520491,0.0031978597,0.00062848255,0.000027417702],"category_scores_gemma":[0.0001884553,0.00087093684,0.001211304,0.00043067362,0.00040606697,0.0015817623,0.0021637853,0.0012487285,0.000053585485],"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.019947896,0.0024210433,0.000895766,0.016165866,0.0019045279,0.000018912218,0.14241402,0.0017481293,0.000113058864,0.71256566,0.04987927,0.05192587],"study_design_scores_gemma":[0.035793204,0.00009866433,0.0001165992,0.00053534476,0.000075918026,0.000013743381,0.0003348392,0.61243796,0.00029769438,0.3423274,0.0071417643,0.000826855],"about_ca_topic_score_codex":0.00013946898,"about_ca_topic_score_gemma":0.00003209309,"teacher_disagreement_score":0.6106899,"about_ca_system_score_codex":0.0002789103,"about_ca_system_score_gemma":0.0002512586,"threshold_uncertainty_score":0.99978477},"labels":[],"label_agreement":null},{"id":"W3037978064","doi":"","title":"QIP = PSPACE","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Perimeter Institute","funders":"","keywords":"PSPACE; Mathematics; Class (philosophy); Multiplicative function; Mathematical proof; Power (physics); Discrete mathematics; Computer science; Computational complexity theory; Combinatorics; Algorithm; Physics","score_opus":0.09210681672539393,"score_gpt":0.18616894085701446,"score_spread":0.09406212413162053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037978064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026913157,0.00013484729,0.95601743,0.0004871926,0.0009283958,0.00020688263,0.000009875766,0.00058140926,0.014720792],"genre_scores_gemma":[0.9795288,0.00021943581,0.017121166,0.00031460123,0.00014084953,4.076692e-7,0.0000090107515,0.000012524603,0.0026532225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979847,0.00012610531,0.00016070488,0.0011954826,0.00011495233,0.00041805385],"domain_scores_gemma":[0.9976717,0.00007728395,0.00017939303,0.0017547301,0.00011872584,0.00019815686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022089804,0.0003335274,0.0003287345,0.00030090267,0.00020284738,0.00020193862,0.0031277833,0.00027761518,0.000038317357],"category_scores_gemma":[0.000019762698,0.00040482602,0.00030647483,0.00075849175,0.00012123787,0.0003393633,0.0024437627,0.0007608737,0.00016289843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008384911,0.000114738184,0.00027828783,0.000032318734,0.000051788113,0.00046522808,0.00017606565,0.038216967,0.0000071825807,0.9531139,0.0018075287,0.0057275845],"study_design_scores_gemma":[0.0002712156,0.0000541057,0.0011788446,0.00007357215,0.000028345621,0.000009054731,0.000020696949,0.4108507,0.00006242459,0.58229166,0.0046302094,0.00052917073],"about_ca_topic_score_codex":0.00009850168,"about_ca_topic_score_gemma":0.000034473203,"teacher_disagreement_score":0.9526156,"about_ca_system_score_codex":0.00012883694,"about_ca_system_score_gemma":0.0001633598,"threshold_uncertainty_score":0.9998404},"labels":[],"label_agreement":null},{"id":"W3040249201","doi":"10.1007/s00037-024-00250-7","title":"KRW Composition Theorems via Lifting","year":2024,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Vetenskapsrådet; Natural Sciences and Engineering Research Council of Canada; European Commission; McGill University; Lunds Universitet","keywords":"Composition (language); Mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics; Philosophy","score_opus":0.03902938089658899,"score_gpt":0.28683573876716145,"score_spread":0.24780635787057245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040249201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009959347,0.00048825136,0.9793483,0.0022016917,0.0012342499,0.00017634383,0.000021944421,0.0011641054,0.005405755],"genre_scores_gemma":[0.798473,0.000002291184,0.20063826,0.00047261355,0.00026292918,0.000011517354,0.0000855162,0.000014702682,0.000039138708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793905,0.00014972995,0.0003759095,0.0006345898,0.00055167783,0.0003490634],"domain_scores_gemma":[0.99874544,0.0005099815,0.00006456826,0.00037842855,0.00016532933,0.00013624516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004683886,0.00023305528,0.00021598098,0.00026304144,0.00048303633,0.0006897009,0.0009024198,0.00006138746,0.0001322311],"category_scores_gemma":[0.000016357644,0.00023347809,0.00018582966,0.00092227996,0.00026551128,0.0007119064,0.00041774844,0.00033110895,0.00036891358],"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.0000039927936,0.00006629863,0.00004825594,0.000042904652,0.00003758799,0.000036153804,0.00033599074,0.0063229944,0.00014829279,0.9525148,0.0009940091,0.039448686],"study_design_scores_gemma":[0.00008372384,0.000028172319,0.0023387945,0.0000399281,0.0000038684993,0.00008819436,0.0000036033878,0.5116644,0.00006164816,0.48401344,0.0015154303,0.0001587678],"about_ca_topic_score_codex":0.000026443635,"about_ca_topic_score_gemma":0.0000037494121,"teacher_disagreement_score":0.78851366,"about_ca_system_score_codex":0.00008990394,"about_ca_system_score_gemma":0.000102240745,"threshold_uncertainty_score":0.952096},"labels":[],"label_agreement":null},{"id":"W3045332431","doi":"10.1007/s10107-022-01780-0","title":"Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Disjoint sets; Combinatorics; Cardinality (data modeling); Bounded function; Constant (computer programming); Discrete mathematics; Routing (electronic design automation); Tree (set theory)","score_opus":0.021040342107216572,"score_gpt":0.23371226578399504,"score_spread":0.21267192367677845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045332431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016819425,0.00013554274,0.9782333,0.00087057566,0.0004462895,0.000718041,0.0000049370447,0.00053618185,0.0022357523],"genre_scores_gemma":[0.4606234,0.0000022409702,0.5384268,0.00025725036,0.000055288445,0.00047753775,0.000012427172,0.000042618063,0.000102392085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969298,0.00018648365,0.00065329263,0.00067572825,0.00078152434,0.00077317277],"domain_scores_gemma":[0.9985968,0.0002219183,0.00015156434,0.0008106835,0.000029738942,0.00018928417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008664282,0.00030312725,0.00043144746,0.00036793505,0.00040120535,0.00026733507,0.0014503499,0.000062945,0.00011623485],"category_scores_gemma":[0.00006201916,0.00028663184,0.00022921298,0.001284892,0.00014692062,0.00032946919,0.001306928,0.0005588736,0.000044877346],"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.000010459874,0.0017014467,0.0006086294,0.00017135749,0.000031331663,0.00030158972,0.0028103334,0.000029108667,0.00008182845,0.44069052,0.000118919816,0.5534445],"study_design_scores_gemma":[0.00047612505,0.00026938363,0.00009277869,0.00006273074,0.000011454858,0.00020910164,0.00032783835,0.1176488,0.0001742565,0.8709057,0.0093151815,0.00050662487],"about_ca_topic_score_codex":0.00001684281,"about_ca_topic_score_gemma":0.000015777454,"teacher_disagreement_score":0.55293787,"about_ca_system_score_codex":0.0001314444,"about_ca_system_score_gemma":0.000030722756,"threshold_uncertainty_score":0.9999586},"labels":[],"label_agreement":null},{"id":"W3046523482","doi":"10.1109/focs46700.2020.00013","title":"KRW Composition Theorems via Lifting","year":2020,"lang":"en","type":"article","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; National Science Foundation; Vetenskapsrådet; Israel Science Foundation; Danmarks Frie Forskningsfond","keywords":"Composition (language); Computer science; Mathematics; Art; Literature","score_opus":0.025326781616408646,"score_gpt":0.22401855392817654,"score_spread":0.1986917723117679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046523482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027278382,0.000024685976,0.9722313,0.0065633417,0.00014667468,0.000052354044,4.948546e-7,0.00036144035,0.01789183],"genre_scores_gemma":[0.8491883,0.0000018093842,0.14681455,0.003843669,0.00012264644,0.0000017781502,0.0000016426509,0.000003310952,0.000022271171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000031039817,0.00011023615,0.00021338034,0.00014072716,0.00013816723],"domain_scores_gemma":[0.999625,0.00005098055,0.000027926657,0.00018027207,0.000026978185,0.00008879134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008669072,0.00006806281,0.00007672998,0.000024169147,0.00012095747,0.00011287545,0.0005190431,0.000020858532,0.00008516635],"category_scores_gemma":[0.00000772011,0.000060223225,0.000048510898,0.00030815418,0.000031010506,0.00024918438,0.00022760281,0.00008927645,0.00014578014],"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.0000026853504,0.000029961704,0.00012978957,0.000007843482,0.0000090192325,0.000010723195,0.00097451947,0.00007561471,0.0050167344,0.88326883,0.0010789932,0.1093953],"study_design_scores_gemma":[0.00019295678,0.00008794572,0.000510835,0.000008003589,0.0000022656134,0.0000146732,0.000026009462,0.91450715,0.009068198,0.071370676,0.004026575,0.0001847121],"about_ca_topic_score_codex":0.000010155747,"about_ca_topic_score_gemma":7.2469277e-7,"teacher_disagreement_score":0.9144315,"about_ca_system_score_codex":0.0000057378898,"about_ca_system_score_gemma":0.000008438598,"threshold_uncertainty_score":0.24558319},"labels":[],"label_agreement":null},{"id":"W3081819253","doi":"10.48550/arxiv.2008.03327","title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Ottawa; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Regular polygon; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Algorithm; Geometry; Computer science","score_opus":0.1051686159428374,"score_gpt":0.2179346125417006,"score_spread":0.1127659965988632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081819253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01193538,0.000112033646,0.9828265,0.0018364262,0.0005845707,0.0021168578,0.00009873941,0.00022362439,0.00026589903],"genre_scores_gemma":[0.9264286,0.00006914405,0.07272769,0.00039155627,0.00015726707,0.000049685135,0.00005352479,0.000022760129,0.00009975716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997453,0.00037482707,0.00035417094,0.0011857998,0.00015837245,0.00047387794],"domain_scores_gemma":[0.99693555,0.0011384008,0.00030947805,0.0012891609,0.0002165477,0.000110888526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007077851,0.0004239734,0.0003893245,0.00028150296,0.00050107646,0.00034237799,0.00321693,0.0002568308,0.00000826781],"category_scores_gemma":[0.00008511096,0.00031550787,0.00042898871,0.0015261323,0.00026747704,0.0003255957,0.0012627365,0.0010243821,0.00001170702],"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.00010228798,0.000650318,0.00021962138,0.00035008206,0.00041680143,0.0059355395,0.011779949,0.02862111,0.000022847185,0.8499406,0.0018873755,0.10007344],"study_design_scores_gemma":[0.0008731067,0.00008955027,0.00011541214,0.00006546734,0.00007526645,0.00015409237,0.0009830435,0.88293105,0.000026498412,0.1135049,0.00082213595,0.00035947765],"about_ca_topic_score_codex":0.0007247641,"about_ca_topic_score_gemma":0.00077051605,"teacher_disagreement_score":0.91449326,"about_ca_system_score_codex":0.00010539356,"about_ca_system_score_gemma":0.0001761988,"threshold_uncertainty_score":0.9999297},"labels":[],"label_agreement":null},{"id":"W3082318583","doi":"10.1137/20m135515x","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Code word; Decoding methods; Block (permutation group theory); List decoding; Constant (computer programming); Block code; Upper and lower bounds; Algorithm; Discrete mathematics; Combinatorics; Computer science; Concatenated error correction code","score_opus":0.02585537324071933,"score_gpt":0.24398451927618517,"score_spread":0.21812914603546585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082318583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46705088,0.0007072309,0.52325815,0.0021420731,0.001963124,0.00036400757,0.000018653574,0.0003910223,0.0041048406],"genre_scores_gemma":[0.9085384,0.000023398523,0.09019168,0.0009275797,0.00021477076,0.0000024956296,0.0000021683668,0.000022140779,0.00007737217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970749,0.0004413547,0.0005127992,0.000531221,0.00083395647,0.00060578727],"domain_scores_gemma":[0.99820036,0.00053769926,0.00039608893,0.00041771057,0.00017494182,0.00027321486],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014481182,0.00028909545,0.00042783492,0.00024239755,0.0025811594,0.00046988516,0.00096577336,0.000041390365,0.00004178911],"category_scores_gemma":[0.0000544344,0.00025536324,0.00010555478,0.00070931565,0.0002965744,0.00029231954,0.0008964291,0.0015004711,0.0000068005243],"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.0010554807,0.0020111275,0.016909601,0.0001511014,0.0007661996,0.00450922,0.009192819,0.2441956,0.00061266654,0.48390332,0.0073353113,0.22935757],"study_design_scores_gemma":[0.001993008,0.0021179547,0.0020184345,0.00021298905,0.000021305552,0.008428136,0.0007676331,0.9650052,0.00014429845,0.009647093,0.0089972075,0.00064672896],"about_ca_topic_score_codex":0.000046024375,"about_ca_topic_score_gemma":0.000015676102,"teacher_disagreement_score":0.72080964,"about_ca_system_score_codex":0.00014493449,"about_ca_system_score_gemma":0.0002790435,"threshold_uncertainty_score":0.99998987},"labels":[],"label_agreement":null},{"id":"W3083903395","doi":"10.48550/arxiv.2009.04892","title":"Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Robustness (evolution); Mathematical proof; Locality; Probabilistic logic; Computation; Theoretical computer science; Computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.12390603914664206,"score_gpt":0.2016284091420833,"score_spread":0.07772236999544124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083903395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09728902,0.000040569666,0.8957417,0.00019797026,0.00032559843,0.0004484156,0.000023416414,0.00043092118,0.005502366],"genre_scores_gemma":[0.9872,0.00004567189,0.012431857,0.00016151265,0.00008636709,0.0000020568662,0.000018373521,0.000020700161,0.000033449145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723434,0.00014713091,0.00030448698,0.0016097475,0.00020447755,0.00049981556],"domain_scores_gemma":[0.9978746,0.0001431813,0.00032905737,0.0011334325,0.00025035054,0.00026936887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002908438,0.00049143384,0.00056403695,0.00018069473,0.00026848458,0.00053350494,0.002331574,0.00022630561,0.000013559507],"category_scores_gemma":[0.000028861943,0.00050747744,0.00023222149,0.00093910005,0.00047416543,0.0005278876,0.0022458248,0.0010315608,0.000021831034],"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.00005404083,0.0001099252,0.0004576238,0.0005322958,0.00018255899,0.0015252829,0.0010468964,0.4059431,0.0000778408,0.58917457,0.00003399973,0.0008619052],"study_design_scores_gemma":[0.0004975509,0.00010701871,0.00021830958,0.00045174122,0.00006934218,0.000009395819,0.0007396463,0.75056237,0.00018580192,0.2463146,0.00010483502,0.0007393723],"about_ca_topic_score_codex":0.00012959495,"about_ca_topic_score_gemma":0.00004906906,"teacher_disagreement_score":0.889911,"about_ca_system_score_codex":0.0002128595,"about_ca_system_score_gemma":0.0008918333,"threshold_uncertainty_score":0.9997377},"labels":[],"label_agreement":null},{"id":"W3085262258","doi":"10.1109/tit.2020.3023962","title":"On List Recovery of High-Rate Tensor Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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; Google; Simons Foundation; United States-Israel Binational Science Foundation; European Research Council; National Science Foundation","keywords":"Decoding methods; List decoding; Probabilistic logic; Tensor product; Mathematics; Linear code; Upper and lower bounds; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code; Concatenated error correction code; Statistics","score_opus":0.015167629555816676,"score_gpt":0.2153799879103764,"score_spread":0.20021235835455972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085262258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068631624,0.0000041693506,0.9888734,0.0008386665,0.00055689004,0.00013000693,0.00008292354,0.00016811625,0.0024826156],"genre_scores_gemma":[0.99015975,0.000025272217,0.006731721,0.0029670459,0.000020601989,0.000015667754,0.0000047808103,0.000004737664,0.00007041639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991023,0.00010072975,0.0003340969,0.00012329136,0.00020978016,0.00012979488],"domain_scores_gemma":[0.99902815,0.0003663677,0.00013496199,0.00030311052,0.000091177426,0.00007621107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027586528,0.000117634074,0.00014835711,0.00018480093,0.00016272647,0.000084311214,0.00041554807,0.000054124066,0.00015135044],"category_scores_gemma":[0.000024758416,0.00010963507,0.000108977234,0.0004340755,0.00007429225,0.0012565047,0.0000030601343,0.00019451504,0.00022984984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032878295,0.00015142286,5.767189e-7,0.000066823115,0.00006753141,0.0000013130718,0.002888622,0.081794925,0.0001886571,0.6631086,0.0008583561,0.2505444],"study_design_scores_gemma":[0.0027689557,0.0032208634,0.00033544932,0.00023488681,0.000048720045,0.00001854229,0.00080615917,0.30144304,0.20616403,0.4760089,0.007900948,0.0010495329],"about_ca_topic_score_codex":0.000013344009,"about_ca_topic_score_gemma":0.0000018975475,"teacher_disagreement_score":0.9832966,"about_ca_system_score_codex":0.000022271262,"about_ca_system_score_gemma":0.000037264515,"threshold_uncertainty_score":0.44707882},"labels":[],"label_agreement":null},{"id":"W3085992258","doi":"10.1007/s00446-023-00451-3","title":"Four shades of deterministic leader election in anonymous networks","year":2023,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Node (physics); Computer science; Task (project management); Context (archaeology); Identifier; Computer network; Distributed computing; Computer security; Engineering; Geography","score_opus":0.033896789744311755,"score_gpt":0.26759833705344255,"score_spread":0.23370154730913079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085992258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15173095,0.000043424086,0.8472144,0.00013085466,0.00036991615,0.00009431968,0.000008294049,0.00031888913,0.00008894265],"genre_scores_gemma":[0.99477965,0.000005643176,0.0050341,0.000039395767,0.000081740436,0.00000346153,0.000040769093,0.000007652245,0.0000075916178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985733,0.00008360323,0.00036851843,0.00033989313,0.00019715885,0.00043753276],"domain_scores_gemma":[0.99912095,0.0003023567,0.00013020558,0.00032749344,0.000067120614,0.00005188541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038908434,0.00013552213,0.00022219322,0.00023263048,0.00013819963,0.00008519385,0.0006388023,0.00007395015,0.000003059479],"category_scores_gemma":[0.000079680685,0.00014822892,0.000079851365,0.002457731,0.000055210792,0.00012323655,0.00023546023,0.00022518911,0.0000097441425],"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.000024694185,0.00027179776,0.03665145,0.00014988614,0.000069591464,0.00037420436,0.0013271137,0.46450615,0.0012969774,0.04046678,0.0017125792,0.45314878],"study_design_scores_gemma":[0.00022161826,0.00005234975,0.053341515,0.000063870626,0.0000029159337,0.000021090756,0.0000493559,0.9425091,0.00030450872,0.0031794854,0.000107780295,0.00014642201],"about_ca_topic_score_codex":0.000037903308,"about_ca_topic_score_gemma":0.000013782799,"teacher_disagreement_score":0.8430487,"about_ca_system_score_codex":0.00004105034,"about_ca_system_score_gemma":0.000036044505,"threshold_uncertainty_score":0.60446},"labels":[],"label_agreement":null},{"id":"W3091841515","doi":"10.1109/focs46700.2020.00094","title":"Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization","year":2020,"lang":"en","type":"preprint","venue":"","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":"Norm (philosophy); Stochastic optimization; Mathematical optimization; Mathematics; Optimization problem; Approximation algorithm; Stochastic approximation; Random variable; Multivariate random variable; Combinatorial optimization; Computer science; Key (lock)","score_opus":0.054998356939426445,"score_gpt":0.2853151208686983,"score_spread":0.23031676392927186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091841515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017815886,0.000053240714,0.98822856,0.002025666,0.0065830825,0.0014799157,0.00005209604,0.00065582775,0.0009037823],"genre_scores_gemma":[0.013150749,0.000008147752,0.98476034,0.0002680379,0.00097442756,0.00038419865,0.000338717,0.000031921078,0.0000834606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756545,0.0000615331,0.00052658306,0.0010198017,0.00047874436,0.0003479028],"domain_scores_gemma":[0.99816126,0.00024176597,0.00031193887,0.0008048623,0.00031349,0.00016670946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031451706,0.00037908056,0.00045918577,0.00019628103,0.00021983817,0.0005800713,0.0017079444,0.00032221302,0.000025333868],"category_scores_gemma":[0.00016039175,0.00039597196,0.00027649436,0.00036688522,0.00006300613,0.000330358,0.0016208604,0.00043339026,0.0000145780305],"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.00003191074,0.00021567325,7.788812e-7,0.00030440243,0.00010326676,0.000002974844,0.000803987,0.32725218,0.000013692343,0.6394794,0.0029691686,0.028822571],"study_design_scores_gemma":[0.0005825567,0.00010418007,0.0000029704088,0.00003771206,0.000021390899,0.000002368313,0.000014115974,0.72162503,0.00007627199,0.276995,0.00020310367,0.00033530185],"about_ca_topic_score_codex":0.00002289956,"about_ca_topic_score_gemma":0.0000012036974,"teacher_disagreement_score":0.39437282,"about_ca_system_score_codex":0.0000930233,"about_ca_system_score_gemma":0.00023530092,"threshold_uncertainty_score":0.9998492},"labels":[],"label_agreement":null},{"id":"W3092028377","doi":"10.1007/978-3-030-59267-7_13","title":"Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"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 New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Cardinality (data modeling); Constraint (computer-aided design); Mathematics; Maximization; Approximation algorithm; Combinatorics; Discrete mathematics; Function (biology); Mathematical optimization; Computer science","score_opus":0.014829903372045872,"score_gpt":0.23276656047874233,"score_spread":0.21793665710669646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092028377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009081333,0.00025697006,0.99165845,0.0013377457,0.0007066179,0.0007212316,0.000016862974,0.00018264628,0.0050286343],"genre_scores_gemma":[0.075327255,0.00008364997,0.92221445,0.0016615906,0.00036451852,0.000019332212,0.00001119107,0.00004393944,0.00027404813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959122,0.000042920525,0.0005349411,0.0019832067,0.00093291345,0.00059385016],"domain_scores_gemma":[0.9977193,0.0003876857,0.00032923504,0.0010470861,0.00024089534,0.00027583606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005624688,0.00062028586,0.0006281245,0.00068287423,0.00039885123,0.00079135684,0.002491221,0.00023734962,0.000017007906],"category_scores_gemma":[0.000071707575,0.00060775666,0.00011882354,0.00096438936,0.0010287673,0.0008903319,0.0022147184,0.0009239841,0.000021404738],"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.00001729426,0.000058262634,0.00010421651,0.00015888664,0.00004235454,0.000267247,0.0038660285,0.050586484,0.00033322646,0.28601822,0.00002539225,0.65852237],"study_design_scores_gemma":[0.00034383248,0.00014762404,0.00007825557,0.00014346892,0.000006556713,0.000029126502,3.8979462e-7,0.5944229,0.0011665625,0.40280294,0.00034525053,0.0005131056],"about_ca_topic_score_codex":0.00005220048,"about_ca_topic_score_gemma":0.0000730361,"teacher_disagreement_score":0.6580093,"about_ca_system_score_codex":0.00016843,"about_ca_system_score_gemma":0.0003537665,"threshold_uncertainty_score":0.99963737},"labels":[],"label_agreement":null},{"id":"W3092815978","doi":"10.1007/s00453-020-00774-8","title":"The Inverse Voronoi Problem in Graphs II: Trees","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Combinatorics; Mathematics; Shortest path problem; Inverse; Omega; Metric (unit); Binary logarithm; Tree (set theory); Upper and lower bounds; Path (computing); Discrete mathematics; Graph; Physics; Computer science; Geometry","score_opus":0.021066763030633373,"score_gpt":0.22541036658677052,"score_spread":0.20434360355613715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092815978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05576105,0.0030819143,0.6426828,0.2588414,0.0034390728,0.003044508,0.000049534272,0.0027291195,0.030370634],"genre_scores_gemma":[0.4927835,0.00043069792,0.4963008,0.008681867,0.0006253158,0.00021492409,0.0000126739715,0.00006442124,0.0008858269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983307,0.00010027567,0.00032211366,0.0004886517,0.00030237593,0.0004558758],"domain_scores_gemma":[0.99900943,0.00016981961,0.0000798027,0.0005262385,0.000045993358,0.00016868877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028463386,0.00018791083,0.00019024881,0.000083637824,0.0004694979,0.00018731007,0.001750529,0.00006190611,0.000015002568],"category_scores_gemma":[0.000049983275,0.00014385281,0.00012063404,0.0011324078,0.000178116,0.00038760167,0.0007537436,0.00032742304,0.00006558223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018423869,0.00016127795,0.00046311071,0.000016125936,0.000050848925,0.00007975096,0.005020981,0.00017272787,0.00024952096,0.32097572,0.018927407,0.6538641],"study_design_scores_gemma":[0.0011204345,0.00042742823,0.0026872207,0.000034447665,0.000009675967,0.000021168853,0.00025426046,0.5610643,0.0010461994,0.19638835,0.2363396,0.0006069208],"about_ca_topic_score_codex":0.000096916636,"about_ca_topic_score_gemma":0.0002978679,"teacher_disagreement_score":0.6532572,"about_ca_system_score_codex":0.00002685187,"about_ca_system_score_gemma":0.000070775546,"threshold_uncertainty_score":0.5866147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034009725,0.000072960815,0.95906967,0.00053727144,0.0013069414,0.0027172992,0.00049310364,0.00021654343,0.0015764813],"genre_scores_gemma":[0.77250034,0.00004625208,0.22311376,0.0013988635,0.00022862402,0.0008711443,0.0008720804,0.000048525817,0.0009204136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979664,0.00001624896,0.0007855913,0.00026739456,0.0003917411,0.00057264324],"domain_scores_gemma":[0.9980473,0.00053145655,0.00037051213,0.00068385905,0.00027218537,0.00009472125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065904116,0.00026003984,0.00028318938,0.00033634045,0.0005287577,0.0005120636,0.0013341302,0.000121229525,0.00004722797],"category_scores_gemma":[0.000037621376,0.00020103702,0.00031215345,0.0007608465,0.00006684343,0.0019086108,0.000087127846,0.00026311618,0.00009484468],"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.00021006181,0.0007990284,0.014470046,0.003186324,0.0008683889,0.000002003582,0.03216456,0.010876251,0.000081968035,0.5925116,0.018854177,0.32597557],"study_design_scores_gemma":[0.0068503222,0.0009856524,0.017200205,0.00028600616,0.000110735935,0.00004421994,0.0016762756,0.6516534,0.001459552,0.034835372,0.2836698,0.0012284649],"about_ca_topic_score_codex":0.000012087243,"about_ca_topic_score_gemma":0.000017875627,"teacher_disagreement_score":0.7384906,"about_ca_system_score_codex":0.000059416034,"about_ca_system_score_gemma":0.000062894396,"threshold_uncertainty_score":0.81980515},"labels":[],"label_agreement":null},{"id":"W3099735866","doi":"","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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":"Combinatorics; Mathematics; Bounded function; Spanning tree; Steiner tree problem; Minimum degree spanning tree; Minimum spanning tree; Minimum weight; Binary logarithm; Asymptotically optimal algorithm; Upper and lower bounds; Graph; k-minimum spanning tree; Discrete mathematics; K-ary tree; Tree structure; Algorithm; Mathematical analysis","score_opus":0.03766430405973071,"score_gpt":0.2539860380125754,"score_spread":0.2163217339528447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099735866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3797957,0.0027450416,0.61300653,0.0007946647,0.0003028968,0.000587258,0.0000043153113,0.00018132519,0.0025822415],"genre_scores_gemma":[0.88851815,0.00030400165,0.109502606,0.0006214136,0.00015454282,0.00006770422,0.000004102147,0.000019105224,0.00080838765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827653,0.00004484848,0.0003461412,0.00063159585,0.000201801,0.00049907545],"domain_scores_gemma":[0.9989101,0.00045126688,0.00007179411,0.00038542587,0.000042148095,0.00013922073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037446647,0.00025784186,0.00040110637,0.00023029961,0.0003372344,0.0003664981,0.00042631675,0.00010712564,0.000011199813],"category_scores_gemma":[0.00003261765,0.00021735516,0.000101194135,0.00035533297,0.00029365832,0.0006249168,0.000318679,0.00018165028,0.0000011109555],"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.0013250475,0.0010879447,0.23874007,0.00016031766,0.0004491482,0.00046375688,0.014593102,0.0024201109,0.0005570788,0.3746109,0.01631087,0.34928164],"study_design_scores_gemma":[0.0067433966,0.0003332424,0.05185455,0.00007764369,0.000012700239,0.0001428835,0.000121430196,0.902333,0.00011140243,0.03278832,0.004909382,0.00057202094],"about_ca_topic_score_codex":0.00014418297,"about_ca_topic_score_gemma":0.0020467448,"teacher_disagreement_score":0.8999129,"about_ca_system_score_codex":0.000020357713,"about_ca_system_score_gemma":0.00004573687,"threshold_uncertainty_score":0.8863486},"labels":[],"label_agreement":null},{"id":"W3099773693","doi":"","title":"Regular finite decomposition complexity","year":2019,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","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":"McMaster University","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.019232649625109104,"score_gpt":0.24638448892453074,"score_spread":0.22715183929942165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099773693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1577526,0.00077861804,0.7940574,0.006733199,0.0049172477,0.001231005,0.00014047508,0.0018091977,0.032580234],"genre_scores_gemma":[0.6644601,0.00008767431,0.32603016,0.0055979798,0.00076905644,0.00004390958,0.00023376763,0.000059613387,0.0027177255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977015,0.00009810328,0.00034181634,0.0007315528,0.00054257025,0.0005844351],"domain_scores_gemma":[0.99827284,0.00022593253,0.00015669686,0.0010726734,0.000109620305,0.00016221304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036254368,0.0003080731,0.0003755423,0.00007973945,0.0003600047,0.0002884364,0.001332297,0.00020276131,0.0002685506],"category_scores_gemma":[0.000014555847,0.00031298216,0.00042034476,0.00073954987,0.0001515607,0.00061525794,0.00046421986,0.00045196625,0.00063843525],"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.00005224233,0.00067834224,0.012737057,0.0003605768,0.00040316678,0.00007500086,0.004955832,0.0017114569,0.006030954,0.8220804,0.13257894,0.018336074],"study_design_scores_gemma":[0.0028739732,0.0005006312,0.02441885,0.00024353832,0.000047654266,0.00013437677,0.00029800227,0.39661008,0.002828,0.32086876,0.24930327,0.0018728581],"about_ca_topic_score_codex":0.000021808726,"about_ca_topic_score_gemma":0.000014284736,"teacher_disagreement_score":0.5067075,"about_ca_system_score_codex":0.00008585768,"about_ca_system_score_gemma":0.000071410774,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W3099873237","doi":"","title":"Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Regret; Computer science; Maximization; Order (exchange); Algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Machine learning","score_opus":0.04129501515726763,"score_gpt":0.26037031659564563,"score_spread":0.219075301438378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099873237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092556636,0.00017678691,0.9935031,0.0032534811,0.000838834,0.00066387065,0.000044582623,0.0005183242,0.00007546878],"genre_scores_gemma":[0.7053811,0.000023895458,0.2870251,0.005156613,0.0010382193,0.00029955764,0.0008940514,0.0000446995,0.00013674867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983018,0.000032698863,0.0007000995,0.0002808482,0.00035851973,0.0003260326],"domain_scores_gemma":[0.99844044,0.000038942588,0.00044778863,0.0002837016,0.0006443315,0.0001448075],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022493489,0.00022129346,0.00025548303,0.00013735003,0.0004890793,0.0011495822,0.00069368165,0.00011079004,0.0000032556788],"category_scores_gemma":[0.00012701505,0.00020625675,0.00008044274,0.00091739313,0.000042859723,0.0048537226,0.00012701136,0.0001673808,0.00001209033],"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.00008322436,0.00012587602,0.00011634976,0.0034098746,0.000054898675,0.0000032926002,0.01030444,0.042905733,0.00044581335,0.0050173523,0.0037390715,0.9337941],"study_design_scores_gemma":[0.000609955,0.00015156285,0.000056602177,0.000051473802,0.000007486164,0.000024934045,0.000111436995,0.96576786,0.00010984563,0.0002379466,0.032622542,0.00024833597],"about_ca_topic_score_codex":0.000034915975,"about_ca_topic_score_gemma":0.0000039005995,"teacher_disagreement_score":0.93354577,"about_ca_system_score_codex":0.000048338996,"about_ca_system_score_gemma":0.00009034965,"threshold_uncertainty_score":0.99988735},"labels":[],"label_agreement":null},{"id":"W3103645939","doi":"10.1007/978-3-030-83508-8_44","title":"Routing on Heavy-Path WSPD-Spanners","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Mathematics; Routing algorithm; Bounded function; Graph; Discrete mathematics; Static routing; Computer science; Computer network; Distributed computing; Routing protocol","score_opus":0.02440027243317933,"score_gpt":0.24931211597163747,"score_spread":0.22491184353845814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103645939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007164706,0.00044992182,0.98230803,0.0015610676,0.003799006,0.00027696832,0.0000073251017,0.00027669643,0.011249346],"genre_scores_gemma":[0.1170186,0.00012772073,0.87114686,0.007976216,0.0017766727,0.000016823658,0.000018677547,0.00009537598,0.0018230213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994408,0.00006376415,0.0006229595,0.0023732644,0.0015151495,0.0010168514],"domain_scores_gemma":[0.9962181,0.00072096934,0.00030226365,0.002217272,0.00027249256,0.00026891238],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010160177,0.0007283372,0.00071702234,0.0009053599,0.00055183197,0.0010552256,0.0045277537,0.00036322515,0.00004681055],"category_scores_gemma":[0.00015382949,0.00070251676,0.00029486927,0.0011615534,0.0007792909,0.00052410964,0.0023355295,0.0015159638,0.00007452992],"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.00000577794,0.000055937886,0.000020299254,0.000029571365,0.000017019189,0.00039190298,0.0006460935,0.017279424,0.00003417163,0.268564,0.000062512656,0.7128933],"study_design_scores_gemma":[0.00039575435,0.00038214354,0.00011511013,0.0014225648,0.000010381915,0.00018694488,7.4618805e-7,0.72107184,0.0017531549,0.267232,0.005957327,0.0014720042],"about_ca_topic_score_codex":0.0000301913,"about_ca_topic_score_gemma":0.000051285042,"teacher_disagreement_score":0.7114213,"about_ca_system_score_codex":0.00036390705,"about_ca_system_score_gemma":0.0007297407,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W3108038062","doi":"10.1145/3488250","title":"Erasure-Resilient Sublinear-Time Graph Algorithms","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","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":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; National Science Foundation","keywords":"Sublinear function; Degree (music); Property testing; Social connectedness; Erasure; Adjacency list; Mathematics; Algorithm; Discrete mathematics; Graph property; Computer science; Graph; Time complexity; Combinatorics; Theoretical computer science; Line graph","score_opus":0.026755156282618764,"score_gpt":0.27548059888454823,"score_spread":0.24872544260192947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108038062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039513106,0.00029950528,0.99090075,0.0012889942,0.0018203203,0.0005129525,0.00006101013,0.0008049017,0.00036022728],"genre_scores_gemma":[0.2506379,0.000115576986,0.74694306,0.0007893598,0.00018921414,0.00019977323,0.00021664434,0.00008449242,0.00082399667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960048,0.00068104564,0.00059296563,0.0013652212,0.00088544487,0.0004705092],"domain_scores_gemma":[0.99588144,0.0010236278,0.00027477957,0.0020893128,0.0005135829,0.00021728025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079941977,0.0005799989,0.0005691786,0.00071813073,0.0005494386,0.0008370986,0.0021922656,0.00033190427,0.00021722878],"category_scores_gemma":[0.00004517657,0.00057387573,0.00049077906,0.0011461729,0.0002211031,0.00041701476,0.00020434851,0.0013606792,0.00011315296],"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.000073852345,0.0008541704,0.0000034717887,0.00010223849,0.00046668915,0.00009364686,0.0013473952,0.45165396,0.000058742287,0.010468008,0.00014854134,0.5347293],"study_design_scores_gemma":[0.0013551542,0.00043837135,0.0006004745,0.00050076173,0.00017355446,0.00014187982,0.00021505253,0.4965173,0.0033125961,0.49473283,0.0004501322,0.0015619198],"about_ca_topic_score_codex":0.000035797242,"about_ca_topic_score_gemma":0.000015199325,"teacher_disagreement_score":0.53316736,"about_ca_system_score_codex":0.00012104934,"about_ca_system_score_gemma":0.00038956827,"threshold_uncertainty_score":0.9996713},"labels":[],"label_agreement":null},{"id":"W3108451666","doi":"10.48550/arxiv.2011.14450","title":"Approximation algorithms for hitting subgraphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Hypergraph; Combinatorics; Mathematics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Discrete mathematics; Graph","score_opus":0.1562712320790418,"score_gpt":0.21712803545084147,"score_spread":0.06085680337179966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108451666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007225844,0.000076547534,0.9888272,0.00051020586,0.0010120759,0.000658824,0.000049187114,0.0005889921,0.0010511063],"genre_scores_gemma":[0.84558964,0.000088902816,0.15340535,0.00024163634,0.00028013103,0.000007776996,0.00008063524,0.000029636367,0.00027632443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976175,0.00010031486,0.00028006226,0.0014499129,0.0001243393,0.00042791176],"domain_scores_gemma":[0.99799734,0.00021276526,0.00033364765,0.0010420828,0.00021084535,0.00020332982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032750028,0.0003640036,0.0004054883,0.00029944078,0.0003180135,0.00024776836,0.00235309,0.00027373023,0.00000969065],"category_scores_gemma":[0.000073086776,0.00045236837,0.0004628511,0.0008805118,0.00011187215,0.00043631427,0.0019979537,0.00057177024,0.000027273469],"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.000024739293,0.00010343628,0.0002156766,0.0002937786,0.0001415543,0.0000821479,0.00053607265,0.017789155,0.000036906637,0.96236056,0.0007187546,0.017697228],"study_design_scores_gemma":[0.0003340252,0.000045456716,0.00012550016,0.000047003592,0.00003480719,0.0000022364695,0.000043262076,0.64021033,0.00013818327,0.35763702,0.0010421451,0.00034004427],"about_ca_topic_score_codex":0.000052842024,"about_ca_topic_score_gemma":0.000009237802,"teacher_disagreement_score":0.83836377,"about_ca_system_score_codex":0.00010888372,"about_ca_system_score_gemma":0.00015636937,"threshold_uncertainty_score":0.9997928},"labels":[],"label_agreement":null},{"id":"W3109005260","doi":"10.1007/s00453-022-01000-3","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo; Alfred P. Sloan Foundation","keywords":"Mathematics; Monotone polygon; Conjecture; Upper and lower bounds; Combinatorics; Discrete mathematics; Boolean function; Theory of computation; Algorithm","score_opus":0.0248240701737722,"score_gpt":0.21198124739635596,"score_spread":0.18715717722258376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109005260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02918484,0.0006241584,0.95319796,0.00237476,0.005832892,0.0003778154,0.00019522829,0.00085463567,0.0073577403],"genre_scores_gemma":[0.86629534,0.000029218949,0.12745658,0.003109224,0.00076601945,0.00024905952,0.00011110698,0.00006967722,0.0019137629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734676,0.00014197732,0.0003445549,0.0008320967,0.00075816846,0.00057644607],"domain_scores_gemma":[0.998221,0.00018389692,0.00011687649,0.0012276673,0.000061959516,0.00018860004],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033621723,0.00025879723,0.00028743286,0.00020558378,0.0008899363,0.00024355957,0.0023886808,0.000060222592,0.0011466759],"category_scores_gemma":[0.000022635244,0.0002981686,0.00021610556,0.0009943405,0.00012727098,0.00044171224,0.0014703736,0.0005635535,0.00013250887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077241166,0.0022485054,0.00079441065,0.000020372563,0.0006051203,0.0015171444,0.005326694,0.007533645,0.0021058023,0.31603682,0.05145857,0.61227566],"study_design_scores_gemma":[0.0016305129,0.0005310957,0.002454902,0.000016862978,0.00004103846,0.00013337121,0.0003154689,0.41178736,0.0012357575,0.21165413,0.36878014,0.0014193718],"about_ca_topic_score_codex":0.00048965,"about_ca_topic_score_gemma":0.00001258645,"teacher_disagreement_score":0.8371105,"about_ca_system_score_codex":0.00016563188,"about_ca_system_score_gemma":0.00012802091,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W3113424924","doi":"10.1007/978-3-030-61792-9_25","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2020,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotone polygon; Clique; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Discrete mathematics; Function (biology); Generalization; Boolean function","score_opus":0.03200032741610515,"score_gpt":0.23597260365970743,"score_spread":0.20397227624360229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113424924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033150986,0.00018776984,0.9591896,0.004855783,0.0020299433,0.0001913437,0.000005827727,0.00031226658,0.000076491444],"genre_scores_gemma":[0.68129754,0.0000066348457,0.313074,0.005243734,0.0003607218,0.000005638587,0.0000017966152,0.000009491274,4.769675e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641407,0.0000729597,0.0003896113,0.001480468,0.0008694347,0.0007734635],"domain_scores_gemma":[0.9979496,0.00039237982,0.00010799212,0.001061047,0.00012728122,0.00036172266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044470836,0.00032252708,0.00034948473,0.00027188467,0.00036230372,0.00084040646,0.004229282,0.00011025183,0.000046400866],"category_scores_gemma":[0.00018349843,0.00031146928,0.00012544174,0.0037597667,0.0006412566,0.0011368429,0.00137225,0.0005502696,0.00006564194],"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.000021366639,0.00022196345,0.0038984576,0.000019820096,0.000024093035,0.0003040125,0.0073817447,0.21771845,0.00426801,0.006665293,0.000114029834,0.75936276],"study_design_scores_gemma":[0.0003715292,0.00016877642,0.0029946954,0.00003638751,0.0000029979026,0.000011854831,0.0000011019353,0.93806845,0.0049535027,0.052492905,0.00046565963,0.00043213725],"about_ca_topic_score_codex":0.00016480441,"about_ca_topic_score_gemma":0.000053017335,"teacher_disagreement_score":0.7589306,"about_ca_system_score_codex":0.00011215279,"about_ca_system_score_gemma":0.00027454967,"threshold_uncertainty_score":0.9999337},"labels":[],"label_agreement":null},{"id":"W3115470548","doi":"10.1145/3402926","title":"Deterministic APSP, Orthogonal Vectors, and More","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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":"University of Waterloo; National Science Foundation","keywords":"Satisfiability; Deterministic algorithm; Combinatorics; Mathematics; Binary logarithm; Randomized algorithm; Discrete mathematics; Matching (statistics); Algorithm; Statistics","score_opus":0.0392331204555236,"score_gpt":0.2640326974534066,"score_spread":0.22479957699788297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115470548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056505185,0.00009137609,0.98587865,0.007290508,0.00040476775,0.00015526952,0.000039246595,0.0003382594,0.00015138881],"genre_scores_gemma":[0.70774424,0.00008858836,0.28875417,0.003097074,0.0001686041,0.000038767623,0.0000048787324,0.000024504949,0.000079175436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985559,0.000047106,0.00022668173,0.0005608017,0.00031462667,0.00029487928],"domain_scores_gemma":[0.99883056,0.00019327429,0.000047107413,0.0005917165,0.000044922777,0.00029241218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008627064,0.00021489758,0.00020760199,0.000109538276,0.00033872915,0.00015857507,0.0008884301,0.00007598787,0.00006972215],"category_scores_gemma":[0.00003734467,0.00021254689,0.00011040526,0.00055543025,0.00014277485,0.00030480212,0.00004649137,0.00034208136,0.00005447955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016152715,0.00012740493,0.000060064624,0.00002626929,0.000052109994,0.00007735227,0.0012902163,0.0002590914,0.00013811386,0.0033383113,0.00010003829,0.9945149],"study_design_scores_gemma":[0.002859617,0.0019270676,0.016475128,0.00010344172,0.00012377194,0.0004704086,0.00041115956,0.9158303,0.004358043,0.029262587,0.026326627,0.0018518505],"about_ca_topic_score_codex":0.000011928443,"about_ca_topic_score_gemma":0.000005337295,"teacher_disagreement_score":0.992663,"about_ca_system_score_codex":0.000017436869,"about_ca_system_score_gemma":0.00004926183,"threshold_uncertainty_score":0.86674106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014283664,0.000072267016,0.97715276,0.0027403347,0.0008770854,0.0013835861,0.00285953,0.0003838939,0.00024687944],"genre_scores_gemma":[0.54169095,0.00009610585,0.44910604,0.00522003,0.0005063456,0.0004156827,0.0027116947,0.00009540576,0.0001577907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972145,0.000031546977,0.00096951274,0.00048327266,0.00044386525,0.0008572795],"domain_scores_gemma":[0.99816006,0.00017606877,0.00034787678,0.00060560275,0.00028535325,0.00042500618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037562542,0.00045327688,0.0005305841,0.00015972427,0.000550092,0.0007718033,0.001413892,0.00020446711,0.000015401278],"category_scores_gemma":[0.00011827287,0.00043796585,0.00032244594,0.000467199,0.00020236873,0.0015993085,0.00081416237,0.00036697966,0.000034922552],"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.0012764046,0.0016322182,0.0030302808,0.007432093,0.0021647494,0.000098799006,0.053846266,0.0015777505,0.0009771702,0.31126893,0.047303233,0.5693921],"study_design_scores_gemma":[0.003305072,0.0005489738,0.0002620632,0.00006127882,0.00004550367,0.000072942465,0.00046552208,0.89828086,0.0004196344,0.0063096387,0.089590006,0.0006384966],"about_ca_topic_score_codex":0.000008850104,"about_ca_topic_score_gemma":0.0000120268405,"teacher_disagreement_score":0.8967031,"about_ca_system_score_codex":0.00008342119,"about_ca_system_score_gemma":0.00009492796,"threshold_uncertainty_score":0.99980724},"labels":[],"label_agreement":null},{"id":"W3118028601","doi":"10.1007/s10107-025-02301-5","title":"Beyond submodular maximization via one-sided smoothness","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","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 British Columbia; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Multilinear map; Matroid; Combinatorics; Mathematics; Discrete mathematics; Monotone polygon; Nabla symbol; Parameterized complexity; Linear subspace; Polytope; Omega; Pure mathematics; Physics","score_opus":0.01847810080773667,"score_gpt":0.2587033691405789,"score_spread":0.24022526833284222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118028601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001834323,0.00009764085,0.9907789,0.0011258848,0.00022462668,0.00036278542,5.182637e-7,0.00043193373,0.005143338],"genre_scores_gemma":[0.21940112,0.0000022110164,0.7797675,0.00030083285,0.000046501376,0.00008659511,0.000006278333,0.000012682769,0.00037625947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845487,0.000060492875,0.0003690879,0.00040082872,0.0003291606,0.00038555107],"domain_scores_gemma":[0.9988875,0.00022158417,0.0000709753,0.00064132124,0.00009169899,0.00008697009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004518388,0.00016746552,0.00025949746,0.00017492489,0.00023947364,0.00035664803,0.0008088188,0.000086873406,0.000041941094],"category_scores_gemma":[0.00019806302,0.0001620275,0.00011079604,0.0009454589,0.00011092394,0.00031602153,0.00039308143,0.00017734714,0.00007550998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016815512,0.00020585523,0.00003394637,0.00012030038,0.000021709637,0.0000058092123,0.00019315178,0.000018561535,0.00007761514,0.637848,0.000039651863,0.3614337],"study_design_scores_gemma":[0.00022381806,0.000028128012,0.0001136259,0.00012302678,0.00001665857,0.0000093945655,0.000022601509,0.19006126,0.0010587473,0.80659074,0.0015713255,0.00018066679],"about_ca_topic_score_codex":0.000006217823,"about_ca_topic_score_gemma":0.0000026544594,"teacher_disagreement_score":0.36125305,"about_ca_system_score_codex":0.000038633076,"about_ca_system_score_gemma":0.000035578683,"threshold_uncertainty_score":0.660729},"labels":[],"label_agreement":null},{"id":"W3125711631","doi":"10.1007/s10589-020-00261-4","title":"A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Iterated function; Maximum cut; Eigenvalues and eigenvectors; Semidefinite programming; Upper and lower bounds; Mathematical optimization; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.021822011724032295,"score_gpt":0.2932571728029479,"score_spread":0.2714351610789156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125711631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005881394,0.00015593416,0.99168414,0.0063658357,0.00006490518,0.0010008921,0.000039884504,0.00003764548,0.00059195014],"genre_scores_gemma":[0.06382111,0.000028794175,0.9349108,0.0004981353,0.00006998561,0.00045667007,0.000060202685,0.00000846762,0.00014585364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989001,0.00010496201,0.00033552138,0.00031541495,0.00022411076,0.00011987143],"domain_scores_gemma":[0.99663323,0.0018787612,0.00037128926,0.00027954584,0.0007994486,0.00003774315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934545,0.0001091702,0.00013289375,0.000052292857,0.0007015635,0.00013504126,0.00035682213,0.000044704168,0.000006354713],"category_scores_gemma":[0.00011093671,0.00007979215,0.000091897906,0.0007937208,0.00010313799,0.00024676265,0.00016478967,0.000113496935,7.379692e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034420323,0.00005630167,0.000022198572,0.000012378708,0.000029059738,5.6160022e-8,0.00041948847,0.55391544,0.00003199425,0.430162,0.00006866776,0.01527894],"study_design_scores_gemma":[0.00042895673,0.000017221653,0.0007280253,0.000016578233,0.000029450117,0.000011176024,0.00023061567,0.9235432,0.00033637695,0.0726697,0.0018987943,0.000089901194],"about_ca_topic_score_codex":0.0000075922194,"about_ca_topic_score_gemma":0.0000057999086,"teacher_disagreement_score":0.36962774,"about_ca_system_score_codex":0.000025848329,"about_ca_system_score_gemma":0.00018124073,"threshold_uncertainty_score":0.539593},"labels":[],"label_agreement":null},{"id":"W3125922185","doi":"10.1142/s0217595921400017","title":"Non-Submodular Maximization with Matroid and Knapsack Constraints","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","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":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Maximization; Mathematics; Constraint (computer-aided design); Greedy algorithm; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Geometry","score_opus":0.04239402338292181,"score_gpt":0.3160553754276193,"score_spread":0.2736613520446975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125922185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09269167,0.0009986827,0.8763045,0.012947028,0.00031856782,0.0002624198,0.000010513331,0.000017580753,0.016449051],"genre_scores_gemma":[0.91343594,0.00016202012,0.0858813,0.000040186605,0.000112295114,0.000002769891,0.000004740232,0.0000061794594,0.0003545804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979958,0.00018272149,0.00027865655,0.00021397343,0.0010937657,0.00023511186],"domain_scores_gemma":[0.9975994,0.00017579632,0.00007058072,0.00022201301,0.0017801872,0.00015198033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387705,0.00008527617,0.0001541786,0.00023051676,0.00030559453,0.00047770925,0.00035621042,0.00004182069,0.00011865734],"category_scores_gemma":[0.00013639232,0.000068423666,0.000040307506,0.0006415782,0.0003010266,0.00065961335,0.00013382846,0.00042025442,0.000011407952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001316053,0.0005474191,0.009272853,0.00007521872,0.00028378426,0.0020961529,0.0024406034,0.0017604769,0.015153486,0.88375056,0.006387146,0.0781007],"study_design_scores_gemma":[0.0145481145,0.006269704,0.19634627,0.001769642,0.0000831807,0.060068198,0.016783863,0.27666578,0.07730292,0.28977337,0.05798408,0.002404905],"about_ca_topic_score_codex":0.0000018714825,"about_ca_topic_score_gemma":0.0000027679514,"teacher_disagreement_score":0.8207443,"about_ca_system_score_codex":0.000041608717,"about_ca_system_score_gemma":0.00076067954,"threshold_uncertainty_score":0.46065614},"labels":[],"label_agreement":null},{"id":"W3126714247","doi":"10.1109/focs52979.2021.00058","title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"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 Defense; National Science Foundation","keywords":"Combinatorics; Integer (computer science); Bounded function; Algorithm; Computer science; Discrete mathematics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","score_opus":0.02194554114572731,"score_gpt":0.2572976699790676,"score_spread":0.2353521288333403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126714247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012581091,0.0006196555,0.9457881,0.0023709622,0.0051561464,0.0008380806,0.00006627233,0.0013680042,0.031211732],"genre_scores_gemma":[0.25417155,0.0003972377,0.7035869,0.0030157408,0.00074347307,0.0006264888,0.00023851052,0.00016486856,0.03705527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542063,0.00029790765,0.00062035455,0.0017259897,0.0010333739,0.00090171664],"domain_scores_gemma":[0.9966629,0.00020695712,0.00020886616,0.002558334,0.000101803744,0.000261096],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058276,0.0006218899,0.0006426495,0.000532644,0.00033459227,0.00069388415,0.0049738893,0.00031322395,0.0016272875],"category_scores_gemma":[0.000046232068,0.00061180245,0.00058012176,0.00090763264,0.0000828339,0.00028631804,0.009337034,0.0020301864,0.00024566022],"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.00012767786,0.0024810093,0.0013011697,0.00058432535,0.0010388673,0.0014802166,0.0035516154,0.021117438,0.0004538432,0.34534258,0.03011817,0.5924031],"study_design_scores_gemma":[0.0002844605,0.00017410437,0.001480711,0.000060522776,0.000027282014,0.000082135106,0.000030107005,0.9054509,0.000033839267,0.068715,0.022688562,0.00097237877],"about_ca_topic_score_codex":0.0002484044,"about_ca_topic_score_gemma":0.00023732329,"teacher_disagreement_score":0.8843335,"about_ca_system_score_codex":0.0003355643,"about_ca_system_score_gemma":0.00035947605,"threshold_uncertainty_score":0.9996333},"labels":[],"label_agreement":null},{"id":"W3127093867","doi":"10.1109/focs46700.2020.00031","title":"A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract","year":2020,"lang":"en","type":"article","venue":"","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Composition (language); Mathematics; Conjecture; Measure (data warehouse); Characterization (materials science); Boolean function; Function (biology); Oracle; Randomized algorithm; Discrete mathematics; Type (biology); Physics; Computer science","score_opus":0.0623333746463483,"score_gpt":0.27544934783109226,"score_spread":0.21311597318474396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127093867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013887732,0.00013206044,0.9844029,0.010998061,0.00034410888,0.00079878647,0.000021284124,0.00016192689,0.0017520803],"genre_scores_gemma":[0.9479794,0.000014266394,0.050600354,0.0010976902,0.00016472241,0.00009569813,0.000012163099,0.0000060037173,0.000029735102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877316,0.00012626153,0.00040111537,0.0002803423,0.00023422443,0.00018490128],"domain_scores_gemma":[0.9979082,0.0013701456,0.00016055875,0.00036328295,0.00012296745,0.00007489526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066660246,0.00013162688,0.0003574733,0.000037420545,0.00027089106,0.00009375867,0.0006638222,0.000039384944,0.00019352484],"category_scores_gemma":[0.000094313895,0.00008162548,0.00035295123,0.00026568587,0.000503526,0.00023489051,0.0001425078,0.00012142958,0.00001492143],"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.0032709162,0.00010820895,0.0000032514943,0.000025888025,0.00009842492,0.0000010472398,0.00054654886,0.00014114146,0.0005583996,0.9859866,0.0014210606,0.0078385],"study_design_scores_gemma":[0.029194871,0.00014052413,0.00054552977,0.000019231686,0.00006239503,0.000007892295,0.00014824912,0.76250505,0.0066020885,0.19833985,0.0022207976,0.00021353993],"about_ca_topic_score_codex":0.000047712805,"about_ca_topic_score_gemma":0.000005468901,"teacher_disagreement_score":0.9465906,"about_ca_system_score_codex":0.000009004614,"about_ca_system_score_gemma":0.000041566866,"threshold_uncertainty_score":0.33285904},"labels":[],"label_agreement":null},{"id":"W3127553026","doi":"10.1109/focs46700.2020.00045","title":"A New Minimax Theorem for Randomized Algorithms (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Minimax; Computer science; Minimax theorem; Algorithm; Mathematics; Mathematical optimization","score_opus":0.0333413938213585,"score_gpt":0.2703619376936957,"score_spread":0.2370205438723372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127553026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058646874,0.00013244581,0.97295856,0.012995964,0.0003603818,0.00073175697,0.0000053011227,0.00042680398,0.012330146],"genre_scores_gemma":[0.023564097,0.000017574193,0.9708554,0.0039884616,0.00043372405,0.000064767155,0.000005175735,0.000015189881,0.0010555736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984792,0.00004696762,0.0003689908,0.0005071916,0.0002597563,0.00033791375],"domain_scores_gemma":[0.99840957,0.00072752783,0.000098871285,0.000379238,0.00007694938,0.00030785886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046094254,0.00019561533,0.0004672252,0.000058883263,0.00012508308,0.00023602668,0.0011524969,0.000062189225,0.0003426489],"category_scores_gemma":[0.00021910999,0.00015276778,0.00039105816,0.00034163002,0.000083257386,0.00034148386,0.00022355473,0.00012701788,0.00007563383],"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.0014806669,0.00003544718,5.6128926e-7,0.000015504567,0.000058818663,0.000008579429,0.00076179137,0.00000982703,0.000104115614,0.75284165,0.014135139,0.23054789],"study_design_scores_gemma":[0.08047298,0.00015072283,0.000037975744,0.0000124369935,0.000024924264,0.00001243231,0.00005768293,0.4457041,0.0030140593,0.44270968,0.027385984,0.00041703312],"about_ca_topic_score_codex":0.000031759286,"about_ca_topic_score_gemma":0.0000032066557,"teacher_disagreement_score":0.44569427,"about_ca_system_score_codex":0.00001045013,"about_ca_system_score_gemma":0.00011784843,"threshold_uncertainty_score":0.622969},"labels":[],"label_agreement":null},{"id":"W3128575592","doi":"","title":"The maximum weight stable set problem with a budget constraint","year":2020,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","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":"Simon Fraser University","keywords":"Set (abstract data type); Constraint (computer-aided design); Budget constraint; Mathematical optimization; Computer science; Mathematics; Operations research; Economics; Microeconomics; Programming language","score_opus":0.011936377588198606,"score_gpt":0.20322566887286295,"score_spread":0.19128929128466435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128575592","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01586966,0.0016444513,0.2098538,0.008971743,0.0049000885,0.004439705,0.0009699165,0.0027367703,0.75061387],"genre_scores_gemma":[0.44204518,0.005242186,0.23451622,0.003324884,0.0017619735,0.00009837914,0.009088393,0.000708635,0.30321416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777097,0.00013036905,0.00022662811,0.00080612506,0.0005373064,0.0005285793],"domain_scores_gemma":[0.9983242,0.00016385582,0.00027032098,0.0007691764,0.00023727697,0.00023517034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014764165,0.00042068775,0.00036275273,0.00028326694,0.0008417911,0.00038155576,0.0024147932,0.00021582506,0.000047895737],"category_scores_gemma":[0.000012344599,0.0003435634,0.00017831894,0.0015646709,0.00020903813,0.0004968083,0.00026520313,0.0007312972,0.000065693726],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079143804,0.0002988795,0.008720104,0.00053526805,0.0011054567,0.0021075096,0.0012013813,0.00014581438,0.000009630177,0.7578813,0.15253969,0.07466359],"study_design_scores_gemma":[0.00080712675,0.00022926762,0.00008459089,0.00015709837,0.000087897366,7.421239e-8,0.014697414,0.0018673175,0.0005212116,0.010368956,0.97052455,0.0006545128],"about_ca_topic_score_codex":0.00011926206,"about_ca_topic_score_gemma":0.035988186,"teacher_disagreement_score":0.8179849,"about_ca_system_score_codex":0.00012106224,"about_ca_system_score_gemma":0.00053702417,"threshold_uncertainty_score":0.99990165},"labels":[],"label_agreement":null},{"id":"W3131144142","doi":"10.1016/j.orl.2021.09.006","title":"Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid","year":2021,"lang":"en","type":"preprint","venue":"Operations Research Letters","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 British Columbia","funders":"","keywords":"Matroid; Automatic summarization; Heuristics; Greedy algorithm; Computer science; Set function; Set (abstract data type); Mathematical optimization; Submodular set function; Weighted matroid; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Matroid partitioning; Graphic matroid","score_opus":0.0882885469965528,"score_gpt":0.33743894468261254,"score_spread":0.24915039768605973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131144142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5828646,0.0003492898,0.40404758,0.01034925,0.00064360956,0.0014004974,0.00018841351,0.00007251172,0.000084277155],"genre_scores_gemma":[0.5651955,0.0006946303,0.43111923,0.00072191627,0.00035722213,0.001253343,0.00027156604,0.000058328667,0.00032823946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996368,0.0003498237,0.0005607779,0.0011253395,0.0009469335,0.0006491172],"domain_scores_gemma":[0.9970078,0.00038898154,0.00006469979,0.0015488936,0.0008308684,0.00015877979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001554086,0.00033834096,0.0004969397,0.0009057279,0.0010863339,0.0007706512,0.0012484717,0.00019471113,0.000022290633],"category_scores_gemma":[0.00028661606,0.0003487289,0.0002683907,0.00077171915,0.0004559975,0.0005566284,0.0015407474,0.0010957691,0.000009147353],"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.00044541596,0.0032686042,0.0017031546,0.0069645643,0.0026914955,0.00037321332,0.024638513,0.39570734,0.19253276,0.035290956,0.035477083,0.3009069],"study_design_scores_gemma":[0.00065965095,0.00032096248,0.000672318,0.0006272516,0.000030583495,0.000033438686,0.00043823506,0.99151087,0.0030154774,0.00016208312,0.0020843379,0.00044479562],"about_ca_topic_score_codex":0.00021326054,"about_ca_topic_score_gemma":0.000078428915,"teacher_disagreement_score":0.5958035,"about_ca_system_score_codex":0.00012905667,"about_ca_system_score_gemma":0.00035334448,"threshold_uncertainty_score":0.99989647},"labels":[],"label_agreement":null},{"id":"W3133702556","doi":"","title":"Shrinkage of Decision Lists and DNF Formulas.","year":2020,"lang":"en","type":"article","venue":"Electron. Colloquium Comput. Complex.","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Shrinkage; Boolean function; Function (biology); Upper and lower bounds; Domain (mathematical analysis); Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.022438189867162603,"score_gpt":0.24991663093310237,"score_spread":0.22747844106593978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133702556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14331241,0.00094899465,0.84963363,0.0026787654,0.00035992367,0.0005484586,0.000019138753,0.00045492753,0.0020437676],"genre_scores_gemma":[0.8592879,0.000053096945,0.13917097,0.001239429,0.00016900375,0.000010553017,0.000010741332,0.000024537103,0.000033741104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969945,0.000121704026,0.0006509003,0.00086842425,0.0006582156,0.00070627907],"domain_scores_gemma":[0.9980199,0.00043088704,0.00024112962,0.00073022547,0.00020027634,0.00037758748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031131643,0.00038258065,0.0006549814,0.00022001553,0.00031810996,0.00022626955,0.0017573548,0.00010615888,0.000054416785],"category_scores_gemma":[0.00008655386,0.0003916978,0.00020287115,0.0013789715,0.00019378803,0.00046995212,0.0013206743,0.0003711906,0.000029749706],"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.0004058294,0.0007279937,0.0021100526,0.00038352545,0.00031263754,0.00019852682,0.0038998958,0.0014398779,0.029713722,0.68706816,0.040234394,0.23350537],"study_design_scores_gemma":[0.0029916796,0.0023418688,0.020508373,0.000109611545,0.00003729883,0.00017826207,0.000040039427,0.82734597,0.010853892,0.060435258,0.07398829,0.0011694388],"about_ca_topic_score_codex":0.000028385622,"about_ca_topic_score_gemma":0.000022975191,"teacher_disagreement_score":0.8259061,"about_ca_system_score_codex":0.000055640976,"about_ca_system_score_gemma":0.00013972705,"threshold_uncertainty_score":0.9998535},"labels":[],"label_agreement":null},{"id":"W3136251153","doi":"10.48550/arxiv.2103.08061","title":"On distributed algorithms for minimum dominating set problem and beyond","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Distributed algorithm; Algorithm; Computer science; Connected dominating set; Set (abstract data type); Upper and lower bounds; Graph; Theory of computation; Approximation algorithm; Cover (algebra); Randomized algorithm; Mathematics; Theoretical computer science; Distributed computing","score_opus":0.07399647599064386,"score_gpt":0.2143383928248311,"score_spread":0.14034191683418723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136251153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084251165,0.00007933352,0.91309077,0.00025276493,0.0005588475,0.00055093656,0.00027177177,0.00018354788,0.0007608728],"genre_scores_gemma":[0.92860204,0.00007561144,0.070398346,0.00016691515,0.00009032815,0.000007485683,0.0002479518,0.000022519187,0.00038881696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976556,0.000113966205,0.00023949573,0.0014387321,0.00011652608,0.00043572718],"domain_scores_gemma":[0.9979289,0.0004902429,0.00024579343,0.00091732864,0.00023330937,0.00018440561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003292618,0.0003723944,0.00042839063,0.00022209286,0.0003523506,0.00036405405,0.0012366251,0.00026834902,0.000010760104],"category_scores_gemma":[0.00006987725,0.00043956796,0.00024568467,0.00056224084,0.00015177796,0.00030324206,0.0022636042,0.00052757654,0.0000036126812],"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.00007205876,0.00037412427,0.00028943157,0.0005661015,0.0003303445,0.00060908444,0.0014260204,0.035287686,0.000051789302,0.9406462,0.0014530105,0.01889415],"study_design_scores_gemma":[0.00082342146,0.00013286169,0.00014618447,0.00015981813,0.000051880124,0.000010124337,0.00022568848,0.724312,0.00013933044,0.2731765,0.00032011422,0.00050210604],"about_ca_topic_score_codex":0.000037603488,"about_ca_topic_score_gemma":0.000024268906,"teacher_disagreement_score":0.8443509,"about_ca_system_score_codex":0.00012062824,"about_ca_system_score_gemma":0.00015267731,"threshold_uncertainty_score":0.9998056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09501897,0.00028173756,0.8996075,0.0009624782,0.0007624887,0.0009597701,0.0003450968,0.00023508015,0.0018269159],"genre_scores_gemma":[0.25462663,0.00007339012,0.74097633,0.0031277654,0.00022365601,0.0002479811,0.00025206464,0.00006242997,0.0004097386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756396,0.000029626679,0.0008377109,0.00043016855,0.0003634506,0.00077506475],"domain_scores_gemma":[0.9981765,0.00021768715,0.00032509913,0.0006384995,0.0003881816,0.00025398933],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005860065,0.00038083643,0.0004511265,0.00022044004,0.0008405982,0.0011556469,0.0006591103,0.00016934812,0.000013419216],"category_scores_gemma":[0.00011924757,0.0003786111,0.00022440359,0.0005418748,0.00017836395,0.00210097,0.0006732738,0.00030673333,0.000010111336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003976099,0.0015248817,0.0027374518,0.0072760344,0.000757557,0.0009477828,0.08070659,0.00040116577,0.00076270534,0.3210604,0.021629117,0.56179875],"study_design_scores_gemma":[0.011726738,0.0007046546,0.00023190884,0.00066198653,0.00011440382,0.006815212,0.008261381,0.3955231,0.005047367,0.08762598,0.481028,0.0022592836],"about_ca_topic_score_codex":0.000009564057,"about_ca_topic_score_gemma":0.000041388023,"teacher_disagreement_score":0.55953944,"about_ca_system_score_codex":0.00007590606,"about_ca_system_score_gemma":0.00016954231,"threshold_uncertainty_score":0.99988127},"labels":[],"label_agreement":null},{"id":"W3159233598","doi":"10.26421/qic22.9-10-3","title":"Deterministic algorithms for the hidden subgroup problem","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Combinatorics; Abelian group; Deterministic algorithm; Time complexity; Algorithm; Discrete mathematics","score_opus":0.03099737201496289,"score_gpt":0.27165005824911126,"score_spread":0.24065268623414837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159233598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002348935,0.000076909004,0.99502546,0.0012776108,0.00046734692,0.0004619009,0.000016965772,0.00012547015,0.00019941127],"genre_scores_gemma":[0.9262315,0.000014474518,0.07217107,0.0010637362,0.000046184912,0.00035425182,0.000081786995,0.000005373509,0.00003162861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914443,0.00004575841,0.00028283725,0.000118898475,0.00025700912,0.0001510539],"domain_scores_gemma":[0.9993052,0.00027465937,0.00015737585,0.00014661819,0.00007955627,0.00003658213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044123855,0.00008864324,0.00008183912,0.00011340756,0.0010519347,0.00031865746,0.00037189745,0.00001705498,0.000008312212],"category_scores_gemma":[0.000016266538,0.000073736286,0.00004596428,0.00030208167,0.000038398393,0.00084748096,0.00022433432,0.0001069811,0.0000071147183],"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.000009327497,0.000017810218,0.000013996571,0.00003524363,0.000009559095,3.6032034e-7,0.0022965053,0.0031879626,0.0000019975087,0.35902864,0.00080217357,0.6345964],"study_design_scores_gemma":[0.0003500506,0.00016883151,0.00073535135,0.0000036975903,0.000005488883,0.000035902984,0.0004533858,0.903275,0.0000044180124,0.07663542,0.018230414,0.00010203956],"about_ca_topic_score_codex":0.000019046074,"about_ca_topic_score_gemma":0.0000010889992,"teacher_disagreement_score":0.92388254,"about_ca_system_score_codex":0.000029235225,"about_ca_system_score_gemma":0.000045588764,"threshold_uncertainty_score":0.80907375},"labels":[],"label_agreement":null},{"id":"W3160226286","doi":"10.1007/978-3-030-73879-2_23","title":"Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Disjoint sets; Cardinality (data modeling); Bounded function; Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Tree (set theory); Routing (electronic design automation); Computer science","score_opus":0.016773846219433224,"score_gpt":0.2219259976952959,"score_spread":0.20515215147586266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160226286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026165572,0.0010186973,0.9895966,0.0008847848,0.003931522,0.00051168003,0.000014798726,0.0002588874,0.0035213418],"genre_scores_gemma":[0.058665507,0.00018832074,0.9370964,0.0026817762,0.00072736567,0.000043153148,0.00004454721,0.000120047545,0.0004328438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284494,0.000110272405,0.0011082569,0.0029407647,0.0016451093,0.0013506416],"domain_scores_gemma":[0.9958823,0.0005227014,0.00042833498,0.0025661865,0.00025209875,0.00034839366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010120282,0.001038888,0.0011367832,0.0021086137,0.00034023807,0.0009458281,0.0052949935,0.00054367445,0.00004741091],"category_scores_gemma":[0.000077707664,0.0010012711,0.00041062583,0.0020986947,0.0011654696,0.0009178241,0.0029990599,0.0016840135,0.000038824255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008441216,0.00021756612,0.00037349583,0.000099213095,0.00002714785,0.001276175,0.0011448602,0.0020261281,0.00013748748,0.07627025,0.00003440324,0.91838485],"study_design_scores_gemma":[0.00049196824,0.0002216755,0.00029518286,0.00090188475,0.000011391117,0.00031837708,7.8805084e-7,0.28133774,0.0012338083,0.71100867,0.002748689,0.0014298123],"about_ca_topic_score_codex":0.000069084555,"about_ca_topic_score_gemma":0.00083489035,"teacher_disagreement_score":0.916955,"about_ca_system_score_codex":0.00046290873,"about_ca_system_score_gemma":0.000508109,"threshold_uncertainty_score":0.9992438},"labels":[],"label_agreement":null},{"id":"W3164533693","doi":"","title":"Fragile Complexity of Adaptive Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"IT University Of Copenhagen (IT University of Copenhagen)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Binary logarithm; Time complexity; Computational complexity theory; Log-log plot; Sorting; Sequence (biology); Element (criminal law); Algorithm; Worst-case complexity; Computer science; Rank (graph theory); Combinatorics; Mathematics","score_opus":0.05489166506460514,"score_gpt":0.21803141634772433,"score_spread":0.1631397512831192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164533693","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002461427,0.0018104838,0.19151022,0.0006552011,0.00042902428,0.00072649965,0.000860025,0.00011732694,0.8036451],"genre_scores_gemma":[0.019042501,0.00086853054,0.09034099,0.00013169712,0.00005538154,8.139741e-8,0.00017184857,0.000053144744,0.8893358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99579793,0.00024789534,0.0007183031,0.001338238,0.0013038976,0.0005937345],"domain_scores_gemma":[0.9939686,0.000388534,0.0017320157,0.0019737787,0.001541224,0.00039584373],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055227394,0.0007662887,0.0020409033,0.0005808239,0.0005678866,0.000050016522,0.004968018,0.00068735826,0.09654764],"category_scores_gemma":[0.000028962617,0.0011190835,0.0011583186,0.00056502986,0.002281407,0.0010161119,0.002982594,0.00082671613,0.0026432723],"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.00049051445,0.0006416151,0.0000022311228,0.0006209202,0.002107934,0.0018608246,0.006545634,0.00025888585,0.00038467918,0.30483866,0.6619651,0.020283034],"study_design_scores_gemma":[0.0023031526,0.0007226533,0.0002705088,0.0011385685,0.00055743,0.000038912865,0.0032251521,0.0034768041,0.0013653926,0.0026501506,0.9829387,0.0013125467],"about_ca_topic_score_codex":0.0012989206,"about_ca_topic_score_gemma":0.0009402199,"teacher_disagreement_score":0.32097363,"about_ca_system_score_codex":0.0002559352,"about_ca_system_score_gemma":0.0011311559,"threshold_uncertainty_score":0.9991259},"labels":[],"label_agreement":null},{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","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":"Simon Fraser University","funders":"","keywords":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","score_opus":0.08495536218311425,"score_gpt":0.2882672099705096,"score_spread":0.20331184778739533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316638553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13473773,0.00012707802,0.8368512,0.018374903,0.00042912705,0.00044317893,0.000083034014,0.00031961352,0.00863414],"genre_scores_gemma":[0.8724818,0.0000022576926,0.12544134,0.0018309923,0.00011760409,0.0000142838835,0.000028625249,0.00001258027,0.00007048486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971755,0.00030662952,0.00060224085,0.00057852705,0.0009155673,0.0004215225],"domain_scores_gemma":[0.9973446,0.0009502349,0.0002950032,0.00092425145,0.0003457952,0.00014012118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914148,0.0003090834,0.0003921013,0.0001950434,0.0005661559,0.00015264607,0.002072928,0.000066757566,0.00031548753],"category_scores_gemma":[0.00013762974,0.00024206901,0.00026895182,0.0007617197,0.0014174461,0.00035992195,0.0005908431,0.0003884404,0.00018270728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018827739,0.0002714585,0.00012915448,0.0000131471215,0.0000391812,0.0000022528802,0.00024764292,0.014159079,0.000020651869,0.97230726,0.004441397,0.008349938],"study_design_scores_gemma":[0.00031005382,0.00009450181,0.032961193,0.000023128658,0.000004690929,0.000016489534,0.000009467255,0.31587905,0.00022294321,0.6486314,0.0016526922,0.00019440395],"about_ca_topic_score_codex":0.00007592309,"about_ca_topic_score_gemma":0.000042815012,"teacher_disagreement_score":0.7377441,"about_ca_system_score_codex":0.00008478186,"about_ca_system_score_gemma":0.00012997039,"threshold_uncertainty_score":0.9871288},"labels":[],"label_agreement":null},{"id":"W3166952120","doi":"10.1007/978-3-030-36412-0_10","title":"A Randomized Approximation Algorithm for Metric Triangle Packing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Triangle inequality; Approximation algorithm; Combinatorics; Disjoint sets; Randomized algorithm; Vertex (graph theory); Mathematics; Metric (unit); Graph; Discrete mathematics; Algorithm; Computer science","score_opus":0.027703865774299303,"score_gpt":0.2624524088311046,"score_spread":0.2347485430568053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166952120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030025064,0.00090874813,0.9904213,0.00038174956,0.0034942033,0.0022531534,0.00001671041,0.00022005712,0.0023010846],"genre_scores_gemma":[0.0020389636,0.000056109206,0.9958312,0.0007014378,0.0006091399,0.00006768529,0.000018802028,0.000042111566,0.00063458533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995358,0.000100648766,0.00087533635,0.0017614753,0.0011286122,0.00077593204],"domain_scores_gemma":[0.99403554,0.003346538,0.0006026615,0.0014573687,0.0004105382,0.00014734226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036929043,0.00062646554,0.00145217,0.002195455,0.00033889638,0.00087164703,0.003416057,0.00037010934,0.000017792949],"category_scores_gemma":[0.00042661472,0.00055065204,0.00061225623,0.0014301373,0.0006836768,0.0008020337,0.0010400402,0.0006634477,0.00003496941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012624153,0.00002625862,4.9705267e-7,0.00005672122,0.000027730854,0.000007960408,0.00034597065,0.0029708834,0.0000045757065,0.076830864,0.000012336768,0.91958994],"study_design_scores_gemma":[0.01471526,0.00009026807,0.0000012024889,0.00021424975,0.000017163995,0.000022063103,1.2189923e-7,0.6581823,0.0002322449,0.32536447,0.0007045652,0.00045608415],"about_ca_topic_score_codex":0.0000132978375,"about_ca_topic_score_gemma":0.0000088671795,"teacher_disagreement_score":0.9191339,"about_ca_system_score_codex":0.00028184656,"about_ca_system_score_gemma":0.0006300061,"threshold_uncertainty_score":0.9996945},"labels":[],"label_agreement":null},{"id":"W3170119173","doi":"10.1137/22m1480616","title":"Unambiguous DNFs and Alon–Saks–Seymour","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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":"European Regional Development Fund","keywords":"Mathematics; Logarithm; Combinatorics; Partition (number theory); Chromatic scale; Graph; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","score_opus":0.025012964549539742,"score_gpt":0.27128595249382187,"score_spread":0.24627298794428212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170119173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5786389,0.00057964417,0.40094858,0.008369503,0.004815583,0.00019910753,0.0000031753068,0.0011263685,0.0053191003],"genre_scores_gemma":[0.9738891,0.00007844219,0.024349649,0.0007350097,0.0007062688,6.8339943e-7,0.0000010101588,0.000017616178,0.00022222732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982275,0.00012208137,0.00034131872,0.00035258848,0.00044484102,0.0005116813],"domain_scores_gemma":[0.99893296,0.00028115304,0.00016772175,0.0003064217,0.0000858349,0.00022588614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880792,0.00018381009,0.0002256137,0.00037276975,0.00080818875,0.00058650755,0.0007894428,0.000055911274,0.000010127031],"category_scores_gemma":[0.00008454891,0.00016750881,0.00011306411,0.0009074593,0.00005716739,0.0002613595,0.00051997276,0.00058852974,0.0001340094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013426493,0.0001028148,0.0013275348,0.000037919173,0.00008099319,0.0012895636,0.0021057946,0.005745376,0.00030336945,0.087073945,0.008071805,0.89384747],"study_design_scores_gemma":[0.0012006696,0.00051929476,0.035227902,0.000355801,0.000011095521,0.0025213775,0.00018837163,0.8527107,0.00036384916,0.09130029,0.014950553,0.00065008504],"about_ca_topic_score_codex":0.0000075253247,"about_ca_topic_score_gemma":0.0000016536501,"teacher_disagreement_score":0.89319736,"about_ca_system_score_codex":0.00004238656,"about_ca_system_score_gemma":0.000053990836,"threshold_uncertainty_score":0.68308115},"labels":[],"label_agreement":null},{"id":"W3174034613","doi":"10.1145/3409964.3461794","title":"Four Shades of Deterministic Leader Election in Anonymous Networks","year":2021,"lang":"en","type":"article","venue":"","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":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Node (physics); Computer science; Task (project management); Context (archaeology); Identifier; Computer network; Theoretical computer science; Computer security; Engineering","score_opus":0.02998807016376363,"score_gpt":0.24835406710797217,"score_spread":0.21836599694420855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174034613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025072305,0.00015503811,0.9701492,0.00030342623,0.0003151864,0.000045834408,3.0012615e-7,0.000059477316,0.0038992304],"genre_scores_gemma":[0.9517174,0.00001622425,0.047544062,0.00019140173,0.00004125282,0.0000034085544,7.733712e-7,0.000003065659,0.00048243735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928766,0.000047277306,0.00017433727,0.00021067023,0.00011070289,0.00016932526],"domain_scores_gemma":[0.99953765,0.00009510315,0.000034698587,0.00025130293,0.000053102438,0.000028159066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010856016,0.00006522119,0.000117973126,0.000077192955,0.00003609091,0.000046503315,0.00025728825,0.000042145526,0.00004628476],"category_scores_gemma":[0.00002976639,0.000064436834,0.000046203084,0.00062506075,0.000032511358,0.00013865778,0.000115156574,0.00010495599,0.0000038131482],"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.000017380251,0.00059104525,0.013208575,0.0000924379,0.000046747416,0.00053871627,0.0011016704,0.009333211,0.0039131083,0.3181482,0.0013478391,0.6516611],"study_design_scores_gemma":[0.0002587993,0.000079351965,0.019702775,0.000031598993,0.000003073735,0.00011662409,0.000052403804,0.95491457,0.0052680373,0.018892393,0.00052179594,0.00015859322],"about_ca_topic_score_codex":0.000036260626,"about_ca_topic_score_gemma":0.0002669501,"teacher_disagreement_score":0.9455813,"about_ca_system_score_codex":0.000013256615,"about_ca_system_score_gemma":0.000047320627,"threshold_uncertainty_score":0.2627658},"labels":[],"label_agreement":null},{"id":"W3178051994","doi":"10.3934/jimo.2021116","title":"Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem","year":2021,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","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 New Brunswick","funders":"","keywords":"Steiner tree problem; Stochastic optimization; Mathematical optimization; Computer science; Stochastic programming; Tree (set theory); Constant (computer programming); Approximation algorithm; Optimization problem; Mathematics; Combinatorics","score_opus":0.037908615113591684,"score_gpt":0.23958581426675862,"score_spread":0.20167719915316695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178051994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001067844,0.000061395156,0.9976434,0.00087568857,0.00028909242,0.0004782616,0.000002189646,0.000018776465,0.0005243724],"genre_scores_gemma":[0.0027520342,0.000059932623,0.996583,0.000066041765,0.0002120375,0.00002050331,0.00000842154,0.0000073649394,0.000290693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.00005126873,0.0003771913,0.00017440764,0.0002624237,0.00013421466],"domain_scores_gemma":[0.99903595,0.000077750774,0.00037960967,0.0001055816,0.00034707223,0.00005404044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043128233,0.00010483885,0.0001798292,0.00017813426,0.00018599744,0.00028707224,0.00014619676,0.000048298345,0.000005188496],"category_scores_gemma":[0.000043257864,0.000083743354,0.000045282904,0.00051760057,0.000026746393,0.0005489747,0.00007761623,0.00011261917,9.702817e-8],"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.00012505068,0.0002015902,0.000016113341,0.00007024975,0.00025758852,0.000033534463,0.00035088713,0.43794286,0.000032761596,0.056959353,0.00092320435,0.5030868],"study_design_scores_gemma":[0.0037147813,0.00041912936,0.0000062878794,0.00021809875,0.000084404324,0.00009060157,0.00025286153,0.9911386,0.0001752594,0.0032071776,0.0005502923,0.00014252562],"about_ca_topic_score_codex":0.0000010194474,"about_ca_topic_score_gemma":0.0000017318903,"teacher_disagreement_score":0.5531957,"about_ca_system_score_codex":0.000038799513,"about_ca_system_score_gemma":0.000097627686,"threshold_uncertainty_score":0.34149548},"labels":[],"label_agreement":null},{"id":"W3183859668","doi":"10.1007/978-3-030-79987-8_26","title":"Approximation Algorithms for Hitting Subgraphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Combinatorics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Graph; Discrete mathematics; Computer science; Mathematics; Algorithm","score_opus":0.033338767995964066,"score_gpt":0.26544700857681075,"score_spread":0.23210824058084667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183859668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018577372,0.0009815034,0.9925501,0.0007962993,0.0029124178,0.00064599985,0.0000146400735,0.00024499669,0.001835469],"genre_scores_gemma":[0.0037097286,0.00006369253,0.9939889,0.0009602672,0.0007701167,0.00003983342,0.0000297599,0.000041772742,0.0003959363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953967,0.000037819416,0.0006870464,0.002021227,0.0010196799,0.00083756243],"domain_scores_gemma":[0.996504,0.0008588106,0.00037423134,0.0015605326,0.00052098674,0.00018141422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013206035,0.0005910568,0.00065307325,0.0010158627,0.00053589744,0.0009776711,0.0033309355,0.00035880267,0.000018438916],"category_scores_gemma":[0.00017387493,0.0005996765,0.00034209105,0.0010637471,0.0006013393,0.0007431388,0.0013625191,0.00075095834,0.000010473702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022223398,0.000028574563,0.0000074242444,0.000069871436,0.000013977875,0.000030882886,0.00036650745,0.002658052,0.00005383528,0.14618133,0.00002071622,0.8505666],"study_design_scores_gemma":[0.00025591438,0.000096449796,0.000021166406,0.00029910923,0.0000078050725,0.000057061916,2.9218285e-7,0.6048854,0.0012373115,0.39001793,0.0025631483,0.00055842556],"about_ca_topic_score_codex":0.000012886675,"about_ca_topic_score_gemma":0.000036986625,"teacher_disagreement_score":0.8500082,"about_ca_system_score_codex":0.00022007998,"about_ca_system_score_gemma":0.00056821766,"threshold_uncertainty_score":0.9996455},"labels":[],"label_agreement":null},{"id":"W3184920538","doi":"10.1109/focs52979.2021.00080","title":"LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic","year":2022,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"Royal Society","keywords":"Equivalence (formal languages); Bounded function; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm","score_opus":0.022093047755522524,"score_gpt":0.23088522474277096,"score_spread":0.20879217698724845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184920538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660088,0.00038441422,0.16340727,0.0057966,0.0016236927,0.0009712873,0.00001048194,0.00061954424,0.061177928],"genre_scores_gemma":[0.9845997,0.0000032868702,0.013867267,0.0005702141,0.000014678876,0.00005248711,0.0000012585115,0.0000057310444,0.00088534644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858624,0.00009159063,0.00021942821,0.00046277497,0.00033499408,0.0003049793],"domain_scores_gemma":[0.9992457,0.00008905861,0.000038349823,0.00052825396,0.000026254194,0.00007237568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006571701,0.000115301285,0.00015586709,0.0001737599,0.00041367632,0.0002302404,0.00068706716,0.0000265265,0.00026806694],"category_scores_gemma":[0.000032116535,0.00011652651,0.000050061964,0.00077576714,0.00014698638,0.00033624173,0.0009677983,0.00033667395,0.0000067454557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013627321,0.00060644984,0.006487595,0.000029995423,0.000014319286,0.00006392513,0.0017403618,0.000121532146,0.000059495116,0.8474164,0.0003706631,0.14307564],"study_design_scores_gemma":[0.00089833897,0.00046775248,0.032955866,0.0000067812953,0.0000035559217,0.00009937584,0.0003438989,0.15902108,0.00006303779,0.75757766,0.0481048,0.0004578239],"about_ca_topic_score_codex":0.00024179304,"about_ca_topic_score_gemma":0.00016791464,"teacher_disagreement_score":0.21859093,"about_ca_system_score_codex":0.00010884886,"about_ca_system_score_gemma":0.00009704034,"threshold_uncertainty_score":0.4751813},"labels":[],"label_agreement":null},{"id":"W3185873601","doi":"10.1007/s10878-021-00753-x","title":"Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Set cover problem; Mathematical optimization; Cover (algebra); Computer science; Stochastic programming; Approximation algorithm; Set (abstract data type); Covering problems; Stochastic optimization; Theory of computation; Optimization problem; Combinatorial optimization; Knapsack problem; Vertex cover; Mathematics; Algorithm","score_opus":0.031047118973509858,"score_gpt":0.2593955644821698,"score_spread":0.22834844550865996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185873601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027387606,0.00014565416,0.9943435,0.00052970025,0.0019644466,0.00020421694,0.0000057462357,0.000024671375,0.000043277054],"genre_scores_gemma":[0.17234471,0.000041178002,0.8268877,0.000091899215,0.00051163736,0.000008150143,0.00002535621,0.000020261088,0.00006905685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860317,0.00009556595,0.0004270648,0.0002270408,0.0004617921,0.00018538123],"domain_scores_gemma":[0.9979757,0.0002158726,0.00047268666,0.00021352654,0.0010102243,0.00011195908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043928542,0.00014890808,0.00029204218,0.00014485062,0.00018232084,0.00034111855,0.0002637386,0.00007897685,0.000016437421],"category_scores_gemma":[0.0002530751,0.000120699384,0.00007667223,0.00049064896,0.000051539508,0.0009937672,0.00008294306,0.00015164283,6.052121e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080375036,0.0009771821,0.000052694115,0.00015217761,0.00023178189,0.0000957982,0.0013768043,0.9025235,0.0006988055,0.07677143,0.0010529306,0.015263115],"study_design_scores_gemma":[0.003908475,0.0012623781,0.000041871575,0.00012784763,0.00006278907,0.00036816348,0.00005962603,0.9667606,0.0015813342,0.025065145,0.00053638004,0.00022542727],"about_ca_topic_score_codex":0.0000014709494,"about_ca_topic_score_gemma":3.3379905e-7,"teacher_disagreement_score":0.16960596,"about_ca_system_score_codex":0.000076113436,"about_ca_system_score_gemma":0.00023629589,"threshold_uncertainty_score":0.4921978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31982264,0.00009847357,0.6494095,0.0054363324,0.0023053845,0.00243007,0.0011170645,0.0004285996,0.01895197],"genre_scores_gemma":[0.9472359,0.00003465745,0.04959088,0.0023591,0.00011627082,0.00011222612,0.00016166289,0.000035944027,0.0003533849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679846,0.00014065616,0.0011054494,0.00036242558,0.0008459907,0.00074704684],"domain_scores_gemma":[0.9965779,0.00076496176,0.00035843631,0.0015909942,0.0005331209,0.00017458951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912644,0.00036434157,0.0005075,0.00020404227,0.000557465,0.00044811462,0.0020565072,0.00014484723,0.00008220033],"category_scores_gemma":[0.00021809887,0.00027775424,0.00037706847,0.00072076276,0.0005739649,0.00070705154,0.0010067525,0.0005974331,0.0000934885],"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.000048544764,0.00076603994,0.0006065108,0.00088279916,0.0001908804,0.000019465358,0.009345456,0.00039405905,0.000169387,0.973199,0.0043312693,0.010046592],"study_design_scores_gemma":[0.004112328,0.001275254,0.0027616837,0.0008769995,0.000069413974,0.0004834393,0.0022271143,0.72466916,0.01079696,0.21792217,0.033317808,0.001487665],"about_ca_topic_score_codex":0.000023583336,"about_ca_topic_score_gemma":0.000028490113,"teacher_disagreement_score":0.75527686,"about_ca_system_score_codex":0.00007186403,"about_ca_system_score_gemma":0.0002086428,"threshold_uncertainty_score":0.99996746},"labels":[],"label_agreement":null},{"id":"W3186774379","doi":"10.4230/lipics.icalp.2021.9","title":"Almost-Linear-Time Weighted &#120001; 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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23483679,0.00034665526,0.74332213,0.0026750634,0.0031034222,0.0022079025,0.00062457955,0.0009212499,0.011962216],"genre_scores_gemma":[0.50236356,0.00032778297,0.4877787,0.004723767,0.00037057645,0.00035418928,0.0020380828,0.00014300767,0.0019003273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958848,0.00009244308,0.0015321135,0.000613465,0.00076993357,0.0011072768],"domain_scores_gemma":[0.9968143,0.00027125675,0.00045845748,0.0015717677,0.000551145,0.00033304896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007026226,0.00054862123,0.0006515983,0.00060465315,0.00048234896,0.0005010552,0.0018625704,0.00030079283,0.00014078342],"category_scores_gemma":[0.00008716253,0.00055519416,0.00043486708,0.0017836995,0.00020101253,0.0022489782,0.0006940956,0.00062047754,0.00050099497],"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.00085570733,0.009842356,0.03868462,0.0028509123,0.002256803,0.0010221748,0.08808323,0.0018804154,0.004678726,0.49896124,0.05891575,0.29196808],"study_design_scores_gemma":[0.0059394194,0.000304905,0.0035223207,0.00030057543,0.000062140905,0.00043426178,0.0008852074,0.8348144,0.008883215,0.028575387,0.11456812,0.0017100191],"about_ca_topic_score_codex":0.000037792277,"about_ca_topic_score_gemma":0.00006691003,"teacher_disagreement_score":0.832934,"about_ca_system_score_codex":0.00018710028,"about_ca_system_score_gemma":0.00024110655,"threshold_uncertainty_score":0.99968994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029840486,0.0003899677,0.9857943,0.001112941,0.0031367042,0.0041036247,0.0016759472,0.0002517122,0.0005507542],"genre_scores_gemma":[0.04989778,0.00023076554,0.9417846,0.0020360053,0.00044308274,0.002870374,0.0023494984,0.00012889167,0.00025900936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420273,0.0001300686,0.0023135666,0.000953425,0.00092661375,0.0014736169],"domain_scores_gemma":[0.9949066,0.0010612583,0.0010691419,0.0021080412,0.00060053635,0.00025444003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019432891,0.0009886905,0.0011943106,0.0006877553,0.0007144838,0.0018888762,0.0045295106,0.0007041583,0.000016340393],"category_scores_gemma":[0.00010392237,0.0008088595,0.0010281358,0.00081125926,0.00036541893,0.0012878678,0.0038016273,0.0018107995,0.000015083252],"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.00011378892,0.0010028445,0.0006730236,0.004739804,0.0011688787,0.00008461754,0.059521977,0.0035666951,0.000007619141,0.030409595,0.009509184,0.889202],"study_design_scores_gemma":[0.0029452124,0.00019905114,0.00015125642,0.0010238831,0.00008099948,0.00010510478,0.0030261748,0.9510344,0.00017624849,0.017765265,0.02241655,0.0010758511],"about_ca_topic_score_codex":0.00012713118,"about_ca_topic_score_gemma":0.00020387162,"teacher_disagreement_score":0.9474677,"about_ca_system_score_codex":0.00027438247,"about_ca_system_score_gemma":0.0004198116,"threshold_uncertainty_score":0.9994362},"labels":[],"label_agreement":null},{"id":"W3193621667","doi":"10.1007/978-3-030-64018-7_1","title":"A Book About Network Design","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Network planning and design; Selection (genetic algorithm); Computer science; Graph; Combinatorial optimization; Theoretical computer science; Mathematics; Artificial intelligence; Computer network","score_opus":0.04296006355214073,"score_gpt":0.22785402133400132,"score_spread":0.18489395778186057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193621667","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.713111e-10,0.005233318,0.53999865,0.00090482406,0.00040666896,0.00015129059,0.0000017073756,0.00031942074,0.45298412],"genre_scores_gemma":[0.0000010591515,0.00051422545,0.31573802,0.013684016,0.00073435233,0.000007807059,0.000004536835,0.000029760502,0.66928625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827784,0.000025335581,0.00030874758,0.00069164153,0.00037221704,0.0003242375],"domain_scores_gemma":[0.99864364,0.00016503355,0.0001327421,0.0008102685,0.00005732233,0.00019097216],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015795445,0.00036078817,0.00039521238,0.000074175936,0.00016147256,0.00022860429,0.001660976,0.00021969072,0.0015785493],"category_scores_gemma":[0.000006992359,0.00034122224,0.00024886132,0.00007942612,0.000089967616,0.0002036852,0.0007193514,0.00047666655,0.0011605144],"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.0000016815108,0.0000023909893,4.5580233e-8,0.000006175146,0.0000286145,0.000046368852,0.000021678341,0.00009333292,1.5773881e-7,0.6293056,0.35579592,0.014697993],"study_design_scores_gemma":[0.00006269798,0.00006256606,7.950882e-7,0.00005781964,0.000008745911,0.000012060634,1.6353916e-7,0.019733215,0.0000037394786,0.3257757,0.6539937,0.00028877202],"about_ca_topic_score_codex":0.000002899813,"about_ca_topic_score_gemma":0.0000017378707,"teacher_disagreement_score":0.30352992,"about_ca_system_score_codex":0.00002880385,"about_ca_system_score_gemma":0.00012570899,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W3196918370","doi":"10.4230/lipics.esa.2021.36","title":"An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"European Commission","keywords":"Mathematics; Submodular set function; Mathematical optimization; Applied mathematics; Divergence (linguistics); Convergence (economics); Parametric statistics; Markov decision process; Newton's method; Time complexity; Polynomial; Combinatorics; Markov process; Nonlinear system","score_opus":0.10893362346287878,"score_gpt":0.25793020884617324,"score_spread":0.14899658538329447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196918370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17533037,0.00005184054,0.82353944,0.00013697724,0.00013467163,0.00016386609,0.0000081978205,0.00014505888,0.00048959727],"genre_scores_gemma":[0.9819565,0.000019261264,0.017388532,0.00017314681,0.00005391245,0.0000019285394,0.000011159071,0.0000074918803,0.00038807924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983639,0.00034393405,0.00015286442,0.0008072785,0.000083821964,0.00024816598],"domain_scores_gemma":[0.9985818,0.0001263635,0.000070594666,0.0007025399,0.00028552292,0.00023316713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045243054,0.00015104008,0.00020143366,0.00012701756,0.00024377844,0.0002089329,0.0006788774,0.000069437956,0.000017987764],"category_scores_gemma":[0.000024771625,0.00017502818,0.00004119572,0.0013296837,0.000023221117,0.0007268873,0.00037572024,0.00013438797,0.000028545726],"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.000010125492,0.000110349334,0.001155176,0.00002612556,0.000029013316,0.000045138622,0.00027488833,0.055401824,0.008792858,0.93174714,0.00004458881,0.002362794],"study_design_scores_gemma":[0.00037216247,0.00004618569,0.0016442188,0.000013546855,0.000017780607,0.000018599421,0.00013069992,0.97731674,0.001754914,0.016835628,0.0015945017,0.00025504912],"about_ca_topic_score_codex":0.0002739404,"about_ca_topic_score_gemma":0.000041502324,"teacher_disagreement_score":0.9219149,"about_ca_system_score_codex":0.000056227705,"about_ca_system_score_gemma":0.00008134134,"threshold_uncertainty_score":0.7137442},"labels":[],"label_agreement":null},{"id":"W3198583770","doi":"10.1007/s00037-023-00241-0","title":"The Power of Natural Properties as Oracles","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Mathematics; Discrete mathematics; Randomized algorithm; Upper and lower bounds; Random oracle; Computer science","score_opus":0.06434584726470818,"score_gpt":0.28898157429051835,"score_spread":0.22463572702581017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198583770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86241937,0.0011545565,0.11481959,0.012289633,0.0026020964,0.0005956864,0.000028912908,0.0012641399,0.004826037],"genre_scores_gemma":[0.9862307,0.0000066914286,0.013261604,0.0001964511,0.00003881581,0.000010900512,0.000012594877,0.0000071975337,0.00023505828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984352,0.00011656667,0.0003105144,0.00028068468,0.00058146927,0.0002755712],"domain_scores_gemma":[0.9986136,0.00049369404,0.000120368,0.0004056511,0.00030993533,0.000056727433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044196763,0.00013454672,0.000161703,0.00012133549,0.00064706034,0.0001709124,0.0012471222,0.000027413913,0.00001549886],"category_scores_gemma":[0.00013889132,0.00009477321,0.00012012193,0.00097458245,0.00054903154,0.00026541884,0.00061243284,0.00016821484,0.0001827621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016831473,0.000042372194,0.00016968917,0.000014379546,0.00003550016,0.000006118008,0.0007032724,0.0036427812,0.000108587126,0.98296475,0.0026335358,0.009662151],"study_design_scores_gemma":[0.00015938513,0.000052922478,0.0405492,0.00001773624,0.0000018533927,0.000017583792,0.00008789256,0.32110623,0.00024603764,0.63483423,0.0027961507,0.00013079241],"about_ca_topic_score_codex":0.000034109293,"about_ca_topic_score_gemma":0.000013177445,"teacher_disagreement_score":0.34813058,"about_ca_system_score_codex":0.000021735994,"about_ca_system_score_gemma":0.000121656274,"threshold_uncertainty_score":0.49767303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52847826,0.00050521526,0.44747016,0.0025979185,0.003394224,0.0015484574,0.00058332755,0.0008796486,0.014542817],"genre_scores_gemma":[0.68502045,0.00015058619,0.31070134,0.0027477874,0.00021676101,0.00015467423,0.0005921153,0.000064719185,0.00035157954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968287,0.00007796415,0.0011955819,0.0004272423,0.0005574621,0.0009131009],"domain_scores_gemma":[0.9979405,0.00027372094,0.0003264517,0.0010033755,0.00024893426,0.00020706505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006306947,0.00039026616,0.00051197736,0.0004785435,0.00037315008,0.00052572467,0.0014980485,0.00020790487,0.00003154657],"category_scores_gemma":[0.00010678261,0.00038875517,0.0003147426,0.0011497928,0.000113274495,0.0017300366,0.0005816931,0.0005484378,0.000073980635],"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.0001255542,0.0017955517,0.055888485,0.0014468165,0.000521706,0.0003611285,0.036234837,0.00027207722,0.00042414884,0.70291007,0.009344611,0.19067502],"study_design_scores_gemma":[0.010894542,0.00046080002,0.025024245,0.001259537,0.00006870501,0.00070662476,0.004930963,0.58108777,0.007861921,0.21026047,0.15445267,0.0029917809],"about_ca_topic_score_codex":0.00003274556,"about_ca_topic_score_gemma":0.00011003052,"teacher_disagreement_score":0.5808157,"about_ca_system_score_codex":0.00009967203,"about_ca_system_score_gemma":0.00014421335,"threshold_uncertainty_score":0.9998564},"labels":[],"label_agreement":null},{"id":"W3202223927","doi":"10.48550/arxiv.2109.12736","title":"Hardness of Graph-Structured Algebraic and Symbolic Problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Finite field; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Diagonal; Laplacian matrix; Coefficient matrix; Polynomial ring; Polynomial; Matrix (chemical analysis); Graph; Ring (chemistry); Field (mathematics); Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.057932253981401345,"score_gpt":0.1750413654552177,"score_spread":0.11710911147381636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202223927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6153044,0.00057420915,0.3820079,0.000056895395,0.0009132056,0.00027260018,0.000022100858,0.0001569699,0.00069171574],"genre_scores_gemma":[0.99420154,0.000479926,0.0050086346,0.00004299019,0.000033631066,9.665816e-7,0.000015973152,0.000013020575,0.00020331044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980951,0.00013803101,0.00024099376,0.0010980464,0.000121981684,0.0003058754],"domain_scores_gemma":[0.99807876,0.000064042244,0.00026653465,0.0012295076,0.00020448968,0.0001566509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016799085,0.0003143488,0.0005095506,0.0003635252,0.00013883156,0.00015382566,0.0015858305,0.0002578402,0.000021497961],"category_scores_gemma":[0.000020506217,0.0003657361,0.0002474574,0.00095735205,0.00030024155,0.00031352814,0.0028757842,0.0005143599,0.000002171664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098979,0.0002525931,0.008255933,0.0011346133,0.0005397939,0.00036034346,0.0025042682,0.030560227,0.0005217853,0.9496387,0.00023122266,0.005979505],"study_design_scores_gemma":[0.0011583321,0.00011242312,0.022496723,0.00061860814,0.00018043161,0.00005958435,0.00030448587,0.23848167,0.001506644,0.7333378,0.000465973,0.0012773297],"about_ca_topic_score_codex":0.00019945433,"about_ca_topic_score_gemma":0.00009247076,"teacher_disagreement_score":0.37889716,"about_ca_system_score_codex":0.000036189504,"about_ca_system_score_gemma":0.00016739637,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"W3204704467","doi":"10.1016/j.ipl.2022.106293","title":"On public-coin zero-error randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Communication complexity; Zero (linguistics); Mathematics; Theoretical computer science; Upper and lower bounds; Computer science; Polynomial; PSPACE; Computational complexity theory; Discrete mathematics; Algorithm","score_opus":0.037043340476142904,"score_gpt":0.25551627706450736,"score_spread":0.21847293658836445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204704467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011343392,0.00004602224,0.94228524,0.039864574,0.0003326069,0.00042534372,0.000010645858,0.00050138147,0.0051908167],"genre_scores_gemma":[0.921266,0.0000024440074,0.05151543,0.026849952,0.000014356127,0.00021083652,0.000109857545,0.000006772306,0.000024355213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802077,0.0003581035,0.0005310675,0.0001674066,0.0006574513,0.00026518485],"domain_scores_gemma":[0.99856687,0.00022850989,0.00043109947,0.00059974205,0.00010764307,0.00006616326],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014960031,0.00015233528,0.0002444182,0.0003838023,0.0014537354,0.00075184077,0.0014710539,0.000025278188,0.0000750208],"category_scores_gemma":[0.00014309993,0.00015133701,0.00011426123,0.0007620374,0.00023228001,0.0034438304,0.00054810604,0.00039704543,0.00005070241],"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.00089375826,0.00014238711,0.000019313202,0.00007101028,0.00003476873,0.0000020792509,0.009556252,0.0059568123,0.000049268,0.8178612,0.019283118,0.14613006],"study_design_scores_gemma":[0.027001576,0.000058692774,0.000152276,0.000042421987,0.00001009193,0.000046176403,0.0002937125,0.80213,0.00009474041,0.12179421,0.04786853,0.00050760154],"about_ca_topic_score_codex":0.000026306001,"about_ca_topic_score_gemma":0.0000011530021,"teacher_disagreement_score":0.9099226,"about_ca_system_score_codex":0.000134551,"about_ca_system_score_gemma":0.00008213716,"threshold_uncertainty_score":0.9998462},"labels":[],"label_agreement":null},{"id":"W32072441","doi":"10.1007/s11060-020-03434-7","title":"Efficient Communication Using Partial Information.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","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":"Communication complexity; Computer science; Bounded function; Protocol (science); Theoretical computer science; Computational complexity theory; Discrete mathematics; Communications protocol; Mathematics; Algorithm; Computer network","score_opus":0.0231787037010444,"score_gpt":0.27372607558373924,"score_spread":0.2505473718826948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32072441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2487932,0.00003411879,0.74528176,0.0018242621,0.0007152013,0.00043212168,0.00002364302,0.00039284155,0.0025028232],"genre_scores_gemma":[0.8833115,0.0000013859926,0.11573027,0.0007525316,0.000092606395,0.000024869167,0.000062278596,0.000009784198,0.0000147323735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750054,0.0001725643,0.00052141433,0.00039062768,0.00078580616,0.00062906835],"domain_scores_gemma":[0.9979696,0.00037007497,0.00025712792,0.0008807792,0.00036435688,0.00015806021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072586234,0.0002672683,0.00024795756,0.00030832237,0.0009686218,0.00039066837,0.0014528645,0.00009777907,0.00013250402],"category_scores_gemma":[0.000090430214,0.00028820845,0.0001544581,0.00093031314,0.00028563372,0.00046857478,0.00042699388,0.0008688385,0.00014941269],"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.000022748214,0.00016024646,0.00004217824,0.0000055657338,0.000021476006,8.2272186e-7,0.00018740752,0.12410786,0.00009598219,0.8724174,0.00027283758,0.0026654922],"study_design_scores_gemma":[0.00054613134,0.00010803208,0.0022085607,0.000010651063,0.000005383162,0.000041168118,0.000011144016,0.80398685,0.00014339427,0.18479821,0.007869296,0.00027117485],"about_ca_topic_score_codex":0.00008101202,"about_ca_topic_score_gemma":0.000066903995,"teacher_disagreement_score":0.68761915,"about_ca_system_score_codex":0.00021213341,"about_ca_system_score_gemma":0.0006097011,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W3209675893","doi":"10.1002/jcd.21809","title":"The combinatorial game N<scp>ofil</scp> played on Steiner triple systems","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","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":"Carleton University; Concordia University of Edmonton; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Steiner system; Hypergraph; Discrete mathematics; Complete graph","score_opus":0.030839130138622266,"score_gpt":0.2560989864287562,"score_spread":0.22525985629013395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209675893","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13583744,0.008709358,0.27147117,0.0036412699,0.560905,0.001660542,0.00003912925,0.0004740462,0.017262066],"genre_scores_gemma":[0.9925803,0.00021424446,0.0015222077,0.00017396074,0.0044652913,0.000015073734,0.0000025467314,0.000041237814,0.0009851343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952755,0.0009652206,0.0011121737,0.00038341904,0.0016391559,0.0006245338],"domain_scores_gemma":[0.993795,0.0029105127,0.0008884659,0.0009162514,0.0011490359,0.00034073522],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022051954,0.00034392733,0.0006756622,0.00021795687,0.0005784795,0.0012206291,0.0021921694,0.00020920034,0.000006250528],"category_scores_gemma":[0.0014086502,0.0002522136,0.00046838832,0.0010583194,0.0001391385,0.00058475987,0.00030374457,0.00093396584,0.000034771565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007402299,0.0004780696,0.000035814137,0.000016582153,0.00018187704,0.00041243335,0.00031910258,0.0002379064,0.0013235601,0.9667344,0.028767671,0.0014185315],"study_design_scores_gemma":[0.011619802,0.0037617758,0.0005302003,0.0003156208,0.00011364369,0.00084351917,0.00041164484,0.009755048,0.018736178,0.5458822,0.4076143,0.0004160804],"about_ca_topic_score_codex":0.00001108379,"about_ca_topic_score_gemma":0.0000011570505,"teacher_disagreement_score":0.85674286,"about_ca_system_score_codex":0.00017805654,"about_ca_system_score_gemma":0.00072272005,"threshold_uncertainty_score":0.999993},"labels":[],"label_agreement":null},{"id":"W3211932688","doi":"10.1016/j.orl.2023.03.008","title":"On a partition LP relaxation for min-cost 2-node connected spanning subgraphs","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming relaxation; Spanning tree; Combinatorics; Partition (number theory); Mathematics; Minimum spanning tree; Relaxation (psychology); Linear programming; Graph partition; Minimum degree spanning tree; Greedy algorithm; Graph factorization; Discrete mathematics; Graph; Mathematical optimization; Line graph; Graph power","score_opus":0.13134850434815168,"score_gpt":0.3851309175006559,"score_spread":0.25378241315250427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211932688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3813772,0.000015430616,0.5619844,0.053700536,0.00047904105,0.0014260168,0.000047772042,0.0004799211,0.00048970035],"genre_scores_gemma":[0.9634701,0.000026471349,0.032008898,0.00194352,0.00020845217,0.0014030149,0.00033961755,0.000026426736,0.0005734781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978797,0.00028670643,0.00022194238,0.00047610706,0.00058384245,0.00055174384],"domain_scores_gemma":[0.9981999,0.00083294284,0.00002199345,0.0005368748,0.00030324317,0.00010505189],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00143125,0.00011430545,0.00011197529,0.0008270303,0.0013644705,0.00059938873,0.0005685549,0.000053182932,0.000030861993],"category_scores_gemma":[0.00080681423,0.00011496672,0.00008357959,0.0023836482,0.00013451018,0.00055544346,0.00013590543,0.000300588,0.00026113435],"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.000047338515,0.00016513906,0.0001818066,0.00004039429,0.000054022137,0.000037329006,0.0024616017,0.093645535,0.052442927,0.6694756,0.16287859,0.018569691],"study_design_scores_gemma":[0.0006628342,0.00018402476,0.0027751217,0.00006820495,0.0000032626028,0.000004166673,0.00011892582,0.97133213,0.0046806117,0.00923161,0.010706056,0.0002330199],"about_ca_topic_score_codex":0.00007611636,"about_ca_topic_score_gemma":0.00011319601,"teacher_disagreement_score":0.8776866,"about_ca_system_score_codex":0.00008590995,"about_ca_system_score_gemma":0.0000734928,"threshold_uncertainty_score":0.9999356},"labels":[],"label_agreement":null},{"id":"W3212014075","doi":"10.1145/3519935.3520024","title":"Locally testable codes with constant rate, distance, and locality","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Azrieli Foundation; Israel Science Foundation; European Commission","keywords":"Locality; Code (set theory); Construct (python library); Discrete mathematics; Constant (computer programming); Word (group theory); Mathematics; Computer science; Combinatorics; Programming language","score_opus":0.01958422355762212,"score_gpt":0.2422624260804508,"score_spread":0.22267820252282866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212014075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013364772,0.00057192636,0.962307,0.00061308086,0.00034002497,0.00038925983,0.00009727209,0.00036841896,0.033976547],"genre_scores_gemma":[0.57924634,0.00047701554,0.41393098,0.0016349257,0.00009259359,0.00024728145,0.00007911389,0.000045175482,0.004246577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976765,0.00017389616,0.0003214707,0.0010279466,0.00041545415,0.00038475747],"domain_scores_gemma":[0.9980885,0.00027162704,0.00015894315,0.0011915272,0.00012850978,0.00016092182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065464404,0.00034020358,0.00045330383,0.0001071082,0.0003552738,0.00055910635,0.0012909136,0.000093692724,0.00021878122],"category_scores_gemma":[0.000022710963,0.0002755721,0.00006554673,0.0004309683,0.00048525646,0.00020558154,0.003877023,0.00074846664,0.0000033963915],"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.000043120705,0.00019751262,0.0036964037,0.0002875645,0.00010246654,0.00017619468,0.00025598123,0.0030808838,0.000007719584,0.9782452,0.002051096,0.011855861],"study_design_scores_gemma":[0.0012254874,0.0004969462,0.003318176,0.0003690782,0.00005305549,0.00012662388,0.00043727717,0.45569927,0.00023127768,0.4496339,0.08646578,0.0019431419],"about_ca_topic_score_codex":0.0003905976,"about_ca_topic_score_gemma":0.00034792008,"teacher_disagreement_score":0.5779098,"about_ca_system_score_codex":0.00007971681,"about_ca_system_score_gemma":0.00042582967,"threshold_uncertainty_score":0.99996966},"labels":[],"label_agreement":null},{"id":"W3213138807","doi":"10.1007/s00453-021-00889-6","title":"Bounded-Angle Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Theory of computation; Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Tree (set theory); Computer science; Discrete mathematics; Algorithm","score_opus":0.021689003908254963,"score_gpt":0.25106207579004597,"score_spread":0.229373071881791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213138807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010798861,0.0010313363,0.9620187,0.004031202,0.0018302684,0.00012105335,0.000012528122,0.0005989095,0.019557115],"genre_scores_gemma":[0.17614207,0.000047530648,0.81716,0.0016173441,0.00064683234,0.000027114078,0.000023543793,0.00003219283,0.0043033645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982168,0.00008226949,0.0002616501,0.000605571,0.00036548523,0.0004681941],"domain_scores_gemma":[0.99858046,0.00015947016,0.00006857925,0.0008973127,0.00014172503,0.00015245641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017739298,0.00019213354,0.00023564065,0.00010590185,0.0002980229,0.00038441332,0.00096405967,0.00008081358,0.00012337633],"category_scores_gemma":[0.00006603633,0.00020237645,0.0001686976,0.0007929329,0.00009749021,0.00047007992,0.0006168376,0.00022165795,0.00017154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000418387,0.00037118277,0.00020288824,0.000021963757,0.00012849763,0.00085545157,0.0017305803,0.000040052048,0.0025520553,0.2919221,0.010916113,0.691255],"study_design_scores_gemma":[0.0015041445,0.00023404918,0.0046743695,0.00012380535,0.000043769902,0.0007810596,0.0004905984,0.33141267,0.05372064,0.30914035,0.2964352,0.0014393289],"about_ca_topic_score_codex":0.000027849932,"about_ca_topic_score_gemma":0.000023002805,"teacher_disagreement_score":0.68981564,"about_ca_system_score_codex":0.0000374408,"about_ca_system_score_gemma":0.00015523369,"threshold_uncertainty_score":0.8252672},"labels":[],"label_agreement":null},{"id":"W3213890954","doi":"10.1017/s0960129521000372","title":"Two-stage submodular maximization problem beyond nonnegative and monotone","year":2021,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","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 New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Mathematics; Matroid; Combinatorics; Cardinality (data modeling); Maximization; Constraint (computer-aided design); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.013735870939906622,"score_gpt":0.2589103105992053,"score_spread":0.24517443965929864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213890954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048744164,0.00009471587,0.9491312,0.0005287701,0.00024536645,0.00021042184,0.0000028929912,0.000089767,0.00095270673],"genre_scores_gemma":[0.38196528,0.0000052537293,0.61771536,0.00024567032,0.000037841844,0.000008323514,0.0000010339277,0.0000052422292,0.00001598817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975808,0.000087014836,0.0003688062,0.0008623071,0.0006341287,0.00046694538],"domain_scores_gemma":[0.99866575,0.00020270309,0.00009194774,0.0006937265,0.0001724211,0.0001734375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058752263,0.00021019766,0.00027875594,0.00021457694,0.00029949713,0.00070214795,0.0011669815,0.0000442525,0.000037102152],"category_scores_gemma":[0.00009270683,0.00018536166,0.000045947254,0.0016397901,0.0006696264,0.0008337877,0.0014970548,0.00022240545,0.0000055390738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015427261,0.0000589835,0.00033533227,0.00004367646,0.000004084464,0.00007867702,0.0011603172,0.0024692458,0.00045605595,0.93764895,0.000008254427,0.05773485],"study_design_scores_gemma":[0.00022117361,0.000017409777,0.0020371107,0.000024743345,0.0000013438323,0.00008535322,0.000013262623,0.491502,0.0027371421,0.50319165,0.000025559526,0.00014326145],"about_ca_topic_score_codex":0.000010068886,"about_ca_topic_score_gemma":0.00001161123,"teacher_disagreement_score":0.48903275,"about_ca_system_score_codex":0.000060824364,"about_ca_system_score_gemma":0.00012993514,"threshold_uncertainty_score":0.7558829},"labels":[],"label_agreement":null},{"id":"W3216441663","doi":"","title":"A $2$-Approximation Algorithm for Flexible Graph Connectivity","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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; University of Ottawa","funders":"","keywords":"Computer science; Approximation algorithm; Algorithm; Theoretical computer science","score_opus":0.07365225862169666,"score_gpt":0.1985476314444734,"score_spread":0.12489537282277674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216441663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016565876,0.00004301336,0.98091304,0.00014702506,0.0003566311,0.00017325525,0.00001650036,0.0003095802,0.0014750846],"genre_scores_gemma":[0.82454437,0.000039532202,0.1732457,0.00023360786,0.000082078885,0.0000032763135,0.000019610166,0.000011798709,0.001820028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988005,0.00007824231,0.00011366123,0.00064382673,0.00006933471,0.0002944114],"domain_scores_gemma":[0.99879587,0.00020125386,0.00007559752,0.00058335706,0.00023755776,0.000106368876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002156414,0.00014147749,0.00017377255,0.00014157938,0.00030617943,0.000105790394,0.00056144316,0.000073098156,0.000025473524],"category_scores_gemma":[0.000041617994,0.00017105011,0.00018898955,0.0012795608,0.00007466047,0.0006952074,0.00025588923,0.00011567136,0.00002120132],"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.000007038092,0.00016911032,0.00019410926,0.000018773939,0.000044817945,0.00008187143,0.000107640466,0.0018665104,0.00016736674,0.94755405,0.00033836658,0.049450338],"study_design_scores_gemma":[0.0006079993,0.000053231346,0.00037812066,0.000010726021,0.0000149404505,0.000014509247,0.00006773532,0.69276476,0.0034296976,0.30047408,0.0019830083,0.00020117937],"about_ca_topic_score_codex":0.000022903381,"about_ca_topic_score_gemma":0.000022405056,"teacher_disagreement_score":0.8079785,"about_ca_system_score_codex":0.00005501281,"about_ca_system_score_gemma":0.000104693456,"threshold_uncertainty_score":0.6975221},"labels":[],"label_agreement":null},{"id":"W3217052763","doi":"10.1016/j.dam.2022.07.023","title":"A counter-example to the probabilistic universal graph conjecture via randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Bounded function; Probabilistic logic; Randomized algorithm; Graph; Regular graph; Graph power; Line graph","score_opus":0.025755645183202655,"score_gpt":0.23955181027054392,"score_spread":0.21379616508734128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217052763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031158281,0.0000618524,0.98597103,0.0029426962,0.00015472049,0.0020390109,0.000046166453,0.00025062857,0.00541805],"genre_scores_gemma":[0.70653933,0.0000087699755,0.2912214,0.0011561902,0.000036691516,0.00085359754,0.00007439734,0.00002981385,0.00007980134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997977,0.00025567217,0.0004430253,0.00038935806,0.0006030775,0.00033186306],"domain_scores_gemma":[0.99700385,0.0009260742,0.0001834272,0.0017269525,0.00006220374,0.000097460266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015207011,0.0002438327,0.000496775,0.000120695135,0.0011542119,0.00019901569,0.002705313,0.000035633737,0.00012910066],"category_scores_gemma":[0.000048203194,0.00018186944,0.00019202984,0.00083804515,0.0003929048,0.000098702556,0.0017937062,0.00041096582,0.000028685417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023225344,0.000112213704,4.1720054e-7,0.000034463028,0.000053572418,0.0000016779974,0.008321955,0.0025418873,0.000059798997,0.98715097,0.0008764834,0.0006143237],"study_design_scores_gemma":[0.0069430233,0.000045807836,0.0000068864542,0.000012009468,0.000044124445,0.00002664836,0.0009919397,0.22305621,0.00003690333,0.76295906,0.0056055165,0.00027188272],"about_ca_topic_score_codex":0.00015162608,"about_ca_topic_score_gemma":0.00007301435,"teacher_disagreement_score":0.7034235,"about_ca_system_score_codex":0.00009343415,"about_ca_system_score_gemma":0.0000543102,"threshold_uncertainty_score":0.88773817},"labels":[],"label_agreement":null},{"id":"W326289323","doi":"10.1007/978-3-642-02017-9_29","title":"Kolmogorov Complexity and Combinatorial Methods in Communication Complexity","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kolmogorov complexity; Communication complexity; Kolmogorov structure function; Minimax; Mathematics; Upper and lower bounds; Worst-case complexity; Quantum complexity theory; Mutual information; Intuition; Computational complexity theory; Dimension (graph theory); Discrete mathematics; Matching (statistics); Kolmogorov equations (Markov jump process); Theoretical computer science; Computer science; Quantum; Combinatorics; Time complexity; Algorithm; Mathematical optimization; Quantum information; Statistics","score_opus":0.047070984818778014,"score_gpt":0.34114653367503217,"score_spread":0.29407554885625414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326289323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024719149,0.00031809474,0.9693558,0.003980334,0.0009851608,0.00031506363,0.0000017037978,0.0001647019,0.00015994116],"genre_scores_gemma":[0.4933744,0.000015861806,0.50590855,0.00064613676,0.00004637735,0.0000036715187,0.0000014778981,0.0000033678382,1.5385575e-7],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659544,0.00054146606,0.0005473176,0.0010414216,0.0005587488,0.0007156306],"domain_scores_gemma":[0.99726623,0.0008013507,0.00015755133,0.0014467033,0.00014279527,0.00018539024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029183263,0.00031487306,0.00046828025,0.000662566,0.00048406576,0.00058722595,0.0031858836,0.00012448433,0.000006416858],"category_scores_gemma":[0.00023946365,0.00031204283,0.000066684115,0.0033384643,0.001589217,0.0011134046,0.0012812573,0.0007052406,0.000003687832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011987769,0.00025689605,0.0022292868,0.000010837974,0.0000027724943,0.000010752718,0.0017869748,0.0017697102,0.0006341304,0.21562746,0.0000056728195,0.7776535],"study_design_scores_gemma":[0.00045783512,0.00011381189,0.05457745,0.000042185013,0.0000010310163,0.000026309664,0.0000010815257,0.4335062,0.0012954803,0.5097238,0.000033512333,0.00022134844],"about_ca_topic_score_codex":0.00026045798,"about_ca_topic_score_gemma":0.00029532897,"teacher_disagreement_score":0.7774322,"about_ca_system_score_codex":0.00017920343,"about_ca_system_score_gemma":0.00015310344,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W34613702","doi":"10.1021/acs.est.1c04111","title":"Rigorous analysis of heuristics for NP-hard problems.","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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":"Canada First Research Excellence Fund","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.023512675040069493,"score_gpt":0.2730710835262716,"score_spread":0.2495584084862021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34613702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026654217,0.00027224547,0.9883709,0.0035232385,0.00057625497,0.00065176847,0.00034591235,0.0002709026,0.0033233562],"genre_scores_gemma":[0.2894679,0.0002677907,0.7062239,0.0011871863,0.0006759789,0.00024221641,0.00017737536,0.000067828965,0.0016898174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727786,0.00007908841,0.0006702799,0.00079826434,0.00060042937,0.0005741059],"domain_scores_gemma":[0.9977406,0.00031597607,0.0003003992,0.0012078687,0.0002463504,0.0001887626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051091594,0.00033724878,0.0006436811,0.0006632651,0.0002228726,0.0001507114,0.0014370681,0.00012199611,0.000030262829],"category_scores_gemma":[0.000044095636,0.00030778156,0.0006085185,0.0017750517,0.0001584533,0.0003534039,0.00025556184,0.00019397952,0.00002309496],"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.0001722272,0.0021578297,0.0012848169,0.00039991835,0.006201998,0.000032011398,0.005107417,0.14675333,0.0062022116,0.54386365,0.01109202,0.27673256],"study_design_scores_gemma":[0.0008609706,0.00064526894,0.0010593095,0.000037133253,0.00052227394,0.000007956627,0.000021909816,0.94667447,0.004022172,0.0072114985,0.03834776,0.00058929913],"about_ca_topic_score_codex":0.000046686455,"about_ca_topic_score_gemma":0.000034455883,"teacher_disagreement_score":0.7999211,"about_ca_system_score_codex":0.00007252883,"about_ca_system_score_gemma":0.000061566156,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W35907325","doi":"10.1007/978-3-642-31594-7_2","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Combinatorics; Communication complexity; Physics; Function (biology); Mathematics; Discrete mathematics","score_opus":0.04896195018404148,"score_gpt":0.2646787093088615,"score_spread":0.21571675912482002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35907325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088558154,0.0019990068,0.99086607,0.0013854064,0.0015614381,0.00043833893,0.000019647236,0.00013277848,0.0035087764],"genre_scores_gemma":[0.437617,0.0003282271,0.5607173,0.00054112764,0.0003497384,0.000020118163,0.000026118922,0.000038195576,0.00036216108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663335,0.0001245086,0.00076097227,0.00081069715,0.0010055332,0.00066492235],"domain_scores_gemma":[0.9941694,0.00156812,0.0005665659,0.0030781142,0.0004491753,0.00016863234],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016706281,0.00044838854,0.0005342251,0.00044661644,0.0011461184,0.00036276312,0.005813181,0.00022840162,0.000026069398],"category_scores_gemma":[0.00009132427,0.00034886427,0.00022859081,0.00075322756,0.004499982,0.0005849877,0.002496548,0.0010200196,0.00003875573],"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.000010431632,0.00009949932,0.00010515114,0.000031825493,0.000024682551,0.000002996917,0.00090805255,0.0034117736,0.00013972573,0.2937198,0.00008017246,0.7014659],"study_design_scores_gemma":[0.00041772384,0.00013644216,0.001629408,0.0002902063,0.000019305047,0.000045483233,0.0000010887222,0.48439032,0.0010712402,0.4998891,0.011425922,0.00068374723],"about_ca_topic_score_codex":0.00008413194,"about_ca_topic_score_gemma":0.0004075633,"teacher_disagreement_score":0.7007821,"about_ca_system_score_codex":0.00017776905,"about_ca_system_score_gemma":0.0002995661,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W4205250726","doi":"10.1007/978-3-030-91434-9_6","title":"Differentially Private Submodular Maximization over Integer Lattice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Computer science; Maximization; Cardinality (data modeling); Automatic summarization; Greedy algorithm; Integer (computer science); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data mining; Algorithm","score_opus":0.01746079052434353,"score_gpt":0.2340155430445845,"score_spread":0.21655475252024098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205250726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003390257,0.00050619344,0.9931391,0.0005676407,0.0031655962,0.00031487935,0.0000069803286,0.00022043117,0.0017401511],"genre_scores_gemma":[0.06401144,0.00020007812,0.9306382,0.0027746703,0.0010056345,0.000014836437,0.00004287946,0.00008527265,0.0012270028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527824,0.000068435475,0.00062679796,0.0019510466,0.0013252711,0.0007502062],"domain_scores_gemma":[0.99679786,0.0003459002,0.0003138904,0.0019921768,0.0003471097,0.00020303729],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061558344,0.00064616726,0.00064283976,0.00084959535,0.0003362029,0.001158185,0.0038534184,0.00037724065,0.00015124475],"category_scores_gemma":[0.00011330082,0.0006251307,0.00024420614,0.001022873,0.0006633589,0.00081194285,0.002820936,0.0010657483,0.00003513518],"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.0000065008167,0.00008691274,0.0001225364,0.00007972845,0.000040344737,0.00027528795,0.00051713694,0.012522537,0.00023876935,0.37269294,0.000024531895,0.6133928],"study_design_scores_gemma":[0.00031645646,0.000088058245,0.0006759031,0.00046763677,0.000015434109,0.00007321504,8.342224e-8,0.62708944,0.0012607516,0.36567944,0.0034749478,0.0008586183],"about_ca_topic_score_codex":0.000022101716,"about_ca_topic_score_gemma":0.00008384531,"teacher_disagreement_score":0.6145669,"about_ca_system_score_codex":0.00025496248,"about_ca_system_score_gemma":0.00042387663,"threshold_uncertainty_score":0.9998787},"labels":[],"label_agreement":null},{"id":"W4205439189","doi":"10.17771/pucrio.acad.51356","title":"THE MULTI-PERIOD PRIZE-COLLECTING STEINER TREE PROBLEM WITH BUDGET CONSTRAINTS","year":2019,"lang":"en","type":"dissertation","venue":"","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":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Steiner tree problem; Benchmark (surveying); Period (music); Combinatorics; Tree (set theory); Revenue; Time horizon; Mathematics; Mathematical optimization; Computer science; Geography; Economics; Cartography; Physics","score_opus":0.01859464823067754,"score_gpt":0.25794409219994796,"score_spread":0.2393494439692704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205439189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076873754,0.0008359479,0.510778,0.0017726378,0.005169829,0.004951598,0.000040647148,0.001378079,0.46738592],"genre_scores_gemma":[0.05815783,0.000055497938,0.5970607,0.00027063655,0.0001899825,0.00030510954,0.00019035528,0.00010269952,0.3436672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978193,0.0000832168,0.00038866966,0.0007066538,0.0005137466,0.00048839295],"domain_scores_gemma":[0.9982852,0.00023858396,0.00029846857,0.00084445183,0.00024886153,0.0000844557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036502455,0.0003877446,0.00034944888,0.0001443269,0.0007256182,0.0008061789,0.0015781099,0.00018077967,0.000048817088],"category_scores_gemma":[0.000038865255,0.00023260675,0.00014048385,0.0004978475,0.00014483118,0.00025615562,0.00012897814,0.00053672615,0.00006295769],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012666057,0.00032666107,0.0005996032,0.00035860893,0.0005107423,0.00006295285,0.012944379,0.00006341052,0.00043345892,0.15660647,0.0026774558,0.8252896],"study_design_scores_gemma":[0.025081333,0.0054104156,0.027199004,0.0058023576,0.0006019251,0.0012254931,0.050048526,0.6754298,0.014531229,0.03321883,0.14655142,0.014899665],"about_ca_topic_score_codex":0.000053285796,"about_ca_topic_score_gemma":0.0020692414,"teacher_disagreement_score":0.81038994,"about_ca_system_score_codex":0.00004757783,"about_ca_system_score_gemma":0.00046573265,"threshold_uncertainty_score":0.94854283},"labels":[],"label_agreement":null},{"id":"W4205516090","doi":"10.1145/3487351.3489471","title":"Approximating 4-cliques in streaming graphs","year":2021,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Clique; Clique problem; Computer science; Scalability; Clique-sum; Split graph; Graph; Theoretical computer science; Chordal graph; Combinatorics; Mathematics; 1-planar graph","score_opus":0.020728732248032528,"score_gpt":0.25507014524213834,"score_spread":0.2343414129941058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205516090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095121555,0.00029138473,0.8417048,0.0010250215,0.000278167,0.00007848408,7.8466036e-7,0.0003552584,0.06114454],"genre_scores_gemma":[0.44719312,0.000016001284,0.5521717,0.00034070946,0.00001717368,0.0000060929697,0.0000014954288,0.0000036009255,0.00025009693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991327,0.000052296284,0.00019235029,0.00027684163,0.0001451401,0.0002006767],"domain_scores_gemma":[0.9994472,0.00009602288,0.000030069566,0.00034673218,0.000041973093,0.000037980244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021199776,0.00007525661,0.00011057878,0.0001024219,0.00006505606,0.00014103678,0.00036481745,0.000028074797,0.000043580258],"category_scores_gemma":[0.000052835723,0.00007371712,0.000049729868,0.00073386513,0.000021850137,0.00032221284,0.00028759157,0.00011465266,0.000008529311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.87712e-7,0.00006441207,0.0027470102,0.000011811576,0.0000043053137,0.000072269155,0.00050191476,0.000019405428,0.00045078155,0.8457924,0.00006717195,0.1502682],"study_design_scores_gemma":[0.0003917533,0.00003488479,0.011277341,0.00009984157,0.0000019422057,0.00006868927,0.00052327354,0.288381,0.022619344,0.67486537,0.0013465126,0.00039006586],"about_ca_topic_score_codex":0.000059534806,"about_ca_topic_score_gemma":0.00014573616,"teacher_disagreement_score":0.35207155,"about_ca_system_score_codex":0.000012946123,"about_ca_system_score_gemma":0.000039695165,"threshold_uncertainty_score":0.30060968},"labels":[],"label_agreement":null},{"id":"W4205934954","doi":"10.1007/978-3-030-92681-6_9","title":"A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Monotone polygon; Time complexity; Function (biology); Combinatorics; Matching (statistics); Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Streaming algorithm; Binary logarithm; Mathematics; Computer science; Algorithm; Upper and lower bounds","score_opus":0.023621794034393018,"score_gpt":0.2539519593697021,"score_spread":0.2303301653353091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205934954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005827944,0.00040193478,0.99455476,0.00054951257,0.0022616186,0.00087066746,0.00011526716,0.00025924935,0.0009286889],"genre_scores_gemma":[0.0042867786,0.000028698892,0.9927081,0.0006124971,0.0011108461,0.00006312417,0.000092802846,0.000061495,0.0010356489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447864,0.00005984793,0.0008304856,0.0024527288,0.0010699555,0.0011083286],"domain_scores_gemma":[0.9958374,0.00086616626,0.00037076225,0.0019877395,0.0006347725,0.00030315592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013028611,0.00083267124,0.0010717855,0.00097266067,0.00083278463,0.0008457297,0.0029638952,0.00044850507,0.000039885035],"category_scores_gemma":[0.000118199205,0.0008744735,0.0005692395,0.0011657431,0.0008912478,0.00070900394,0.0017328294,0.0010697107,0.000034974604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039639704,0.00004935263,0.000005543641,0.00006278211,0.000072508876,0.00014178638,0.0004293539,0.015472828,0.0002717507,0.0039020204,0.000030788233,0.97955734],"study_design_scores_gemma":[0.0005235652,0.00019083434,0.000024752542,0.00048490727,0.00003585698,0.00018739651,0.00000143535,0.9381923,0.0010980269,0.056562617,0.0017663559,0.00093192287],"about_ca_topic_score_codex":0.000049343278,"about_ca_topic_score_gemma":0.000028387829,"teacher_disagreement_score":0.9786254,"about_ca_system_score_codex":0.0003493885,"about_ca_system_score_gemma":0.000928243,"threshold_uncertainty_score":0.9993706},"labels":[],"label_agreement":null},{"id":"W4206483022","doi":"10.1137/1.9781611977073.7","title":"Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","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":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Flow (mathematics); Mathematics; Bounded function; Planar; Algorithm; Linear programming; Discrete mathematics; Computer science; Graph; Computer graphics (images); Geometry","score_opus":0.0581106082261173,"score_gpt":0.24177144191080382,"score_spread":0.18366083368468653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206483022","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015809298,0.00042288713,0.15469064,0.0014869287,0.0037085398,0.017271467,0.002015646,0.0015501482,0.81727284],"genre_scores_gemma":[0.000621616,0.00012634494,0.72631526,0.00079201185,0.0035582276,0.0018937534,0.0009958545,0.000448329,0.2652486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783224,0.000009833126,0.0006402269,0.0006706899,0.00044054026,0.00040648505],"domain_scores_gemma":[0.99860686,0.00036345274,0.0003514753,0.000508602,0.00004060109,0.00012899065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060045597,0.00047977452,0.0006961159,0.000116278614,0.00045864398,0.00017213513,0.0006505335,0.0006166326,0.0000677535],"category_scores_gemma":[0.000014599023,0.0004828229,0.00048420765,0.00007755324,0.00016666425,0.00007906018,0.00036639,0.0009109714,0.000012096091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041528467,0.00008826123,2.1474693e-7,0.00020920586,0.00022030085,0.0000070060287,0.0035026234,0.00004793206,0.00019936613,0.9310852,0.0057255905,0.058872767],"study_design_scores_gemma":[0.0038774435,0.00031124192,5.681064e-7,0.00036873008,0.0002082449,0.000055578603,0.0003548578,0.07636303,0.00040336448,0.5864943,0.33001783,0.0015447852],"about_ca_topic_score_codex":0.000007895464,"about_ca_topic_score_gemma":0.000008436823,"teacher_disagreement_score":0.57162464,"about_ca_system_score_codex":0.00011503387,"about_ca_system_score_gemma":0.0001414641,"threshold_uncertainty_score":0.99976236},"labels":[],"label_agreement":null},{"id":"W4206681002","doi":"10.1007/978-3-540-77120-3_3","title":"Integer Representation and Counting in the Bit Probe Model","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Logarithm; Bit (key); Bitwise operation; Mathematics; Discrete mathematics; Representation (politics); Subtraction; Measure (data warehouse); Arithmetic; Computation; Constant (computer programming); Omega; Algorithm; Combinatorics; Computer science","score_opus":0.05007665314434419,"score_gpt":0.29048685802540014,"score_spread":0.24041020488105597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206681002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020107161,0.0003018708,0.9940301,0.0009909954,0.00053999864,0.00039667403,0.0000016356278,0.00006492558,0.0034727152],"genre_scores_gemma":[0.18345669,0.00007093338,0.8121303,0.003771468,0.0003567691,0.000015584697,0.000004074989,0.000025993888,0.00016823421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690145,0.000039295348,0.00045908743,0.0011725288,0.00092352676,0.00050408224],"domain_scores_gemma":[0.99796534,0.0006364293,0.00019564302,0.0009973148,0.00014058636,0.00006468484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020438926,0.00033874623,0.00031646996,0.0008735524,0.00025345394,0.000694627,0.0025876507,0.00019700006,0.000003451636],"category_scores_gemma":[0.00009032995,0.000260348,0.00007335032,0.00094276085,0.0007242247,0.00065267144,0.001060212,0.0009551067,0.0000053653926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050489266,0.000034900873,0.00020540191,0.000038015056,0.0000052763107,0.00011017726,0.005144103,0.042174295,0.000039051683,0.19407932,0.000015892734,0.7581485],"study_design_scores_gemma":[0.00009981799,0.00003002468,0.00015528487,0.00014389252,0.0000020052605,0.00006555848,7.188697e-7,0.64778405,0.00006614268,0.35129344,0.00014273172,0.00021631653],"about_ca_topic_score_codex":0.00006136745,"about_ca_topic_score_gemma":0.00028443345,"teacher_disagreement_score":0.7579322,"about_ca_system_score_codex":0.00010958901,"about_ca_system_score_gemma":0.00019899668,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W4206719352","doi":"10.1016/j.procs.2021.11.025","title":"The Speed and Threshold of the Biased Perfect Matching Game","year":2021,"lang":"en","type":"article","venue":"Procedia Computer Science","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":"Université de Montréal; Dawson College; McGill University","funders":"","keywords":"Infinity; Matching (statistics); Computer science; Circuit breaker; Combinatorics; Mathematical economics; Algorithm; Discrete mathematics; Mathematics; Physics; Statistics; Mathematical analysis; Quantum mechanics","score_opus":0.016517971246204122,"score_gpt":0.2352522358121574,"score_spread":0.21873426456595327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206719352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5675763,0.00083197217,0.42356783,0.004667835,0.0022713176,0.00026154474,0.0000019109575,0.00011844833,0.0007028851],"genre_scores_gemma":[0.9587429,0.00003941535,0.040568132,0.00050116633,0.00009992511,0.0000029878124,1.1091629e-7,0.0000043075006,0.00004104295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819607,0.000049564136,0.00022144742,0.00052295654,0.00064642733,0.00036354543],"domain_scores_gemma":[0.99840546,0.00029906185,0.000108142296,0.00084696227,0.00024834514,0.00009205956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092946517,0.00012857873,0.00013912086,0.000063516796,0.000783453,0.00067389384,0.0024877428,0.000024369672,0.0000016465513],"category_scores_gemma":[0.000096148004,0.00007575414,0.00007425638,0.0017269866,0.0009221967,0.00050818484,0.0021609084,0.0001964801,0.0000026281296],"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.000009114481,0.00019856087,0.009078275,0.00012907636,0.000035736924,0.00003350424,0.010587933,0.0016980971,0.020583093,0.6126352,0.0005014916,0.3445099],"study_design_scores_gemma":[0.0002885315,0.000063076375,0.032776028,0.00010026243,0.0000061423884,0.00020463414,0.00005136708,0.85793954,0.028690794,0.07877443,0.00085704564,0.00024813536],"about_ca_topic_score_codex":0.00000892418,"about_ca_topic_score_gemma":0.000010605294,"teacher_disagreement_score":0.85624146,"about_ca_system_score_codex":0.000018934088,"about_ca_system_score_gemma":0.00037875932,"threshold_uncertainty_score":0.6498374},"labels":[],"label_agreement":null},{"id":"W4220679245","doi":"10.1287/ijoc.2022.1161","title":"A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","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 British Columbia","funders":"","keywords":"Quadratic assignment problem; Bounding overwatch; Mathematical optimization; Relaxation (psychology); Mathematics; Optimization problem; Convergence (economics); Lagrangian relaxation; Quadratic equation; Dual (grammatical number); Multiplier (economics); Exploit; Computer science; Artificial intelligence","score_opus":0.03811457354944635,"score_gpt":0.3168046937288804,"score_spread":0.27869012017943406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220679245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03279558,0.00005103528,0.9634919,0.0010312379,0.0015351789,0.00058182015,0.000017451262,0.00018198066,0.00031377372],"genre_scores_gemma":[0.170408,0.0000039044526,0.8278151,0.0008549973,0.0006935634,0.000054031218,0.00002044099,0.000026047303,0.00012389492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973186,0.00013568014,0.00091288483,0.00037473987,0.0006344672,0.000623578],"domain_scores_gemma":[0.9960061,0.0021817752,0.0010026841,0.00036403385,0.00028977785,0.00015563077],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029741009,0.00024106444,0.00032660554,0.0005067915,0.0026800078,0.00056075037,0.0010038138,0.000060303024,0.000009524426],"category_scores_gemma":[0.0007703753,0.0002223513,0.00035556653,0.0007870843,0.00002724659,0.00062887464,0.00057723484,0.00075846515,0.0000019451586],"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.00017015437,0.0001232972,0.000051485782,0.00003921281,0.00008690379,0.000018307219,0.0024995934,0.0628065,0.000111246634,0.15151908,0.0013048598,0.7812694],"study_design_scores_gemma":[0.0017919573,0.001150819,0.00020030915,0.000059203074,0.000015462358,0.00044702858,0.0004062383,0.9193457,0.00014359015,0.034700774,0.041437842,0.0003011142],"about_ca_topic_score_codex":0.0000075703556,"about_ca_topic_score_gemma":0.0000013186431,"teacher_disagreement_score":0.8565392,"about_ca_system_score_codex":0.00026703038,"about_ca_system_score_gemma":0.00022736788,"threshold_uncertainty_score":0.99861836},"labels":[],"label_agreement":null},{"id":"W4221162731","doi":"10.1609/aaai.v36i9.21275","title":"Sparsification of Decomposable Submodular Functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Precursory Research for Embryonic Science and Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Cardinality (data modeling); Matroid; Complement (music); Mathematics; Function (biology); Simple (philosophy); Time complexity; Discrete mathematics; Combinatorics; Computer science; Data mining","score_opus":0.08783125934303422,"score_gpt":0.2769420356941431,"score_spread":0.1891107763511089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221162731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421717,0.00010626149,0.3088268,0.011159629,0.0028961485,0.0012892473,0.00006735597,0.00029385847,0.033189006],"genre_scores_gemma":[0.9949158,0.000010364746,0.0046703843,0.00007630748,0.000026103493,0.000042622858,0.000001059243,0.0000063095667,0.00025104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983686,0.000026573403,0.00046351398,0.00036537525,0.00055571715,0.00022018803],"domain_scores_gemma":[0.99868923,0.00007220515,0.00039425574,0.00037444918,0.00042176695,0.000048064303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553489,0.00013065191,0.00019214704,0.00017113039,0.0004433931,0.00007709566,0.002226747,0.000030130157,0.00020283411],"category_scores_gemma":[0.00010998518,0.00011550749,0.0001339967,0.0011555365,0.00021931862,0.00026088278,0.00070191093,0.00027698796,0.00002119821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024973984,0.00023792192,0.00027691122,0.000016918517,0.0000114172735,1.2613724e-7,0.00060683466,0.00050130894,0.026877966,0.9414547,0.00022973632,0.029761156],"study_design_scores_gemma":[0.00002969671,0.00031450944,0.0006656492,0.000044865006,0.000012544248,0.0000066440107,0.0010027855,0.14800373,0.3847809,0.4640575,0.0008843209,0.00019684085],"about_ca_topic_score_codex":0.00005214188,"about_ca_topic_score_gemma":0.0000037257148,"teacher_disagreement_score":0.4773972,"about_ca_system_score_codex":0.000044104767,"about_ca_system_score_gemma":0.00008579932,"threshold_uncertainty_score":0.47102588},"labels":[],"label_agreement":null},{"id":"W4224209627","doi":"10.1145/3532737.3532746","title":"Guest Column","year":2022,"lang":"en","type":"article","venue":"ACM SIGACT News","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":"McGill University","funders":"","keywords":"Computer science; Perspective (graphical); Communication complexity; Theoretical computer science; Column (typography); Circuit complexity; Upper and lower bounds; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence; Electronic circuit","score_opus":0.02997993845767251,"score_gpt":0.2524561424002102,"score_spread":0.2224762039425377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224209627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38522705,0.0028151511,0.30493256,0.08805671,0.047212478,0.002722662,0.00017315746,0.005728966,0.16313125],"genre_scores_gemma":[0.9165007,0.000027028907,0.072698355,0.0065797945,0.0007094094,0.0001310912,0.000016080448,0.000023684432,0.0033138727],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988455,0.00009156709,0.0001507023,0.00031880097,0.00033456294,0.00025884324],"domain_scores_gemma":[0.9984769,0.00016486493,0.00005751459,0.0011992988,0.000020622718,0.00008079254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002052309,0.00009614488,0.00011778028,0.000085270556,0.00048512948,0.00012468253,0.0025839747,0.000017810578,0.00033215474],"category_scores_gemma":[0.0000747308,0.00010640228,0.00008350766,0.00059308845,0.000034479344,0.0002451842,0.002240211,0.00023386517,0.00010649527],"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.000020230293,0.0006229029,0.0059971423,0.000018413935,0.00007186808,0.00030977873,0.0034103761,0.00032859857,0.002014665,0.24171026,0.4147172,0.33077857],"study_design_scores_gemma":[0.00030224744,0.00019442257,0.0019906152,0.000002695215,0.0000035618393,0.000060216415,0.00012112692,0.0046608546,0.0004986119,0.04506114,0.9468485,0.0002559679],"about_ca_topic_score_codex":0.00020386824,"about_ca_topic_score_gemma":0.000039215833,"teacher_disagreement_score":0.5321314,"about_ca_system_score_codex":0.000044660454,"about_ca_system_score_gemma":0.000059625563,"threshold_uncertainty_score":0.48017108},"labels":[],"label_agreement":null},{"id":"W4225101446","doi":"10.1137/22n975482","title":"Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Ninth; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Physics","score_opus":0.03321610467084326,"score_gpt":0.2608543157344119,"score_spread":0.22763821106356866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225101446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69223565,0.00010723661,0.20319633,0.024490824,0.034875236,0.001052454,0.000036310063,0.00031390745,0.043692045],"genre_scores_gemma":[0.985075,0.000008942367,0.0024296914,0.0026599239,0.009675532,0.0000031556638,0.0000013278253,0.000023996025,0.00012243753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995938,0.0013342515,0.0006112382,0.0004334077,0.0011642808,0.0005188021],"domain_scores_gemma":[0.99465054,0.0034386022,0.0007459173,0.00091683527,0.00015177939,0.00009629859],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0050843116,0.0002783452,0.00029952647,0.00027419077,0.0036331022,0.00030150122,0.0030656883,0.000049967894,0.00011971299],"category_scores_gemma":[0.00029570467,0.00017830395,0.00033273836,0.0007565481,0.00015433182,0.00015793699,0.0014624095,0.0021068063,0.00001643085],"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.00020635135,0.00051354646,0.00020876333,0.0000138675405,0.00016469505,0.000101439815,0.011281495,0.11537347,0.00016325101,0.7057207,0.042283442,0.12396895],"study_design_scores_gemma":[0.003041402,0.0101036485,0.017114842,0.0011619349,0.00008722586,0.0031979145,0.014925961,0.6172026,0.0024050935,0.21355593,0.11530747,0.001895999],"about_ca_topic_score_codex":0.0000056863187,"about_ca_topic_score_gemma":0.0000014391434,"teacher_disagreement_score":0.5018291,"about_ca_system_score_codex":0.00019005564,"about_ca_system_score_gemma":0.00011984865,"threshold_uncertainty_score":0.99766403},"labels":[],"label_agreement":null},{"id":"W4226108027","doi":"10.4230/lipics.icalp.2023.63","title":"An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bipartite graph; Minor (academic); Constant (computer programming); Linear programming relaxation; Discrete mathematics; Approximation algorithm; Dual (grammatical number); Tree (set theory); Linear programming; Algorithm; Graph; Computer science; Law","score_opus":0.11199471886834342,"score_gpt":0.2181126986295274,"score_spread":0.10611797976118398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226108027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17558378,0.000025170126,0.8207259,0.000197716,0.0009601166,0.00078704866,0.000085902786,0.0011379665,0.0004963866],"genre_scores_gemma":[0.97740096,0.00006551276,0.021511316,0.000059721442,0.00007324318,0.000011610918,0.00019019374,0.000030266518,0.0006571785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977978,0.00015937534,0.00026216323,0.0012540356,0.00010908986,0.0004175634],"domain_scores_gemma":[0.9981015,0.00020384138,0.0001959942,0.0012266524,0.00013424442,0.00013781128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003998269,0.00031111736,0.00036955503,0.00088266673,0.00015536814,0.00014518041,0.00202443,0.0002891097,0.0000054482516],"category_scores_gemma":[0.000039987848,0.0003727646,0.00022187096,0.0013985068,0.00009210255,0.0004866028,0.0005818282,0.00043229244,0.000019930734],"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.00007245529,0.00031364182,0.0037253215,0.00017167657,0.00009131452,0.00020882272,0.0006206293,0.065037616,0.00008895646,0.92352796,0.0006445141,0.005497084],"study_design_scores_gemma":[0.00047099558,0.0000678153,0.006405808,0.000059258466,0.000017196384,0.0000010017186,0.00004923115,0.61625445,0.000045402212,0.37618947,0.00012622558,0.00031314002],"about_ca_topic_score_codex":0.00036324083,"about_ca_topic_score_gemma":0.0012107007,"teacher_disagreement_score":0.8018172,"about_ca_system_score_codex":0.0001239734,"about_ca_system_score_gemma":0.00011022634,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"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":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.006974374443870286,"score_gpt":0.22273242763541046,"score_spread":0.21575805319154018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232943531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54305434,0.0030600876,0.3515787,0.051940694,0.0057392213,0.007557295,0.0029897678,0.0032622374,0.030817635],"genre_scores_gemma":[0.8841506,0.00013767798,0.11140321,0.00042048964,0.0009662409,0.00015118436,0.000041451265,0.00008808266,0.0026410515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620163,0.000033233773,0.0007886583,0.0010253391,0.0011158937,0.00083523453],"domain_scores_gemma":[0.9978788,0.00015780432,0.0006277444,0.0006908718,0.00043114985,0.00021362717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054447027,0.0005557214,0.0005299973,0.0003005002,0.00075768295,0.0004911797,0.0029461398,0.0001586857,0.000005893668],"category_scores_gemma":[0.00011232841,0.00044957487,0.0003383676,0.0011931806,0.00043825875,0.0015714986,0.0018272266,0.0005363292,0.0000122007405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285935,0.0021600553,0.009607502,0.0010513718,0.00047101633,0.000018607147,0.009404365,0.00059475994,0.00442465,0.85799015,0.053016067,0.06114862],"study_design_scores_gemma":[0.0073796767,0.0021014612,0.033942427,0.0032670614,0.00051253795,0.00052423344,0.005181706,0.28610417,0.059940834,0.47963,0.11559888,0.0058170143],"about_ca_topic_score_codex":0.00010518297,"about_ca_topic_score_gemma":0.0000055207806,"teacher_disagreement_score":0.37836012,"about_ca_system_score_codex":0.00011521122,"about_ca_system_score_gemma":0.000049670354,"threshold_uncertainty_score":0.9997956},"labels":[],"label_agreement":null},{"id":"W4233454535","doi":"10.1007/s00454-009-9165-3","title":"Dynamic Coresets","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Constant (computer programming); Bounded function; Dimension (graph theory); Amortized analysis; Integer (computer science); Binary logarithm; Bounding overwatch; Annulus (botany); Discrete mathematics; Data structure; Mathematical analysis; Computer science","score_opus":0.01138252880161875,"score_gpt":0.27628883777066476,"score_spread":0.264906308969046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233454535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049434368,0.0002069114,0.94297457,0.0025215247,0.00037223866,0.000120898054,0.000018644088,0.0003066923,0.004044184],"genre_scores_gemma":[0.832365,0.0000054134243,0.16620035,0.0011751279,0.000036850673,0.0000030786343,0.000062577776,0.0000054955017,0.00014611645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839616,0.000035075325,0.0002567805,0.0004363161,0.0005499272,0.00032574296],"domain_scores_gemma":[0.9991259,0.00016340669,0.00008401267,0.00037790483,0.00011457689,0.00013418923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018301708,0.0001726193,0.00017371771,0.00034654795,0.0002266766,0.00021369933,0.0009393922,0.00005220082,0.000057899906],"category_scores_gemma":[0.000038927756,0.00017054749,0.00012902303,0.0011937039,0.00006964889,0.000456003,0.00016674223,0.00018657534,0.0001390236],"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.000011325323,0.00016639578,0.0005380617,0.000010133608,0.000038054695,0.00005726136,0.00024615639,0.03242913,0.00008765217,0.77584314,0.0017830249,0.18878967],"study_design_scores_gemma":[0.00028081707,0.000115906456,0.12777494,0.000014582827,0.0000033444207,0.000040606345,0.00001136173,0.58592534,0.00001593839,0.28427574,0.0013010723,0.00024035313],"about_ca_topic_score_codex":0.000005068377,"about_ca_topic_score_gemma":0.0000012322963,"teacher_disagreement_score":0.7829306,"about_ca_system_score_codex":0.000041527306,"about_ca_system_score_gemma":0.00006092054,"threshold_uncertainty_score":0.6954725},"labels":[],"label_agreement":null},{"id":"W4235156957","doi":"10.1145/3196275","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Exponential time hypothesis; Mathematics; Completeness (order theory); Property (philosophy); Combinatorics; Time complexity; Set (abstract data type); Order (exchange); PSPACE; Exponential function; Class (philosophy); Discrete mathematics; Data structure; Algorithm; Computational complexity theory; Computer science","score_opus":0.050926100854386855,"score_gpt":0.26676406540761133,"score_spread":0.21583796455322446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235156957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061680126,0.00004810978,0.99363214,0.0029959627,0.0005559009,0.0013640673,0.000108487504,0.00047222152,0.00020632695],"genre_scores_gemma":[0.20848474,0.00002967548,0.7877857,0.001125556,0.00048584977,0.0016927321,0.000015438518,0.00006154105,0.00031877193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765533,0.000049617367,0.0003460063,0.00090057193,0.0004841912,0.0005642845],"domain_scores_gemma":[0.997243,0.0002559859,0.0001157226,0.0017460192,0.00046460528,0.00017468428],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00016720296,0.0004051044,0.0003328986,0.0003361409,0.0013784914,0.00025960137,0.0017794917,0.00012133546,0.00006499121],"category_scores_gemma":[0.000018716257,0.0003199335,0.00014907827,0.0010410383,0.00046644046,0.0003831388,0.000035105262,0.0003097048,0.00009059356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020366587,0.000833329,0.0000096789245,0.00008624747,0.00025596347,0.000006583178,0.0013031183,0.0041912743,0.00020623695,0.028358782,0.00033170084,0.96421343],"study_design_scores_gemma":[0.0065734494,0.007685511,0.001914101,0.00036864108,0.00021615747,0.0002867511,0.0006623112,0.6436961,0.03268001,0.142,0.16089272,0.0030241888],"about_ca_topic_score_codex":0.00006266345,"about_ca_topic_score_gemma":0.00014714776,"teacher_disagreement_score":0.9611892,"about_ca_system_score_codex":0.00007539761,"about_ca_system_score_gemma":0.00011274831,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W4237140089","doi":"10.1137/1.9781611973068.77","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"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":"Bottleneck; Logarithm; Approximation algorithm; Bounded function; Mathematics; Time complexity; Computer science; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.020031024562312948,"score_gpt":0.2649339222629797,"score_spread":0.24490289770066673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237140089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12758382,0.0014953149,0.6288965,0.15816869,0.018025286,0.021275448,0.0026808227,0.0046425234,0.037231613],"genre_scores_gemma":[0.44192883,0.00026714202,0.5476041,0.004058007,0.0011842413,0.0005206357,0.000085205415,0.0001397108,0.004212141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961785,0.000033227712,0.0007667927,0.0010885039,0.0010522758,0.0008807104],"domain_scores_gemma":[0.9973916,0.00018072853,0.0006004391,0.0009156696,0.0006862469,0.00022534416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358659,0.0005725902,0.00059590203,0.00041863148,0.0006062439,0.00036321577,0.0038906094,0.00022560607,0.000006376719],"category_scores_gemma":[0.00024165079,0.00043012455,0.0006155947,0.0014176656,0.00021784208,0.0011821475,0.0005816868,0.00051885407,0.000012743048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011179949,0.0033144688,0.00026221163,0.000951014,0.00044803906,0.0000052062856,0.008250826,0.0040377285,0.017008279,0.6886829,0.037239708,0.2386816],"study_design_scores_gemma":[0.0033368682,0.0061916253,0.0011669822,0.00075912196,0.00013315174,0.000040094812,0.00045296957,0.42266765,0.08473625,0.47050786,0.008604472,0.0014029626],"about_ca_topic_score_codex":0.000014629241,"about_ca_topic_score_gemma":7.9744655e-7,"teacher_disagreement_score":0.4186299,"about_ca_system_score_codex":0.00009996136,"about_ca_system_score_gemma":0.00006364876,"threshold_uncertainty_score":0.99981505},"labels":[],"label_agreement":null},{"id":"W4239068887","doi":"10.1007/978-0-387-39940-9_4054","title":"Wrapper Robustness","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Computer science; Chemistry","score_opus":0.021525749702203077,"score_gpt":0.2335625794180037,"score_spread":0.21203682971580062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239068887","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006157464,0.004632557,0.13654801,0.000090268906,0.0031221276,0.0005405534,0.0005506487,0.00023659275,0.8542731],"genre_scores_gemma":[0.00033075534,0.005341092,0.04731221,0.000118300595,0.0021242856,0.000042060274,0.0007094475,0.00011355802,0.9439083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968901,0.000057817182,0.00088841416,0.0008817378,0.0008798671,0.00040203964],"domain_scores_gemma":[0.9964444,0.00016082524,0.00058396143,0.0024059254,0.0002064444,0.00019846708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048315103,0.0005413583,0.0008579997,0.0004284335,0.000117066185,0.00010018515,0.0021831577,0.00029786074,0.000104898434],"category_scores_gemma":[0.00002982733,0.00052334607,0.0002785325,0.00015232209,0.00013859855,0.0005555913,0.0006103723,0.0005263168,0.00013226806],"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.0000054752213,0.00006152554,0.000005284806,0.0003672948,0.00009181068,0.00015311404,0.00010485992,0.00020507746,0.000006146298,0.91819066,0.0363678,0.04444096],"study_design_scores_gemma":[0.00027325668,0.00009883052,0.000011857056,0.0010591842,0.00004446709,0.00008225292,0.000009840635,0.006492514,0.000008531834,0.004343446,0.98684424,0.0007316024],"about_ca_topic_score_codex":0.00007456753,"about_ca_topic_score_gemma":0.000013967044,"teacher_disagreement_score":0.9504764,"about_ca_system_score_codex":0.000049465707,"about_ca_system_score_gemma":0.00021457265,"threshold_uncertainty_score":0.9997218},"labels":[],"label_agreement":null},{"id":"W4239711818","doi":"10.1007/978-3-319-14115-2_31","title":"Linear Arrangement Problems and Interval Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Bounding overwatch; Interval (graph theory); Indifference graph; Interval graph; Combinatorics; Mathematics; Upper and lower bounds; Chordal graph; Discrete mathematics; Pathwidth; Focus (optics); Computer science; 1-planar graph; Graph; Line graph; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.025509850149295066,"score_gpt":0.24055500380338335,"score_spread":0.21504515365408827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239711818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010145618,0.0006120179,0.9936817,0.0009906751,0.0017613113,0.00040539372,0.0000041160793,0.00019152544,0.0022517834],"genre_scores_gemma":[0.08239976,0.00022400633,0.9128965,0.0029975944,0.00076159096,0.000025348578,0.000007571865,0.00006002251,0.0006275602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961953,0.000041721632,0.00053321494,0.0016712929,0.0008975054,0.0006609746],"domain_scores_gemma":[0.9977165,0.00030590553,0.0002460356,0.0013307479,0.00017939648,0.00022144013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010602678,0.0005673795,0.00058610237,0.0009192687,0.00030680696,0.00055401144,0.003015729,0.00024298367,0.000020153528],"category_scores_gemma":[0.000043417174,0.0005131816,0.0001584382,0.0005377355,0.0011223741,0.00036186495,0.002229749,0.0008391599,0.00002857614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029255273,0.000024469822,0.00005118304,0.00008527209,0.00001730805,0.00003059881,0.00082615274,0.003095485,0.000036446534,0.11431808,0.000029307417,0.8814828],"study_design_scores_gemma":[0.00027254442,0.0002802204,0.000096577074,0.00048556778,0.000007831865,0.000071587696,9.8093665e-8,0.4788992,0.00017828208,0.509915,0.009156105,0.00063698797],"about_ca_topic_score_codex":0.000025838011,"about_ca_topic_score_gemma":0.00008940394,"teacher_disagreement_score":0.8808458,"about_ca_system_score_codex":0.00010003882,"about_ca_system_score_gemma":0.00013738399,"threshold_uncertainty_score":0.99973196},"labels":[],"label_agreement":null},{"id":"W4242064191","doi":"10.1002/rsa.20279","title":"Asymptotic random graph intuition for the biased connectivity game","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":52,"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":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","score_opus":0.01809614125711018,"score_gpt":0.2568782022790673,"score_spread":0.23878206102195715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242064191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011620877,0.0014854637,0.9827552,0.0020998141,0.0008065208,0.00091471476,0.000030190327,0.00017216409,0.00011508101],"genre_scores_gemma":[0.9752729,0.00026131712,0.023043081,0.0009316319,0.00039085743,0.000052730724,0.00001082418,0.00001046218,0.000026207195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983403,0.00013070999,0.00030413998,0.0005213115,0.00029262848,0.0004108812],"domain_scores_gemma":[0.9976753,0.0014723483,0.00013428433,0.0004974511,0.000100197416,0.00012043752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063212286,0.00027805584,0.00042165455,0.00013242908,0.00062335836,0.00041141763,0.00061763945,0.000095853764,0.000014272012],"category_scores_gemma":[0.00016060384,0.00017985688,0.00026712113,0.0003834847,0.000176299,0.00032312504,0.00008428195,0.00022415849,0.0000010375902],"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.00047565534,0.00006254184,0.000024745143,0.00002460477,0.00010725329,0.0000078432795,0.0006014458,0.0005572425,0.00037718663,0.19573434,0.00057212816,0.801455],"study_design_scores_gemma":[0.016211666,0.00034839398,0.0071236533,0.000027514365,0.000060534006,0.00009018394,0.000041754003,0.27444482,0.0010009905,0.69699687,0.0032645336,0.0003890509],"about_ca_topic_score_codex":0.000033834593,"about_ca_topic_score_gemma":0.000009245192,"teacher_disagreement_score":0.963652,"about_ca_system_score_codex":0.000015950298,"about_ca_system_score_gemma":0.00003243368,"threshold_uncertainty_score":0.7334351},"labels":[],"label_agreement":null},{"id":"W4242600797","doi":"10.1137/1.9781611974331.ch87","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2015,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":36,"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":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Running time; Discrete mathematics; Algorithm; Computer science; Statistics","score_opus":0.03425324003984173,"score_gpt":0.26127349678342926,"score_spread":0.22702025674358753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242600797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24290001,0.0006217999,0.74700904,0.0015319661,0.0010933966,0.00028954985,0.000004920709,0.0004566447,0.006092664],"genre_scores_gemma":[0.8985564,0.00001740192,0.100097336,0.0009174108,0.0001310813,0.000013277673,0.0000028408506,0.000010947445,0.0002532845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860543,0.00007332651,0.00024552303,0.00041961132,0.0003277104,0.0003284123],"domain_scores_gemma":[0.9989376,0.00021831441,0.000060778242,0.00041068948,0.000091055816,0.0002815662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044423123,0.00017820096,0.0002425485,0.000112929636,0.00016417184,0.00025957823,0.0005172169,0.00005580871,0.000013100521],"category_scores_gemma":[0.000119473625,0.00015340505,0.000065676475,0.0002748864,0.00014106925,0.0003634317,0.00039311158,0.00014313636,0.000022851962],"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.0002559902,0.0003059009,0.015291417,0.000080466525,0.00013151472,0.00042229673,0.0051756636,0.00013053426,0.00052829884,0.5911478,0.006732,0.37979814],"study_design_scores_gemma":[0.024331192,0.0011053303,0.046953987,0.00019102219,0.00009897403,0.0014351453,0.0008000507,0.64684135,0.0029798616,0.23299216,0.0393725,0.0028984158],"about_ca_topic_score_codex":0.000052876276,"about_ca_topic_score_gemma":0.000027025591,"teacher_disagreement_score":0.6556564,"about_ca_system_score_codex":0.000022632548,"about_ca_system_score_gemma":0.000113176764,"threshold_uncertainty_score":0.6255677},"labels":[],"label_agreement":null},{"id":"W4243222502","doi":"10.1007/978-1-4939-7131-2_100561","title":"k-Cores","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Geology; Computer science","score_opus":0.03263804680829943,"score_gpt":0.23550820541233497,"score_spread":0.20287015860403554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243222502","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.6199685e-7,0.00012947558,0.18212026,0.00019470537,0.0006776661,0.000059121994,0.0000032865512,0.00027028396,0.8165447],"genre_scores_gemma":[0.000029815385,0.00004237462,0.07305362,0.0005218716,0.0004145705,0.0000016594507,0.000003431114,0.00001422679,0.9259184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898607,0.000004261728,0.00016406026,0.00041720027,0.0002590137,0.00016942392],"domain_scores_gemma":[0.99887353,0.000044441906,0.000069308255,0.0008627261,0.00007823629,0.000071772105],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008587833,0.00020185587,0.00019009328,0.00013287632,0.000090406065,0.00013416128,0.0012894713,0.00014996981,0.003925309],"category_scores_gemma":[0.000004291516,0.00017560765,0.00015062552,0.000029215993,0.00014122493,0.00013061137,0.00059463433,0.00017805771,0.00253084],"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":[3.4022162e-7,0.0000027744547,2.697196e-7,0.0000037426012,0.000014984353,0.000010580489,0.000034284698,6.500049e-8,4.8040727e-7,0.91577435,0.053882994,0.030275162],"study_design_scores_gemma":[0.000026517422,0.000031645577,0.0000029661962,0.0000196054,0.000002476652,0.000009720103,3.4237266e-7,0.0006564852,0.00001685201,0.49667618,0.5024076,0.00014960686],"about_ca_topic_score_codex":0.0000056219683,"about_ca_topic_score_gemma":0.000014769848,"teacher_disagreement_score":0.44852462,"about_ca_system_score_codex":0.000015440492,"about_ca_system_score_gemma":0.000041858177,"threshold_uncertainty_score":0.9982458},"labels":[],"label_agreement":null},{"id":"W4243376123","doi":"10.1007/978-94-007-4978-8_102","title":"Mathematical Proof, Argumentation, and Reasoning","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Argumentation theory; Computer science; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology; Philosophy; Medicine","score_opus":0.018974619462691928,"score_gpt":0.23723492313704247,"score_spread":0.21826030367435054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243376123","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013788575,0.00006427664,0.5309326,0.00021767584,0.00006600827,0.00008928127,6.7991937e-7,0.000078436904,0.46854964],"genre_scores_gemma":[0.00042040242,0.000027311222,0.37973264,0.0004236343,0.00013221503,0.000008791534,0.0000053479416,0.000019818186,0.61922985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990245,0.000009373754,0.00021315232,0.00037105798,0.00024116,0.0001407316],"domain_scores_gemma":[0.9992685,0.00009656299,0.000090012654,0.0004136415,0.000047838388,0.00008348813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018893956,0.00018450119,0.00022099902,0.00009200024,0.000103576924,0.00018681011,0.00038813535,0.000107711254,0.00029822416],"category_scores_gemma":[0.000015387279,0.00016042875,0.000058870257,0.000022347196,0.00008804148,0.000103860155,0.0002986751,0.00017085693,0.00011554979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.327167e-7,0.0000033961608,0.0000010671775,0.000028515891,0.00001267943,0.0000032691028,0.00007246464,2.9286622e-7,6.5992424e-7,0.95064914,0.0010601778,0.048168022],"study_design_scores_gemma":[0.00009439954,0.00004041857,0.0000072434186,0.00013192941,0.000009852373,0.00005193497,0.0000018474209,0.01754061,0.000028999106,0.90999657,0.07187022,0.00022594785],"about_ca_topic_score_codex":0.0000014260194,"about_ca_topic_score_gemma":0.0000021371725,"teacher_disagreement_score":0.1512,"about_ca_system_score_codex":0.000013381964,"about_ca_system_score_gemma":0.000021407226,"threshold_uncertainty_score":0.6542095},"labels":[],"label_agreement":null},{"id":"W4243384718","doi":"10.1002/net.20188","title":"The maximum residual flow problem:<i>NP</i>‐hardness with two‐arc destruction","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","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":"University of New Brunswick","funders":"","keywords":"Arc (geometry); Residual; Mathematics; Flow (mathematics); Combinatorics; Maximum flow problem; Polynomial; Arc routing; Flow network; Computer science; Geometry; Algorithm; Mathematical analysis; Routing (electronic design automation); Computer network","score_opus":0.010911708731744182,"score_gpt":0.22936413531378097,"score_spread":0.21845242658203678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243384718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037554896,0.000295453,0.9891498,0.0006531931,0.0013282871,0.00022662959,7.4378556e-7,0.00024788207,0.004342508],"genre_scores_gemma":[0.46374875,0.0001260372,0.53202426,0.0009065083,0.002444582,0.000049739436,0.00001136064,0.000047405894,0.00064135995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983075,0.00007261047,0.0002439274,0.0003878906,0.00039378903,0.00059427554],"domain_scores_gemma":[0.99882585,0.00019291318,0.000101080484,0.00065506744,0.00011073435,0.00011436948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075031,0.00017441623,0.0001315276,0.000059061036,0.00074153097,0.00034111907,0.00094803836,0.00007436697,0.0000063048597],"category_scores_gemma":[0.000006820946,0.0001172717,0.000051697796,0.0007321671,0.00019649007,0.00031691513,0.00022762128,0.00039425862,0.000010145046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091741604,0.00004874911,0.0012289709,0.0000072845587,0.00004202499,0.00005710301,0.00030967762,0.024039567,0.000012454261,0.08368535,0.004546423,0.88593066],"study_design_scores_gemma":[0.0019065053,0.0005080273,0.009952582,0.00011653268,0.000033755856,0.00067991257,0.00013821892,0.6984896,0.0003044225,0.1963016,0.09065511,0.0009137458],"about_ca_topic_score_codex":0.000045720364,"about_ca_topic_score_gemma":0.0004909063,"teacher_disagreement_score":0.8850169,"about_ca_system_score_codex":0.000037286896,"about_ca_system_score_gemma":0.000045751854,"threshold_uncertainty_score":0.5703332},"labels":[],"label_agreement":null},{"id":"W4244133084","doi":"10.1137/1.9781611974782.141","title":"Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Memorial University of Newfoundland","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Completeness (order theory); Property (philosophy); Exponential time hypothesis; Time complexity; Exponential function; Set (abstract data type); Computer science; PSPACE; Class (philosophy); Data structure; Mathematics; Order (exchange); Algorithm; Computational complexity theory; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.06519014408323036,"score_gpt":0.2715318482800997,"score_spread":0.2063417041968693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244133084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013211756,0.000030423247,0.9925107,0.0031746263,0.00015280262,0.0008272499,0.000012981995,0.00017129534,0.0017987916],"genre_scores_gemma":[0.5895782,0.000006572984,0.40862554,0.00047767936,0.00015905069,0.0006165578,0.000005126125,0.000015679954,0.00051554496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896425,0.000010640833,0.00013714498,0.00042304705,0.00020443973,0.00026049474],"domain_scores_gemma":[0.9982652,0.00005868282,0.000107913744,0.0013244916,0.00017405581,0.000069676185],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00008831322,0.00016508653,0.00016743423,0.00006584316,0.0013996363,0.0005624401,0.0016660667,0.000038255304,0.000014200776],"category_scores_gemma":[0.000018361961,0.00011012921,0.000051064733,0.00009514497,0.00021803043,0.00033800912,0.00022521504,0.00008644291,0.000015201843],"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.000032744247,0.000121045116,0.00024199726,0.00006000862,0.00004887607,0.0000025993593,0.00027573237,0.00061671,0.00008665641,0.8692055,0.0006032295,0.12870495],"study_design_scores_gemma":[0.0024533132,0.00078968966,0.016237607,0.00011127562,0.000030161464,0.000052793654,0.00013181346,0.62898874,0.004787338,0.22817783,0.11710108,0.0011383409],"about_ca_topic_score_codex":0.00008407808,"about_ca_topic_score_gemma":0.00015213457,"teacher_disagreement_score":0.6410276,"about_ca_system_score_codex":0.000015091765,"about_ca_system_score_gemma":0.000046974365,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W4245020129","doi":"10.1109/lics.2017.8005099","title":"Uniform, integral and efficient proofs for the determinant identities","year":2017,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Mathematical proof; Bounded function; Algebraic number; Discrete mathematics; Combinatorics; Mathematics; Computer science","score_opus":0.03406652558910504,"score_gpt":0.2880806296348293,"score_spread":0.2540141040457242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245020129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030106466,0.00012776241,0.96419793,0.0019854584,0.00070904655,0.00032100512,0.0000030666192,0.0000618209,0.002487463],"genre_scores_gemma":[0.95475566,0.000018966099,0.04281276,0.00013658626,0.00006632903,0.000043042277,2.4663785e-7,0.0000036906188,0.0021627245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946153,0.000007153398,0.00009138337,0.00016842234,0.000105002546,0.0001665337],"domain_scores_gemma":[0.99914056,0.00012014103,0.00005575225,0.000608327,0.00004316744,0.000032039927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025654276,0.00007259733,0.00007366367,0.000029164874,0.0010740136,0.0008435234,0.0011276422,0.00001838593,0.0000042824877],"category_scores_gemma":[0.00005355708,0.000040171322,0.000050601993,0.00002722536,0.00021482653,0.00023179816,0.0005189381,0.000054285105,0.000002942498],"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.000003529781,0.000021104046,0.00026811816,0.000015672342,0.000010449687,0.0000027390713,0.00050074985,0.000013047165,0.000017916951,0.72975504,0.000523982,0.26886764],"study_design_scores_gemma":[0.00033855048,0.000106548934,0.013397931,0.000023872897,0.000008498189,0.000037918253,0.00015377864,0.88501203,0.001444039,0.091696374,0.0076164315,0.00016403939],"about_ca_topic_score_codex":0.000057048142,"about_ca_topic_score_gemma":0.00008652953,"teacher_disagreement_score":0.9246492,"about_ca_system_score_codex":0.0000063631064,"about_ca_system_score_gemma":0.000017831022,"threshold_uncertainty_score":0.82605535},"labels":[],"label_agreement":null},{"id":"W4250124835","doi":"10.1109/focs.2007.4389538","title":"Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lov&amp;#x0E9;sz-Schrijver Hierarchy","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","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 Toronto","funders":"","keywords":"Semidefinite programming; Vertex cover; Approximation algorithm; Cover (algebra); Combinatorics; Vertex (graph theory); Linear programming; Mathematics; Time complexity; Omega; Computer science; Algorithm; Discrete mathematics; Mathematical optimization; Graph; Physics","score_opus":0.027782965703401368,"score_gpt":0.31612913376889534,"score_spread":0.28834616806549396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250124835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06276999,0.000020759102,0.93161213,0.002059646,0.0009656055,0.0004582694,0.000035253674,0.000040788196,0.0020375687],"genre_scores_gemma":[0.84367394,0.000009569574,0.15528937,0.0008476273,0.00007873958,0.000014446024,0.000009584954,0.0000064503533,0.00007030493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972261,0.00010163509,0.0006464605,0.000599297,0.0009158634,0.0005106073],"domain_scores_gemma":[0.9967759,0.0010451186,0.0002452812,0.0011961311,0.0006355578,0.00010196576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034650492,0.00019849678,0.00027529866,0.0006118384,0.0003674485,0.00021209661,0.003644557,0.000060703213,0.000010982416],"category_scores_gemma":[0.000121696896,0.00015537834,0.00016110438,0.0026147356,0.0011226409,0.0013580655,0.00049159286,0.00021951483,0.000019380494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055505963,0.0007875958,0.0008563925,0.000050295705,0.00001572539,0.0000025677082,0.007156099,0.0017008565,0.0016959478,0.9337058,0.0016399178,0.05233328],"study_design_scores_gemma":[0.005376221,0.0055692275,0.16426575,0.0007849916,0.000068726804,0.00014296976,0.000796868,0.24788861,0.036008023,0.2963686,0.24019419,0.0025358105],"about_ca_topic_score_codex":0.00013754488,"about_ca_topic_score_gemma":0.00006395513,"teacher_disagreement_score":0.78090394,"about_ca_system_score_codex":0.00007156524,"about_ca_system_score_gemma":0.00027592288,"threshold_uncertainty_score":0.67725545},"labels":[],"label_agreement":null},{"id":"W4254239736","doi":"10.1137/1.9781611973730.115","title":"Four terminal planar Delta-Wye reducibility via rooted <i>K</i><sub>2,4</sub> minors","year":2014,"lang":"en","type":"article","venue":"","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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Terminal (telecommunication); Planar; Combinatorics; Mathematics; Computer science; Discrete mathematics; Algorithm; Telecommunications","score_opus":0.020170558798452018,"score_gpt":0.22639555046168022,"score_spread":0.20622499166322822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254239736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3186289,0.000021619655,0.67518836,0.0009114512,0.00063307275,0.00016702629,0.0000053038975,0.00040289244,0.0040413802],"genre_scores_gemma":[0.9275418,0.0000040250593,0.07124311,0.00081777276,0.000208396,0.000014153505,0.000007991276,0.000013156232,0.00014961444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975055,0.00017852789,0.00040429804,0.000907371,0.00044357296,0.0005607647],"domain_scores_gemma":[0.9978559,0.0002014041,0.000113333954,0.0014764173,0.000105675485,0.00024724592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080875243,0.00027398387,0.0002994172,0.00015690121,0.000287952,0.00018359326,0.0014285302,0.0001150678,0.000034585784],"category_scores_gemma":[0.00009436777,0.00024625426,0.00018069486,0.0005545063,0.00015945043,0.00045541476,0.00033942546,0.00027084726,0.00016822462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029838979,0.00036771747,0.0018647119,0.000055299628,0.000053214844,0.000079798396,0.00044993285,0.00006408345,0.023034602,0.048971605,0.0102496045,0.9147796],"study_design_scores_gemma":[0.0016088759,0.00072564447,0.04293204,0.00007901205,0.000047427642,0.0006788371,0.00004345295,0.49347788,0.2283749,0.21266472,0.017570663,0.0017965655],"about_ca_topic_score_codex":0.00015961513,"about_ca_topic_score_gemma":0.00022178053,"teacher_disagreement_score":0.912983,"about_ca_system_score_codex":0.000041441646,"about_ca_system_score_gemma":0.00006082582,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W4282936435","doi":"10.1007/s10898-022-01183-7","title":"A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Hypergraph; Combinatorics; Maximum cut; Vertex (graph theory); Disjoint sets; Semidefinite programming; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.007454803762989175,"score_gpt":0.21333503972465478,"score_spread":0.2058802359616656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282936435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018966869,0.00018775623,0.9793101,0.0009097468,0.00009492492,0.00009857612,0.0000089039295,0.000029441306,0.00039367483],"genre_scores_gemma":[0.40315744,0.00005620999,0.5965714,0.00015968166,0.000026194395,0.000005644384,0.0000099814615,0.0000039033457,0.00000957527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878436,0.00010467933,0.0003113916,0.00017077371,0.00049415574,0.00013461421],"domain_scores_gemma":[0.999057,0.000023146495,0.00043898524,0.0001665881,0.0002409839,0.0000732807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035407176,0.000099268414,0.00021165921,0.00024869226,0.00023899287,0.00015361114,0.00036358007,0.000023388477,0.000016590038],"category_scores_gemma":[0.0000126711875,0.00008416277,0.000089470384,0.0032034456,0.000036946916,0.000579061,0.00014139696,0.00013941912,1.6741832e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005617525,0.000112455404,0.015137792,0.000007733992,0.0002355881,0.000018536937,0.00013586633,0.96674263,0.00000460664,0.011094877,0.00011623813,0.0063374895],"study_design_scores_gemma":[0.00065991416,0.0004493099,0.00786359,0.000011059477,0.00017062464,0.00035416285,0.000067747584,0.98296833,0.000006486243,0.0070565757,0.00026044826,0.00013174656],"about_ca_topic_score_codex":0.000009048821,"about_ca_topic_score_gemma":0.000005314353,"teacher_disagreement_score":0.38419056,"about_ca_system_score_codex":0.0001053429,"about_ca_system_score_gemma":0.00007129562,"threshold_uncertainty_score":0.3432058},"labels":[],"label_agreement":null},{"id":"W4285230523","doi":"10.4086/toc.2022.v018a019","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","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; National Science Foundation","keywords":"Mathematics; Rank (graph theory); Communication complexity; Combinatorics; Context (archaeology); Sign (mathematics); Dimension (graph theory); Discrete mathematics; Boolean function; Connection (principal bundle); Matrix (chemical analysis); VC dimension; Computational complexity theory; Omega; Algorithm","score_opus":0.021959954705695197,"score_gpt":0.2398138414644886,"score_spread":0.21785388675879339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285230523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4379793,0.00011011704,0.56061745,0.00023809214,0.00038389798,0.000094884526,0.0000018630942,0.00021826684,0.0003560911],"genre_scores_gemma":[0.898899,8.0480487e-7,0.10055998,0.0004584671,0.000050550407,0.000005980109,0.0000012931647,0.000008691906,0.0000151885115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667406,0.0011007816,0.0005514801,0.00049386657,0.00069810724,0.00048171458],"domain_scores_gemma":[0.9972322,0.0012705118,0.00036370067,0.00096464745,0.0000796626,0.00008927779],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004447948,0.00018185549,0.0003435264,0.00029779703,0.0014063907,0.00006275986,0.0036215624,0.000017810802,0.00002598205],"category_scores_gemma":[0.0000734505,0.00020654683,0.00020115118,0.0012965543,0.00019060053,0.00032009286,0.0048919525,0.0004097637,7.3529407e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022703496,0.00013981886,0.00040153804,0.000012122936,0.000024854462,0.000014897109,0.007850339,0.023731228,0.0008103521,0.83459896,0.000010499063,0.13238269],"study_design_scores_gemma":[0.000578666,0.00033636775,0.005529802,0.000014721894,0.0000055517216,0.00013160058,0.0014884174,0.28632343,0.0024020525,0.7027217,0.00020062599,0.0002670817],"about_ca_topic_score_codex":0.000017453347,"about_ca_topic_score_gemma":5.143619e-7,"teacher_disagreement_score":0.46091974,"about_ca_system_score_codex":0.000045291905,"about_ca_system_score_gemma":0.00007011027,"threshold_uncertainty_score":0.99989367},"labels":[],"label_agreement":null},{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","score_opus":0.013494570952473108,"score_gpt":0.2375044258966565,"score_spread":0.22400985494418338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288734880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014058448,0.0000134401835,0.9945376,0.00091769913,0.0016453502,0.0006788152,0.000008861167,0.00028209956,0.0005102874],"genre_scores_gemma":[0.48179278,0.0000010084739,0.51731193,0.0005640984,0.00014507861,0.0001504116,0.0000059435097,0.000009990855,0.00001875075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971722,0.00009976824,0.0003247606,0.0009689602,0.0007779904,0.0006563322],"domain_scores_gemma":[0.99846673,0.00014968298,0.000111576875,0.00082669227,0.0002472941,0.000198019],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002084776,0.00020186817,0.00020827749,0.0002948568,0.0018905724,0.00045750785,0.0027620145,0.000034932982,0.00006095281],"category_scores_gemma":[0.000030187422,0.00019493808,0.0001240151,0.0019508236,0.00097453955,0.000716232,0.0020651587,0.0002597341,0.0000074204067],"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.000017494101,0.000101037745,0.0000067249334,0.000009542696,0.00000553827,0.0000018458833,0.00023839899,0.0018046178,0.0006893845,0.86569095,0.00008825602,0.1313462],"study_design_scores_gemma":[0.00032344388,0.00061654515,0.000112704576,0.0000040807604,0.0000049199953,0.000021451016,0.0000072699245,0.67459804,0.0007050456,0.32269314,0.0007215447,0.0001918413],"about_ca_topic_score_codex":0.000004245313,"about_ca_topic_score_gemma":2.442851e-7,"teacher_disagreement_score":0.6727934,"about_ca_system_score_codex":0.00012514959,"about_ca_system_score_gemma":0.00016687578,"threshold_uncertainty_score":0.99940884},"labels":[],"label_agreement":null},{"id":"W4296957141","doi":"10.4230/lipics.icalp.2023.15","title":"Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Approximation algorithm; Mathematics; Dual (grammatical number); Discrete mathematics; Function (biology); Combinatorics; Algorithm; Graph; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.06882819582855235,"score_gpt":0.21885638562654103,"score_spread":0.15002818979798868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296957141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006367459,0.0002017915,0.9874662,0.00044253914,0.0016507889,0.00058799173,0.00017712402,0.00040575056,0.002700363],"genre_scores_gemma":[0.45517346,0.00047468286,0.50712335,0.0017877523,0.00092100794,0.000097740354,0.0011596308,0.00016594693,0.033096436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969155,0.00050996395,0.0003223694,0.001478264,0.00023243042,0.00054147886],"domain_scores_gemma":[0.99724543,0.0002627513,0.0003914599,0.0017750959,0.00017761382,0.00014767481],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010222155,0.00042377537,0.00036794555,0.00024043757,0.0014821391,0.00048669707,0.0025353665,0.00022465856,0.0001886156],"category_scores_gemma":[0.00003226648,0.00042050018,0.00036475426,0.0013290951,0.00019416744,0.0005848512,0.0046972698,0.0012767167,0.000019489305],"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.000049129707,0.0005071164,0.00028469,0.00012513789,0.0005673805,0.00010614383,0.0017125667,0.4297632,0.0012420043,0.52955323,0.011934153,0.024155205],"study_design_scores_gemma":[0.00040295857,0.000065637774,0.00004944174,0.000012046131,0.00008526817,0.000012053557,0.00031389494,0.927448,0.00034853714,0.058989372,0.011763714,0.00050910254],"about_ca_topic_score_codex":0.0007765586,"about_ca_topic_score_gemma":0.00003878969,"teacher_disagreement_score":0.49768478,"about_ca_system_score_codex":0.0003590651,"about_ca_system_score_gemma":0.00029022893,"threshold_uncertainty_score":0.9998247},"labels":[],"label_agreement":null},{"id":"W4297907868","doi":"10.48550/arxiv.1305.1451","title":"Explicit bounds for graph minors","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Sigma; Mathematics; Disjoint sets; Vertex (graph theory); Graph; Homeomorphism (graph theory); Discrete mathematics; Path (computing); Physics; Computer science; Quantum mechanics","score_opus":0.10544782032158255,"score_gpt":0.19369282895272355,"score_spread":0.088245008631141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297907868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11490321,0.00008838495,0.88015586,0.00016870837,0.0013865158,0.00059357745,0.00003415662,0.00036808386,0.0023014906],"genre_scores_gemma":[0.97328347,0.00012225143,0.022418367,0.00021676198,0.00017530238,0.0000124956705,0.00002943947,0.00002560507,0.0037163235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997734,0.00007028724,0.00022863355,0.0013323902,0.0001049303,0.00052973273],"domain_scores_gemma":[0.9974943,0.00017874279,0.00023238781,0.0016511978,0.00022408804,0.00021928149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020466563,0.0003896128,0.00039367712,0.00042852628,0.0003230728,0.00031808173,0.0031611656,0.0003123794,0.000051699528],"category_scores_gemma":[0.000023937868,0.00045938024,0.0005167467,0.0006598968,0.000146699,0.00047832562,0.002262131,0.0004690514,0.00008822124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011454612,0.00010990759,0.00035488672,0.00010446135,0.00011523038,0.000044263128,0.00023822369,0.006870989,0.000015601157,0.9854841,0.0036960766,0.0029547554],"study_design_scores_gemma":[0.000413584,0.00007046831,0.00042542463,0.000055545286,0.000043457672,0.0000037277578,0.000048315072,0.347526,0.00010803444,0.645002,0.0057375324,0.0005658684],"about_ca_topic_score_codex":0.00026993742,"about_ca_topic_score_gemma":0.000043443055,"teacher_disagreement_score":0.85838026,"about_ca_system_score_codex":0.00010546024,"about_ca_system_score_gemma":0.00013956297,"threshold_uncertainty_score":0.9997858},"labels":[],"label_agreement":null},{"id":"W4301206442","doi":"10.48550/arxiv.1010.1481","title":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code\\n Problem","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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":"York University","funders":"","keywords":"Reduction (mathematics); Mathematics; Constant (computer programming); Simple (philosophy); Coding (social sciences); Minimum distance; Code (set theory); Discrete mathematics; Finite field; Combinatorics; Algorithm; Computer science; Statistics; Geometry","score_opus":0.10284293198063879,"score_gpt":0.22271202435021115,"score_spread":0.11986909236957236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301206442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05571245,0.00012457579,0.9385639,0.00022531812,0.0024926465,0.0018216489,0.00029896482,0.000104802115,0.00065572537],"genre_scores_gemma":[0.9887174,0.00031617016,0.008957462,0.00003136747,0.00028968064,0.000014218677,0.000023645824,0.000035195062,0.0016149037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614495,0.00020635108,0.00072226534,0.0019386044,0.00022568477,0.00076214416],"domain_scores_gemma":[0.99413246,0.0010249844,0.0011831266,0.0027227998,0.000701,0.00023562976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008576949,0.000628245,0.00073484314,0.0002749355,0.0010116139,0.00023247667,0.00428659,0.0005014232,0.000066933244],"category_scores_gemma":[0.00012641512,0.00062144396,0.0007675755,0.0011955661,0.0015047722,0.00044407565,0.0020201437,0.0011975601,0.000015796482],"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.0005700493,0.0007796065,0.0003875685,0.0011140092,0.00045954654,0.00007418637,0.0020782142,0.09840681,0.00082096993,0.8707991,0.0006126124,0.023897333],"study_design_scores_gemma":[0.0007128918,0.00025338412,0.0003068763,0.0001707274,0.00027755927,0.000021307247,0.0002516936,0.7162735,0.00038104202,0.27466425,0.0061299903,0.0005567827],"about_ca_topic_score_codex":0.00016754505,"about_ca_topic_score_gemma":0.00030191577,"teacher_disagreement_score":0.9330049,"about_ca_system_score_codex":0.00014478581,"about_ca_system_score_gemma":0.0005348374,"threshold_uncertainty_score":0.9996237},"labels":[],"label_agreement":null},{"id":"W4302588649","doi":"10.48550/arxiv.1409.6365","title":"Lift &amp; Project Systems Performing on the Partial-Vertex-Cover Polytope","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Toronto; University of Waterloo; Canada Research Chairs; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Polytope; Vertex cover; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Linear programming relaxation; Theory of computation; Discrete mathematics; Graph; Linear programming; Mathematical optimization; Computer science; Algorithm","score_opus":0.13041956807151922,"score_gpt":0.2075711145987895,"score_spread":0.07715154652727027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302588649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25432035,0.00012284234,0.72160816,0.0004753819,0.0040844185,0.0011836778,0.00003121642,0.00058008236,0.017593853],"genre_scores_gemma":[0.9947774,0.00008755412,0.00047447704,0.00031143893,0.00022176062,0.0000051694838,0.000010077335,0.000023261384,0.0040888675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972618,0.00039897527,0.0002767474,0.0012751034,0.000237221,0.00055014354],"domain_scores_gemma":[0.9964965,0.0004403965,0.00031976646,0.0024810825,0.00013300874,0.00012922272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072690455,0.00045017953,0.0004360125,0.0003068835,0.0005585308,0.0004709717,0.003413269,0.00028168893,0.000041482275],"category_scores_gemma":[0.000079313264,0.00037515926,0.00035371134,0.00068105955,0.00018652843,0.00030506487,0.0025138888,0.0010182787,0.0005034935],"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.0000317566,0.00012262889,0.00058529153,0.00012410527,0.00015027619,0.00007943246,0.0005393397,0.099791236,0.00000956826,0.89307094,0.0044587837,0.0010366545],"study_design_scores_gemma":[0.00028640038,0.00008631605,0.0002071804,0.00032208292,0.000054203843,0.0000125052475,0.00006758567,0.9402442,0.000055098793,0.01880338,0.039220247,0.0006407856],"about_ca_topic_score_codex":0.00057985686,"about_ca_topic_score_gemma":0.000032204982,"teacher_disagreement_score":0.8742675,"about_ca_system_score_codex":0.00016402775,"about_ca_system_score_gemma":0.00025262355,"threshold_uncertainty_score":0.99987006},"labels":[],"label_agreement":null},{"id":"W4312949591","doi":"10.1109/tac.2022.3226713","title":"Submodular Maximization With Limited Function Access","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Pairwise comparison; Function (biology); Maximization; Notation; Mathematics; Computer science; Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Artificial intelligence","score_opus":0.016951647863755085,"score_gpt":0.22667549728313635,"score_spread":0.20972384941938127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312949591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068436293,0.000017608116,0.9896946,0.001130465,0.00085940957,0.0004990161,0.000020389603,0.00075173465,0.00018314164],"genre_scores_gemma":[0.9926785,0.000002512668,0.0057769595,0.00095488026,0.00002062642,0.00038950605,0.0000035114324,0.000016957636,0.00015649834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983274,0.00019906474,0.00026146858,0.0003909201,0.00055899384,0.0002621823],"domain_scores_gemma":[0.99895775,0.00015772643,0.00011851897,0.00061122346,0.000073158466,0.000081622224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024817584,0.00017948596,0.00020703739,0.00036550412,0.0008286782,0.00023429375,0.0007504624,0.000032936412,0.00050487334],"category_scores_gemma":[0.0000032702835,0.00017038346,0.00010658964,0.0011484765,0.000041781932,0.0007509494,0.0000067109545,0.00023838445,0.000021731179],"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.00015851708,0.00083867076,0.000033662116,0.000033714816,0.0002442628,0.00003877867,0.00043677835,0.5604163,0.0002822544,0.005191512,0.0002091574,0.43211642],"study_design_scores_gemma":[0.0018142969,0.00052763434,0.0008089155,0.000012526585,0.00005986343,0.000057471327,0.00003296201,0.99331415,0.00028978914,0.0021725814,0.0006836712,0.00022616552],"about_ca_topic_score_codex":0.000030260217,"about_ca_topic_score_gemma":0.000022234237,"teacher_disagreement_score":0.9858349,"about_ca_system_score_codex":0.00010782703,"about_ca_system_score_gemma":0.00008063511,"threshold_uncertainty_score":0.6948036},"labels":[],"label_agreement":null},{"id":"W4313227384","doi":"10.1109/focs54457.2022.00111","title":"Separations in Proof Complexity and TFNP","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","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":"McGill University","funders":"","keywords":"Unary operation; Mathematical proof; Resolution (logic); Oracle; Combinatorics; Computer science; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.025926062884421137,"score_gpt":0.28530665950310496,"score_spread":0.25938059661868385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28294817,0.00007490212,0.69923043,0.00859194,0.0040359157,0.0012217882,0.00023058387,0.00028062073,0.0033856763],"genre_scores_gemma":[0.9610404,0.00001136098,0.03797115,0.0005755664,0.0001015921,0.00011630377,0.000011319215,0.000011628538,0.00016067832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965552,0.00021595166,0.000569802,0.00095453736,0.0011843564,0.00052015326],"domain_scores_gemma":[0.998162,0.00021534353,0.00023424823,0.0009638749,0.00024793245,0.00017660295],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014089262,0.00023575948,0.00032130367,0.0010496893,0.0016104088,0.0003599842,0.0025121104,0.00003539619,0.000057829042],"category_scores_gemma":[0.00002463221,0.0002636326,0.00009642275,0.0037846938,0.0010686872,0.0016670842,0.0014971988,0.00041889359,0.000012193927],"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.000032761585,0.0015844196,0.0013357796,0.000036227353,0.000029012392,0.000022487082,0.008841531,0.0581397,0.0032571054,0.8911904,0.002365106,0.033165485],"study_design_scores_gemma":[0.0010508664,0.0015212622,0.010387625,0.000040441577,0.000010616724,0.00010858639,0.00030628912,0.90871143,0.0026287274,0.063182846,0.011316119,0.00073519244],"about_ca_topic_score_codex":0.000117932505,"about_ca_topic_score_gemma":0.00008090653,"teacher_disagreement_score":0.85057175,"about_ca_system_score_codex":0.00021591988,"about_ca_system_score_gemma":0.0004239977,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W4313227811","doi":"10.1109/focs54457.2022.00065","title":"Randomised Composition and Small-Bias Minimax","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","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":"Bounded function; Omega; Combinatorics; Measure (data warehouse); Composition (language); Minimax; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical economics; Philosophy; Data mining; Mathematical analysis","score_opus":0.024539535215569456,"score_gpt":0.25784443180688893,"score_spread":0.23330489659131948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30832857,0.00006770178,0.6799605,0.0041433414,0.0043256893,0.00094666006,0.00012604299,0.0003137715,0.0017877236],"genre_scores_gemma":[0.9402344,0.000030956347,0.05808566,0.0010588149,0.00021411173,0.00013311015,0.000019380122,0.000019659186,0.00020388093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627745,0.0002986653,0.00061880716,0.0010200944,0.0012511557,0.00053383067],"domain_scores_gemma":[0.99761,0.0004785263,0.00035205393,0.0009918341,0.0003313421,0.00023627857],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018286598,0.00028554036,0.00039418723,0.0008661679,0.002149923,0.0005229778,0.0026646429,0.00004217176,0.000056363584],"category_scores_gemma":[0.000026235926,0.00030765202,0.00017444212,0.0024616476,0.0008534472,0.0012127286,0.0013932489,0.0003693508,0.000017698554],"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.00089985784,0.0037794756,0.0007785501,0.00013936599,0.00022313962,0.00009047082,0.02065433,0.06843987,0.06086621,0.64556974,0.007590127,0.19096889],"study_design_scores_gemma":[0.010428922,0.0032492832,0.003018579,0.00009271289,0.000061947234,0.00036533302,0.00045144212,0.92806786,0.017128568,0.019199263,0.01637043,0.0015656817],"about_ca_topic_score_codex":0.00005023438,"about_ca_topic_score_gemma":0.0000061109754,"teacher_disagreement_score":0.85962796,"about_ca_system_score_codex":0.00017085166,"about_ca_system_score_gemma":0.0003218509,"threshold_uncertainty_score":0.99993753},"labels":[],"label_agreement":null},{"id":"W4313343183","doi":"10.1007/978-3-031-22105-7_40","title":"Two-Stage BP Maximization Under p-matroid Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Constraint (computer-aided design); Mathematics; Monotonic function; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Mathematical analysis","score_opus":0.024827609823504546,"score_gpt":0.2528371644592893,"score_spread":0.22800955463578473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023808017,0.00034810175,0.98366696,0.0012254468,0.0028700603,0.00042871363,0.000027348813,0.0003133917,0.011096184],"genre_scores_gemma":[0.047236342,0.00010230817,0.94551176,0.0053143287,0.00057426316,0.000027721973,0.000037163052,0.00007025436,0.0011258612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951906,0.00007470061,0.00063023064,0.001849337,0.0014599705,0.00079511566],"domain_scores_gemma":[0.99700314,0.00047150374,0.00036780885,0.0017626552,0.00018963494,0.00020526207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010040288,0.00061180384,0.00056381355,0.0011134198,0.0006787424,0.00074081635,0.0043711658,0.00016218719,0.0005563494],"category_scores_gemma":[0.000046060835,0.00062990625,0.00022382586,0.0010529398,0.0011994956,0.0007785041,0.0029541054,0.0012940647,0.000041921587],"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.0000033823392,0.000032037115,0.00001151852,0.000020871854,0.000012605766,0.00010823517,0.00031759756,0.2006024,0.000040752682,0.56151253,0.000018766515,0.2373193],"study_design_scores_gemma":[0.00039075536,0.00012592056,0.000033474393,0.00009972032,0.0000073025853,0.00014782522,7.636509e-7,0.5682377,0.00020758875,0.4217607,0.008213956,0.0007742626],"about_ca_topic_score_codex":0.00006916915,"about_ca_topic_score_gemma":0.00011152319,"teacher_disagreement_score":0.36763534,"about_ca_system_score_codex":0.0004931728,"about_ca_system_score_gemma":0.0007534679,"threshold_uncertainty_score":0.99961525},"labels":[],"label_agreement":null},{"id":"W4313351104","doi":"10.1007/978-3-031-22105-7_1","title":"A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Combinatorics; Regular polygon; Mathematics; Oracle; Maximization; Function (biology); Constraint (computer-aided design); Order (exchange); Discrete mathematics; Set (abstract data type); Set function; Convex function; Stochastic ordering; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.016908042043018292,"score_gpt":0.2398259652213626,"score_spread":0.2229179231783443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006455862,0.00023859912,0.99339557,0.00065366365,0.0027084325,0.0010443721,0.000029003204,0.00026592385,0.0015998868],"genre_scores_gemma":[0.14450765,0.00008874181,0.8479153,0.004171373,0.0011442208,0.00022853994,0.00010226752,0.00018706989,0.0016548665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942284,0.000066359076,0.0007401444,0.0022864004,0.0017507465,0.000927918],"domain_scores_gemma":[0.9965925,0.00041819335,0.00043335062,0.0020750149,0.00023498628,0.00024593654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010917847,0.0007503347,0.0007734586,0.0012971514,0.00067643635,0.0007262996,0.0047480376,0.0002974439,0.00025561382],"category_scores_gemma":[0.00006371209,0.00077247806,0.00023744938,0.0015092815,0.0008273314,0.0009433318,0.0034395554,0.0013970332,0.00003841873],"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.00002178893,0.00013529893,0.000045228688,0.00013959916,0.000056928093,0.0002804855,0.0029057167,0.5744311,0.00009922322,0.12518916,0.0001844764,0.296511],"study_design_scores_gemma":[0.00036731106,0.00021111632,0.0000728937,0.00017835309,0.000011171807,0.00009080243,2.270855e-7,0.7374082,0.00006857201,0.25816244,0.002708811,0.00072007405],"about_ca_topic_score_codex":0.00007105725,"about_ca_topic_score_gemma":0.00004721612,"teacher_disagreement_score":0.2957909,"about_ca_system_score_codex":0.00048826492,"about_ca_system_score_gemma":0.0007240635,"threshold_uncertainty_score":0.9994726},"labels":[],"label_agreement":null},{"id":"W4313457405","doi":"10.21203/rs.3.rs-2170035/v1","title":"A Randomized Algorithm for Finding Local Maximum Cuts","year":2023,"lang":"en","type":"preprint","venue":"Research Square","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science; Randomized algorithm; Mathematical optimization; Mathematics","score_opus":0.17055799200511046,"score_gpt":0.42335887962679336,"score_spread":0.2528008876216829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313457405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009584432,0.00064536155,0.9894694,0.0025574663,0.0019150886,0.0036927282,0.0002118066,0.00070417754,0.0007080911],"genre_scores_gemma":[0.019487016,0.0012981939,0.95668364,0.00017834698,0.0023952909,0.009370934,0.00053549866,0.0002535038,0.009797597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99309516,0.001223185,0.0006677739,0.0015696255,0.0019645474,0.0014796886],"domain_scores_gemma":[0.99153095,0.005210356,0.0001681513,0.0018087823,0.000939895,0.0003418461],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009716941,0.00042830632,0.0010888651,0.0013476469,0.00074569596,0.0010688709,0.003749707,0.00047675124,0.000036429203],"category_scores_gemma":[0.0011033829,0.00039806368,0.0009477556,0.0013504473,0.00068400503,0.00022339492,0.007306767,0.0021527882,0.0002314569],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017599873,0.00022018467,0.000008339275,0.0014249446,0.00035374894,0.00022901264,0.0015443022,0.00087279285,0.0000047928647,0.08251408,0.01975013,0.89131767],"study_design_scores_gemma":[0.019238817,0.00007555002,0.000016271693,0.00053321547,0.0000094381585,0.0000060097195,0.0000965883,0.5738877,0.00007504026,0.4013307,0.00442007,0.00031057288],"about_ca_topic_score_codex":0.0003736112,"about_ca_topic_score_gemma":0.00003767868,"teacher_disagreement_score":0.8910071,"about_ca_system_score_codex":0.00028780592,"about_ca_system_score_gemma":0.0007409389,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W4315471891","doi":"10.1109/cdc51059.2022.9992771","title":"A Programming Approach for Worst-case Studies in Distributed Submodular Maximization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","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","keywords":"Submodular set function; Computer science; Maximization; Mathematical optimization; Mathematics","score_opus":0.08175591008355151,"score_gpt":0.31350981465584,"score_spread":0.23175390457228848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315471891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023487752,0.00046728784,0.973738,0.0004540482,0.0005407327,0.001043454,0.00010642929,0.00010389669,0.000058355647],"genre_scores_gemma":[0.965915,0.000081787955,0.032608736,0.0003174693,0.000043798093,0.0009261958,0.000033696208,0.000012590709,0.00006068166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976612,0.00022681995,0.00044641044,0.0007703694,0.00048849074,0.00040673843],"domain_scores_gemma":[0.9985542,0.0004925763,0.00015664699,0.00050715945,0.0001758686,0.0001135483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010259323,0.00024524797,0.00043429952,0.00032584957,0.00070000655,0.00027059056,0.0006308545,0.000055641805,0.000026256195],"category_scores_gemma":[0.0002079577,0.00023130041,0.000113832044,0.00084410474,0.00010905314,0.00024213715,0.0003030752,0.00032431463,0.0000015927388],"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.00058957026,0.00079066015,0.00041392268,0.00005428072,0.000101885984,0.0005780818,0.0014966583,0.0077793626,0.0001480904,0.09481887,0.0007835127,0.8924451],"study_design_scores_gemma":[0.0039551724,0.0005365505,0.00018844547,0.00003195621,0.000019620153,0.00028250637,0.0015421093,0.96262527,0.0000244162,0.02753286,0.0029042051,0.0003568684],"about_ca_topic_score_codex":0.000019920008,"about_ca_topic_score_gemma":0.000034154047,"teacher_disagreement_score":0.9548459,"about_ca_system_score_codex":0.00009513223,"about_ca_system_score_gemma":0.0000681724,"threshold_uncertainty_score":0.9432157},"labels":[],"label_agreement":null},{"id":"W4315472114","doi":"10.1109/cdc51059.2022.9993409","title":"Optimistic Greedy Strategies for Partially Known Submodular Functions","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","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","keywords":"Submodular set function; Set function; Greedy algorithm; Function (biology); Set (abstract data type); Maximization; Mathematical optimization; Entropy (arrow of time); Computer science; Mathematics","score_opus":0.04157984328601584,"score_gpt":0.26978825440398185,"score_spread":0.22820841111796603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315472114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008464041,0.00024124233,0.98572576,0.0012882467,0.0018385057,0.0005630024,0.0001660906,0.00016761315,0.0015455142],"genre_scores_gemma":[0.991552,0.000050137776,0.0060172407,0.0009107221,0.00013057407,0.00046130572,0.000014172491,0.000016263339,0.0008476134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752605,0.00017826947,0.00041762475,0.00078886526,0.00063664356,0.00045253374],"domain_scores_gemma":[0.99804026,0.0006724969,0.00014374848,0.0007425545,0.00019944628,0.00020151249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068314956,0.00027640598,0.00038454548,0.00024646745,0.0012079116,0.0006599794,0.0010497293,0.00006923648,0.0006194689],"category_scores_gemma":[0.00009110054,0.00026568337,0.00018379,0.0004326667,0.00012237922,0.0003527517,0.00025826698,0.00040343113,0.00003309451],"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.00045669673,0.00036074032,0.000048988346,0.00001459302,0.00008226071,0.000042672542,0.00035769164,0.008091595,0.0013405902,0.5892801,0.0064388188,0.39348525],"study_design_scores_gemma":[0.003297197,0.0016922166,0.0006087704,0.000024499115,0.000042389915,0.000039423998,0.00074467907,0.7786737,0.000036725007,0.17498876,0.039357327,0.00049432187],"about_ca_topic_score_codex":0.000033145352,"about_ca_topic_score_gemma":0.00008758194,"teacher_disagreement_score":0.98308796,"about_ca_system_score_codex":0.00004813976,"about_ca_system_score_gemma":0.000283817,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W4315641735","doi":"10.1007/s10878-022-00978-4","title":"Two approximation algorithms for maximizing nonnegative weakly monotonic set functions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Monotone polygon; Approximation algorithm; Monotonic function; Combinatorics; Greedy algorithm; Theory of computation; Maximization; Set function; Set (abstract data type); Discrete mathematics; Function (biology); Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.03909375940252006,"score_gpt":0.2958453431144178,"score_spread":0.2567515837118977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315641735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007992942,0.000031780542,0.9894461,0.0010327661,0.007886829,0.00034517102,0.000010168731,0.00013505352,0.00031281766],"genre_scores_gemma":[0.0793534,0.00008318036,0.9190154,0.00007203625,0.0012322643,0.000049699396,0.000045715333,0.000031697222,0.000116616364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983308,0.00011075227,0.00061146205,0.00022142533,0.00046177336,0.00026378655],"domain_scores_gemma":[0.9978317,0.00035293677,0.00062978925,0.00024898857,0.0008317832,0.00010481337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010049464,0.00016024325,0.0002864659,0.0005260358,0.00035038523,0.00026291062,0.00056806515,0.00008153617,0.000008878238],"category_scores_gemma":[0.00027362644,0.00015676327,0.00021204041,0.0014280807,0.00004030275,0.0013550376,0.000115163864,0.00021414945,0.000011296468],"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.00008163716,0.00014471926,0.000020091786,0.000027004324,0.00010087302,0.000007728849,0.0008840938,0.80506474,0.0001639768,0.17750204,0.0025848416,0.013418281],"study_design_scores_gemma":[0.0020457662,0.00035674768,0.000046693265,0.000041481908,0.000029676467,0.000024754534,0.00014938416,0.9122912,0.00054955174,0.08317757,0.0011226514,0.00016446528],"about_ca_topic_score_codex":0.0000043832756,"about_ca_topic_score_gemma":3.8421226e-7,"teacher_disagreement_score":0.10722655,"about_ca_system_score_codex":0.00011923742,"about_ca_system_score_gemma":0.00016942872,"threshold_uncertainty_score":0.6392621},"labels":[],"label_agreement":null},{"id":"W4318303117","doi":"10.1142/s0129054122460029","title":"Graph Algorithm Based Submodular Function for Sparsest Cut Problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","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 New Brunswick","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Minimum cut; Combinatorics; Subroutine; Graph partition; Maximum flow problem; Maximum cut; Partition (number theory); Graph; Weight function; Cut; Discrete mathematics; Minimum weight; Algorithm; Segmentation; Computer science; Image segmentation; Artificial intelligence","score_opus":0.03254517234860851,"score_gpt":0.3020471426313973,"score_spread":0.2695019702827888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318303117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005050615,0.000017374156,0.98782444,0.0021290442,0.0046592625,0.00015767888,0.000014306497,0.00006459496,0.00008269521],"genre_scores_gemma":[0.24583553,0.000013239327,0.75352055,0.00019974391,0.00038349905,0.000009202051,0.000009330371,0.0000066986036,0.000022234595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974748,0.000037153204,0.0006421134,0.00030281543,0.0012864554,0.00025665405],"domain_scores_gemma":[0.9958621,0.00028488124,0.00057224004,0.00034260613,0.0028248732,0.0001132727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015873447,0.00012888208,0.00019565006,0.0016470146,0.00025663848,0.00044562216,0.0030295735,0.00003366049,0.00000915595],"category_scores_gemma":[0.00009374308,0.00012230448,0.00023037771,0.0020115105,0.00037165705,0.0018739516,0.00029162545,0.00012852282,0.000010144306],"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.000036528494,0.00036383208,0.00044865158,0.00002163788,0.00014233221,0.000022768265,0.00033685195,0.03878653,0.0017585595,0.17740902,0.0022433316,0.7784299],"study_design_scores_gemma":[0.00075606274,0.00040289684,0.005109477,0.00008741727,0.000012672556,0.00006845995,0.000010889862,0.8775856,0.0022849934,0.10700103,0.006524959,0.0001555579],"about_ca_topic_score_codex":0.000009113349,"about_ca_topic_score_gemma":0.0000034310963,"teacher_disagreement_score":0.83879906,"about_ca_system_score_codex":0.000079884485,"about_ca_system_score_gemma":0.00058947876,"threshold_uncertainty_score":0.56297517},"labels":[],"label_agreement":null},{"id":"W4320487114","doi":"10.1137/18m1233418","title":"Inapproximability of Matrix \\(\\boldsymbol{p \\rightarrow q}\\) Norms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Hardness of approximation; Approximation algorithm; Exponential time hypothesis; Matrix (chemical analysis); Norm (philosophy); Matrix norm; Exponential function; Constant (computer programming); Discrete mathematics; Time complexity; Computer science; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Mathematical analysis","score_opus":0.023548463633614986,"score_gpt":0.2929863234056024,"score_spread":0.2694378597719874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320487114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731549,0.00013213503,0.31906456,0.001786447,0.002884912,0.00018562037,0.0000037710906,0.00046302038,0.0023246568],"genre_scores_gemma":[0.954082,0.000017917408,0.04532983,0.00011749308,0.0003534322,8.3138394e-7,0.000001309653,0.000012910851,0.00008423315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997647,0.00016563866,0.0006449576,0.0003662232,0.0006722194,0.0005039847],"domain_scores_gemma":[0.9982796,0.00043144295,0.00036748816,0.0005547813,0.00018948484,0.00017725551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018729519,0.00019831612,0.0003538172,0.00043503544,0.00046051553,0.00019162548,0.0014111714,0.0000741036,0.000023066279],"category_scores_gemma":[0.00014073226,0.00016380276,0.0002573056,0.0016109307,0.000107989756,0.0003133975,0.00049038674,0.0006350769,0.00008851058],"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.00007777886,0.00084922794,0.0118012745,0.00031480886,0.00022506058,0.0006103705,0.0052400846,0.025637679,0.0023875572,0.3861063,0.0076636486,0.5590862],"study_design_scores_gemma":[0.0013455148,0.0007180666,0.03836648,0.00041096043,0.000013343604,0.00053183205,0.00021181753,0.7646762,0.003868993,0.18427847,0.0049470286,0.0006312769],"about_ca_topic_score_codex":0.00000763306,"about_ca_topic_score_gemma":0.0000011274475,"teacher_disagreement_score":0.7390385,"about_ca_system_score_codex":0.00006102742,"about_ca_system_score_gemma":0.00010410196,"threshold_uncertainty_score":0.6679683},"labels":[],"label_agreement":null},{"id":"W4360610866","doi":"10.1142/s0217595923400122","title":"Minimization Problems with Non-Submodular Cover Constraint","year":2023,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Cover (algebra); Constraint (computer-aided design); Set function; Set cover problem; Mathematics; Greedy algorithm; Set (abstract data type); Mathematical optimization; Covering problems; Function (biology); Computer science","score_opus":0.06893791714868018,"score_gpt":0.33205864503315735,"score_spread":0.26312072788447716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360610866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047838926,0.00018392921,0.908923,0.01685071,0.0006326046,0.00072395086,0.000017399603,0.000077786746,0.0247517],"genre_scores_gemma":[0.97349936,0.000088680106,0.025140692,0.000030254634,0.00017057308,0.000012167163,0.000009844633,0.000009669712,0.0010387788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719197,0.00020177086,0.00036117662,0.00021771867,0.0016874777,0.0003399065],"domain_scores_gemma":[0.9976851,0.00032099392,0.00009748064,0.00025635198,0.001490725,0.00014936314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025383087,0.000098472636,0.00016175734,0.0005921022,0.0003553385,0.00043544394,0.0006969576,0.000049179383,0.00009150101],"category_scores_gemma":[0.00016859369,0.00007398925,0.00006248004,0.001695787,0.00023950434,0.00075102056,0.000130575,0.0004615414,0.00013067458],"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.00018386844,0.00068356184,0.005903279,0.0001209387,0.0003970812,0.0011264796,0.0071155243,0.08250177,0.008646657,0.7513333,0.094205126,0.047782425],"study_design_scores_gemma":[0.0045808414,0.0036531687,0.03833969,0.00072708674,0.000020166857,0.0026053563,0.0039092195,0.76664025,0.0049953535,0.08124977,0.0923951,0.00088402774],"about_ca_topic_score_codex":0.0000040449813,"about_ca_topic_score_gemma":0.0000017625023,"teacher_disagreement_score":0.92566043,"about_ca_system_score_codex":0.00006528394,"about_ca_system_score_gemma":0.0007469021,"threshold_uncertainty_score":0.41989958},"labels":[],"label_agreement":null},{"id":"W4360985546","doi":"10.1007/s40305-023-00469-1","title":"Maximizing the Ratio of Monotone DR-Submodular Functions on Integer Lattice","year":2023,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Monotone polygon; Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Integer lattice; Half-integer; Computer science; Physics","score_opus":0.08786346303967044,"score_gpt":0.35909603442660903,"score_spread":0.27123257138693857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360985546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30236223,0.00029659944,0.5724658,0.12185505,0.0014591904,0.0006205099,0.000019050127,0.000036266567,0.00088530174],"genre_scores_gemma":[0.96499467,0.00030074336,0.031623036,0.00021017021,0.0003454291,0.000013830811,0.0000013411251,0.000012056408,0.002498734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767303,0.00043812988,0.00044476122,0.00012646843,0.0011013186,0.00021627337],"domain_scores_gemma":[0.99796206,0.0004855003,0.00013072307,0.00064240646,0.0007253738,0.000053949112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039371396,0.00008262308,0.00017712265,0.00014429005,0.0009874544,0.00015863038,0.0016332347,0.00004577422,0.00002167663],"category_scores_gemma":[0.0004312215,0.000046062098,0.00041034576,0.001859546,0.00037678352,0.00040396338,0.0004613169,0.0008438187,0.000009218116],"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.00006321929,0.0009025265,0.00029101758,0.00013899729,0.0007595004,0.000006121875,0.035759367,0.5487858,0.03032339,0.19074908,0.17664064,0.015580332],"study_design_scores_gemma":[0.00040556092,0.00030209732,0.007380389,0.00017204361,0.0000164831,0.000023712524,0.0016870815,0.96147305,0.0061237654,0.018413471,0.0039146,0.000087771456],"about_ca_topic_score_codex":0.00006174682,"about_ca_topic_score_gemma":0.000012534603,"teacher_disagreement_score":0.6626324,"about_ca_system_score_codex":0.00005758111,"about_ca_system_score_gemma":0.00027642664,"threshold_uncertainty_score":0.7594801},"labels":[],"label_agreement":null},{"id":"W4366282323","doi":"10.4230/lipics.esa.2023.84","title":"Approximation Algorithms for the Airport and Railway Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Bhabha Atomic Research Centre; Villum Fonden; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Multiplicative function; Logarithm; Planar graph; Inverse; Embedding; Graph; Discrete mathematics; Pathwidth; Line graph; Computer science; Geometry","score_opus":0.15203343678785233,"score_gpt":0.2170879876616281,"score_spread":0.06505455087377576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366282323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002262003,0.00009222368,0.994327,0.00079053163,0.00074737915,0.00092635595,0.000032331856,0.00039698315,0.00042520865],"genre_scores_gemma":[0.84315246,0.0010451287,0.14499848,0.00027957873,0.00047673009,0.00005713061,0.00008890671,0.00007281185,0.009828768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839044,0.00005877389,0.00018881717,0.0009520704,0.000100914476,0.00030898204],"domain_scores_gemma":[0.9982142,0.00037666672,0.00020904062,0.0009672,0.00014238522,0.0000905001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057288515,0.00025077767,0.00024162853,0.00019132439,0.00043143306,0.00023449294,0.0015792076,0.00018032841,0.000005186482],"category_scores_gemma":[0.000030460456,0.00022568126,0.00018790581,0.00052477553,0.0001785987,0.0002852872,0.0020534806,0.00038669485,0.000016996779],"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.000017945891,0.00007255348,0.00042166136,0.00027863032,0.00020005158,0.000053144697,0.0006629801,0.047475122,0.0000053954095,0.9101533,0.0016783687,0.0389808],"study_design_scores_gemma":[0.00023125552,0.000028584354,0.0007617735,0.00004394897,0.00003770176,0.0000036299866,0.000055509925,0.6613422,0.000015652473,0.33562186,0.0016499831,0.0002079032],"about_ca_topic_score_codex":0.00010659139,"about_ca_topic_score_gemma":0.000041301,"teacher_disagreement_score":0.8493285,"about_ca_system_score_codex":0.00005899085,"about_ca_system_score_gemma":0.00010967537,"threshold_uncertainty_score":0.9203015},"labels":[],"label_agreement":null},{"id":"W4367050013","doi":"10.1007/s10107-023-01961-5","title":"Approximation algorithms for flexible graph connectivity","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Mathematics; Combinatorics; Partition (number theory); Graph; Undirected graph; Algorithm; Efficient algorithm; Discrete mathematics","score_opus":0.07737915461578086,"score_gpt":0.3207735815701585,"score_spread":0.24339442695437763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014228667,0.000020420708,0.9938541,0.0006561023,0.00022273252,0.000772924,0.0000035265427,0.0019365171,0.0011108174],"genre_scores_gemma":[0.052504275,0.0000026569692,0.9463757,0.000073664945,0.00011242775,0.00058967265,0.000015780728,0.000022319427,0.00030345473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983887,0.000040686464,0.00030064586,0.0004263898,0.00032385593,0.0005197265],"domain_scores_gemma":[0.99862355,0.00062553654,0.000080915815,0.00046941504,0.000087033375,0.00011352835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061184,0.00016608374,0.0002463639,0.00021000889,0.00032899444,0.00032019734,0.00060365937,0.0000749048,0.000008829045],"category_scores_gemma":[0.0003002344,0.00015118478,0.0001823269,0.00125633,0.00009157944,0.00039069145,0.00024829776,0.00012578795,0.00013576215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021079047,0.000109203065,0.0000072015264,0.0001658468,0.000016188696,0.0000021141816,0.00041324625,0.000022652093,0.000053203432,0.62413293,0.0004471262,0.3746282],"study_design_scores_gemma":[0.00021434613,0.00007015445,0.00002915188,0.000030379195,0.000006031451,0.000008573613,0.00006666464,0.3904129,0.00073947525,0.60449624,0.0037706578,0.00015544443],"about_ca_topic_score_codex":0.0000028595173,"about_ca_topic_score_gemma":8.2413067e-7,"teacher_disagreement_score":0.39039025,"about_ca_system_score_codex":0.000023151606,"about_ca_system_score_gemma":0.000022984263,"threshold_uncertainty_score":0.6165136},"labels":[],"label_agreement":null},{"id":"W4367369757","doi":"10.1145/3558481.3591101","title":"A Simple and Efficient Parallel Laplacian Solver","year":2023,"lang":"en","type":"preprint","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Binary logarithm; Combinatorics; Cholesky decomposition; Factorization; Simple (philosophy); Laplacian matrix; Mathematics; Laplace operator; Diagonal; Upper and lower bounds; Log-log plot; Discrete mathematics; Graph; Computer science; Eigenvalues and eigenvectors; Algorithm; Physics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.0479539260316339,"score_gpt":0.27860579142161734,"score_spread":0.23065186538998345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367369757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006776868,0.00016990802,0.9847736,0.0016887393,0.0012409979,0.00033247768,0.000019940624,0.0009901786,0.0040073353],"genre_scores_gemma":[0.45673612,0.0003116304,0.53192884,0.0019716516,0.0005455382,0.0002150781,0.00007979655,0.000084880165,0.0081264805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982178,0.00004459951,0.00024543324,0.0008151914,0.0003181112,0.00035886827],"domain_scores_gemma":[0.9986542,0.00012811249,0.00007959645,0.0009488165,0.000050705603,0.00013860229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030909537,0.0002465745,0.00027781868,0.00019122162,0.00016310539,0.00042068344,0.0011426291,0.00016203409,0.00003605256],"category_scores_gemma":[0.000024967783,0.00022512485,0.00012824436,0.0002449821,0.00009119798,0.00005653021,0.0052369405,0.00042266195,0.0001242919],"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.00001131722,0.00026539058,0.0011347808,0.00034700628,0.00019661314,0.000193753,0.0025638256,0.029973252,0.00001947642,0.87299013,0.03676728,0.055537194],"study_design_scores_gemma":[0.00019744562,0.000026791227,0.004457681,0.000042083746,0.0000076051206,0.0000076229367,0.000029398014,0.76535565,0.000020637692,0.2223482,0.007114016,0.00039288134],"about_ca_topic_score_codex":0.00024810492,"about_ca_topic_score_gemma":0.00011653364,"teacher_disagreement_score":0.7353824,"about_ca_system_score_codex":0.000024001862,"about_ca_system_score_gemma":0.00007738287,"threshold_uncertainty_score":0.9180325},"labels":[],"label_agreement":null},{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","score_opus":0.05154537697838242,"score_gpt":0.30494632123818965,"score_spread":0.25340094425980725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367397470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00487021,0.0004253955,0.9915201,0.0012216204,0.000673504,0.00056573626,0.000007870176,0.00038587657,0.00032965594],"genre_scores_gemma":[0.8575309,0.00014484763,0.14153242,0.00018210862,0.00033954743,0.000041286152,0.000030561114,0.000026231992,0.00017208548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997997,0.000115186194,0.00051353534,0.00045810046,0.0003620221,0.0005541475],"domain_scores_gemma":[0.997798,0.0011405637,0.0002940293,0.00052679126,0.00016475824,0.00007586124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429719,0.00021567233,0.0003100193,0.00016277168,0.00058346573,0.00019682175,0.0012379047,0.00007298361,0.000008065853],"category_scores_gemma":[0.00009143633,0.00016742692,0.00022111775,0.001142966,0.00008412222,0.00025506355,0.00038227128,0.00017628881,0.000016063155],"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.000031283256,0.0001024341,0.00041822452,0.00014694438,0.00019463873,0.000013985316,0.0037953416,0.5200233,0.00035555506,0.31214136,0.0032774834,0.15949944],"study_design_scores_gemma":[0.0008136015,0.000063761036,0.0019400539,0.000062446656,0.000014723465,0.0000064413152,0.00012516168,0.9692965,0.00027907937,0.024761114,0.0024280425,0.00020906531],"about_ca_topic_score_codex":0.000038402934,"about_ca_topic_score_gemma":0.000006268788,"teacher_disagreement_score":0.8526607,"about_ca_system_score_codex":0.000024139386,"about_ca_system_score_gemma":0.00007067649,"threshold_uncertainty_score":0.6827471},"labels":[],"label_agreement":null},{"id":"W4376874065","doi":"10.1145/3583085","title":"Catalytic Branching Programs from Groups and General Protocols","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","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":"Université de Montréal","funders":"","keywords":"Branching (polymer chemistry); Amortized analysis; Boolean function; Exponential function; Mathematics; Multiplicity (mathematics); Binary decision diagram; Combinatorics; Range (aeronautics); Discrete mathematics; Data structure; Computer science; Algorithm; Geometry","score_opus":0.04121551144187059,"score_gpt":0.29964253833018345,"score_spread":0.25842702688831287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376874065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029980997,0.000013397259,0.96636194,0.0005221708,0.0002760283,0.0019501299,0.000011762867,0.0007689306,0.00011463375],"genre_scores_gemma":[0.8645284,0.000008381972,0.13277724,0.00035522823,0.000104056184,0.0019210143,0.00005262771,0.000025169646,0.00022782927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.0001638317,0.00022299078,0.0004383512,0.00024710654,0.00023407959],"domain_scores_gemma":[0.99882257,0.0004958186,0.00006162068,0.00048592864,0.00004398867,0.000090076326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038290667,0.00015682967,0.00015100544,0.00023180898,0.0004137547,0.00027036454,0.0005659999,0.000056284338,0.000010673988],"category_scores_gemma":[0.00001994268,0.0001566746,0.000078804194,0.0007701685,0.00009338865,0.00041381287,0.000037489135,0.00021060249,0.0000840825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001712406,0.000095537114,0.000029505167,0.000015602509,0.000036702513,0.000008169654,0.0014019993,0.005469963,0.000066559274,0.030406108,0.000025485822,0.96242726],"study_design_scores_gemma":[0.00056919444,0.0001371743,0.0026547366,0.00006491186,0.000010893229,0.000011698601,0.000089883455,0.27880502,0.0005863448,0.71650857,0.0003301017,0.00023145483],"about_ca_topic_score_codex":0.00003663937,"about_ca_topic_score_gemma":0.000012660704,"teacher_disagreement_score":0.9621958,"about_ca_system_score_codex":0.00002415804,"about_ca_system_score_gemma":0.00003085677,"threshold_uncertainty_score":0.6389005},"labels":[],"label_agreement":null},{"id":"W4379622149","doi":"10.1016/j.dam.2023.05.022","title":"A local search approximation algorithm for the multiway cut problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Approximation algorithm; Combinatorics; Heuristic; Set (abstract data type); Local search (optimization); Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.03813232295211413,"score_gpt":0.28438786931293325,"score_spread":0.24625554636081912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379622149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112284295,0.000020417629,0.9952919,0.00070845097,0.00011239939,0.0013388355,0.000023028637,0.0004881166,0.0019045585],"genre_scores_gemma":[0.015559929,0.000020450749,0.9830853,0.000107906875,0.00008997795,0.0007781769,0.000034796212,0.000030858508,0.00029261282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834347,0.000016045806,0.000331482,0.00036809416,0.00047580036,0.00046508413],"domain_scores_gemma":[0.9982992,0.00070804934,0.00009496497,0.00074397685,0.00007882526,0.00007498652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008521766,0.00019494085,0.00021524409,0.00011984033,0.00045311882,0.00024596154,0.0011744251,0.00007175804,0.0000069965495],"category_scores_gemma":[0.00001771779,0.00013533908,0.00012677044,0.00087575463,0.0001606239,0.00015227626,0.0004594677,0.00018017477,0.00014720488],"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.00000183211,0.00005144584,2.484416e-7,0.00014106753,0.00003634566,0.000001297718,0.0032467295,0.000989661,0.00015455557,0.6295724,0.00088899146,0.36491546],"study_design_scores_gemma":[0.00029032555,0.00002403485,0.000008170553,0.000019315748,0.000012003324,0.0000046271048,0.0009388628,0.8100781,0.0014301279,0.18563093,0.0014038035,0.00015971225],"about_ca_topic_score_codex":0.0000059654917,"about_ca_topic_score_gemma":0.0000033843576,"teacher_disagreement_score":0.8090884,"about_ca_system_score_codex":0.00002958213,"about_ca_system_score_gemma":0.000044819404,"threshold_uncertainty_score":0.55189675},"labels":[],"label_agreement":null},{"id":"W4384918518","doi":"10.4230/lipics.icalp.2024.35","title":"A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; National Science Foundation","keywords":"Enumeration; Bipartite graph; Combinatorics; Mathematics; Bounded function; Independent set; Subspace topology; Discrete mathematics; Dense graph; Maximal independent set; Cograph; Split graph; Counting problem; Pathwidth; Graph; Line graph","score_opus":0.12753554819873622,"score_gpt":0.21624135065149205,"score_spread":0.08870580245275583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384918518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6015309,0.00003132566,0.3935926,0.00013545147,0.0008651948,0.0006834298,0.000028300143,0.000635059,0.0024977126],"genre_scores_gemma":[0.98250455,0.000056907887,0.016780678,0.00011385487,0.000051718034,0.000007811624,0.0000217638,0.000034376844,0.0004283233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964424,0.0001806118,0.00037574134,0.0019151138,0.00026422404,0.0008219372],"domain_scores_gemma":[0.9978509,0.00011359879,0.00021611075,0.0014431585,0.0000935831,0.00028264496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077147887,0.0004657817,0.0005201221,0.0012976576,0.00019712317,0.00034403976,0.0028751413,0.0003153237,0.000007040288],"category_scores_gemma":[0.000042320582,0.00057668134,0.00029459473,0.0027529667,0.00011335976,0.00038855325,0.0041115903,0.0010809678,0.00015556677],"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.000042858595,0.00038049516,0.012043336,0.00020762048,0.00010652336,0.0010506185,0.001610211,0.3028397,0.00002178074,0.6808279,0.0002941966,0.00057475147],"study_design_scores_gemma":[0.00046412204,0.000039919203,0.015317297,0.000149937,0.000023976016,0.000015942684,0.0001549624,0.70230395,0.000051767314,0.28064993,0.00011960373,0.000708607],"about_ca_topic_score_codex":0.00073841,"about_ca_topic_score_gemma":0.00043895206,"teacher_disagreement_score":0.400178,"about_ca_system_score_codex":0.00027189372,"about_ca_system_score_gemma":0.00018549983,"threshold_uncertainty_score":0.9996685},"labels":[],"label_agreement":null},{"id":"W4385317379","doi":"10.1007/978-3-031-38906-1_16","title":"Hardness of Graph-Structured Algebraic and Symbolic Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Algebraic number; Combinatorics; Discrete mathematics; Laplacian matrix; Coefficient matrix; Diagonal; Polynomial; Polynomial ring; Matrix (chemical analysis); Graph; Field (mathematics); Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.022552788461934904,"score_gpt":0.23496622140103143,"score_spread":0.21241343293909654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033350012,0.00070193096,0.9943467,0.00035185553,0.0025854697,0.00045052485,0.000017069264,0.0002570898,0.0009558731],"genre_scores_gemma":[0.314659,0.00084129383,0.6808369,0.0013125507,0.00085591,0.00004668751,0.00002317433,0.00017487427,0.001249617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603164,0.00003823912,0.00064282207,0.0015852593,0.0010396299,0.0006624154],"domain_scores_gemma":[0.9973989,0.00039071447,0.00035926676,0.0014156443,0.00024282726,0.00019265966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076303736,0.0005636833,0.0007870491,0.0015135088,0.000257246,0.0003667366,0.0033024224,0.0003273033,0.000008727712],"category_scores_gemma":[0.00007326377,0.0005182405,0.00017419666,0.0014717748,0.0016389202,0.00045514037,0.0021019205,0.00076240173,0.000011177877],"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.000004795235,0.00003010218,0.00014551808,0.00028817175,0.000044442222,0.00005463976,0.0018111798,0.005300386,0.00031953148,0.26956967,0.000042879215,0.7223887],"study_design_scores_gemma":[0.00027851455,0.00015393022,0.00093300914,0.00058128254,0.000011389093,0.000090833775,2.5366805e-7,0.1110839,0.0008438065,0.8849406,0.00044037573,0.00064205815],"about_ca_topic_score_codex":0.000044325283,"about_ca_topic_score_gemma":0.00012769918,"teacher_disagreement_score":0.7217466,"about_ca_system_score_codex":0.00006131732,"about_ca_system_score_gemma":0.00030481853,"threshold_uncertainty_score":0.9997269},"labels":[],"label_agreement":null},{"id":"W4385408288","doi":"10.1007/s00778-023-00805-0","title":"Accelerating directed densest subgraph queries with software and hardware approaches","year":2023,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Shenzhen Science and Technology Innovation Program; National Natural Science Foundation of China; Chinese University of Hong Kong, Shenzhen","keywords":"Computer science; Speedup; Scalability; Parameterized complexity; Bipartite graph; Computation; Matching (statistics); Approximation algorithm; Linear programming; Theoretical computer science; Graph; Algorithm; Parallel computing; Mathematics","score_opus":0.08005984562599212,"score_gpt":0.2340146645626377,"score_spread":0.1539548189366456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385408288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7074201,0.001056824,0.2834009,0.005551496,0.0005760097,0.0002341129,0.000007988479,0.0012153685,0.000537197],"genre_scores_gemma":[0.81933284,0.0002916522,0.17920403,0.00028750542,0.0004074233,0.00001922772,0.000003691547,0.000030113464,0.0004235345],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998932,0.000113682436,0.00016265738,0.00019865637,0.0002927123,0.00030029952],"domain_scores_gemma":[0.9992285,0.00021901795,0.000101565456,0.0002805281,0.00007561862,0.00009478425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049525796,0.00013664804,0.00014186712,0.00014356663,0.0011149431,0.00076886883,0.00066124095,0.000030154823,0.000009422633],"category_scores_gemma":[0.00006854496,0.00008034425,0.000050111496,0.0008812029,0.00018629404,0.00043037647,0.00025696078,0.00035905148,0.0000070685205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009692661,0.00013521229,0.06555642,0.00012409949,0.00045149468,0.00071178755,0.02582942,0.0015028547,0.00035831693,0.057609566,0.008624384,0.8389995],"study_design_scores_gemma":[0.002751908,0.00097005785,0.5868365,0.000708388,0.0001248291,0.012418593,0.0061193067,0.20899817,0.002691992,0.16118704,0.015228858,0.0019643588],"about_ca_topic_score_codex":0.000013645755,"about_ca_topic_score_gemma":0.000039297156,"teacher_disagreement_score":0.8370352,"about_ca_system_score_codex":0.000010299646,"about_ca_system_score_gemma":0.000058856047,"threshold_uncertainty_score":0.8575353},"labels":[],"label_agreement":null},{"id":"W4385460878","doi":"10.1007/s00453-023-01154-8","title":"A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Mathematics; Theory of computation; Laplacian matrix; Matrix (chemical analysis); Current (fluid); Time complexity; Combinatorics; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.028964233586653013,"score_gpt":0.27415611258489736,"score_spread":0.24519187899824435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385460878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000835612,0.00020708864,0.9841183,0.00057836954,0.011017307,0.00079577666,0.00009130275,0.0017339014,0.0006223381],"genre_scores_gemma":[0.07565257,0.00016173281,0.90999955,0.0006419395,0.009473961,0.0010589614,0.00030091006,0.0002461227,0.0024642767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968492,0.000078795776,0.0005689416,0.0008843903,0.0006034436,0.0010152585],"domain_scores_gemma":[0.99774206,0.00065313274,0.0001818152,0.00088897103,0.00027909837,0.00025490776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009979367,0.0003614574,0.00048724542,0.00044952813,0.00074071845,0.0004500608,0.0016465246,0.00020341441,0.000006474767],"category_scores_gemma":[0.0001272413,0.0003794666,0.0002863246,0.0016440412,0.00010439576,0.0005816868,0.00060513197,0.0003393682,0.0002394109],"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.000016184873,0.00023845992,0.00003416066,0.00015271113,0.00024140129,0.00016978881,0.0012760048,0.00066015666,0.00030577104,0.3746348,0.014386689,0.6078839],"study_design_scores_gemma":[0.0010677995,0.00016911549,0.000026385274,0.00006837674,0.000017348859,0.00003398468,0.00012810717,0.92320824,0.0008092708,0.029368551,0.044626214,0.0004765855],"about_ca_topic_score_codex":0.00008515215,"about_ca_topic_score_gemma":0.0000037113496,"teacher_disagreement_score":0.9225481,"about_ca_system_score_codex":0.00008488005,"about_ca_system_score_gemma":0.00014517695,"threshold_uncertainty_score":0.9998657},"labels":[],"label_agreement":null},{"id":"W4385767827","doi":"10.24963/ijcai.2023/240","title":"Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time","year":2023,"lang":"en","type":"article","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Sublinear function; Computation; Mathematics; Running time; Approximation algorithm; Core (optical fiber); Discrete mathematics; Decomposition; Combinatorics; Computer science; Algorithm","score_opus":0.02525899246789385,"score_gpt":0.2665422157182012,"score_spread":0.24128322325030735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385767827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35477436,0.000076815,0.61590874,0.0036768457,0.0009041797,0.0003461868,0.0000043287423,0.002945614,0.021362925],"genre_scores_gemma":[0.5004711,0.00002080009,0.4949222,0.000848544,0.00015372018,0.000010199922,0.000021504375,0.000024493322,0.0035274704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986519,0.000056045425,0.00025285853,0.000385298,0.00023078917,0.0004230625],"domain_scores_gemma":[0.99926305,0.0001453136,0.000039874798,0.00044017032,0.00003833579,0.000073262934],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058260735,0.00012318492,0.00016281703,0.000360237,0.00012565406,0.00018102443,0.0008853662,0.000042329804,0.00008152982],"category_scores_gemma":[0.00003546532,0.00011692503,0.000060405535,0.002167821,0.000036781472,0.00034844218,0.0006445468,0.00014536812,0.0010881309],"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.0000115176545,0.00036939525,0.0073983143,0.000078293,0.000041989017,0.0004282332,0.002774428,0.0096429605,0.0032226546,0.61952055,0.035426717,0.32108498],"study_design_scores_gemma":[0.00022659265,0.000019116485,0.004088089,0.000012843633,6.2437346e-7,0.0000089995065,0.000013678533,0.9809087,0.0007923948,0.0122296745,0.0015365243,0.00016274775],"about_ca_topic_score_codex":0.00006382411,"about_ca_topic_score_gemma":0.0000149750385,"teacher_disagreement_score":0.97126573,"about_ca_system_score_codex":0.000020244664,"about_ca_system_score_gemma":0.000035735815,"threshold_uncertainty_score":0.99968964},"labels":[],"label_agreement":null},{"id":"W4385963754","doi":"10.46298/theoretics.23.9","title":"Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\\Delta$-Coloring","year":2023,"lang":"en","type":"article","venue":"TheoretiCS","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":"European Commission; National Science Foundation","keywords":"Greedy coloring; Graph coloring; Fractional coloring; Edge coloring; Colored; Impossibility; Combinatorics; Complete coloring; Graph; Computer science; Streaming algorithm; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Graph power; Line graph; Upper and lower bounds","score_opus":0.02922000910492449,"score_gpt":0.260946489951689,"score_spread":0.2317264808467645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385963754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072826385,0.00014091788,0.92032236,0.00042919937,0.000983774,0.0006089225,0.00007742605,0.0009497771,0.0036612307],"genre_scores_gemma":[0.75607574,0.000106617095,0.24277371,0.00022119656,0.00029987044,0.00016383984,0.00005244689,0.00006753422,0.0002390533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00011023612,0.00042084997,0.00060053205,0.00034593843,0.00079057814],"domain_scores_gemma":[0.998057,0.00085661584,0.00011707994,0.000746325,0.00009846118,0.00012452935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094565615,0.00029019278,0.0003322989,0.0005169454,0.00023292721,0.00021637083,0.0012709562,0.00012836371,0.00001077311],"category_scores_gemma":[0.00012187811,0.0002876756,0.00018504354,0.001736297,0.00030016966,0.0002730824,0.0005003409,0.00025867118,0.000032296193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006130307,0.0000738221,0.000068922425,0.00002232397,0.000017616327,0.000029679464,0.0012911075,0.00021278612,0.0002317092,0.619348,0.00009591397,0.37860203],"study_design_scores_gemma":[0.00049492286,0.00015515179,0.00018441664,0.00009585482,0.000009093868,0.0000113798715,0.00034627476,0.4071139,0.0030228393,0.58760434,0.0006662956,0.0002955217],"about_ca_topic_score_codex":0.000022190716,"about_ca_topic_score_gemma":0.000022416707,"teacher_disagreement_score":0.68324935,"about_ca_system_score_codex":0.00008010294,"about_ca_system_score_gemma":0.000054743694,"threshold_uncertainty_score":0.99995756},"labels":[],"label_agreement":null},{"id":"W4386041537","doi":"10.26599/tst.2022.9010013","title":"Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","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 New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Constraint (computer-aided design); Greedy algorithm; Mathematical optimization; Mathematics; Function (biology); Approximation algorithm; Curvature","score_opus":0.025300504575868934,"score_gpt":0.26909489866672925,"score_spread":0.24379439409086032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386041537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36715198,0.000033290235,0.61678344,0.009857308,0.0012089107,0.00029817643,0.0000056093772,0.0031901975,0.0014711196],"genre_scores_gemma":[0.95742756,0.000005930439,0.04192271,0.00031821436,0.00004408208,0.00006214336,0.0000017906103,0.000013562092,0.00020399969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965762,0.000035784233,0.00033168908,0.0012011171,0.0006642762,0.001190961],"domain_scores_gemma":[0.9978609,0.000071722236,0.000072286966,0.001513785,0.00024824182,0.00023302781],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0013017625,0.00024616145,0.0002885966,0.004023801,0.0012560348,0.00038312163,0.0035080395,0.00012906741,0.000018008597],"category_scores_gemma":[0.0004298534,0.0002507454,0.000095237236,0.021912057,0.0021495675,0.0007269792,0.0018422764,0.00037788748,0.0006809539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048275324,0.000092416674,0.0011787856,0.000013659424,0.000015515288,0.00018457366,0.0013322079,0.00092129956,0.11535995,0.60965407,0.00046958154,0.27077314],"study_design_scores_gemma":[0.0012874248,0.0010937279,0.018137207,0.00024965938,0.000033607128,0.0016100735,0.004504402,0.33009484,0.12655573,0.4656685,0.048146963,0.0026178649],"about_ca_topic_score_codex":0.000045813318,"about_ca_topic_score_gemma":0.000020294678,"teacher_disagreement_score":0.5902756,"about_ca_system_score_codex":0.00017721369,"about_ca_system_score_gemma":0.00039405195,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W4386376648","doi":"10.1016/j.tcs.2023.114161","title":"Communication costs in a geometric communication network","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","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","keywords":"Geometric networks; Convex hull; Mathematics; Asynchronous communication; Node (physics); Upper and lower bounds; Topology (electrical circuits); Computer science; Euclidean geometry; Graph; Discrete mathematics; Combinatorics; Theoretical computer science; Regular polygon; Graph theory; Geometry; Computer network","score_opus":0.01940915620891267,"score_gpt":0.2756832360992582,"score_spread":0.25627407989034556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386376648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037740614,0.00020937144,0.95175916,0.003072082,0.0004029687,0.00028133148,0.0000011517645,0.0006409311,0.0058924155],"genre_scores_gemma":[0.83114433,0.000108606895,0.16829261,0.0003777153,0.00004041842,0.000018199838,0.00000434888,0.00000614052,0.000007648836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973577,0.00034506596,0.00036347288,0.0005524543,0.0006707303,0.0007105483],"domain_scores_gemma":[0.99648464,0.0010243191,0.00008379475,0.0020779823,0.00015782386,0.0001714723],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0044335895,0.00015727531,0.00020902141,0.00083131116,0.0007026302,0.0005025585,0.005692104,0.00005878895,0.000019703773],"category_scores_gemma":[0.0001673122,0.00015108501,0.000058155896,0.014317143,0.0021724715,0.00083342317,0.003569302,0.00037057616,0.0002120069],"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.0000023239427,0.000041882988,0.00033773624,0.000002660292,0.0000015258486,0.0000043885766,0.0002684264,0.0013356695,0.00000879366,0.90926117,0.000282636,0.088452816],"study_design_scores_gemma":[0.00016551104,0.00004421495,0.016181145,0.000051675437,0.0000010011619,0.000009117546,0.000007814865,0.61416423,0.00006658604,0.36892983,0.00022949956,0.00014937582],"about_ca_topic_score_codex":0.000027547732,"about_ca_topic_score_gemma":0.000012353248,"teacher_disagreement_score":0.7934037,"about_ca_system_score_codex":0.00013305139,"about_ca_system_score_gemma":0.00008869633,"threshold_uncertainty_score":0.99968755},"labels":[],"label_agreement":null},{"id":"W4386792249","doi":"10.48550/arxiv.2309.06554","title":"An improved protocol for ExactlyN with more than 3 players","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Fundação para a Ciência e a Tecnologia; Israel Science Foundation; European Commission","keywords":"Constructive; Randomness; Combinatorics; Communication complexity; Mathematics; Term (time); Computer science; Order (exchange); Protocol (science); Discrete mathematics; Field (mathematics); Point (geometry); Theoretical computer science; Pure mathematics; Statistics","score_opus":0.1440938354312595,"score_gpt":0.2510016155646354,"score_spread":0.1069077801333759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386792249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081323655,7.467288e-7,0.9303993,0.000114092116,0.00028579292,0.059869234,0.000058728212,0.00088845915,0.00025126446],"genre_scores_gemma":[0.8629201,0.000007115436,0.09805273,0.0003167439,0.00055077183,0.03234009,0.00012973437,0.0001997844,0.005482911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750936,0.00007681149,0.00019766856,0.0015675547,0.0001235164,0.0005251126],"domain_scores_gemma":[0.9972815,0.00012812743,0.00027224197,0.0018556019,0.00021204258,0.00025046486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026773917,0.000422739,0.00036811508,0.00034297883,0.0003046471,0.00026443522,0.0029740531,0.00026331743,0.000009703049],"category_scores_gemma":[0.000015453128,0.00042209285,0.00023476992,0.00070710725,0.00018756054,0.0005330265,0.001266049,0.0005200128,0.000015983378],"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.002502126,0.0017175581,0.0082119815,0.002232388,0.001115928,0.0014659158,0.0034190647,0.38191193,0.00030930643,0.584655,0.0025945604,0.009864268],"study_design_scores_gemma":[0.0015347315,0.00049132656,0.0016614744,0.00015337225,0.000035487137,0.0000046158425,0.0001512219,0.9488025,0.00021177453,0.04505096,0.0012123225,0.00069024763],"about_ca_topic_score_codex":0.00025229674,"about_ca_topic_score_gemma":0.00022070279,"teacher_disagreement_score":0.85478777,"about_ca_system_score_codex":0.00012259775,"about_ca_system_score_gemma":0.00032419944,"threshold_uncertainty_score":0.9998231},"labels":[],"label_agreement":null},{"id":"W4387377762","doi":"10.1142/s0129054123410083","title":"Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","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 New Brunswick","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Monotone polygon; Streaming algorithm; Time complexity; Set (abstract data type); Ideal (ethics); Algorithm; Function (biology); Computer science; Running time; Approximation algorithm; Integer (computer science); Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.046945529046224205,"score_gpt":0.333160625608366,"score_spread":0.28621509656214184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387377762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021732915,0.0000145404965,0.9722796,0.0022449868,0.003343725,0.00016429259,0.000043252316,0.000076912635,0.00009975456],"genre_scores_gemma":[0.42893183,0.0000129648615,0.57024413,0.00008737522,0.0005936281,0.000009673578,0.000017575805,0.0000086214395,0.00009419388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976048,0.000043524236,0.0007774711,0.00034070117,0.0009278258,0.0003056962],"domain_scores_gemma":[0.99580836,0.000484418,0.00061431085,0.00037927783,0.0025770536,0.00013657563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017449667,0.00015281375,0.0002760355,0.001216769,0.0003660458,0.00042476217,0.0027773231,0.000039804814,0.000011602359],"category_scores_gemma":[0.00025998216,0.00014921234,0.0002810349,0.0015780795,0.00045242702,0.0018631029,0.00052178744,0.00017064193,0.000013977214],"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.0000739476,0.00041574397,0.0004227534,0.000039654613,0.00060955784,0.000049341113,0.0021529095,0.046256207,0.030105563,0.06788132,0.0013701234,0.8506229],"study_design_scores_gemma":[0.0006995448,0.00022529713,0.0017050405,0.00007415492,0.000016256032,0.00016370388,0.00005621565,0.9841359,0.002313956,0.008734109,0.0017124244,0.00016338883],"about_ca_topic_score_codex":0.000020532303,"about_ca_topic_score_gemma":0.0000019136364,"teacher_disagreement_score":0.9378797,"about_ca_system_score_codex":0.00011841895,"about_ca_system_score_gemma":0.00060781563,"threshold_uncertainty_score":0.60847026},"labels":[],"label_agreement":null},{"id":"W4387427243","doi":"10.1016/j.disc.2023.113718","title":"Improved bound for the Gerver-Ramsey collinearity problem","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Collinearity; Combinatorics; Sequence (biology); Upper and lower bounds; Discrete mathematics; Element (criminal law); Statistics; Mathematical analysis","score_opus":0.044815859182103866,"score_gpt":0.29272348703558326,"score_spread":0.2479076278534794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024211847,0.00006210291,0.9919733,0.0029388568,0.00035927526,0.0009154926,0.000042897835,0.00045149671,0.00083542435],"genre_scores_gemma":[0.05047442,0.0000841317,0.94359493,0.0005114154,0.00039425687,0.0006757507,0.00003981533,0.000060810482,0.0041644853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878776,0.000023945666,0.00029078248,0.0002727156,0.00025362518,0.00037119404],"domain_scores_gemma":[0.9981564,0.0007874988,0.00011675778,0.00078442896,0.00009343033,0.00006143167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159927,0.00015438157,0.0001898813,0.0000608877,0.0004950778,0.0004334481,0.0012322621,0.00005568839,0.000008711726],"category_scores_gemma":[0.00013271112,0.00010394872,0.00017032752,0.0006873844,0.00010835492,0.00018541134,0.00042891776,0.00013404308,0.000044820597],"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.0000052545956,0.000102956576,0.000019474463,0.00038236327,0.00009959597,0.000004473353,0.0039549363,0.00016805949,0.0003038515,0.97129947,0.010174561,0.013485007],"study_design_scores_gemma":[0.00018938007,0.000044974535,0.000053531046,0.0000209159,0.000012844994,0.000004056766,0.00014895557,0.7082121,0.00025942136,0.2832887,0.0076337005,0.00013145912],"about_ca_topic_score_codex":0.000016540333,"about_ca_topic_score_gemma":0.000020749992,"teacher_disagreement_score":0.70804405,"about_ca_system_score_codex":0.000018388735,"about_ca_system_score_gemma":0.00005133331,"threshold_uncertainty_score":0.42389056},"labels":[],"label_agreement":null},{"id":"W4387495189","doi":"10.1007/s00500-023-09230-5","title":"Finding local Max-Cut in graphs in randomized polynomial time","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Maximum cut; Solver; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Mathematical optimization; Graph","score_opus":0.017210177391430312,"score_gpt":0.25941232174864787,"score_spread":0.24220214435721754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387495189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5764462,0.00014235055,0.4171478,0.0009198394,0.0013424929,0.0005859329,0.0000021560222,0.0009411562,0.0024721306],"genre_scores_gemma":[0.98923254,0.0000063241323,0.010360576,0.00017444532,0.00009212373,0.000009380965,0.0000058503742,0.000015042551,0.000103746104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997518,0.00033007385,0.000606235,0.00055359013,0.00030478628,0.00068728207],"domain_scores_gemma":[0.9979079,0.0015041485,0.00012086178,0.00035967756,0.000026081014,0.00008134926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025382063,0.00021073973,0.0006160178,0.0009913623,0.0001660147,0.00016021839,0.00094904576,0.00009519986,0.000013049908],"category_scores_gemma":[0.00023113769,0.00021864628,0.00020950886,0.0027865027,0.00016885245,0.0002452842,0.0007879572,0.00040233092,0.0002036616],"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.002059267,0.00032712263,0.014122368,0.00013050322,0.00010556308,0.0011299114,0.013137756,0.05325456,0.00050137244,0.083175465,0.0032245817,0.82883155],"study_design_scores_gemma":[0.020223154,0.000016908825,0.0039405576,0.00013509109,0.0000024135356,0.000014107709,0.00005898092,0.9544318,0.000087458415,0.020699922,0.00012536976,0.00026429043],"about_ca_topic_score_codex":0.0002215312,"about_ca_topic_score_gemma":0.0000726675,"teacher_disagreement_score":0.90117717,"about_ca_system_score_codex":0.00007396842,"about_ca_system_score_gemma":0.00007337822,"threshold_uncertainty_score":0.89161366},"labels":[],"label_agreement":null},{"id":"W4387618924","doi":"10.1016/j.tcs.2023.114254","title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Combinatorics; Cardinality (data modeling); Approximation algorithm; Discrete mathematics; Infimum and supremum; Monotone polygon; Monotonic function; Maximization; Algorithm; Mathematical optimization; Computer science","score_opus":0.0218563223892489,"score_gpt":0.2614628641893752,"score_spread":0.2396065418001263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387618924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036829785,0.0000046534824,0.96034455,0.0010780693,0.0005416049,0.0005876233,0.000015297386,0.00031522513,0.00028321793],"genre_scores_gemma":[0.5785441,0.0000030707338,0.42097947,0.00031280424,0.0000955718,0.000037099213,0.000006092095,0.00000973806,0.000012093587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975232,0.00010539996,0.0002937361,0.0009031079,0.0006304947,0.0005440694],"domain_scores_gemma":[0.9980291,0.00078001164,0.00010232019,0.00063164317,0.00025138655,0.0002055407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013124774,0.00023367126,0.00025251662,0.00033667104,0.0006950004,0.00071121886,0.0011193801,0.00007723595,0.000006969919],"category_scores_gemma":[0.00021063091,0.00020669412,0.00007556373,0.0017570741,0.0013491532,0.0009982556,0.0007371073,0.00019445088,0.000024437202],"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.0000064530377,0.00009273288,0.000008763367,0.000014921415,0.0000050780513,0.0000023591479,0.00076691207,0.00035447438,0.0006518798,0.70336103,0.000027030886,0.29470834],"study_design_scores_gemma":[0.00026293943,0.0002924964,0.0007509419,0.000022343607,0.0000035648761,0.000005410014,0.000008308043,0.727645,0.00953648,0.26124036,0.000039212344,0.00019295157],"about_ca_topic_score_codex":0.0000033151239,"about_ca_topic_score_gemma":7.905118e-7,"teacher_disagreement_score":0.7272905,"about_ca_system_score_codex":0.00008162245,"about_ca_system_score_gemma":0.00007426095,"threshold_uncertainty_score":0.84287417},"labels":[],"label_agreement":null},{"id":"W4388328539","doi":"10.4230/lipics.icalp.2024.7","title":"Finer-Grained Reductions in Fine-Grained Hardness of Approximation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Approx; Hardness of approximation; Approximation algorithm; Combinatorics; Dimension (graph theory); Euclidean geometry; Mathematics; Product (mathematics); Alphabet; Order (exchange); Time complexity; Euclidean distance; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.14076508460315465,"score_gpt":0.21070740946731187,"score_spread":0.06994232486415722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388328539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17445447,0.00002771417,0.82092935,0.0007600474,0.0017767692,0.0004943885,0.00005874944,0.00046745522,0.0010310953],"genre_scores_gemma":[0.987639,0.000052895044,0.009368873,0.000018364051,0.0000734541,0.000004624792,0.000066025896,0.000018769098,0.0027579917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808174,0.00015323653,0.00036055973,0.0009532687,0.00013270188,0.00031850615],"domain_scores_gemma":[0.9980419,0.00013024906,0.0003097887,0.0012369398,0.00018988556,0.0000911936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040002714,0.00027355077,0.0004152028,0.00091315096,0.000113428956,0.00006321802,0.001709109,0.0002348632,0.00001813687],"category_scores_gemma":[0.000110710906,0.0003373003,0.0002588046,0.0022365998,0.00018551925,0.00032141848,0.0016415255,0.0005312798,0.000029016377],"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.000037131656,0.00036507184,0.0015339226,0.00033238257,0.000117497955,0.0001842855,0.0010596998,0.23545344,0.00016537253,0.756909,0.0013752923,0.0024668653],"study_design_scores_gemma":[0.0005420247,0.000039215396,0.004781987,0.00018397532,0.000027217591,0.0000032201158,0.00010769796,0.71391827,0.00018629007,0.2796008,0.00024091807,0.00036841902],"about_ca_topic_score_codex":0.00044830827,"about_ca_topic_score_gemma":0.00028441905,"teacher_disagreement_score":0.81318456,"about_ca_system_score_codex":0.00013861147,"about_ca_system_score_gemma":0.00021448161,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W4388482109","doi":"10.48550/arxiv.2311.03174","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Microsoft Research; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Mathematics; Undirected graph; Combinatorics; Minimum-cost flow problem; Algorithm; Norm (philosophy); Interior point method; Approximation algorithm; Graph; Computer science; Discrete mathematics; Flow network","score_opus":0.06854744414091743,"score_gpt":0.19270185921080343,"score_spread":0.124154415069886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388482109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84507394,0.000043556316,0.14374425,0.00051326485,0.0032237065,0.001150687,0.00021379333,0.0021897163,0.0038471217],"genre_scores_gemma":[0.99297166,0.00014613318,0.0055811326,0.0001661145,0.000091703834,0.0000044485528,0.00014274142,0.000048684906,0.0008473733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996853,0.00026703184,0.0003367082,0.0016704396,0.0002030458,0.00066979154],"domain_scores_gemma":[0.99791723,0.00014179533,0.00022609266,0.0014525331,0.00006973738,0.00019260048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046131446,0.0005033792,0.0005259529,0.0011587053,0.00021036321,0.00021047215,0.0027331696,0.00033895182,0.000076952405],"category_scores_gemma":[0.000025994048,0.000618448,0.00032364894,0.0018693148,0.00018801418,0.00033995678,0.0033881492,0.0010018315,0.000739154],"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.00076234416,0.0019363789,0.009608763,0.00037902588,0.00086239196,0.0072813965,0.0012274686,0.39291322,0.00042662933,0.5593349,0.008691878,0.016575648],"study_design_scores_gemma":[0.0008851749,0.00007266131,0.0030314121,0.00014684748,0.000025650103,0.000004176523,0.000020163094,0.7696816,0.0002077978,0.22503677,0.00021548713,0.00067231484],"about_ca_topic_score_codex":0.00044699226,"about_ca_topic_score_gemma":0.00028222005,"teacher_disagreement_score":0.37676832,"about_ca_system_score_codex":0.0003261996,"about_ca_system_score_gemma":0.00015474319,"threshold_uncertainty_score":0.9996267},"labels":[],"label_agreement":null},{"id":"W4388651119","doi":"10.4230/lipics.icalp.2024.119","title":"Better Sparsifiers for Directed Eulerian Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Eulerian path; Combinatorics; Omega; Conjecture; Mathematics; Binary logarithm; Laplace operator; Laplacian matrix; Discrete mathematics; Graph; Physics; Mathematical analysis","score_opus":0.1469199772197672,"score_gpt":0.20703201414579406,"score_spread":0.060112036926026846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388651119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07015739,0.000039225004,0.9211619,0.00077009556,0.003727916,0.00076259125,0.00014248918,0.0021030242,0.0011353778],"genre_scores_gemma":[0.9614976,0.00016124023,0.033383746,0.00041294546,0.00024927937,0.000012426703,0.00012452253,0.000068150635,0.0040900754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740845,0.0001108781,0.00024486711,0.0015251784,0.00011870199,0.0005919281],"domain_scores_gemma":[0.997562,0.00026414183,0.0002222582,0.0015503416,0.00018622524,0.0002150256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030636488,0.00040197093,0.00042892882,0.00058754504,0.00032860483,0.00022506234,0.0027887842,0.0003343669,0.000022421313],"category_scores_gemma":[0.000050239236,0.000490499,0.0005364837,0.0011951139,0.00018755303,0.00030211947,0.0022016785,0.00054707576,0.0000940533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006490592,0.00017546759,0.0021980805,0.00025764387,0.0005134345,0.00044801456,0.00050213287,0.023287171,0.00004673028,0.95195633,0.015246605,0.0053034993],"study_design_scores_gemma":[0.0004741255,0.000050118415,0.0021866008,0.00008263572,0.00005814115,0.0000021238866,0.000029857578,0.40552592,0.00007689627,0.58707434,0.00386343,0.00057579484],"about_ca_topic_score_codex":0.0001564799,"about_ca_topic_score_gemma":0.00010216856,"teacher_disagreement_score":0.89134026,"about_ca_system_score_codex":0.00010895489,"about_ca_system_score_gemma":0.00013295482,"threshold_uncertainty_score":0.99975467},"labels":[],"label_agreement":null},{"id":"W4388739175","doi":"10.1007/978-3-031-38310-6_9","title":"Less Is More Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Diversity (politics); Phrase; Outcome (game theory); Computer science; Mathematical optimization; Optimization problem; Mathematics; Management science; Mathematical economics; Artificial intelligence; Sociology; Engineering","score_opus":0.048304344212709696,"score_gpt":0.2539577146107745,"score_spread":0.2056533703980648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388739175","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9574093e-7,0.00040408128,0.8288361,0.00092864205,0.00008279411,0.00048263348,0.000041481067,0.00038670542,0.16883731],"genre_scores_gemma":[0.00017147984,0.0050389534,0.35108966,0.0011062123,0.00030352263,0.00047482637,0.0002446297,0.00012334576,0.64144737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986175,0.000006206166,0.0002700056,0.0006698519,0.0002553709,0.00018106854],"domain_scores_gemma":[0.9988739,0.00004200288,0.0001541469,0.0006588302,0.00015547934,0.000115677656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009823563,0.0002508714,0.000223056,0.00024801737,0.00031418944,0.00020649057,0.0006396512,0.00020029893,0.000057796773],"category_scores_gemma":[0.0000045334023,0.000269822,0.00008682344,0.00021495257,0.000075099146,0.00018469237,0.00041545148,0.00024377747,0.000091172726],"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":[3.5877648e-7,0.000016542193,5.925025e-7,0.000044795725,0.000026731122,4.9351036e-7,0.0001566481,0.004236599,0.000001078429,0.9756425,0.00070502894,0.019168619],"study_design_scores_gemma":[0.00014521123,0.000010614651,0.000009874994,0.00004495869,0.000029186438,0.000008183357,0.00002561176,0.82285094,0.000014641219,0.025496235,0.15089077,0.0004738051],"about_ca_topic_score_codex":0.0000021885724,"about_ca_topic_score_gemma":5.693241e-7,"teacher_disagreement_score":0.95014626,"about_ca_system_score_codex":0.000021949929,"about_ca_system_score_gemma":0.000046288013,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W4389115885","doi":"10.48550/arxiv.2311.15346","title":"A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Maximum cut; Mathematics; Hyperplane; Combinatorics; Semidefinite programming; Duality (order theory); Generalization; Extension (predicate logic); Approximation algorithm; Linear programming relaxation; Relaxation (psychology); Discrete mathematics; Algorithm; Linear programming; Mathematical optimization; Computer science; Graph; Mathematical analysis","score_opus":0.09324186680180548,"score_gpt":0.2106296667674288,"score_spread":0.11738779996562333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389115885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011969458,0.000070162045,0.9840436,0.0006069912,0.001842969,0.00095134124,0.00009552469,0.00021714903,0.00020279219],"genre_scores_gemma":[0.9016273,0.00062055263,0.09199859,0.00023321145,0.00060575834,0.000031104588,0.000048768114,0.00008381489,0.0047509265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797213,0.0001231202,0.00030365694,0.0009992323,0.00022810049,0.00037376708],"domain_scores_gemma":[0.9970356,0.000646675,0.000441993,0.0014707365,0.00033265183,0.000072342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049521204,0.00031602773,0.00033055028,0.00018023032,0.00057967857,0.00011393216,0.002318094,0.00023003551,0.000011990161],"category_scores_gemma":[0.00003844051,0.00023753136,0.00052558485,0.0009528049,0.00024452887,0.00029034144,0.00304958,0.00069243205,0.000013657721],"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.00011785576,0.00058483676,0.0010684155,0.0005159269,0.0010602362,0.000109703404,0.0013873997,0.324086,0.00027884563,0.5985542,0.004110651,0.068125926],"study_design_scores_gemma":[0.00037462194,0.000044771135,0.0025759283,0.00017796332,0.00008346825,0.000007754497,0.000065810695,0.8437903,0.0003305445,0.14947838,0.0027992278,0.0002712232],"about_ca_topic_score_codex":0.00023665192,"about_ca_topic_score_gemma":0.00006215123,"teacher_disagreement_score":0.892045,"about_ca_system_score_codex":0.00014349124,"about_ca_system_score_gemma":0.00025476908,"threshold_uncertainty_score":0.9686248},"labels":[],"label_agreement":null},{"id":"W4389179369","doi":"10.1016/j.compeleceng.2023.109048","title":"An approximation algorithm for high-dimensional table compression on balanced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.svg\" display=\"inline\" id=\"d1e169\"><mml:mi>K</mml:mi></mml:math>-partite graph","year":2023,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Table (database); Compression (physics); Approximation algorithm; Algorithm; Mathematics; Combinatorics; Data compression; Graph; Discrete mathematics; Computer science; Data mining; Physics","score_opus":0.013862896081772318,"score_gpt":0.23170229449090124,"score_spread":0.21783939840912891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389179369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36611775,0.00007117538,0.63209593,0.00011703769,0.0009385985,0.00008454833,0.000022292628,0.0005375173,0.000015158133],"genre_scores_gemma":[0.7423819,0.00004412302,0.25578758,0.0004012422,0.00064487115,0.00023849259,0.0003964791,0.0000914998,0.000013843904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734104,0.000043917575,0.0004590282,0.00073468586,0.00063476636,0.00078657403],"domain_scores_gemma":[0.99832577,0.0005146365,0.00018495522,0.0006465237,0.00006844622,0.00025966304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040289006,0.00032723387,0.00025811538,0.00030828817,0.00043915006,0.00032162,0.00086230785,0.00023444346,0.000002807491],"category_scores_gemma":[0.00006842413,0.00038027816,0.00022470286,0.0011528021,0.00006465642,0.0005514147,0.0003646062,0.0004467326,0.00008475086],"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.000028001761,0.00011789617,8.6645406e-7,0.00006735952,0.000058971775,0.00004125848,0.00010364049,0.10742429,0.0023018362,0.85819364,0.00061919965,0.03104302],"study_design_scores_gemma":[0.00060221937,0.0005218954,0.000105443025,0.00017687859,0.000026104535,0.000046282217,0.00000502812,0.9894196,0.0065707127,0.0014280694,0.0007218065,0.0003759665],"about_ca_topic_score_codex":0.0000315884,"about_ca_topic_score_gemma":0.0000015703581,"teacher_disagreement_score":0.8819953,"about_ca_system_score_codex":0.000028128683,"about_ca_system_score_gemma":0.000085252286,"threshold_uncertainty_score":0.99986494},"labels":[],"label_agreement":null},{"id":"W4389224840","doi":"10.1145/3633512","title":"Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","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":"Joins; Join (topology); Tuple; Class (philosophy); Upper and lower bounds; Combinatorics; Mathematics; Algorithm; Argument (complex analysis); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.04162814898446222,"score_gpt":0.3084241444342037,"score_spread":0.2667959954497415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8307535,0.00037770293,0.13844946,0.027830396,0.001987528,0.00015952066,0.0000032755263,0.00010040439,0.00033821253],"genre_scores_gemma":[0.55900633,0.0005526377,0.43733877,0.0012853397,0.00092990644,0.0000053887657,7.6071103e-7,0.000018406037,0.0008624298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899054,0.000086977045,0.00028101547,0.0001256982,0.00034054063,0.00017524004],"domain_scores_gemma":[0.99873465,0.00014933324,0.0002415037,0.0007294459,0.000072307674,0.00007272897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060766237,0.00008860016,0.00015531959,0.00012099464,0.00021334733,0.00015627599,0.0021952726,0.000039406,0.0000047854705],"category_scores_gemma":[0.00034724188,0.000058008554,0.00013190831,0.0005316533,0.00006350977,0.0004969601,0.0012488441,0.00021301403,0.00001628436],"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.000210797,0.0009176495,0.020816835,0.00014494253,0.00090557843,0.00056531955,0.015732132,0.04246071,0.015928015,0.09320372,0.39218894,0.41692537],"study_design_scores_gemma":[0.001470051,0.00036002882,0.22987548,0.00012519788,0.000043843607,0.0010490535,0.00017027088,0.3592163,0.0021024742,0.38589856,0.019305555,0.00038317646],"about_ca_topic_score_codex":0.000006035976,"about_ca_topic_score_gemma":0.0000034119162,"teacher_disagreement_score":0.4165422,"about_ca_system_score_codex":0.000019670886,"about_ca_system_score_gemma":0.00004006743,"threshold_uncertainty_score":0.4079399},"labels":[],"label_agreement":null},{"id":"W4389274127","doi":"10.1016/j.orl.2023.11.010","title":"The complexity of geometric scaling","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Polytope; Combinatorics; Mathematics; Oracle; Scaling; Simplex; Upper and lower bounds; Integer (computer science); Simplex algorithm; Discrete mathematics; Linear programming; Mathematical optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.20657309042899014,"score_gpt":0.387549487468558,"score_spread":0.18097639703956786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389274127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38346022,0.00020372632,0.46388853,0.14885198,0.0006908334,0.0006668099,0.000020238906,0.00033505706,0.0018825971],"genre_scores_gemma":[0.978221,0.00011285838,0.02087135,0.00028607305,0.00009502185,0.000059094848,0.00000900617,0.00000770836,0.0003378926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812835,0.00029417677,0.00019714092,0.00022049768,0.0007523953,0.0004074429],"domain_scores_gemma":[0.99840766,0.00062676443,0.000012385572,0.00065021927,0.0002396028,0.0000633437],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023807988,0.00005915904,0.00008207052,0.00064954796,0.0015289423,0.0004243464,0.0013867441,0.000019436711,0.0000133914455],"category_scores_gemma":[0.00042515135,0.000043703545,0.00005653649,0.006107755,0.0008649181,0.00026229853,0.000582403,0.00027806286,0.0001523851],"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.0000041778894,0.00006384086,0.00020882784,0.000018574938,0.00003993275,0.00001757559,0.0009068647,0.021352664,0.012067216,0.86466,0.033419482,0.067240834],"study_design_scores_gemma":[0.00022234015,0.0000551053,0.01123551,0.000020935553,0.0000014251132,0.0000056374533,0.0002264227,0.95571786,0.0046673412,0.01261739,0.015079437,0.00015060058],"about_ca_topic_score_codex":0.00022731743,"about_ca_topic_score_gemma":0.00008690762,"teacher_disagreement_score":0.9343652,"about_ca_system_score_codex":0.00003275157,"about_ca_system_score_gemma":0.00006638668,"threshold_uncertainty_score":0.99977094},"labels":[],"label_agreement":null},{"id":"W4389488492","doi":"10.1007/978-3-031-49611-0_33","title":"An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Approximation algorithm; Vertex cover; Vertex (graph theory); Algorithm; Combinatorics; Computer science; Graph; Matching (statistics); Running time; Path (computing); Mathematics","score_opus":0.02366334272043781,"score_gpt":0.2625619495429864,"score_spread":0.2388986068225486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389488492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000215033,0.00020089434,0.99533755,0.00027041897,0.002602033,0.0006266085,0.00005912846,0.00048523527,0.0003966123],"genre_scores_gemma":[0.0028642407,0.000052081294,0.9953383,0.00068051444,0.0005720935,0.0000523044,0.000054965745,0.00006125162,0.00032424496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598366,0.00003097635,0.00052755815,0.0017384427,0.0009618901,0.0007574577],"domain_scores_gemma":[0.9973116,0.00062053686,0.00027116458,0.0013499733,0.00024423935,0.00020250936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010727493,0.0005220581,0.0005019107,0.0007258885,0.00047410492,0.0010269117,0.0038180246,0.00030149514,0.000006650577],"category_scores_gemma":[0.000065526394,0.0005263974,0.00016496265,0.0007537206,0.00047941692,0.0013214783,0.00083502557,0.00053030107,0.000027590886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022504273,0.000032645134,0.00000272043,0.000040123516,0.000009961971,0.000012254908,0.0004179546,0.0053793536,0.0001603529,0.019067273,0.00005273455,0.9748224],"study_design_scores_gemma":[0.0002085587,0.00021658691,0.000010829843,0.00014556863,0.000006170963,0.000012520844,2.7145578e-7,0.7529326,0.0012428231,0.2433606,0.0013668899,0.0004965843],"about_ca_topic_score_codex":0.000026744088,"about_ca_topic_score_gemma":0.000033016036,"teacher_disagreement_score":0.9743258,"about_ca_system_score_codex":0.00019811763,"about_ca_system_score_gemma":0.000271893,"threshold_uncertainty_score":0.9997188},"labels":[],"label_agreement":null},{"id":"W4390072523","doi":"10.1007/978-3-031-49815-2_15","title":"Independent Set in k-Claw-Free Graphs: Conditional $$\\chi $$-Boundedness and the Power of LP/SDP Relaxations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Discrete mathematics; Regular polygon; Treewidth; Chordal graph; Bounding overwatch; Upper and lower bounds; Convex set; Graph; Pathwidth; Line graph; Convex optimization; Computer science; Artificial intelligence","score_opus":0.022599768777134616,"score_gpt":0.2502445444154464,"score_spread":0.22764477563831179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078737864,0.00034541258,0.99237597,0.0021727453,0.0018082398,0.0005537054,0.00007243285,0.00010790981,0.001776182],"genre_scores_gemma":[0.8333706,0.00027869683,0.16300005,0.0022183731,0.0002907481,0.00007767059,0.00004842188,0.00007580084,0.0006396031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615026,0.00010347653,0.0007244474,0.0011793353,0.0013300698,0.0005124041],"domain_scores_gemma":[0.99611026,0.0015332013,0.00040505372,0.0015995323,0.00024009617,0.000111866306],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018461992,0.00043130558,0.00060592074,0.0012992515,0.0004120803,0.0003957801,0.004022911,0.0002784386,0.000022980208],"category_scores_gemma":[0.0002675695,0.00034017552,0.00017584955,0.0013999428,0.0032214355,0.0005030706,0.002611467,0.0010735585,0.000010353637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013419717,0.00003200074,0.00017360291,0.000029281468,0.000021962453,0.000047627374,0.0026539355,0.0048326086,0.00000539477,0.9777693,0.000053369928,0.014367506],"study_design_scores_gemma":[0.00095552084,0.00007585493,0.0030394185,0.0002620257,0.0000072297594,0.0000683883,0.0000026008724,0.09570495,0.00003811865,0.8993195,0.00016976279,0.00035657236],"about_ca_topic_score_codex":0.00012027684,"about_ca_topic_score_gemma":0.0007951767,"teacher_disagreement_score":0.83258325,"about_ca_system_score_codex":0.000113954506,"about_ca_system_score_gemma":0.00044519073,"threshold_uncertainty_score":0.99990505},"labels":[],"label_agreement":null},{"id":"W4390306948","doi":"10.4230/lipics.ccc.2024.20","title":"Lower Bounds for Set-Multilinear Branching Programs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Tel Aviv University; Tata Institute of Fundamental Research","keywords":"Multilinear map; Branching (polymer chemistry); Set (abstract data type); Mathematics; Combinatorics; Computer science; Discrete mathematics; Pure mathematics; Chemistry; Programming language","score_opus":0.18618325325368926,"score_gpt":0.23415227357518315,"score_spread":0.04796902032149389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390306948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06800932,0.000040921124,0.9266169,0.0001882313,0.0028591005,0.000746391,0.00004767768,0.001104607,0.00038682303],"genre_scores_gemma":[0.96537864,0.00007087084,0.029866561,0.00010365086,0.00031172932,0.0000091167185,0.00008337871,0.000049241284,0.0041268007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974759,0.000079396006,0.00025278685,0.001470545,0.00013156902,0.0005897714],"domain_scores_gemma":[0.9977171,0.00021599482,0.00021313534,0.0014671684,0.0001993506,0.00018727049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004345223,0.00038391902,0.0003959697,0.0003170223,0.0003954943,0.0004147447,0.002662012,0.00031018874,0.00001016973],"category_scores_gemma":[0.00004954676,0.00045589582,0.00051828084,0.0008223557,0.00016761517,0.00038035095,0.0026895888,0.0006487728,0.0000860208],"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.00017614178,0.0008018649,0.003411123,0.0010438947,0.00071308535,0.00096856,0.0020058516,0.15306294,0.00003837132,0.7863983,0.003414115,0.04796575],"study_design_scores_gemma":[0.0005065393,0.00009874183,0.0002453452,0.00014408266,0.000039104507,0.0000029078772,0.000043497697,0.80038464,0.00002786053,0.19101521,0.006983797,0.00050829764],"about_ca_topic_score_codex":0.00015827997,"about_ca_topic_score_gemma":0.00010804399,"teacher_disagreement_score":0.8973693,"about_ca_system_score_codex":0.00012428932,"about_ca_system_score_gemma":0.00020278606,"threshold_uncertainty_score":0.9997893},"labels":[],"label_agreement":null},{"id":"W4390575880","doi":"10.1137/1.9781611977912.106","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Algorithm; Minimum-cost flow problem; Undirected graph; Mathematics; Interior point method; Norm (philosophy); Computer science; Combinatorics; Graph; Amortized analysis; Discrete mathematics; Mathematical optimization; Data structure; Flow network","score_opus":0.039921847726306324,"score_gpt":0.23120163386896045,"score_spread":0.19127978614265412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390575880","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016477308,0.00028840327,0.015195334,0.00064226775,0.0023307977,0.0072359396,0.0012057925,0.001365777,0.97008795],"genre_scores_gemma":[0.0037476302,0.0002575285,0.6295367,0.0017701186,0.0042259847,0.0015968912,0.00096637796,0.0009145565,0.35698423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975128,0.0000062678414,0.00069333,0.0008493528,0.00043538146,0.0005028696],"domain_scores_gemma":[0.9988071,0.00022747017,0.00026685672,0.0005253765,0.000032901702,0.00014030555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005806425,0.0006411491,0.00079952966,0.00020276249,0.00024917856,0.00036063185,0.0006951367,0.00078512134,0.00002998513],"category_scores_gemma":[0.0000065621543,0.0006000578,0.0006325307,0.000087011795,0.0002660925,0.00005393521,0.00056140433,0.0009925959,0.000057944166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000352359,0.000051860974,4.2681492e-8,0.00019815254,0.00024126771,0.0000044587023,0.0007052911,0.000004118439,0.00014060368,0.9601994,0.005220906,0.03319864],"study_design_scores_gemma":[0.0016155879,0.00012291604,6.479561e-8,0.00043432871,0.00011434824,0.000009059042,0.00004667576,0.017178044,0.0006275683,0.9566032,0.022540793,0.00070739334],"about_ca_topic_score_codex":0.0000038413577,"about_ca_topic_score_gemma":0.0000052142263,"teacher_disagreement_score":0.6143414,"about_ca_system_score_codex":0.00011807057,"about_ca_system_score_gemma":0.000113947404,"threshold_uncertainty_score":0.99964505},"labels":[],"label_agreement":null},{"id":"W4391454139","doi":"10.2139/ssrn.4713947","title":"Space Reduction Techniques for the 3-Wise Kemeny Problem and Applications","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Reduction (mathematics); Computer science; Space (punctuation); Mathematics; Geometry","score_opus":0.013637011326584193,"score_gpt":0.2698968676089408,"score_spread":0.25625985628235665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391454139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091762086,0.01768657,0.96822256,0.011715532,0.0003988772,0.001152679,0.0000070280475,0.00021588529,0.0005090835],"genre_scores_gemma":[0.33919066,0.12507923,0.5078224,0.00036391575,0.010668461,0.0064388853,0.000033047436,0.00020932229,0.01019407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980026,0.000047296737,0.00026514605,0.00046416145,0.00021724286,0.0010035827],"domain_scores_gemma":[0.9990445,0.00007997525,0.00019138899,0.0004978453,0.00013241656,0.000053893593],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001749344,0.00020951981,0.00017106319,0.00017713125,0.0005203769,0.00059806515,0.0010844992,0.00012995141,0.0000012188336],"category_scores_gemma":[0.000010097277,0.00015410349,0.00016386816,0.00024902305,0.00009565135,0.000113685586,0.0009529449,0.0032075737,0.0000031866434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027833514,0.00001643747,8.2056124e-7,0.000042650852,0.00009397617,2.396739e-7,0.000119021686,0.000030862888,0.00004988141,0.70658237,0.00031346406,0.29274753],"study_design_scores_gemma":[0.00006723123,0.0000981805,0.0000031581967,0.00007649213,0.00005987094,0.00052267226,0.00013803657,0.006880605,0.00018491222,0.96552634,0.02626945,0.0001730401],"about_ca_topic_score_codex":0.000038695947,"about_ca_topic_score_gemma":0.00007207473,"teacher_disagreement_score":0.4604002,"about_ca_system_score_codex":0.000397028,"about_ca_system_score_gemma":0.001575615,"threshold_uncertainty_score":0.99909204},"labels":[],"label_agreement":null},{"id":"W4392245251","doi":"10.1016/j.tcs.2024.114469","title":"Two-stage BP maximization under p-matroid constraint","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Mathematics; Constraint (computer-aided design); Combinatorics; Monotonic function; Function (biology); Approximation algorithm; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.016197485799270432,"score_gpt":0.274274897290326,"score_spread":0.25807741149105556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392245251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028761574,0.00011390145,0.98521507,0.0024408482,0.001818835,0.00015155257,0.000005011092,0.00078707724,0.006591538],"genre_scores_gemma":[0.68627435,0.0000055494515,0.31276816,0.00076292304,0.00014641105,0.0000044068943,0.0000011661285,0.000007923726,0.000029077273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972466,0.00009807193,0.00029870923,0.00095471647,0.00078012934,0.0006217393],"domain_scores_gemma":[0.99842507,0.00030744352,0.00003511182,0.00082912535,0.00013280082,0.00027045104],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013497515,0.00021789745,0.00018716483,0.00034200458,0.0004493263,0.0017133424,0.0023108807,0.00003722198,0.0001835199],"category_scores_gemma":[0.000031469535,0.00018261849,0.00010875349,0.0020795313,0.0037590067,0.0010083101,0.0011543023,0.00030254506,0.00021362246],"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.0000014765004,0.000027561808,0.000003659245,0.000012687099,0.000005307244,0.000038476504,0.0002295909,0.0019671118,0.00034681434,0.94994205,0.000051876177,0.047373407],"study_design_scores_gemma":[0.00008749804,0.000050869527,0.00004504942,0.000035338817,0.0000026851772,0.00007120529,0.000008595244,0.5986454,0.0011018132,0.39947402,0.0003128591,0.0001646544],"about_ca_topic_score_codex":0.0000056603967,"about_ca_topic_score_gemma":0.0000010538436,"teacher_disagreement_score":0.6833982,"about_ca_system_score_codex":0.00008370593,"about_ca_system_score_gemma":0.00024177626,"threshold_uncertainty_score":0.99932295},"labels":[],"label_agreement":null},{"id":"W4392488727","doi":"10.1145/3717823.3718211","title":"Online Locality Meets Distributed Quantum Computing","year":2025,"lang":"en","type":"preprint","venue":"","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 Calgary","funders":"Agence Nationale de la Recherche","keywords":"Locality; Computer science; Quantum computer; Quantum; Distributed computing; Physics; Quantum mechanics","score_opus":0.043436889373090336,"score_gpt":0.3103039341269586,"score_spread":0.2668670447538683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392488727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002186148,0.00024223096,0.98686516,0.0043651755,0.0026275988,0.00027823186,0.0004948975,0.0010053654,0.001935204],"genre_scores_gemma":[0.4688899,0.00007879358,0.5269921,0.001844771,0.00046865843,0.000013594668,0.0010630287,0.000017110451,0.0006320709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971335,0.00018349338,0.0006302417,0.0011309473,0.00044353248,0.00047830958],"domain_scores_gemma":[0.9972971,0.00029370407,0.00022180093,0.0018032222,0.00023767298,0.00014647054],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00050044735,0.00040554508,0.00056993717,0.0001910215,0.00023833955,0.00038463218,0.0032969555,0.0002967636,0.000029266734],"category_scores_gemma":[0.00009623465,0.0003900531,0.0003140536,0.0006400554,0.00012472615,0.000113254384,0.009489799,0.0010336784,0.000014410776],"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.0000048730008,0.000757013,0.00038226866,0.00039245744,0.00016112172,0.00004620309,0.0002143662,0.0063956426,0.0000040085283,0.8970953,0.008173777,0.08637293],"study_design_scores_gemma":[0.0001636522,0.000016972104,0.0026118963,0.0002351316,0.0000135698765,0.000004644207,0.00001782243,0.8650518,0.00007102328,0.12193426,0.009477139,0.00040210757],"about_ca_topic_score_codex":0.0005756486,"about_ca_topic_score_gemma":0.000099514946,"teacher_disagreement_score":0.85865617,"about_ca_system_score_codex":0.000106495754,"about_ca_system_score_gemma":0.0003281738,"threshold_uncertainty_score":0.99985516},"labels":[],"label_agreement":null},{"id":"W4394569093","doi":"10.1287/moor.2022.0320","title":"On Constrained Mixed-Integer DR-Submodular Minimization","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","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":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Submodular set function; Mathematics; Integer (computer science); Integer programming; Mathematical optimization; Minification; Combinatorics; Computer science","score_opus":0.0928491537130744,"score_gpt":0.38163962710865945,"score_spread":0.28879047339558506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394569093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009294115,0.000119487486,0.9800174,0.0018168899,0.00019801703,0.00031803947,0.000014790996,0.00012278708,0.008098465],"genre_scores_gemma":[0.7709373,0.000027832937,0.22687295,0.00002829702,0.000055886474,0.00006437948,0.00001240763,0.000016367889,0.0019845695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832344,0.00012287605,0.00031765318,0.00028075647,0.0007195478,0.00023574548],"domain_scores_gemma":[0.99830043,0.00065406266,0.000012446079,0.0005862771,0.00038172049,0.00006507719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011470346,0.000098535784,0.00014730939,0.0005405615,0.00023948324,0.0005024234,0.0006958355,0.000055721026,0.00014187043],"category_scores_gemma":[0.0003594445,0.00008375471,0.00007335615,0.0011495297,0.00020887113,0.0002967278,0.00019892986,0.00027882197,0.00017279398],"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":[8.147117e-7,0.00016616932,4.942021e-7,0.00011058328,0.000020927757,0.000008968816,0.0012874671,0.0036877869,0.00072408584,0.98742086,0.0025614186,0.0040104347],"study_design_scores_gemma":[0.000075201766,0.00010086322,0.000004580638,0.00017295874,0.0000024668013,0.0000106376865,0.00014674108,0.8631026,0.0037047642,0.13177113,0.00082897505,0.00007903998],"about_ca_topic_score_codex":0.000012433959,"about_ca_topic_score_gemma":0.000013802297,"teacher_disagreement_score":0.8594149,"about_ca_system_score_codex":0.000038649698,"about_ca_system_score_gemma":0.00018511075,"threshold_uncertainty_score":0.484488},"labels":[],"label_agreement":null},{"id":"W4395099388","doi":"10.1007/978-3-031-48679-1_11","title":"A Survey of Cover-Free Families: Constructions, Applications, and Generalizations","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cover (algebra); Geography; Computer science; Engineering; Mechanical engineering","score_opus":0.09135086160397184,"score_gpt":0.28939632643648017,"score_spread":0.19804546483250834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050793687,0.00394584,0.7251136,0.0017479543,0.00064563076,0.00080470444,0.0014993087,0.00042693884,0.26581097],"genre_scores_gemma":[0.008324778,0.119723566,0.508995,0.0011980158,0.00029250485,0.00091767934,0.005063261,0.00017729754,0.3553079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849814,0.00007164841,0.0006070776,0.000403232,0.0002477819,0.0001720903],"domain_scores_gemma":[0.9933234,0.000576619,0.00033575026,0.0052476637,0.00042643043,0.00009013201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031676356,0.0002533486,0.0003794828,0.00040836813,0.00060146715,0.00010259675,0.0037405486,0.00031734406,0.000025049074],"category_scores_gemma":[0.00016888251,0.00029449418,0.00010743382,0.000415809,0.0010174086,0.00029860748,0.0028618386,0.000506811,0.000050174323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3059863e-7,0.00002402929,0.00006707534,0.000036582293,0.00007544747,5.669339e-7,0.00011839357,0.000053026943,9.137914e-7,0.97760063,0.0063923122,0.015630314],"study_design_scores_gemma":[0.00030289253,0.00003871339,0.0007472947,0.00018502734,0.000059029167,0.0000210365,0.000020417472,0.00962067,0.0000050854455,0.30399296,0.6845204,0.00048645356],"about_ca_topic_score_codex":0.0006080755,"about_ca_topic_score_gemma":0.003463318,"teacher_disagreement_score":0.6781281,"about_ca_system_score_codex":0.00003167877,"about_ca_system_score_gemma":0.00029991506,"threshold_uncertainty_score":0.9999507},"labels":[],"label_agreement":null},{"id":"W4396661433","doi":"10.1007/s00182-024-00896-1","title":"Stable source connection and assignment problems as multi-period shortest path problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Period (music); Connection (principal bundle); Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematics; Computer science; K shortest path routing; Mathematical optimization; Combinatorics; Computer network; Physics; Graph; Geometry","score_opus":0.020033509547972585,"score_gpt":0.2676365030996414,"score_spread":0.2476029935516688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396661433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020851616,0.0023896333,0.97205,0.0015189304,0.0020974553,0.00012120915,0.000005873672,0.00008104964,0.0008842268],"genre_scores_gemma":[0.99106175,0.00018450129,0.0073855403,0.00018401825,0.00028962782,0.0000068298123,0.000001585714,0.000013027282,0.00087313954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985356,0.000115820614,0.00039899157,0.00022878617,0.0005539177,0.00016688452],"domain_scores_gemma":[0.99914694,0.0002017324,0.00016854292,0.000137049,0.00024439747,0.00010132779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429978,0.00013610185,0.00015814175,0.000273465,0.00006366226,0.000619324,0.0006889273,0.000045887966,0.000074101416],"category_scores_gemma":[0.00007579373,0.000111678964,0.000106792046,0.00015313849,0.00009915161,0.0007356194,0.00020552182,0.00030711805,0.0000200842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008098283,0.0005104062,0.00064809003,0.000062337975,0.0007175616,0.0004624044,0.010050985,0.007526119,0.006404271,0.520007,0.0004767576,0.4530531],"study_design_scores_gemma":[0.0014806519,0.0009629507,0.0013240259,0.0014689317,0.000054906814,0.0060605905,0.0007410685,0.3107239,0.0021186639,0.5992131,0.0753188,0.00053237565],"about_ca_topic_score_codex":0.000015320333,"about_ca_topic_score_gemma":0.0000040789632,"teacher_disagreement_score":0.97021013,"about_ca_system_score_codex":0.000105855586,"about_ca_system_score_gemma":0.00011353141,"threshold_uncertainty_score":0.59721553},"labels":[],"label_agreement":null},{"id":"W4396981007","doi":"10.1145/3665453.3665458","title":"Complexity Column","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","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":"Simon Fraser University","funders":"","keywords":"Column (typography); Computer science; Telecommunications","score_opus":0.06455749615922264,"score_gpt":0.29774494069782637,"score_spread":0.23318744453860374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396981007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01670816,0.0032792261,0.890777,0.026726497,0.0069525703,0.00049998553,0.000034728506,0.0034404423,0.0515814],"genre_scores_gemma":[0.6440212,0.000121392244,0.34829167,0.0035963217,0.0007771952,0.000045241,0.000016407756,0.00003288128,0.0030977034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986479,0.00005999328,0.00020434972,0.0004991279,0.00025597887,0.0003326222],"domain_scores_gemma":[0.99834025,0.00028471462,0.000024993293,0.0012021642,0.00003505487,0.00011282731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020296515,0.00014801338,0.0001648084,0.00012152502,0.0001692215,0.0005070706,0.0020026919,0.00006033671,0.00018231128],"category_scores_gemma":[0.000095957475,0.00014030114,0.00012934694,0.0007615176,0.00014392665,0.00045164753,0.0009422669,0.00023372531,0.00071979495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016521466,0.000043469325,0.00027787077,0.000029422701,0.00002727614,0.00010672084,0.00040306555,0.00000627739,0.00023372273,0.7261569,0.06667213,0.2060415],"study_design_scores_gemma":[0.00012645472,0.000074875934,0.0019363388,0.00003609841,0.00000634296,0.00006242481,0.00002194954,0.036504403,0.00030374055,0.5631568,0.39751056,0.0002600322],"about_ca_topic_score_codex":0.00021333034,"about_ca_topic_score_gemma":0.00014800107,"teacher_disagreement_score":0.627313,"about_ca_system_score_codex":0.000036293754,"about_ca_system_score_gemma":0.00007669826,"threshold_uncertainty_score":0.92517483},"labels":[],"label_agreement":null},{"id":"W4398180128","doi":"10.1007/978-3-031-59835-7_30","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hypergraph; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.040178526043008166,"score_gpt":0.27858003125385694,"score_spread":0.23840150521084877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398180128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003518503,0.0013066309,0.98895687,0.002251711,0.0047190413,0.0006492409,0.00007466687,0.00038144362,0.0016252236],"genre_scores_gemma":[0.008970366,0.000141142,0.9864017,0.00093449815,0.001736671,0.000029703442,0.000053220323,0.00006280141,0.0016699462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956031,0.0000152051625,0.00061526464,0.002089673,0.000881119,0.0007956696],"domain_scores_gemma":[0.9973508,0.00046055188,0.0002072392,0.0015223915,0.00026557065,0.00019344036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071395613,0.00061489776,0.00055839616,0.0013600257,0.0003097426,0.00080629624,0.0037739088,0.00032580594,0.000015622038],"category_scores_gemma":[0.000050338334,0.000579991,0.00035051632,0.0010663702,0.0007513263,0.00051496155,0.0009684277,0.0008950284,0.000048910864],"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.0000035394094,0.00007142938,0.000005312362,0.00007584537,0.000023893132,0.000043182383,0.00030076655,0.0037760674,0.00007247877,0.3264778,0.000067903835,0.6690818],"study_design_scores_gemma":[0.0001290109,0.00013853148,0.000034218818,0.00020204367,0.000011050961,0.000051300263,1.4088114e-7,0.49310988,0.00034069567,0.49973127,0.005819305,0.00043254902],"about_ca_topic_score_codex":0.000018018223,"about_ca_topic_score_gemma":0.00005805338,"teacher_disagreement_score":0.66864926,"about_ca_system_score_codex":0.0002529675,"about_ca_system_score_gemma":0.00040196208,"threshold_uncertainty_score":0.99966514},"labels":[],"label_agreement":null},{"id":"W4398886544","doi":"10.4230/lipics.ccc.2024.7","title":"Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação para a Ciência e a Tecnologia; European Commission; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo; UK Research and Innovation; National Science Foundation","keywords":"Degeneracy (biology); Polynomial; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Biology","score_opus":0.05976760516020513,"score_gpt":0.2013693260096444,"score_spread":0.14160172084943928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398886544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51137143,0.0006979018,0.4812473,0.00036476855,0.0035744589,0.0004663698,0.00012813383,0.0004595287,0.0016900646],"genre_scores_gemma":[0.9898942,0.00015209713,0.007299482,0.000097222975,0.0003618794,0.000003206289,0.000018044564,0.000024841826,0.0021490382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795127,0.000051623905,0.00019547221,0.0013054099,0.00008444093,0.00041177546],"domain_scores_gemma":[0.99854076,0.00020348183,0.00012486121,0.00085864274,0.00009981391,0.00017245667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020029678,0.000354513,0.0003365605,0.00033186763,0.00029252298,0.00049649936,0.0012517675,0.0002583783,0.000009810009],"category_scores_gemma":[0.00002489121,0.00040381984,0.00029762296,0.00040721372,0.00018637357,0.0002542599,0.0037336864,0.00054264127,0.000016109816],"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.00022018887,0.0004168158,0.0028194315,0.0013307675,0.0009878409,0.0015866053,0.0018065978,0.033198826,0.00044852938,0.8789134,0.024952658,0.053318337],"study_design_scores_gemma":[0.00052875874,0.00011155054,0.000512755,0.0002108182,0.00013630693,0.000018129374,0.00005534888,0.79312414,0.00026327223,0.19218098,0.012107647,0.0007502825],"about_ca_topic_score_codex":0.00016591934,"about_ca_topic_score_gemma":0.00008613993,"teacher_disagreement_score":0.7599253,"about_ca_system_score_codex":0.00012028523,"about_ca_system_score_gemma":0.00019955172,"threshold_uncertainty_score":0.9998414},"labels":[],"label_agreement":null},{"id":"W4399520984","doi":"10.1145/3618260.3649708","title":"New Graph and Hypergraph Container Lemmas with Applications in Property Testing","year":2024,"lang":"en","type":"article","venue":"","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":"Hypergraph; Container (type theory); Property testing; Graph; Computer science; Property (philosophy); Theoretical computer science; Mathematics; Combinatorics; Algorithm; Engineering","score_opus":0.027830951325252713,"score_gpt":0.23653505565392868,"score_spread":0.20870410432867598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399520984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032947003,0.00063989847,0.98394793,0.0015270244,0.00004777516,0.0002739781,8.1709226e-7,0.00038117007,0.009886691],"genre_scores_gemma":[0.32442194,0.000018717314,0.67281663,0.00023240068,0.000060286606,0.000069688555,0.0000015755577,0.0000116630035,0.002367127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992546,0.000013552372,0.00011399936,0.0003430202,0.00011104247,0.00016378095],"domain_scores_gemma":[0.99953234,0.00012246527,0.000011429527,0.0002301439,0.000027885924,0.0000757215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010522605,0.00009904995,0.00009176211,0.0001873468,0.00007944476,0.000245715,0.00026475286,0.000022707323,0.000007486787],"category_scores_gemma":[0.000007131341,0.000054816246,0.00001942805,0.0013892263,0.00005104947,0.00030077941,0.00010938751,0.00012045248,0.000004729682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015721391,0.000026162472,0.00755012,0.00003153416,0.00001323658,0.000021475887,0.00029560784,0.000027107228,0.00023146006,0.7053478,0.0005462921,0.2859077],"study_design_scores_gemma":[0.0012802772,0.0005840603,0.041963484,0.0005115781,0.000032442924,0.00043413995,0.00036153948,0.33696753,0.0010922202,0.49000525,0.12544698,0.0013204886],"about_ca_topic_score_codex":0.0006880772,"about_ca_topic_score_gemma":0.00033465965,"teacher_disagreement_score":0.3369404,"about_ca_system_score_codex":0.000007895252,"about_ca_system_score_gemma":0.000076116965,"threshold_uncertainty_score":0.23694353},"labels":[],"label_agreement":null},{"id":"W4399521007","doi":"10.1145/3618260.3649664","title":"Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)","year":2024,"lang":"en","type":"article","venue":"","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":"Environment and Climate Change Canada; University of Warwick","keywords":"Conjecture; Combinatorics; Logarithm; Branching (polymer chemistry); Binary logarithm; Mathematics; Linear space; Space (punctuation); Amortized analysis; Tree (set theory); Function (biology); Binary decision diagram; Time complexity; Polynomial; Discrete mathematics; Data structure; Computer science; Algorithm; Chemistry","score_opus":0.05139376386046279,"score_gpt":0.312845261571606,"score_spread":0.26145149771114323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399521007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0113707865,0.0023363272,0.7988412,0.022421753,0.0024281417,0.00047205744,0.000004875933,0.00066809414,0.16145681],"genre_scores_gemma":[0.92611665,0.00007555279,0.06716484,0.0014393069,0.00019679361,0.000024345216,0.000005365434,0.000013091688,0.0049640783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986511,0.00007776461,0.00017866559,0.00044948142,0.00040584189,0.00023718226],"domain_scores_gemma":[0.9993053,0.00013074555,0.000019326839,0.00044045786,0.000053103035,0.00005107366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073291216,0.000115272385,0.00011562698,0.0002475221,0.00005414874,0.00025038686,0.0005539202,0.00006019326,0.0005498637],"category_scores_gemma":[0.000034582074,0.000101310165,0.000072192975,0.0009340112,0.00004528261,0.00042106234,0.0002252714,0.00016914721,0.00033975797],"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.0000016101206,0.000049667346,0.00026834337,0.000018832448,0.00001184103,0.000027392864,0.0011230458,0.00011310618,0.00012538678,0.44027957,0.017820144,0.5401611],"study_design_scores_gemma":[0.00016408623,0.000042806623,0.002029919,0.000034548062,0.0000051440065,0.000010931819,0.000035638837,0.7754896,0.000737806,0.2076064,0.01370237,0.00014073186],"about_ca_topic_score_codex":0.00014946106,"about_ca_topic_score_gemma":0.0002138938,"teacher_disagreement_score":0.91474587,"about_ca_system_score_codex":0.00005635895,"about_ca_system_score_gemma":0.00010756803,"threshold_uncertainty_score":0.60206217},"labels":[],"label_agreement":null},{"id":"W4399849664","doi":"10.26599/tst.2023.9010107","title":"Two-Stage Submodular Maximization Under Knapsack Problem","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","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 New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Knapsack problem; Submodular set function; Maximization; Mathematics; Stage (stratigraphy); Mathematical optimization; Computer science; Biology; Paleontology","score_opus":0.01857924213785202,"score_gpt":0.27978680528301986,"score_spread":0.26120756314516785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399849664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01991025,0.0006399946,0.96305144,0.007158425,0.0010044047,0.00023635227,0.0000025102174,0.0025928782,0.0054037436],"genre_scores_gemma":[0.8239562,0.000025361254,0.17503047,0.00023456961,0.00004542043,0.000020045594,0.0000013896894,0.000013611071,0.00067296927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974211,0.000026083373,0.00027827718,0.0010288298,0.00054035004,0.0007053447],"domain_scores_gemma":[0.99865437,0.000040119452,0.000063198415,0.0010041264,0.00014010875,0.00009807949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283941,0.00020014308,0.00018021748,0.001999247,0.00054363953,0.0007528062,0.0026475654,0.00012243792,0.000041467585],"category_scores_gemma":[0.000054533437,0.00018756445,0.000063258725,0.009806574,0.0017837669,0.0013398223,0.0009509811,0.00037925306,0.00018920796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.388174e-7,0.00002982392,0.00006492736,0.000014873209,0.0000050599215,0.00003445531,0.00019775105,0.0011392685,0.011363967,0.93654364,0.000059808117,0.05054577],"study_design_scores_gemma":[0.00017534541,0.000115703435,0.00011159143,0.00008129513,0.000006588998,0.00016755705,0.00013351992,0.44590488,0.023430185,0.50951695,0.019984733,0.00037164483],"about_ca_topic_score_codex":0.000031206266,"about_ca_topic_score_gemma":0.0000143333955,"teacher_disagreement_score":0.8040459,"about_ca_system_score_codex":0.00019060183,"about_ca_system_score_gemma":0.00041750667,"threshold_uncertainty_score":0.76486564},"labels":[],"label_agreement":null},{"id":"W4400004372","doi":"10.1137/23m1603856","title":"Erratum: Multitasking Capacity: Hardness Results and Improved Constructions","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Human multitasking; Mathematics; Combinatorics; Discrete mathematics; Cognitive psychology; Psychology","score_opus":0.03213379434423039,"score_gpt":0.2703348595808777,"score_spread":0.23820106523664733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400004372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037683797,0.0062509743,0.4594504,0.009556892,0.26864076,0.0015086842,0.0013748043,0.0012971183,0.25154352],"genre_scores_gemma":[0.0036436196,0.0038218813,0.76754403,0.000790853,0.008434308,0.00006746279,0.00014424726,0.00038230166,0.21517126],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664634,0.00011984968,0.001100045,0.0007330705,0.0008029485,0.00059775246],"domain_scores_gemma":[0.9973867,0.00025457912,0.0007650693,0.0010054791,0.00023119753,0.00035698139],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00093290076,0.00063904823,0.0008093332,0.00063155615,0.00070529437,0.0023365733,0.0013529713,0.00045479235,0.000016749138],"category_scores_gemma":[0.00038221898,0.0005158857,0.00039685678,0.0005742196,0.00035834426,0.00046602916,0.0006200887,0.0038046706,0.000051994994],"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.000013895879,0.00013263666,5.942693e-7,0.0010620988,0.0004733709,0.00032081056,0.0044959215,0.0000110947385,0.00003843162,0.17289655,0.8117039,0.0088507],"study_design_scores_gemma":[0.000932285,0.00039417428,0.000013299176,0.0058432054,0.00024902067,0.0049852254,0.0007239537,0.19559078,0.00003529287,0.5075292,0.28242356,0.00128005],"about_ca_topic_score_codex":0.000007468956,"about_ca_topic_score_gemma":0.000018715355,"teacher_disagreement_score":0.52928036,"about_ca_system_score_codex":0.00013769262,"about_ca_system_score_gemma":0.00031962173,"threshold_uncertainty_score":0.9997293},"labels":[],"label_agreement":null},{"id":"W4400668514","doi":"10.4230/lipics.mfcs.2024.45","title":"Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Agence Nationale de la Recherche","keywords":"Bipartite graph; Combinatorics; Bounded function; Treewidth; Physics; Graph; Mathematics; Discrete mathematics; Line graph; Mathematical analysis; Pathwidth","score_opus":0.08587823683852365,"score_gpt":0.20668371998355356,"score_spread":0.12080548314502991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400668514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19644634,0.0006712074,0.7912255,0.00076363096,0.005215688,0.001081343,0.00014959797,0.0007644297,0.003682236],"genre_scores_gemma":[0.98419493,0.00019633322,0.013229366,0.00014958877,0.00013125091,0.000009779537,0.000034647557,0.000035970723,0.0020181339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970033,0.0001173591,0.0003370428,0.001715553,0.00014570064,0.00068101083],"domain_scores_gemma":[0.9978701,0.00020008702,0.00015551673,0.0014256777,0.00012357996,0.00022504924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004929196,0.00045607067,0.0005033113,0.0009119602,0.00021737063,0.00046528017,0.0024333736,0.00038243877,0.00002568186],"category_scores_gemma":[0.000033867986,0.0005430847,0.0005668179,0.0016444994,0.0002447048,0.00035794146,0.002677423,0.0010244611,0.00009030406],"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.00004537791,0.00019994417,0.0007344113,0.00029335302,0.00014472503,0.0004671391,0.0007829508,0.04104295,0.000010557547,0.9502659,0.002027645,0.0039850557],"study_design_scores_gemma":[0.0003074235,0.00006313215,0.00020912517,0.0001389765,0.00003499424,0.0000030260394,0.000032259464,0.5187914,0.000031778494,0.47725302,0.002762003,0.00037291303],"about_ca_topic_score_codex":0.0002550566,"about_ca_topic_score_gemma":0.00043831757,"teacher_disagreement_score":0.7877486,"about_ca_system_score_codex":0.00023520776,"about_ca_system_score_gemma":0.00032007997,"threshold_uncertainty_score":0.9997021},"labels":[],"label_agreement":null},{"id":"W4401025033","doi":"10.24963/ijcai.2024/292","title":"Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3,8) and R(3,9) Problems","year":2024,"lang":"en","type":"article","venue":"","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 Windsor; University of Waterloo","funders":"","keywords":"Democracy; Computer science; Political science; Law; Politics","score_opus":0.03572882690136296,"score_gpt":0.24087611798748693,"score_spread":0.20514729108612395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401025033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016158414,0.01002812,0.9827989,0.0033194816,0.0012047031,0.0005693227,0.000005243541,0.00031715626,0.00014128606],"genre_scores_gemma":[0.94732153,0.0005526451,0.049977567,0.0005248076,0.00042188648,0.00017751659,0.0000064341716,0.00002637825,0.0009912404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989733,0.000032223026,0.0001919693,0.000445671,0.00013031795,0.00022652096],"domain_scores_gemma":[0.998974,0.00056107127,0.00002536028,0.00033358022,0.00003733598,0.000068642716],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035891036,0.00014299217,0.00014621198,0.000068175585,0.00025552444,0.0012152835,0.0004083067,0.00004965289,0.000004772287],"category_scores_gemma":[0.0000050581966,0.00008781099,0.000048560716,0.00021266808,0.00013937829,0.00028641653,0.00025873078,0.000108221895,0.000012045357],"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.0000048808447,0.00002456381,0.00006543207,0.00036055743,0.00010127643,0.000004863291,0.0011581858,0.00010650094,0.0002503248,0.7737027,0.007732231,0.21648853],"study_design_scores_gemma":[0.00012559243,0.00007790966,0.0004887638,0.00005014876,0.00001174969,0.00006410088,0.000028268843,0.9191295,0.00008842742,0.021052659,0.058740113,0.00014278124],"about_ca_topic_score_codex":0.00009128387,"about_ca_topic_score_gemma":0.00000980304,"teacher_disagreement_score":0.9457057,"about_ca_system_score_codex":0.000008507665,"about_ca_system_score_gemma":0.000015517095,"threshold_uncertainty_score":0.99982154},"labels":[],"label_agreement":null},{"id":"W4401103106","doi":"10.1007/s10878-024-01193-z","title":"Maximizing stochastic set function under a matroid constraint from decomposition","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matroid; Combinatorics; Pi; Lattice (music); Physics; Mathematics; Discrete mathematics","score_opus":0.016183519577256323,"score_gpt":0.26374662749282485,"score_spread":0.24756310791556851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401103106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021210972,0.00046404597,0.98294216,0.0007127104,0.013449557,0.000093578994,0.000006138883,0.00010457326,0.00010613835],"genre_scores_gemma":[0.7711929,0.00002848928,0.2277796,0.00009404944,0.0008668158,0.0000022501551,0.000016031923,0.000014246639,0.0000056243975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985935,0.00010975009,0.0004980493,0.00020112717,0.00043859426,0.0001589552],"domain_scores_gemma":[0.9989827,0.0002365143,0.00024417992,0.00017390058,0.00026547437,0.00009721858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004015783,0.00014192761,0.00021543601,0.00031252106,0.00012989774,0.00057347317,0.0003434198,0.000074328076,0.000059690738],"category_scores_gemma":[0.000038411006,0.00013432106,0.00015662187,0.0004855088,0.000043456286,0.0011520075,0.000073973926,0.00029852093,0.000009714295],"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.000064024294,0.00007427727,0.0000031802354,0.000012837061,0.00011015377,0.00002820718,0.0002780703,0.72625774,0.00038100893,0.26677877,0.00045395494,0.005557796],"study_design_scores_gemma":[0.00067498256,0.0002264641,0.000041682863,0.00016430466,0.000056535533,0.00010305773,0.000048691378,0.73920375,0.0001259028,0.2590365,0.00018693757,0.0001312015],"about_ca_topic_score_codex":0.000009887186,"about_ca_topic_score_gemma":3.0634632e-7,"teacher_disagreement_score":0.7690718,"about_ca_system_score_codex":0.00014091934,"about_ca_system_score_gemma":0.00016771411,"threshold_uncertainty_score":0.55300146},"labels":[],"label_agreement":null},{"id":"W4402057635","doi":"10.1061/9780784485569.067","title":"Concrete Solutions: Repurposing Existing C76 Gravity Pipe to Save $1M and Costly Permitting Delays","year":2024,"lang":"en","type":"article","venue":"","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":"Stantec (Canada)","funders":"","keywords":"Repurposing; Computer science; Engineering; Waste management","score_opus":0.05934920457637657,"score_gpt":0.29619355814957826,"score_spread":0.2368443535732017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402057635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038624533,0.0021170173,0.9442003,0.0021116154,0.00088923494,0.0002803896,0.0000079938745,0.0008878405,0.010881074],"genre_scores_gemma":[0.6609662,0.00003558176,0.3372205,0.0008971998,0.00021035905,0.000019177833,0.0000024236879,0.00001577024,0.0006327715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829537,0.00007566309,0.0002889611,0.00064748473,0.0002527545,0.000439794],"domain_scores_gemma":[0.99887854,0.00042108938,0.000036513888,0.00039888435,0.00008682407,0.00017813026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008508511,0.00016946175,0.00017635325,0.00017696501,0.00064094027,0.00090875523,0.0004217408,0.00005382378,0.000014494223],"category_scores_gemma":[0.0001888234,0.00016332934,0.0000782215,0.0006957029,0.00009046809,0.0005021742,0.00076491974,0.00024982286,0.000036189474],"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.000003151428,0.000006111443,0.00019207493,0.000070122616,0.00003077182,0.00010026394,0.002359813,0.000022167316,0.0046559223,0.66391015,0.0010635514,0.32758594],"study_design_scores_gemma":[0.00024213448,0.00018864745,0.001053355,0.00059532403,0.000029030356,0.00052105176,0.00041347885,0.8884844,0.0021161342,0.062498577,0.043106668,0.00075118226],"about_ca_topic_score_codex":0.00017911062,"about_ca_topic_score_gemma":0.000029949964,"teacher_disagreement_score":0.88846225,"about_ca_system_score_codex":0.000059302347,"about_ca_system_score_gemma":0.00006712984,"threshold_uncertainty_score":0.87631476},"labels":[],"label_agreement":null},{"id":"W4402564803","doi":"10.1016/j.disopt.2024.100860","title":"Approximation schemes for Min-Sum <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si35.svg\" display=\"inline\" id=\"d1e488\"><mml:mi>k</mml:mi></mml:math>-Clustering","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","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":"Cluster analysis; Mathematics; Algorithm; Computer science; Combinatorics; Computer graphics (images); Statistics","score_opus":0.020656615144146215,"score_gpt":0.2545916724953852,"score_spread":0.233935057351239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402564803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086258866,0.00029769744,0.9103513,0.00053922646,0.0010746132,0.00012909336,0.000063106134,0.00035019958,0.0009359342],"genre_scores_gemma":[0.51082903,0.00019318251,0.4863345,0.00034586483,0.0006355766,0.00042548336,0.0009308825,0.000117920186,0.00018755047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978969,0.000045779452,0.0004725413,0.000662812,0.00047143234,0.0004505111],"domain_scores_gemma":[0.9987583,0.00019604528,0.0002288339,0.0006162429,0.00007595655,0.00012461274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043692967,0.0002672958,0.0001577482,0.00016993503,0.00048439676,0.00089000433,0.00063611125,0.00023414173,0.000020454183],"category_scores_gemma":[0.00012642784,0.00031005547,0.00026447978,0.00050031295,0.00012827707,0.0012405484,0.0004685876,0.00023031935,0.00010353293],"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.000029003928,0.000036851055,0.000001356016,0.00033341226,0.00007195606,0.000015577109,0.0007540971,0.051230427,0.00017689624,0.9396007,0.00021097653,0.007538713],"study_design_scores_gemma":[0.00029094546,0.00014573129,0.0000064540177,0.00029733608,0.0000658153,0.00004506041,0.0001377735,0.99214876,0.001755534,0.0014991565,0.0032915946,0.0003158481],"about_ca_topic_score_codex":0.00003611124,"about_ca_topic_score_gemma":0.000022422773,"teacher_disagreement_score":0.9409183,"about_ca_system_score_codex":0.000020655718,"about_ca_system_score_gemma":0.00012563495,"threshold_uncertainty_score":0.99993515},"labels":[],"label_agreement":null},{"id":"W4402855487","doi":"10.3390/math12192995","title":"Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs","year":2024,"lang":"en","type":"article","venue":"Mathematics","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Longest path problem; Mathematics; Path (computing); Widest path problem; Combinatorics; Mathematical optimization; Computer science; Discrete mathematics; Graph","score_opus":0.03580666959357446,"score_gpt":0.2776638185410328,"score_spread":0.24185714894745833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402855487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077640996,0.000056312314,0.9878327,0.00013142437,0.0001458359,0.001245955,0.0001638993,0.00026384316,0.0023959284],"genre_scores_gemma":[0.1345028,0.000009738483,0.863853,0.000111070025,0.000076761426,0.0008474534,0.000428289,0.000028688135,0.00014224078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982006,0.000046153098,0.00050192256,0.0005515473,0.00033355615,0.0003661998],"domain_scores_gemma":[0.99897724,0.00023403151,0.000098368895,0.00038448893,0.00023009037,0.000075803604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058750674,0.00025092158,0.00032136688,0.00040017907,0.00013151129,0.00033113293,0.0006513572,0.000095731426,0.000019116898],"category_scores_gemma":[0.000023370629,0.00021753857,0.00009546902,0.0018069322,0.00012272164,0.00060483,0.0001419702,0.00023666811,0.00000827154],"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.0000022172237,0.0005970426,0.000029126919,0.0003061504,0.00005579566,0.000010396039,0.0069296695,0.00020477381,0.00023371015,0.9869564,0.0010656322,0.0036090675],"study_design_scores_gemma":[0.00026390955,0.000101674006,0.000063206804,0.00010272653,0.000005873452,0.00001735028,0.000087903645,0.5411108,0.00019984512,0.4573422,0.00051382964,0.00019066119],"about_ca_topic_score_codex":0.000009586982,"about_ca_topic_score_gemma":0.000008900096,"teacher_disagreement_score":0.540906,"about_ca_system_score_codex":0.000053780757,"about_ca_system_score_gemma":0.00013373101,"threshold_uncertainty_score":0.8870966},"labels":[],"label_agreement":null},{"id":"W4404168112","doi":"10.1145/3717823.3718233","title":"Distributed Quantum Advantage for Local Problems","year":2025,"lang":"en","type":"preprint","venue":"","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 Calgary","funders":"Core Research for Evolutional Science and Technology; National Science Foundation; Institut national de recherche en informatique et en automatique (INRIA); Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Iterated function; Constant (computer programming); Omega; Computer science; Distributed algorithm; Quantum; Quantum algorithm; Mathematics; Discrete mathematics; Quantum mechanics; Physics; Distributed computing","score_opus":0.031124418485892587,"score_gpt":0.29088518299159216,"score_spread":0.25976076450569957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404168112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023293429,0.00023881483,0.9913665,0.0016163364,0.0020709296,0.0009134358,0.0005955605,0.0005982929,0.0025768275],"genre_scores_gemma":[0.08649389,0.00020059102,0.90184027,0.0014035209,0.0004185535,0.0013611653,0.0013775983,0.00003810232,0.006866295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979736,0.000044378914,0.00040601403,0.0009027646,0.00024888036,0.0004243307],"domain_scores_gemma":[0.9981366,0.00023806526,0.00013114259,0.0012153257,0.00017857377,0.00010033743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030228062,0.00031653242,0.0004017461,0.00016555231,0.00016630001,0.00028445732,0.0023832151,0.0002418545,0.000019912533],"category_scores_gemma":[0.00003970936,0.0002921276,0.000322569,0.0003167038,0.00010380653,0.00013988688,0.0033435493,0.00046604077,0.000010205437],"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.0000058339074,0.00012205384,0.000019188978,0.0004967294,0.000060386494,0.000004499532,0.00008991464,0.0042535383,0.0000035361852,0.9377841,0.008658033,0.04850221],"study_design_scores_gemma":[0.00020075562,0.000039535193,0.00002940014,0.00013060746,0.000010371899,0.0000021079122,0.00001738804,0.60812473,0.00012563106,0.352003,0.039049726,0.00026673716],"about_ca_topic_score_codex":0.00007876444,"about_ca_topic_score_gemma":0.00004445017,"teacher_disagreement_score":0.60387117,"about_ca_system_score_codex":0.000075844546,"about_ca_system_score_gemma":0.00027043212,"threshold_uncertainty_score":0.9999531},"labels":[],"label_agreement":null},{"id":"W4404848383","doi":"10.1109/focs61266.2024.00061","title":"Approximation Algorithms for Noncommutative CSPs","year":2024,"lang":"en","type":"article","venue":"","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":"European Commission; Office of Science; Villum Fonden; U.S. Department of Energy","keywords":"Noncommutative geometry; Computer science; Approximation algorithm; Algorithm; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.048695906007020597,"score_gpt":0.31913695464619485,"score_spread":0.27044104863917423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083257706,0.00021092445,0.98636615,0.0018780675,0.00074340316,0.00022593529,0.000007908952,0.0005683206,0.009916054],"genre_scores_gemma":[0.041695252,0.000008271434,0.9563939,0.000277525,0.00015373365,0.0001009872,0.000011021119,0.000008983869,0.0013503094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992441,0.000021175683,0.00013692508,0.0002852739,0.00014039123,0.00017213478],"domain_scores_gemma":[0.99936324,0.000273628,0.000016287224,0.00024903778,0.00005491209,0.000042904525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025778366,0.00009077871,0.00008865969,0.00011829125,0.00011749137,0.0003475609,0.000463492,0.00003245227,0.000025002457],"category_scores_gemma":[0.000017446084,0.00007566324,0.000092414615,0.00042245752,0.000034883047,0.0005582122,0.00012336091,0.000082573955,0.00006252632],"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":[6.9627646e-7,0.000015830328,8.0359183e-7,0.000025337147,0.0000126484365,0.0000023420664,0.00062355323,0.000016175205,0.000040819992,0.67204547,0.0023406055,0.32487574],"study_design_scores_gemma":[0.000082281105,0.00005403612,0.000018583003,0.00001595859,0.0000027289766,0.000008765666,0.000039583545,0.71894896,0.0013712368,0.25701916,0.022344658,0.000094047056],"about_ca_topic_score_codex":0.000009982155,"about_ca_topic_score_gemma":0.0000032442092,"teacher_disagreement_score":0.7189328,"about_ca_system_score_codex":0.000025257015,"about_ca_system_score_gemma":0.000040263185,"threshold_uncertainty_score":0.3351538},"labels":[],"label_agreement":null},{"id":"W4405179551","doi":"10.26599/tst.2023.9010121","title":"Maximization of k-Submodular Function with d-Knapsack Constraints Over Sliding Window","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Knapsack problem; Sliding window protocol; Maximization; Window (computing); Function (biology); Mathematics; Mathematical optimization; Computer science; Biology","score_opus":0.010435708302929282,"score_gpt":0.23778928449261688,"score_spread":0.2273535761896876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405179551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11553201,0.0003135008,0.8806991,0.0007066496,0.0006301997,0.0001498252,0.0000018602515,0.0007131505,0.001253735],"genre_scores_gemma":[0.95113045,0.000012145394,0.04872009,0.000053228225,0.00002315744,0.000007048466,8.197094e-7,0.000007762748,0.0000452948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982012,0.000017713694,0.00023866507,0.0006516271,0.00048623138,0.0004045611],"domain_scores_gemma":[0.99903953,0.00004165486,0.00009342929,0.00061358244,0.00015545644,0.000056356657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647022,0.00014871446,0.00018039574,0.0016010634,0.00027683462,0.00022218999,0.0011379849,0.00010489432,0.000032095926],"category_scores_gemma":[0.000069860755,0.00012763732,0.000041868836,0.006900207,0.0022303916,0.0010127962,0.00032181302,0.00023878862,0.000017517865],"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.0000057719753,0.00004370207,0.00093582773,0.0000426703,0.000016950395,0.000027971104,0.0003829568,0.00037152227,0.05202951,0.7831249,0.000027251728,0.16299096],"study_design_scores_gemma":[0.000730984,0.0011050531,0.004248524,0.000668318,0.000052222946,0.00066898356,0.0004844381,0.5378739,0.16386361,0.28406674,0.0054221554,0.0008150465],"about_ca_topic_score_codex":0.000010444678,"about_ca_topic_score_gemma":0.000004134265,"teacher_disagreement_score":0.83559847,"about_ca_system_score_codex":0.00009077378,"about_ca_system_score_gemma":0.00031719953,"threshold_uncertainty_score":0.8217971},"labels":[],"label_agreement":null},{"id":"W4405206838","doi":"10.1007/s10107-024-02166-0","title":"On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Vertex (graph theory); Rank (graph theory); Graph; Operator (biology); Discrete mathematics; Monotone polygon","score_opus":0.027944331652606805,"score_gpt":0.28410354848886915,"score_spread":0.25615921683626236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405206838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011925376,0.0006394454,0.98325676,0.0023461573,0.00042412378,0.0008764498,0.0000059705862,0.00033115133,0.00019457938],"genre_scores_gemma":[0.5475874,0.000034407207,0.4512878,0.0001971678,0.0001465544,0.0005293266,0.0000051877323,0.000027968417,0.00018416582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.000042823965,0.0002948213,0.00043946865,0.000277735,0.00033758322],"domain_scores_gemma":[0.9983216,0.0011163424,0.000023257018,0.00039457428,0.00004916274,0.00009505364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005192128,0.00018633575,0.00018232185,0.00016760682,0.00055047974,0.000984139,0.00042730328,0.00006647176,0.00002201054],"category_scores_gemma":[0.00013852159,0.00012472861,0.00017176008,0.0005693946,0.0002508451,0.0003442727,0.00014988532,0.00024516278,0.000026566853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005733498,0.000057301175,0.0000018204256,0.000109295914,0.000039125254,0.0000042887077,0.0008415657,0.00003393091,0.000039215254,0.79104954,0.00010412467,0.20771405],"study_design_scores_gemma":[0.00020476937,0.00016530462,0.00003255162,0.00010497546,0.00003166898,0.00005107156,0.00008611022,0.3741608,0.00012490936,0.6180162,0.0068553635,0.00016625338],"about_ca_topic_score_codex":0.000005413987,"about_ca_topic_score_gemma":0.000004569375,"teacher_disagreement_score":0.53566206,"about_ca_system_score_codex":0.000015849666,"about_ca_system_score_gemma":0.000024743293,"threshold_uncertainty_score":0.9490075},"labels":[],"label_agreement":null},{"id":"W4406247024","doi":"10.1007/s00446-024-00475-3","title":"($$\\Delta + 1$$) vertex coloring in O(n) communication","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Combinatorics; Fractional coloring; Vertex (graph theory); Complete coloring; List coloring; Mathematics; Computer science; Graph; Line graph","score_opus":0.013701662946639616,"score_gpt":0.2683874029262402,"score_spread":0.2546857399796006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406247024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056078885,0.00031380425,0.939144,0.0011950427,0.00035888422,0.00013678528,0.000008581306,0.00028247677,0.0024815155],"genre_scores_gemma":[0.9766286,0.0000111558775,0.023053916,0.00022672798,0.000010452943,0.0000057587736,0.000048781876,0.0000034184993,0.000011203852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877155,0.00011504277,0.0003294032,0.0003226923,0.00014099079,0.00032034202],"domain_scores_gemma":[0.9987177,0.0003341766,0.000073576855,0.00075622875,0.00007727922,0.000040986102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044282756,0.00012586771,0.0001821635,0.00020399259,0.00027932684,0.00019876519,0.0015057127,0.000059385045,0.000003241873],"category_scores_gemma":[0.000091514696,0.00014541669,0.000057488425,0.0017157324,0.000050264825,0.00021940436,0.00070928823,0.00028321365,0.000008570252],"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.0000062631434,0.00016488356,0.013953577,0.00003161034,0.00002641221,0.00001515606,0.00043197678,0.006622859,0.00013923932,0.8239872,0.0014023787,0.15321843],"study_design_scores_gemma":[0.00049927697,0.000015076884,0.04486019,0.00021696776,0.0000033181338,0.0000034092245,0.00010568873,0.91555727,0.0005185071,0.034973945,0.0030622904,0.00018405869],"about_ca_topic_score_codex":0.00011751512,"about_ca_topic_score_gemma":0.000032129003,"teacher_disagreement_score":0.9205497,"about_ca_system_score_codex":0.000117385025,"about_ca_system_score_gemma":0.00006530439,"threshold_uncertainty_score":0.59299207},"labels":[],"label_agreement":null},{"id":"W4407126070","doi":"10.1007/978-3-031-83438-7_16","title":"Algorithms and Hardness Results for the (3, 1)-Cover Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cover (algebra); Algorithm; Theoretical computer science; Mechanical engineering; Engineering","score_opus":0.02337062143164717,"score_gpt":0.25785019098540135,"score_spread":0.23447956955375418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407126070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013897989,0.0012074744,0.9866157,0.0042043864,0.0027382097,0.0009783391,0.000052526895,0.00013302246,0.0040689493],"genre_scores_gemma":[0.0018949826,0.00023947984,0.9895291,0.0026928675,0.0006665949,0.00006874982,0.000009658641,0.000027508864,0.0048710783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963371,0.0000283582,0.0005574713,0.0017080597,0.000718263,0.00065072515],"domain_scores_gemma":[0.99587333,0.0019053645,0.00024765063,0.0015468915,0.0003109058,0.0001158336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014737707,0.0005122026,0.00048497148,0.00055269204,0.0007207428,0.0009772084,0.0038951656,0.00026386481,0.000003776602],"category_scores_gemma":[0.00015254019,0.00037438027,0.00016860857,0.0006664439,0.0010783471,0.000463148,0.0021374098,0.00071551075,0.0000068395207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014190465,0.000017304019,0.0000029383853,0.00006176048,0.000021850276,0.0000125856295,0.000498616,0.0028821826,0.000004657925,0.08993036,0.0006105125,0.90594304],"study_design_scores_gemma":[0.00046881923,0.00011632726,0.000041404845,0.00032712697,0.000013788959,0.000031661028,1.7556384e-7,0.61298794,0.00014461613,0.34736487,0.038083125,0.00042013894],"about_ca_topic_score_codex":0.000030644966,"about_ca_topic_score_gemma":0.00004581322,"teacher_disagreement_score":0.9055229,"about_ca_system_score_codex":0.000119929544,"about_ca_system_score_gemma":0.0005261306,"threshold_uncertainty_score":0.99987084},"labels":[],"label_agreement":null},{"id":"W4408059813","doi":"10.1016/j.ipl.2025.106572","title":"A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Simple (philosophy); Binary number; Mathematics; Binary tree; Algorithm; Combinatorics; Weight-balanced tree; Tree (set theory); Binary search tree; Arithmetic","score_opus":0.015516512004594286,"score_gpt":0.2570153997252107,"score_spread":0.24149888772061642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408059813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070352578,0.000020724421,0.9872235,0.0041164835,0.00033062784,0.00055879494,0.000017955485,0.00027703086,0.00041964068],"genre_scores_gemma":[0.57917124,0.0000035028156,0.4043825,0.015499305,0.000096046206,0.00044037824,0.0003213927,0.000012589608,0.00007306854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.00003017651,0.00045708485,0.00022739214,0.00031409267,0.00030841673],"domain_scores_gemma":[0.99906033,0.0001800524,0.00022779127,0.00032591313,0.0001587078,0.000047184007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034715934,0.00018585722,0.00015412325,0.00049639546,0.00047276105,0.00051884993,0.00055874174,0.000062756844,0.0000040215327],"category_scores_gemma":[0.000109931156,0.00017969517,0.00008632542,0.00070894824,0.000053495394,0.0025148224,0.00011870534,0.00012145492,0.00001679012],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001580859,0.00005326928,0.00015827463,0.0001416289,0.000013079469,6.979214e-7,0.0007401773,0.002861348,0.00015698915,0.0029723537,0.0042193322,0.988667],"study_design_scores_gemma":[0.0010537889,0.000074764495,0.0048842565,0.00013056658,0.000007647818,0.000001834949,0.00007465982,0.96783435,0.0013791353,0.009897842,0.014448359,0.00021278791],"about_ca_topic_score_codex":0.0000144367195,"about_ca_topic_score_gemma":0.000009774646,"teacher_disagreement_score":0.9884543,"about_ca_system_score_codex":0.000106622494,"about_ca_system_score_gemma":0.000080949314,"threshold_uncertainty_score":0.7327756},"labels":[],"label_agreement":null},{"id":"W4408293789","doi":"10.1145/3723141.3723144","title":"Complexity Column","year":2025,"lang":"en","type":"article","venue":"ACM SIGLOG News","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":"Simon Fraser University","funders":"","keywords":"Column (typography); Computer science; Computer network","score_opus":0.04422964664292883,"score_gpt":0.2960666793611475,"score_spread":0.25183703271821867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408293789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014531628,0.0005133917,0.85195076,0.022831641,0.00279725,0.00042538496,0.0000111868685,0.00092383963,0.106014915],"genre_scores_gemma":[0.49572995,0.00006805813,0.4840949,0.01332321,0.00022762075,0.00005535507,0.000012211822,0.000014469516,0.006474236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877703,0.00007464701,0.00022539082,0.00042094942,0.00018354483,0.000318441],"domain_scores_gemma":[0.99799484,0.00025596534,0.00005149356,0.0015586301,0.000064192216,0.00007485259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017778919,0.00013839111,0.00019907736,0.00013669208,0.0002618036,0.0001886359,0.0026247508,0.00006464693,0.000074063995],"category_scores_gemma":[0.0002043104,0.00014073684,0.00010496022,0.0008761007,0.00016314206,0.00025619997,0.0013720033,0.00018351643,0.00013416292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003778362,0.00008542638,0.0028980367,0.000013150066,0.000024310686,0.000012788511,0.00012759535,0.0000072762355,0.00016254527,0.8147264,0.059341427,0.12259724],"study_design_scores_gemma":[0.00041075234,0.00004952966,0.017293183,0.000024198409,0.000006632229,0.00000776039,0.000029943438,0.0075189318,0.00059952994,0.7505542,0.22328219,0.0002231174],"about_ca_topic_score_codex":0.00030028852,"about_ca_topic_score_gemma":0.00027733852,"teacher_disagreement_score":0.4811983,"about_ca_system_score_codex":0.000036423666,"about_ca_system_score_gemma":0.00008993181,"threshold_uncertainty_score":0.5739082},"labels":[],"label_agreement":null},{"id":"W4409280356","doi":"10.1145/3728631","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Minimum-cost flow problem; Flow (mathematics); Maximum flow problem; Mathematics; Computer science; Mathematical optimization; Geometry","score_opus":0.015960487311521922,"score_gpt":0.2604227304612225,"score_spread":0.24446224314970058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409280356","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64097935,0.0041109296,0.16448894,0.17546774,0.008691997,0.00079211337,0.000023492805,0.00009285166,0.005352586],"genre_scores_gemma":[0.13391711,0.00024348931,0.8575792,0.004700272,0.00056513574,0.0000046449745,6.828243e-7,0.000017874549,0.0029715984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991648,0.00007888943,0.0002841079,0.000117488176,0.00020090469,0.00015376644],"domain_scores_gemma":[0.9988182,0.00018586435,0.00011956392,0.00076116744,0.00006888203,0.00004632705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305946,0.00008475202,0.00017569562,0.00015832702,0.00008973436,0.00008171546,0.0025189898,0.00004019053,0.000015282874],"category_scores_gemma":[0.0004320732,0.000056917448,0.00010080324,0.0004820671,0.00005612855,0.00023387786,0.0011895887,0.00028876046,0.00000906357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017027017,0.00061873766,0.008494408,0.00008813999,0.00024199778,0.0003052851,0.0030031963,0.005879948,0.0035082663,0.004275502,0.10410435,0.8693099],"study_design_scores_gemma":[0.0015548551,0.00012957813,0.022163922,0.00037166858,0.000025009196,0.0003248423,0.000045535053,0.64718735,0.0016811723,0.293845,0.03246053,0.000210559],"about_ca_topic_score_codex":0.000004471284,"about_ca_topic_score_gemma":0.000005975858,"teacher_disagreement_score":0.8690993,"about_ca_system_score_codex":0.00002898966,"about_ca_system_score_gemma":0.00008041239,"threshold_uncertainty_score":0.46809518},"labels":[],"label_agreement":null},{"id":"W4409704918","doi":"10.1007/s10107-025-02209-0","title":"A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Extension (predicate logic); Mathematics; Dual (grammatical number); Combinatorics; Algorithm; Maximum cut; Applied mathematics; Mathematical optimization; Computer science; Graph","score_opus":0.020471976019507402,"score_gpt":0.2747189467901412,"score_spread":0.2542469707706338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409704918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007409399,0.00015095195,0.9950119,0.002040512,0.00031568087,0.0010690875,0.0000035696457,0.00011436007,0.00055299257],"genre_scores_gemma":[0.038197108,0.000006121933,0.96086,0.00017551861,0.000088149216,0.00027220446,0.0000017435001,0.000013201148,0.00038593297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846804,0.000053671545,0.0004284124,0.00034252397,0.0003728937,0.00033446177],"domain_scores_gemma":[0.99802196,0.0009920154,0.00015556438,0.00062951806,0.00016149197,0.00003942624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000692854,0.00016926692,0.00023840494,0.00006600009,0.00050260423,0.00017748475,0.00084639917,0.000074154224,0.00001154353],"category_scores_gemma":[0.00014196175,0.00009610899,0.00024767872,0.0006683178,0.00019314291,0.00019767147,0.0005101532,0.00024573455,0.000004252798],"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.000004710114,0.00020194484,0.000013183899,0.00016338039,0.000055469725,7.442961e-7,0.0003013416,0.000028167487,0.00012148029,0.3618159,0.00016995535,0.6371237],"study_design_scores_gemma":[0.000323875,0.00005585699,0.0001533394,0.0002988752,0.000042901866,0.000017920887,0.000088786794,0.64994985,0.0020299435,0.32942283,0.017482242,0.00013360263],"about_ca_topic_score_codex":0.00000870625,"about_ca_topic_score_gemma":0.000002752574,"teacher_disagreement_score":0.64992166,"about_ca_system_score_codex":0.000040836378,"about_ca_system_score_gemma":0.00007423288,"threshold_uncertainty_score":0.3919211},"labels":[],"label_agreement":null},{"id":"W4410951340","doi":"10.1007/s10878-025-01311-5","title":"Approximation algorithms for the total dominating set problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dominating set; Theory of computation; Approximation algorithm; Algorithm; Set (abstract data type); Set cover problem; Mathematics; Computer science; Mathematical optimization; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.018128412770283365,"score_gpt":0.27632276594259153,"score_spread":0.25819435317230816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410951340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013874227,0.00015536875,0.99133986,0.0019837136,0.005615396,0.00036421372,0.0000017313173,0.000028039067,0.00037294466],"genre_scores_gemma":[0.043953907,0.00003495935,0.95525473,0.0000899024,0.0005218227,0.000025504152,0.0000038188164,0.0000081767375,0.000107175176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880445,0.0000813569,0.0005189755,0.00013229814,0.00030976208,0.00015312988],"domain_scores_gemma":[0.9980379,0.000548305,0.0004844961,0.00020456857,0.000689861,0.000034883677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114526,0.00010756326,0.00019178988,0.0001902416,0.00032856624,0.00029558348,0.0006381689,0.00006655326,0.0000034091343],"category_scores_gemma":[0.00026091415,0.00007921931,0.00014752432,0.0006385398,0.00003814685,0.0007086944,0.000109331064,0.00017609168,3.476659e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004982819,0.00011228604,0.000010409885,0.000037511894,0.000077493634,0.0000011719873,0.00047038106,0.42941287,0.000046819976,0.5172089,0.0014173092,0.051155046],"study_design_scores_gemma":[0.001412414,0.00015315623,0.00003837309,0.00005770871,0.000030241932,0.000016810847,0.000053522203,0.8790197,0.0004345117,0.117968105,0.0007371232,0.000078337114],"about_ca_topic_score_codex":0.0000026339185,"about_ca_topic_score_gemma":6.618588e-8,"teacher_disagreement_score":0.44960684,"about_ca_system_score_codex":0.00007164902,"about_ca_system_score_gemma":0.00015440652,"threshold_uncertainty_score":0.32304698},"labels":[],"label_agreement":null},{"id":"W4411141691","doi":"10.1145/3725235","title":"Fast Matrix Multiplication meets the Submodular Width","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","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":"University of Waterloo","funders":"Universitas Brawijaya","keywords":"Matrix multiplication; Submodular set function; Multiplication (music); Matrix (chemical analysis); Computer science; Mathematics; Arithmetic; Combinatorics; Physics; Materials science","score_opus":0.0438812084694511,"score_gpt":0.3106361800602223,"score_spread":0.2667549715907712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411141691","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16846313,0.0024376984,0.23108827,0.45912662,0.0036525724,0.009621059,0.00046781646,0.0010253368,0.12411751],"genre_scores_gemma":[0.76851124,0.00022266542,0.2296169,0.0004228016,0.00003521052,0.00003205478,0.000010720269,0.000008927376,0.0011394675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000008414263,0.00024503944,0.00038309186,0.0003905112,0.00014331994],"domain_scores_gemma":[0.9967936,0.00006056133,0.00022156387,0.0028141101,0.00009519276,0.000014955302],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006626774,0.000105407074,0.00012287422,0.00009608772,0.00015022125,0.000089204135,0.01576854,0.000022346005,0.0000024161768],"category_scores_gemma":[0.00012032136,0.00006607023,0.000056038964,0.000735602,0.00010685036,0.0004588128,0.012570774,0.00009710631,0.0000036780507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012755842,0.00014109924,0.0007500685,0.0002935517,0.00012387645,1.4900819e-7,0.0000911336,0.000022856575,0.0007240184,0.8840756,0.014744199,0.09902068],"study_design_scores_gemma":[0.0013551782,0.00013481661,0.07100637,0.0012103238,0.00025326372,0.000002487371,0.000631618,0.120921634,0.024974499,0.69132936,0.08774407,0.0004363966],"about_ca_topic_score_codex":0.000012057156,"about_ca_topic_score_gemma":6.6887105e-7,"teacher_disagreement_score":0.6000481,"about_ca_system_score_codex":0.000013755241,"about_ca_system_score_gemma":0.000007475083,"threshold_uncertainty_score":0.9954154},"labels":[],"label_agreement":null},{"id":"W4411278309","doi":"10.1145/3732772.3733530","title":"Brief Announcement: Distributed Graph Algorithms with Predictions","year":2025,"lang":"en","type":"article","venue":"","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":"Computer science; Distributed algorithm; Algorithm; Theoretical computer science; Distributed computing","score_opus":0.01203827415186444,"score_gpt":0.23897547277520506,"score_spread":0.2269371986233406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411278309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019681091,0.00007314704,0.97371596,0.0025838015,0.00037416644,0.00016961832,0.000048252812,0.0005332379,0.022305008],"genre_scores_gemma":[0.33323568,0.00012609367,0.64834225,0.00494086,0.0002203199,0.00025983868,0.00023959768,0.000024190986,0.012611136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988203,0.000029259143,0.00018570278,0.00041106506,0.00026115068,0.0002925038],"domain_scores_gemma":[0.99906576,0.000058696838,0.00003763694,0.00062563864,0.0001344733,0.000077771096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001301205,0.00014439167,0.00013616914,0.00019603585,0.0003555182,0.00021972266,0.00075944525,0.000041788793,0.00003875806],"category_scores_gemma":[0.000009747216,0.000115570205,0.000063568594,0.0019127632,0.00013000511,0.00038849673,0.0002470233,0.0001429233,0.000009854672],"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.00000749654,0.00021558862,0.0009810765,0.000012681905,0.00010674499,0.000014454405,0.00008019057,0.00037061333,0.00002293828,0.9459902,0.022092681,0.030105317],"study_design_scores_gemma":[0.0021665478,0.0004644905,0.023666954,0.00014421731,0.000053999345,0.000053652755,0.00016055653,0.392692,0.00090306264,0.16385031,0.41514188,0.000702338],"about_ca_topic_score_codex":0.000096689466,"about_ca_topic_score_gemma":0.000048369868,"teacher_disagreement_score":0.7821399,"about_ca_system_score_codex":0.000033360986,"about_ca_system_score_gemma":0.00009687852,"threshold_uncertainty_score":0.47128162},"labels":[],"label_agreement":null},{"id":"W4411319863","doi":"10.1145/3717823.3718265","title":"Vizing’s Theorem in Near-Linear Time","year":2025,"lang":"en","type":"article","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Simons Institute for the Theory of Computing, University of California Berkeley; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Mathematics","score_opus":0.010081720040346649,"score_gpt":0.2535451831704213,"score_spread":0.24346346313007464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013080132,0.000106620675,0.7177779,0.004244922,0.0004643373,0.00014273789,8.5954105e-7,0.00036397035,0.26381853],"genre_scores_gemma":[0.41056448,0.000014021202,0.5605216,0.004767717,0.00006756517,0.000016302134,0.0000023402404,0.0000091150405,0.02403684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993308,0.000036397152,0.0001332211,0.00022515819,0.00009767121,0.000176739],"domain_scores_gemma":[0.99946576,0.000092083435,0.000014226901,0.00037957937,0.000022056967,0.000026299998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023976069,0.00007119629,0.00009848377,0.00010892953,0.00007676949,0.00010314604,0.00070228823,0.000032889042,0.00011972169],"category_scores_gemma":[0.000025016927,0.00006233544,0.000043076412,0.0007396281,0.000058535268,0.00016533719,0.0003196644,0.000106875974,0.00021352989],"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.0000018739912,0.000045257282,0.00029061275,0.0000038075734,0.0000046905275,0.000007721561,0.00014749679,0.00006250235,0.000075063545,0.9241262,0.0017859463,0.073448814],"study_design_scores_gemma":[0.0002559377,0.000020185225,0.0029862116,0.000026189458,0.0000010874293,0.0000024657659,0.000010824581,0.7394371,0.0009770035,0.23213565,0.024025582,0.00012178208],"about_ca_topic_score_codex":0.0000512526,"about_ca_topic_score_gemma":0.000017796545,"teacher_disagreement_score":0.7393746,"about_ca_system_score_codex":0.00001657119,"about_ca_system_score_gemma":0.000056831774,"threshold_uncertainty_score":0.2744566},"labels":[],"label_agreement":null},{"id":"W4411320007","doi":"10.1145/3717823.3718303","title":"When Connectivity Is Hard, Random Walks Are Easy with Non-determinism","year":2025,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Random walk; Computer science; Determinism; Theoretical computer science; Statistical physics; Mathematics; Physics; Statistics","score_opus":0.015476538454911475,"score_gpt":0.2387348822514241,"score_spread":0.22325834379651263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411320007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016153164,0.000048367103,0.9386022,0.0043147826,0.00048029248,0.00026899457,0.000005705565,0.00025640722,0.039870054],"genre_scores_gemma":[0.8743032,0.000009260146,0.108851485,0.0049830037,0.00006296796,0.000046816138,0.0000011659303,0.000009557079,0.011732507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986862,0.00005600992,0.00017655907,0.00054476963,0.00024060688,0.0002958354],"domain_scores_gemma":[0.9986955,0.00022291832,0.00006944162,0.0008301378,0.0001000672,0.00008194051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433801,0.00018536979,0.00029436077,0.00014652398,0.0002418672,0.00025530258,0.00090970716,0.00006346755,0.00010180765],"category_scores_gemma":[0.000025821184,0.00014229506,0.0001081912,0.00039891523,0.000107496504,0.00037751519,0.00037130588,0.00018004734,0.00004367949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049751916,0.0010866841,0.035449736,0.00030349405,0.00069294625,0.0003820528,0.0062887324,0.000064588494,0.0006761449,0.44133446,0.107676595,0.40554705],"study_design_scores_gemma":[0.018152589,0.00065830455,0.11370388,0.00064972066,0.00009736022,0.000117141586,0.00041666027,0.36245242,0.02231656,0.3748781,0.10459162,0.0019656168],"about_ca_topic_score_codex":0.00011799793,"about_ca_topic_score_gemma":0.0000948392,"teacher_disagreement_score":0.85815006,"about_ca_system_score_codex":0.000023641654,"about_ca_system_score_gemma":0.000095448784,"threshold_uncertainty_score":0.58026236},"labels":[],"label_agreement":null},{"id":"W4412825210","doi":"10.46298/theoretics.25.16","title":"A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching","year":2025,"lang":"en","type":"article","venue":"TheoretiCS","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; University of Waterloo","keywords":"Simple (philosophy); Matching (statistics); Algorithm; Computer science; Mathematics; Mathematical optimization; Statistics","score_opus":0.011563491496002689,"score_gpt":0.26232859526662544,"score_spread":0.2507651037706228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019013303,0.00012246973,0.991546,0.00045102934,0.00045793512,0.00032306477,0.000024798375,0.00028798566,0.004885412],"genre_scores_gemma":[0.14638655,0.000024955969,0.85251623,0.00051974924,0.00012431014,0.00006340594,0.0000383137,0.000016912116,0.00030959566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987515,0.00006957243,0.00028206073,0.00035993507,0.00018590268,0.00035103725],"domain_scores_gemma":[0.9987574,0.00042323698,0.00008873794,0.0005635243,0.000112198875,0.000054902826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646419,0.00017400556,0.0001973604,0.00017940163,0.00032439464,0.00022338843,0.000830962,0.00008244205,0.000016503123],"category_scores_gemma":[0.000042209376,0.00016935877,0.00011385743,0.000521706,0.000114655806,0.00023560345,0.00032180498,0.00014891138,0.0000083815075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001993786,0.000028746725,0.000006251541,0.000024645686,0.000014599642,0.0000012649706,0.00035209078,0.00002189178,0.00009044419,0.62831134,0.00015946264,0.3709873],"study_design_scores_gemma":[0.00020260285,0.000023093831,0.000018435618,0.000032345077,0.000009399352,0.0000031102652,0.000071612056,0.42390656,0.002261076,0.5712424,0.0021200075,0.00010936391],"about_ca_topic_score_codex":0.000009641216,"about_ca_topic_score_gemma":0.0000017554241,"teacher_disagreement_score":0.42388466,"about_ca_system_score_codex":0.000047117,"about_ca_system_score_gemma":0.000057994468,"threshold_uncertainty_score":0.690625},"labels":[],"label_agreement":null},{"id":"W4413483942","doi":"10.1016/j.cosrev.2025.100806","title":"Polynomial property testing","year":2025,"lang":"en","type":"article","venue":"Computer Science Review","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":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; United States - Israel Binational Science Foundation","keywords":"Computer science; Property (philosophy); Property testing; Polynomial; Algorithm; Mathematics; Mathematical analysis","score_opus":0.04482246225547628,"score_gpt":0.30111749325256554,"score_spread":0.2562950309970893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413483942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007968344,0.015681641,0.96621233,0.006077963,0.0017695485,0.00042129031,4.6512199e-7,0.0003402872,0.00941681],"genre_scores_gemma":[0.0077381423,0.0028022006,0.97411466,0.01455136,0.00022886225,0.000042274016,5.4152224e-7,0.0000067527358,0.00051522907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979709,0.00006609584,0.00035292946,0.00073938345,0.00040521807,0.00046550907],"domain_scores_gemma":[0.9983133,0.000120965466,0.000089385496,0.0010782966,0.00027099493,0.00012703332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013813225,0.00016912747,0.000299293,0.0002359689,0.00052900205,0.00043551432,0.003713555,0.000023509452,0.000006621206],"category_scores_gemma":[0.00019595218,0.00011204637,0.000095360905,0.00499467,0.00040110544,0.00087082945,0.0017683419,0.00016865971,0.00006446217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.6544612e-7,0.000027026595,0.000084933476,0.00027940585,0.0000028618167,0.0000048940656,0.000016291526,0.0000065690915,0.00006266888,0.0075545018,0.011827943,0.98013276],"study_design_scores_gemma":[0.00028018642,0.00013043603,0.0033104406,0.008759117,0.00002000551,0.00011115428,0.0000011409761,0.5468373,0.000501819,0.0043805405,0.4350705,0.0005974066],"about_ca_topic_score_codex":0.0000151127115,"about_ca_topic_score_gemma":8.331968e-7,"teacher_disagreement_score":0.97953534,"about_ca_system_score_codex":0.00006773609,"about_ca_system_score_gemma":0.000635705,"threshold_uncertainty_score":0.69007707},"labels":[],"label_agreement":null},{"id":"W4413895517","doi":"10.4086/toc.2025.v021a004","title":"","year":2025,"lang":"en","type":"article","venue":"Theory of Computing","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":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Computer science; Mathematics","score_opus":0.014534446798497138,"score_gpt":0.26385536255630854,"score_spread":0.2493209157578114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413895517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3189511,0.00019728558,0.6772302,0.00045754976,0.0004339764,0.0001033909,3.8952038e-7,0.0002604452,0.0023656795],"genre_scores_gemma":[0.8356873,0.00000275796,0.1636869,0.00054604124,0.000030825577,0.0000013321676,3.6290984e-7,0.0000037033392,0.000040772225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977979,0.0004281968,0.0005971521,0.00047086415,0.00027309894,0.00043279954],"domain_scores_gemma":[0.99671763,0.0018071845,0.00022093816,0.0010205981,0.00017098025,0.00006263734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577281,0.00019743449,0.0003946456,0.00042040533,0.00040387528,0.00010392549,0.002703312,0.00005517966,0.0000020172747],"category_scores_gemma":[0.00019790723,0.00019950057,0.00018777946,0.0015578568,0.0002960672,0.0003676634,0.0015643567,0.00022588503,0.0000010196806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013083404,0.00006855776,0.00069112226,0.000038048598,0.000037073525,0.0000031132915,0.001578327,0.0011093424,0.0007339016,0.7564198,0.00001051703,0.23929715],"study_design_scores_gemma":[0.00050227327,0.000059070684,0.017755859,0.00020514856,0.000008313325,0.000007759683,0.00024764377,0.15653813,0.013104661,0.8113358,0.00006875827,0.00016657461],"about_ca_topic_score_codex":0.000014091676,"about_ca_topic_score_gemma":0.000001523702,"teacher_disagreement_score":0.5167362,"about_ca_system_score_codex":0.00002231743,"about_ca_system_score_gemma":0.00009189606,"threshold_uncertainty_score":0.81353974},"labels":[],"label_agreement":null},{"id":"W4415829623","doi":"10.1016/j.jcss.2025.103727","title":"Algorithms and hardness results for the (k,ℓ)-cover problem","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","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":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Efficient algorithm; Minification; Key (lock)","score_opus":0.027734756578015954,"score_gpt":0.2790050750009111,"score_spread":0.25127031842289516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415829623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019382158,0.0019273706,0.98958904,0.0033287234,0.002048883,0.00019206459,0.0000034182979,0.00001897837,0.0009532944],"genre_scores_gemma":[0.57840633,0.00015650543,0.41995206,0.0005384046,0.0005555203,0.0000096345875,1.5576822e-7,0.000003799472,0.00037758544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987599,0.00007363348,0.00045125544,0.0002334647,0.00030091018,0.00018081027],"domain_scores_gemma":[0.9987022,0.00062847446,0.0002486061,0.00016612545,0.00019609275,0.000058475038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023980343,0.00010379032,0.00023290908,0.00018316536,0.00059762393,0.0007458026,0.0009348914,0.00003100676,1.6932671e-7],"category_scores_gemma":[0.000017421413,0.00005730007,0.00007993413,0.00044478345,0.00024396674,0.0004993315,0.0002499746,0.00009928548,3.217979e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057475834,0.00006426136,0.000548186,0.0003088814,0.00014150937,0.000018414743,0.002296775,0.0010997957,0.000025918838,0.49050054,0.018764041,0.48617423],"study_design_scores_gemma":[0.0012624237,0.00050955935,0.004084512,0.0005231621,0.000028940472,0.0004894645,0.00037460047,0.94870573,0.00007456888,0.014798426,0.028986672,0.00016190863],"about_ca_topic_score_codex":0.000008128953,"about_ca_topic_score_gemma":0.0000013121055,"teacher_disagreement_score":0.94760597,"about_ca_system_score_codex":0.000013959129,"about_ca_system_score_gemma":0.00011670851,"threshold_uncertainty_score":0.71917915},"labels":[],"label_agreement":null},{"id":"W4415966320","doi":"10.48550/arxiv.2510.17740","title":"Generalized Flow in Nearly-linear Time on Moderately Dense Graphs","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","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; Simons Institute for the Theory of Computing, University of California Berkeley; Microsoft Research; National Science Foundation","keywords":"Flow (mathematics); Maximum flow problem; Enhanced Data Rates for GSM Evolution; Graph; Point (geometry); Flow network; Control flow graph","score_opus":0.06437540954912388,"score_gpt":0.28995719206980053,"score_spread":0.22558178252067665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415966320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540465,0.001075397,0.032458346,0.002258181,0.005144419,0.0015300018,0.00017473039,0.00045971535,0.0028527016],"genre_scores_gemma":[0.8112178,0.0035517153,0.15604681,0.0074209594,0.0013763113,0.0005513576,0.00028711016,0.00020280824,0.01934514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99039364,0.0011177165,0.0019369748,0.0036548416,0.0011600524,0.001736747],"domain_scores_gemma":[0.9938454,0.00061450823,0.00056625187,0.003989854,0.00048693703,0.000497057],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014679492,0.0015691314,0.0018686508,0.0012482859,0.00077952933,0.00069966994,0.0046334206,0.0010670326,0.0005230622],"category_scores_gemma":[0.00024723003,0.0017262754,0.0011153091,0.0027556226,0.00052423246,0.00057109527,0.0044102077,0.0032763705,0.0017091358],"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.0026214386,0.0070347907,0.06904137,0.0014493917,0.0020212082,0.0032096547,0.012839284,0.61384434,0.0019860093,0.085247725,0.007046276,0.1936585],"study_design_scores_gemma":[0.0022326466,0.00030710973,0.02603669,0.0011386706,0.00007583014,0.000023473965,0.00001615921,0.92822534,0.0021116622,0.0352138,0.0028892916,0.0017293461],"about_ca_topic_score_codex":0.0007820288,"about_ca_topic_score_gemma":0.00015259044,"teacher_disagreement_score":0.31438097,"about_ca_system_score_codex":0.0003092764,"about_ca_system_score_gemma":0.0010227638,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W4416052615","doi":"10.48550/arxiv.2504.11256","title":"Covering Approximate Shortest Paths with DAGs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Directed acyclic graph; Upper and lower bounds; Directed graph; Probabilistic logic; Embedding; Tree (set theory); Cover (algebra); Simple (philosophy); K-ary tree","score_opus":0.04341478645897524,"score_gpt":0.262463454533178,"score_spread":0.21904866807420276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416052615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24460028,0.00045507975,0.73777395,0.0007737931,0.0020643098,0.0005936379,0.00006111905,0.0009115406,0.012766262],"genre_scores_gemma":[0.90872633,0.00016751728,0.08813631,0.00075796543,0.00030286677,0.00015622149,0.00005103898,0.000034423887,0.0016673225],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975482,0.00006372608,0.00036068796,0.001139146,0.00039030574,0.000497931],"domain_scores_gemma":[0.99753094,0.00012032656,0.00018759537,0.0019036777,0.0001289697,0.00012851626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028075255,0.0004368447,0.0004711746,0.00020710868,0.00023243918,0.000312028,0.0024231786,0.0002047675,0.000021563512],"category_scores_gemma":[0.000033038243,0.0003987742,0.00017027509,0.0005051317,0.00013205736,0.00027161263,0.003943804,0.0009119129,0.000039342314],"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.00007447111,0.0010123015,0.74006784,0.0018290781,0.0009706353,0.0009354976,0.0046037375,0.0121430475,0.00035985457,0.1336271,0.0028704482,0.10150599],"study_design_scores_gemma":[0.0024773807,0.00063652167,0.3633526,0.005305855,0.00030897997,0.00018840608,0.00025149295,0.48933214,0.0070272405,0.07860538,0.04651471,0.0059993095],"about_ca_topic_score_codex":0.00013107758,"about_ca_topic_score_gemma":0.00004180281,"teacher_disagreement_score":0.66412604,"about_ca_system_score_codex":0.00007428943,"about_ca_system_score_gemma":0.00028557898,"threshold_uncertainty_score":0.9998464},"labels":[],"label_agreement":null},{"id":"W4416091488","doi":"10.1016/j.ic.2025.105378","title":"Approximation algorithms for the maximum path cover problem using long paths","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Approximation algorithm; Path (computing); Cover (algebra); Matching (statistics); Approximation theory; Stability (learning theory)","score_opus":0.026057032211216403,"score_gpt":0.27926336159475795,"score_spread":0.25320632938354154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416091488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011327686,0.00009045679,0.9964991,0.00056642015,0.0003619785,0.0005935887,0.0000060423163,0.00010446574,0.0006451308],"genre_scores_gemma":[0.36225432,0.000042450058,0.63560075,0.0017286389,0.00006531214,0.00013196467,0.00009491613,0.000006507557,0.00007512736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924326,0.00002733033,0.00030734998,0.00011948127,0.00016683295,0.00013572676],"domain_scores_gemma":[0.9993301,0.00016685581,0.00014979497,0.00013975684,0.00018890877,0.000024599452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035728494,0.000098277094,0.00008783622,0.00014893505,0.00044104402,0.0005091534,0.00021368943,0.000045593737,0.000001574855],"category_scores_gemma":[0.000022150285,0.000078173834,0.000044128734,0.0003988551,0.000038067483,0.0016721492,0.00010062603,0.0000724948,0.0000051388147],"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.0000073090764,0.000017063885,0.00006373232,0.00012402733,0.000018408868,1.3056112e-7,0.001005031,0.020652197,0.0000059454765,0.113982856,0.00027024455,0.86385304],"study_design_scores_gemma":[0.00042351874,0.000024539118,0.0013893122,0.000044672663,0.000009287858,0.000006026008,0.00010714674,0.92892164,0.000049972194,0.065905705,0.003029667,0.00008853528],"about_ca_topic_score_codex":0.000020877907,"about_ca_topic_score_gemma":0.0000010114946,"teacher_disagreement_score":0.9082694,"about_ca_system_score_codex":0.000035354824,"about_ca_system_score_gemma":0.000064549946,"threshold_uncertainty_score":0.49097782},"labels":[],"label_agreement":null},{"id":"W4416902920","doi":"10.1137/24m1635570","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \\(\\boldsymbol{k}\\)- <scp>means</scp>","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Euclidean geometry; Approximation algorithm; Upper and lower bounds; Time complexity; Euclidean domain; Euclidean distance","score_opus":0.018779879089882767,"score_gpt":0.2781844359888292,"score_spread":0.2594045568989464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416902920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12500937,0.0012777752,0.86538714,0.0004537147,0.0025658344,0.0002265386,0.000008366343,0.00009492891,0.0049763354],"genre_scores_gemma":[0.7904726,0.00016360961,0.20773917,0.00066184305,0.00043920352,0.0000031980528,0.0000015679855,0.0000206114,0.00049815106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779296,0.00011150145,0.00067257055,0.0004499104,0.00041436293,0.00055866764],"domain_scores_gemma":[0.99745095,0.0013167267,0.00040992946,0.00037655138,0.00029035148,0.00015546559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014150578,0.0002601204,0.00046321677,0.00043200274,0.0007497635,0.00054477644,0.0009599129,0.00008708688,0.0000031498842],"category_scores_gemma":[0.000258743,0.00023857372,0.00020745458,0.00075651286,0.00014346132,0.00045178144,0.00033925226,0.0004738368,0.0000016050947],"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.000036775604,0.0005327894,0.0030578442,0.00031736935,0.00033697346,0.00007682512,0.0022461067,0.003409453,0.00063159707,0.26480222,0.006982285,0.71756977],"study_design_scores_gemma":[0.0031290052,0.0014063695,0.0074896268,0.0017305155,0.000055994857,0.00021722566,0.00081346784,0.72950774,0.0046967496,0.1638386,0.08672197,0.00039274094],"about_ca_topic_score_codex":0.000008829814,"about_ca_topic_score_gemma":0.0000053998515,"teacher_disagreement_score":0.7260983,"about_ca_system_score_codex":0.00006380572,"about_ca_system_score_gemma":0.00018393743,"threshold_uncertainty_score":0.9728754},"labels":[],"label_agreement":null},{"id":"W4417091733","doi":"10.48550/arxiv.2504.13105","title":"A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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; Cover (algebra); Covering problems; Approximation algorithm; Set cover problem; Relaxation (psychology); Linear programming relaxation; Polyhedron; Iterative method; Set packing","score_opus":0.10042766214381417,"score_gpt":0.3023558924078041,"score_spread":0.20192823026398993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417091733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007516138,0.00044932778,0.98267776,0.002168393,0.0019043009,0.0029782008,0.00018314923,0.00022239836,0.0019003284],"genre_scores_gemma":[0.35766637,0.00020545232,0.60896325,0.004361266,0.0019491989,0.007275441,0.00023641155,0.000104028295,0.019238548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997466,0.00013178258,0.00046318365,0.0011211558,0.00022468506,0.00059313973],"domain_scores_gemma":[0.9952774,0.0025958852,0.00030368156,0.0014133286,0.00032925553,0.000080474245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011102278,0.00044186244,0.00047170298,0.00016285492,0.0007661451,0.0006298338,0.0027538901,0.00022506007,0.000015019471],"category_scores_gemma":[0.00018303357,0.0003343673,0.00049690105,0.0003377172,0.00014805414,0.00023530085,0.002290904,0.0005603777,0.000011675278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008501067,0.00019810033,0.0043769456,0.00067687774,0.00058406766,0.0000061513347,0.007860431,0.002606275,0.00006384796,0.9404436,0.005539149,0.037559576],"study_design_scores_gemma":[0.0011834692,0.00023139942,0.003271552,0.0007313106,0.00014441732,0.000007930672,0.00014752019,0.25511888,0.0009823119,0.5671178,0.17011723,0.0009461501],"about_ca_topic_score_codex":0.00016664281,"about_ca_topic_score_gemma":0.000078097655,"teacher_disagreement_score":0.37371448,"about_ca_system_score_codex":0.00012370263,"about_ca_system_score_gemma":0.00032557722,"threshold_uncertainty_score":0.99991083},"labels":[],"label_agreement":null},{"id":"W4417092764","doi":"10.4230/lipics.ccc.2025.15","title":"Algebraic Pseudorandomness in VNC⁰","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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":"National Science Foundation","keywords":"Constant (computer programming); Polynomial; Algebraic number; Ideal (ethics); Generator (circuit theory); Correctness; Degree (music); Unary operation; Arithmetic circuit complexity; Corollary","score_opus":0.0238879756256104,"score_gpt":0.26902055791595436,"score_spread":0.24513258229034396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417092764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8937433,0.0003276932,0.09583904,0.002477926,0.00095625647,0.00015274323,8.899687e-7,0.00018464355,0.0063175363],"genre_scores_gemma":[0.9944859,0.00002286909,0.0035736961,0.0010625126,0.000041822164,0.000022669212,0.0000011617693,0.0000045212387,0.0007848466],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99888813,0.00006885482,0.00023274335,0.00038053657,0.00013730444,0.00029242577],"domain_scores_gemma":[0.9991402,0.00015145501,0.00003730655,0.00058536086,0.00003868893,0.000046981237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028115284,0.000126161,0.00019155283,0.0002470487,0.00011025643,0.0000717826,0.0009969315,0.00005814432,0.000027303884],"category_scores_gemma":[0.000060927377,0.00012266928,0.00007664516,0.0012460547,0.00007073437,0.00030694203,0.00036480895,0.0001991877,0.000109223714],"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.00002482521,0.00026616888,0.6108153,0.000050896655,0.00003687753,0.00012130829,0.0006710721,0.000059830356,0.00057715684,0.32623294,0.0019529132,0.05919075],"study_design_scores_gemma":[0.0025100652,0.0000472197,0.87070405,0.00014691822,0.000008128536,0.0000126588275,0.00005655308,0.014539493,0.003612228,0.096124984,0.011835116,0.00040255376],"about_ca_topic_score_codex":0.000079810125,"about_ca_topic_score_gemma":0.00007505017,"teacher_disagreement_score":0.25988883,"about_ca_system_score_codex":0.00003035379,"about_ca_system_score_gemma":0.00006950858,"threshold_uncertainty_score":0.5002308},"labels":[],"label_agreement":null},{"id":"W4417194548","doi":"10.1007/s10107-025-02315-z","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Hypergraph; Multiplicative function; Exponential function; Computational complexity theory; Online algorithm; Exponential growth; Rank (graph theory); Space (punctuation)","score_opus":0.05109511184521867,"score_gpt":0.31989459856978447,"score_spread":0.2687994867245658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417194548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018112971,0.0001174387,0.9935175,0.0022745105,0.00024640487,0.00056255615,0.000004183937,0.00036589685,0.0011002157],"genre_scores_gemma":[0.04360899,0.000004204906,0.95548964,0.00018640957,0.000082586404,0.00012904551,0.00001186927,0.000008703815,0.000478573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867445,0.000025288924,0.00033939505,0.00038833727,0.0001907195,0.00038180026],"domain_scores_gemma":[0.99898744,0.00028474224,0.00006219346,0.0005056229,0.0000851057,0.00007490783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035820346,0.00015242047,0.00022112783,0.00016764764,0.00021254031,0.00023352208,0.00074622995,0.00006679643,0.000008970564],"category_scores_gemma":[0.00015509139,0.00013814543,0.00017163166,0.0006792105,0.000094661715,0.00019000802,0.00015391465,0.00013566714,0.000014792794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015977105,0.00033254846,0.00001769778,0.00008392749,0.00001879676,0.0000011331149,0.000091783826,0.0000035098783,0.000045331937,0.65641046,0.0001410079,0.3428522],"study_design_scores_gemma":[0.00030968388,0.00007080544,0.00016183831,0.00007953067,0.00001829114,0.000007562876,0.0000690693,0.31172964,0.00060141395,0.67124623,0.015533686,0.00017225946],"about_ca_topic_score_codex":0.0000029893897,"about_ca_topic_score_gemma":0.0000015551979,"teacher_disagreement_score":0.34267995,"about_ca_system_score_codex":0.000030417803,"about_ca_system_score_gemma":0.000036673777,"threshold_uncertainty_score":0.5633407},"labels":[],"label_agreement":null},{"id":"W4417317377","doi":"10.1137/24m1653173","title":"Testing Graph Properties with the Container Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"","score_opus":0.03708113139195662,"score_gpt":0.2806205290011702,"score_spread":0.24353939760921356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417317377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014727311,0.00031570994,0.9718121,0.0066293483,0.00055166427,0.0001258338,1.7105496e-7,0.00013695014,0.0057008625],"genre_scores_gemma":[0.6925545,0.0000023719508,0.30434147,0.0026752504,0.00023807822,0.0000021133621,8.49965e-8,0.000008603486,0.00017756649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984442,0.00028633352,0.00028187138,0.00027361867,0.00034898403,0.00036501922],"domain_scores_gemma":[0.9983345,0.00079468277,0.00019307778,0.00035594794,0.0002547054,0.00006704187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380689,0.0001785153,0.00020434697,0.00021260553,0.001266473,0.00066291593,0.0011753934,0.000032080156,0.0000022467382],"category_scores_gemma":[0.00014222793,0.000095411764,0.00009423005,0.0011577827,0.00009016559,0.0002013122,0.00029729592,0.0007069971,0.0000041243366],"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.000041831456,0.000119698656,0.0014529192,0.0000386341,0.00019232518,0.00013869761,0.0014777237,0.027412869,0.0008873794,0.21325587,0.0021738643,0.7528082],"study_design_scores_gemma":[0.0014710969,0.0007742381,0.0106042875,0.001615234,0.00004371235,0.0014365145,0.0007185525,0.9231412,0.0022893655,0.043572485,0.013720008,0.00061332766],"about_ca_topic_score_codex":0.000012803889,"about_ca_topic_score_gemma":0.0000032451674,"teacher_disagreement_score":0.8957283,"about_ca_system_score_codex":0.000039119728,"about_ca_system_score_gemma":0.00014260766,"threshold_uncertainty_score":0.97408146},"labels":[],"label_agreement":null},{"id":"W44589754","doi":"10.1007/978-3-642-20807-2_2","title":"Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Matching (statistics); Birkhoff polytope; Mathematics; Operator (biology); Discrete mathematics; Statistics","score_opus":0.09363086593594758,"score_gpt":0.297366810238937,"score_spread":0.20373594430298944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44589754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005239795,0.0006433761,0.9897511,0.0010268886,0.00041376337,0.00031463912,0.000027888549,0.0000720722,0.002510492],"genre_scores_gemma":[0.69511485,0.00022222391,0.30310237,0.0011707841,0.00014373545,0.0000091861675,0.000005506524,0.00002876406,0.00020256342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974785,0.000071404116,0.0004434836,0.0009874183,0.00061061466,0.00040857386],"domain_scores_gemma":[0.9972765,0.0009855098,0.00036249668,0.0010973787,0.00015856668,0.00011959063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080331654,0.0004016255,0.0004954438,0.0006022629,0.00057590456,0.00034505475,0.0017783402,0.00015626856,0.000021480648],"category_scores_gemma":[0.000078597805,0.0002887723,0.00009052063,0.0005912043,0.0018563657,0.0004213088,0.0014828611,0.0006664975,0.0000036893405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008458447,0.00004613047,0.0002624226,0.00006520964,0.000046275512,0.000019607869,0.003806743,0.002060079,0.00018559795,0.8651362,0.00003181708,0.12833142],"study_design_scores_gemma":[0.00014708424,0.00016745288,0.0021173987,0.00040396463,0.00001775079,0.00005599054,0.000002528698,0.07826391,0.0012843178,0.9167455,0.0003660897,0.00042801004],"about_ca_topic_score_codex":0.0003081785,"about_ca_topic_score_gemma":0.00024866045,"teacher_disagreement_score":0.68987507,"about_ca_system_score_codex":0.000049757175,"about_ca_system_score_gemma":0.00016301357,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W46202281","doi":"10.1007/978-3-642-22006-7_2","title":"An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Approximation algorithm; Disjoint sets; Combinatorics; Vertex (graph theory); Steiner tree problem; Vertex connectivity; Graph; Mathematics; Computer science; Algorithm; Discrete mathematics","score_opus":0.03058419392283176,"score_gpt":0.26004901500276495,"score_spread":0.22946482107993318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46202281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042224186,0.0001378885,0.9944678,0.00017002036,0.0025561277,0.0014661562,0.00006892063,0.00031824512,0.00077264226],"genre_scores_gemma":[0.01597733,0.000018070807,0.9823392,0.0006392581,0.00072464906,0.00009894666,0.000045820616,0.000052363648,0.00010433222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533284,0.000059196234,0.00063734566,0.0023202575,0.0007097209,0.00094062515],"domain_scores_gemma":[0.9960467,0.0005851456,0.00043712588,0.002172562,0.00046401244,0.00029446138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015539413,0.0007264376,0.00071718317,0.00096109934,0.0005324445,0.0007469219,0.0045424267,0.00046974004,0.00002062157],"category_scores_gemma":[0.00007885341,0.0007124551,0.00027156575,0.0006584144,0.0007946939,0.0015461367,0.0008542979,0.00076173584,0.00001592947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072552425,0.000086045715,0.00000521803,0.00003157696,0.000012851856,0.000010390411,0.0006568752,0.00045944104,0.0001367619,0.021846171,0.000010259908,0.97673714],"study_design_scores_gemma":[0.00033508282,0.00034316248,0.000048165817,0.00008067766,0.0000088199995,0.000032914166,1.7790691e-7,0.6555316,0.0017070328,0.34064096,0.0006556327,0.00061579084],"about_ca_topic_score_codex":0.00005631997,"about_ca_topic_score_gemma":0.0001321137,"teacher_disagreement_score":0.97612137,"about_ca_system_score_codex":0.00025044597,"about_ca_system_score_gemma":0.00053519726,"threshold_uncertainty_score":0.99953264},"labels":[],"label_agreement":null},{"id":"W579949368","doi":"10.1007/978-1-4613-0279-7_25","title":"Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Maximum cut; Semidefinite embedding; Mathematics; Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematical optimization; Computer science; Quadratically constrained quadratic program; Artificial intelligence; Quadratic programming","score_opus":0.030757240695933663,"score_gpt":0.25227113805011137,"score_spread":0.2215138973541777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W579949368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0545285e-7,0.0010085749,0.9068833,0.0026234528,0.000092526876,0.002421708,0.00008147977,0.00026017558,0.0866287],"genre_scores_gemma":[0.00024521936,0.007822995,0.78460383,0.0009269472,0.00045322973,0.0042674625,0.00062680076,0.00011435075,0.20093916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983873,0.000015397613,0.00047193287,0.000624187,0.00024372104,0.00025747807],"domain_scores_gemma":[0.9978314,0.000523621,0.0004104901,0.000708385,0.00041036174,0.00011572744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020897461,0.0003131581,0.0002517302,0.00018204021,0.0010003106,0.00036532053,0.00075116695,0.00024136389,0.00010223811],"category_scores_gemma":[0.000025364,0.00026653,0.00014259815,0.00025458477,0.00011956673,0.00026908788,0.00020380413,0.00028718394,0.000026541758],"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.0000017642296,0.000028874778,7.094851e-7,0.000031673448,0.00004851861,2.3429381e-7,0.00013484174,0.006705541,7.797309e-7,0.87861496,0.0005205103,0.113911584],"study_design_scores_gemma":[0.00023387073,0.00003380793,7.8995316e-7,0.000039986546,0.00005932959,0.000011438165,0.000013873092,0.35748616,0.0000048745383,0.037557893,0.6043054,0.00025256656],"about_ca_topic_score_codex":0.0000041458447,"about_ca_topic_score_gemma":0.000012739549,"teacher_disagreement_score":0.84105706,"about_ca_system_score_codex":0.000042613137,"about_ca_system_score_gemma":0.00012258832,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W6888425079","doi":"10.20382/jocg.v13i1a14","title":"Algorithms for approximate sparse regression and nearest induced hulls","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degeneracy (biology); Set (abstract data type); Affine transformation; Regular polygon; Approximation algorithm; Convex hull; Conjecture; k-nearest neighbors algorithm; Randomized algorithm; Simple (philosophy)","score_opus":0.03918475331428511,"score_gpt":0.25983895760885284,"score_spread":0.22065420429456772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888425079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16533928,0.00019243917,0.8324273,0.0010366593,0.00051091023,0.00008464149,0.000012584982,0.00002586008,0.00037030695],"genre_scores_gemma":[0.37934792,0.000090015594,0.61953074,0.00028344072,0.00023981392,3.0015588e-7,0.000013529962,0.000012857401,0.00048138393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.000092204304,0.0002838425,0.00025502307,0.00041840345,0.00019924287],"domain_scores_gemma":[0.9980605,0.00041951815,0.00034430335,0.00016547559,0.00083317014,0.00017703495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030427237,0.00014057392,0.0002790602,0.00069935294,0.00024612638,0.00016068181,0.00049082004,0.00007778215,0.000012978986],"category_scores_gemma":[0.000089796864,0.00014110014,0.00017111954,0.0012325383,0.00006397874,0.0007115634,0.0002788675,0.00022780264,0.0000014332879],"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.00037634192,0.00116133,0.0025281932,0.000303954,0.00081848144,0.0030782637,0.0017439803,0.0403681,0.00383751,0.56402564,0.004061547,0.37769666],"study_design_scores_gemma":[0.011718698,0.0018065935,0.03270301,0.0007538104,0.00023453141,0.0035691122,0.0020002036,0.62900555,0.0078068064,0.22547503,0.08340788,0.0015187728],"about_ca_topic_score_codex":0.000003116479,"about_ca_topic_score_gemma":0.0000010654375,"teacher_disagreement_score":0.5886375,"about_ca_system_score_codex":0.00006507822,"about_ca_system_score_gemma":0.0002802269,"threshold_uncertainty_score":0.5753897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21658097,0.0010611891,0.7352095,0.0066305455,0.001314631,0.0043095886,0.00064927404,0.000367905,0.033876378],"genre_scores_gemma":[0.9834276,0.00018477354,0.013219256,0.001960818,0.00007704123,0.000327227,0.000029879111,0.000017257882,0.0007561344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984871,0.000023378701,0.0006326229,0.00021264567,0.00029963956,0.00034457823],"domain_scores_gemma":[0.9983004,0.00045254716,0.00026641096,0.00071901554,0.00018702805,0.00007462749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043954104,0.00022139905,0.00025900232,0.0002449806,0.00046746837,0.00032807444,0.001268813,0.00009373287,0.000010714938],"category_scores_gemma":[0.000055368993,0.00016410524,0.00014827838,0.0006204765,0.00014719811,0.000666658,0.00041604572,0.00026415393,0.00002551291],"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.00004304828,0.00036738726,0.0002872482,0.0005270564,0.00013359942,8.5403735e-7,0.0032605059,0.00004301908,0.00004086843,0.95180666,0.0033765943,0.040113132],"study_design_scores_gemma":[0.0033278624,0.0006882442,0.0024522294,0.00067052216,0.0001135855,0.000043469616,0.0020028993,0.30797875,0.00512788,0.07159177,0.60500896,0.0009938383],"about_ca_topic_score_codex":0.000006920707,"about_ca_topic_score_gemma":0.000010685073,"teacher_disagreement_score":0.8802149,"about_ca_system_score_codex":0.00003395344,"about_ca_system_score_gemma":0.000062093575,"threshold_uncertainty_score":0.6692018},"labels":[],"label_agreement":null},{"id":"W6891657421","doi":"10.48550/arxiv.1103.5215","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Toronto","funders":"","keywords":"Bipartite graph; Correctness; Lemma (botany); Matching (statistics); Time complexity; Blossom algorithm; Probabilistic logic; 3-dimensional matching","score_opus":0.10095548723909412,"score_gpt":0.19691255218897472,"score_spread":0.0959570649498806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891657421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01786314,0.00017143218,0.965017,0.00005472041,0.0016487954,0.00050912047,0.000010141826,0.00060408295,0.014121547],"genre_scores_gemma":[0.9376555,0.0003702092,0.06052463,0.00016222004,0.00015513018,0.000003981752,0.00001527349,0.000029022223,0.0010840025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972436,0.00035812435,0.0003921377,0.001283153,0.00014694217,0.000576061],"domain_scores_gemma":[0.9972987,0.00028642395,0.0004234339,0.0016142473,0.00015278388,0.00022437498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009887913,0.00047849136,0.00088261726,0.0004527864,0.00034812707,0.00025861856,0.0033586845,0.00033014166,0.00007007062],"category_scores_gemma":[0.000039916926,0.00051785604,0.0007664513,0.00058283494,0.0002776046,0.00076358137,0.0045485627,0.0009620212,0.00010576859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005518547,0.00008332853,0.000032493135,0.000079141195,0.00021325269,0.00030914354,0.0012202852,0.012580383,0.0000037782293,0.9818426,0.00008977353,0.0029939928],"study_design_scores_gemma":[0.009504284,0.000014842232,0.000023583721,0.00010515918,0.00006951249,0.0000114204,0.00005113959,0.41515693,0.000060269922,0.5743362,0.00019037855,0.0004762916],"about_ca_topic_score_codex":0.00067355705,"about_ca_topic_score_gemma":0.000027733155,"teacher_disagreement_score":0.9197924,"about_ca_system_score_codex":0.00011860819,"about_ca_system_score_gemma":0.00015599701,"threshold_uncertainty_score":0.9997273},"labels":[],"label_agreement":null},{"id":"W6891703795","doi":"10.48550/arxiv.0904.2203","title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta","funders":"","keywords":"Clique graph; Partition (number theory); Vertex (graph theory); Polynomial-time approximation scheme; Approximation algorithm; Independent set; Clique; Graph; Unit disk graph","score_opus":0.1346992862128803,"score_gpt":0.2149697447596503,"score_spread":0.08027045854677001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891703795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19338734,0.00008830721,0.8026014,0.00038653787,0.00072691316,0.0007908996,0.00006627367,0.00029514465,0.0016571905],"genre_scores_gemma":[0.9839826,0.0002909737,0.014903325,0.0002078441,0.000081171595,0.000007990778,0.00006716428,0.000018089937,0.00044084506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975201,0.00019758429,0.0003317334,0.0012918613,0.00010915981,0.00054956315],"domain_scores_gemma":[0.9979986,0.00020285397,0.00025540678,0.0012038428,0.00015952729,0.00017978463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044873529,0.0003904187,0.00044030382,0.00067320064,0.00020195308,0.00016430057,0.001980465,0.00037365474,0.000017324723],"category_scores_gemma":[0.00004216514,0.00048232503,0.0003935802,0.0011883241,0.00015430362,0.0004519896,0.0009998812,0.00067912653,0.000019917754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061551116,0.00031415603,0.0015538011,0.000105111096,0.000050341467,0.00018583304,0.00023155943,0.0799214,0.000016334156,0.9144873,0.00048073108,0.002591879],"study_design_scores_gemma":[0.0005883025,0.000114445415,0.0033325413,0.00016301172,0.000032699707,0.0000035143905,0.000046186986,0.38509852,0.000055214572,0.6089798,0.0011136576,0.00047207213],"about_ca_topic_score_codex":0.00016829727,"about_ca_topic_score_gemma":0.00051373703,"teacher_disagreement_score":0.79059523,"about_ca_system_score_codex":0.00013688671,"about_ca_system_score_gemma":0.00019035855,"threshold_uncertainty_score":0.99976283},"labels":[],"label_agreement":null},{"id":"W6908534628","doi":"10.3386/w31233","title":"The Aggregate Importance of Intermediate Input Substitutability","year":2023,"lang":"en","type":"report","venue":"National Bureau of Economic Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Stanford Institute for Economic Policy Research; HEC Montréal","keywords":"Aggregate (composite); Agrégation; Production (economics); Component (thermodynamics); Work (physics)","score_opus":0.4381251778231931,"score_gpt":0.5172616427501187,"score_spread":0.07913646492692555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6908534628","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042547245,0.010196156,0.0027331014,0.007387141,0.019225476,0.004204132,0.0011126099,0.0004312432,0.9121629],"genre_scores_gemma":[0.96076643,0.016932929,0.0039619873,0.000043156175,0.0024168068,0.00044266606,0.0004029382,0.000111093825,0.014921971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954783,0.00023602658,0.0010872917,0.00062934204,0.002121996,0.00044708283],"domain_scores_gemma":[0.9920479,0.0036903797,0.0006592025,0.0010290173,0.0024814832,0.00009198905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012403566,0.00018723405,0.00046480258,0.0005863866,0.0002506341,0.00012076512,0.0030501087,0.00021180238,0.000041310584],"category_scores_gemma":[0.0030821948,0.00015302058,0.00028003554,0.0006124168,0.0011415262,0.00024196133,0.001181564,0.0008358371,0.000076652235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021444865,0.000058108926,0.0028877505,0.00021781573,0.00017643718,0.00000788004,0.000094781746,0.00017302987,0.000014840694,0.95472413,0.02572972,0.015894076],"study_design_scores_gemma":[0.00017280826,0.000068650515,0.00742784,0.00014390913,0.0000038626436,0.00001007734,0.000015239582,0.005832035,0.00020055432,0.9725396,0.013422099,0.00016330047],"about_ca_topic_score_codex":0.00069465546,"about_ca_topic_score_gemma":0.0010069967,"teacher_disagreement_score":0.9182192,"about_ca_system_score_codex":0.00080978876,"about_ca_system_score_gemma":0.005177572,"threshold_uncertainty_score":0.918479},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018110583,0.000096632415,0.96955884,0.0021909007,0.0031725145,0.002257788,0.0012347624,0.00090543757,0.002472555],"genre_scores_gemma":[0.14570484,0.000049908955,0.84786963,0.0016082186,0.00093868707,0.0006011764,0.00081592874,0.00012786749,0.0022837352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623114,0.00005014262,0.0011785172,0.0006453251,0.00078661315,0.0011082921],"domain_scores_gemma":[0.9969827,0.00066656154,0.00014507443,0.001307973,0.0004449511,0.0004527483],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012238172,0.0004988511,0.00054804375,0.0007841131,0.0010021762,0.0019855527,0.0020743767,0.00021028053,0.00009856112],"category_scores_gemma":[0.00016474581,0.00046277844,0.0005828827,0.0011986283,0.00027690438,0.0023667691,0.000917914,0.0005379753,0.00078467804],"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.00026516567,0.00072941056,0.000057701036,0.0014384217,0.00050132285,0.000015585962,0.014943541,0.0007010068,0.00033875272,0.57467204,0.113034904,0.29330215],"study_design_scores_gemma":[0.0012625224,0.00052708946,0.00016580915,0.00037151534,0.00003675196,0.0001236199,0.00030977622,0.60751283,0.00083340146,0.064459436,0.32370645,0.00069082755],"about_ca_topic_score_codex":0.000026976793,"about_ca_topic_score_gemma":0.00001764626,"teacher_disagreement_score":0.6068118,"about_ca_system_score_codex":0.00025805627,"about_ca_system_score_gemma":0.0002238217,"threshold_uncertainty_score":0.9999933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40247455,0.00016854698,0.56441563,0.007472201,0.0037648655,0.0046912576,0.0013260514,0.0028290253,0.012857869],"genre_scores_gemma":[0.7741679,0.00014004059,0.21760914,0.00359829,0.000544538,0.0006916264,0.0010582195,0.00009021985,0.002100008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978239,0.000029745064,0.00064718956,0.00030739172,0.00051154697,0.00068025495],"domain_scores_gemma":[0.99866414,0.00016155699,0.00020300566,0.00055221724,0.00021094417,0.00020812835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056746555,0.00028850458,0.0003024207,0.0003521871,0.0005680503,0.0005664908,0.0009595277,0.00014282617,0.000020051124],"category_scores_gemma":[0.000058807782,0.0002631711,0.00015333826,0.00073825935,0.00019448122,0.0014783845,0.00078038365,0.00030481038,0.00021672448],"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.00014878798,0.0007412369,0.008416066,0.0017163913,0.00042420017,0.00006163817,0.022398671,0.00026548543,0.00019689767,0.7629217,0.059994146,0.14271481],"study_design_scores_gemma":[0.0043262136,0.0008047186,0.010116657,0.00027283782,0.000038722126,0.00034584437,0.0009434472,0.70824677,0.0011580087,0.072405085,0.20008159,0.0012601033],"about_ca_topic_score_codex":0.0000059445774,"about_ca_topic_score_gemma":0.0000072953994,"teacher_disagreement_score":0.7079813,"about_ca_system_score_codex":0.000054032866,"about_ca_system_score_gemma":0.00008892931,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W6925036136","doi":"10.15468/dl.ru2vsr","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Real world data; Data set","score_opus":0.024388405500497198,"score_gpt":0.23172240401211036,"score_spread":0.20733399851161316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925036136","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001543824,0.000011684826,0.000762277,0.00032569646,0.0017820955,0.00023190938,0.99633616,0.00047374147,0.000060989354],"genre_scores_gemma":[7.3106725e-7,0.000066775385,0.00003547592,0.00047222248,0.000002077044,0.00000417602,0.9994184,1.0374397e-8,1.6630175e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980691,0.00007050924,0.00040515745,0.0003600578,0.0006999031,0.00039527388],"domain_scores_gemma":[0.9981921,0.000045767294,0.00027119773,0.0010623821,0.00024527547,0.00018332916],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036859052,0.00030327807,0.00028614613,0.00018225255,0.00043066096,0.00046927435,0.0023213942,0.0002940618,0.00014238247],"category_scores_gemma":[0.00013241246,0.00032296265,0.00021034642,0.0010875094,0.00017298861,0.0018960404,0.0016046563,0.00036090577,0.49553454],"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.0000055168002,0.000024087834,0.00005819252,0.0000859131,0.00002265508,0.000005647653,0.00003529768,0.00000968029,5.0417612e-9,0.000004354164,0.99485874,0.0048899064],"study_design_scores_gemma":[0.00021321936,0.00003211251,0.00008403712,0.0000034376021,0.000014096578,0.0000064379515,0.000030140758,0.000008175698,8.16762e-7,0.00003769831,0.9992311,0.00033870898],"about_ca_topic_score_codex":0.000705929,"about_ca_topic_score_gemma":0.00002442524,"teacher_disagreement_score":0.49539217,"about_ca_system_score_codex":0.00020621998,"about_ca_system_score_gemma":0.00017100069,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W6927327761","doi":"10.34726/hss.2013.23219&lt;/div&gt;\\n&lt;/div&gt","title":"A new partition-based heuristic for the Steiner tree problem in large graphs","year":2013,"lang":"en","type":"article","venue":"reposiTUm (TU Wien)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Steiner tree problem; Heuristic; Tree (set theory); Greedy algorithm; Field (mathematics); Generalization; Class (philosophy); Set (abstract data type); Term (time)","score_opus":0.014380747554923863,"score_gpt":0.23388314958933323,"score_spread":0.21950240203440938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6927327761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048160874,0.0003323119,0.9875103,0.0044983905,0.0003842874,0.0010948232,0.0000063150464,0.00016824246,0.0011892365],"genre_scores_gemma":[0.9139323,0.0000064423916,0.08360667,0.0007692823,0.000095316274,0.00047136095,0.000007073087,0.000015899519,0.0010956175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984313,0.00006246427,0.0003488155,0.00042557894,0.0002666965,0.00046513064],"domain_scores_gemma":[0.99855155,0.00039581032,0.00011107133,0.00072579813,0.00009881576,0.00011695408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031787436,0.00017092488,0.00018527513,0.00013403574,0.00027269774,0.000298846,0.0007980887,0.00005633855,0.000036174366],"category_scores_gemma":[0.000050203696,0.0001227961,0.0001576167,0.00067043625,0.000048703445,0.0006713662,0.00012569348,0.0001598015,0.000044143075],"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.00003406888,0.0007182201,0.0068386393,0.00014790072,0.000082924686,0.00005195027,0.0014958476,0.0012162217,0.0013230884,0.8828822,0.020240908,0.08496805],"study_design_scores_gemma":[0.00228062,0.0003483963,0.031216193,0.00015562084,0.000031004256,0.000035234443,0.00004936257,0.59401023,0.0012576166,0.35216573,0.017908925,0.00054106314],"about_ca_topic_score_codex":0.00041921932,"about_ca_topic_score_gemma":0.0006749121,"teacher_disagreement_score":0.90911627,"about_ca_system_score_codex":0.000032602187,"about_ca_system_score_gemma":0.00012594988,"threshold_uncertainty_score":0.500748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11450892,0.00044368685,0.86340183,0.00435127,0.0044615376,0.003010039,0.0026936617,0.00090370013,0.0062253326],"genre_scores_gemma":[0.5642308,0.00007514454,0.43236768,0.0011353366,0.0003742426,0.00033019687,0.0007185279,0.000052473963,0.0007156037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965396,0.00013874844,0.0016063914,0.00045034898,0.00065148977,0.0006134455],"domain_scores_gemma":[0.99715406,0.0009294173,0.00032671433,0.0009837789,0.00033870892,0.00026735078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012015947,0.00041558614,0.0010636038,0.00052986084,0.00038368875,0.0008611758,0.0016491207,0.00016359043,0.0001660346],"category_scores_gemma":[0.0002539741,0.0003586535,0.0006770326,0.0008909397,0.00096698746,0.0015290739,0.00060850807,0.00038514743,0.0003972957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030983447,0.00062743877,0.0001487417,0.001027974,0.0018719279,0.00002243185,0.036008768,0.00029388428,0.0023045011,0.9001415,0.023485735,0.030968776],"study_design_scores_gemma":[0.036272533,0.000468739,0.00017687869,0.001250392,0.00028792612,0.00016942518,0.0012448813,0.40152746,0.014255566,0.46038282,0.08236941,0.0015939486],"about_ca_topic_score_codex":0.00021856815,"about_ca_topic_score_gemma":0.00002985791,"teacher_disagreement_score":0.44972187,"about_ca_system_score_codex":0.00011077483,"about_ca_system_score_gemma":0.00021316676,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W6930485136","doi":"10.5281/zenodo.12304255","title":"el mecánico de la espalda pdf descargar","year":2024,"lang":"es","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Bachelor; State (computer science)","score_opus":0.028042663558011386,"score_gpt":0.2690329688877634,"score_spread":0.24099030532975202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930485136","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000103607235,0.0011221616,0.05866702,0.0007646802,0.0006280504,0.00047332456,0.00026037538,0.0019032002,0.9360776],"genre_scores_gemma":[0.059648078,0.0043562623,0.02316751,0.0014708464,0.004767453,5.108419e-7,0.0021221451,0.03440871,0.8700585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956205,0.0012127636,0.00041391744,0.0011845573,0.0007493173,0.00081892643],"domain_scores_gemma":[0.9976915,0.00009395245,0.00019613614,0.001272946,0.00035993388,0.00038552296],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016723345,0.0004558939,0.0003813973,0.0007945138,0.0017260547,0.0054384265,0.0042501623,0.0003424178,0.08413587],"category_scores_gemma":[0.00052595406,0.0004964527,0.00023590372,0.0014811929,0.0006241409,0.00027125803,0.0049412604,0.0011502032,0.17998807],"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.000014824353,0.0001742976,7.267528e-7,0.00031152667,0.00016833007,0.00019241792,0.001464895,0.000018311142,0.00023679253,0.1935111,0.6718496,0.13205715],"study_design_scores_gemma":[0.00033324113,0.00020535254,0.000076532335,0.00043467127,0.000053789354,0.0005692964,0.0001130902,0.003888763,0.000092547365,0.011829133,0.9818916,0.00051202375],"about_ca_topic_score_codex":0.000047451445,"about_ca_topic_score_gemma":6.216688e-7,"teacher_disagreement_score":0.31004193,"about_ca_system_score_codex":0.00028483072,"about_ca_system_score_gemma":0.000023575512,"threshold_uncertainty_score":0.9997487},"labels":[],"label_agreement":null},{"id":"W6931625855","doi":"10.5683/sp3/oxjdb1","title":"UNI-CEN Boundaries (DBF-Original Shorelines) - Census Tract (CT) - 2006 - Esri Shapefile format (WGS84 / EPSG:4326)","year":2023,"lang":"en","type":"dataset","venue":"Borealis","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":"Western University","funders":"","keywords":"Shapefile; North American Datum of 1927; File format; Census; Documentation; Geocoding; Boundary (topology)","score_opus":0.03334873771499019,"score_gpt":0.28415834470722445,"score_spread":0.25080960699223426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931625855","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010993051,0.00053615513,0.002456043,0.0009840092,0.0027349978,0.0004640477,0.99133676,0.0008055912,0.0006714094],"genre_scores_gemma":[0.00000588866,0.00077735784,0.0056844736,0.0006293311,0.0011443492,0.000100533995,0.99125046,0.00006823548,0.00033936623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947695,0.00017210675,0.0010380276,0.0013278985,0.001362378,0.001330075],"domain_scores_gemma":[0.99567693,0.0003939847,0.00050006295,0.002738435,0.0002677013,0.00042288617],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007186536,0.00096562476,0.000996283,0.0006915422,0.0011796595,0.0023532568,0.004650707,0.00039531442,0.0001092171],"category_scores_gemma":[0.00019611366,0.000915637,0.0005102997,0.0013499019,0.0006689829,0.00093752966,0.0012803015,0.0012316637,0.00065870764],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013991828,0.00019035826,0.000007614874,0.00015899802,0.00008777619,0.00073729194,0.00009324426,0.000022148159,3.1263235e-7,0.0063442006,0.9856311,0.0067129736],"study_design_scores_gemma":[0.0004889562,0.00013204782,0.00022649686,0.00017656131,0.00008963258,0.0003278269,0.000041050385,0.003816161,0.000007719954,0.0062592602,0.9873638,0.0010704943],"about_ca_topic_score_codex":0.07190347,"about_ca_topic_score_gemma":0.01502894,"teacher_disagreement_score":0.05687453,"about_ca_system_score_codex":0.00020249051,"about_ca_system_score_gemma":0.00073801144,"threshold_uncertainty_score":0.99932945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042554606,0.00011532344,0.9899034,0.00041435097,0.0013257011,0.0028980728,0.00016783013,0.0004280819,0.00049179676],"genre_scores_gemma":[0.063192725,0.000047041547,0.9341657,0.0011703988,0.00014381592,0.00078778993,0.00022271274,0.00003236923,0.00023742947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974219,0.00008038471,0.00091439276,0.00045552084,0.00026055318,0.0008672344],"domain_scores_gemma":[0.9975665,0.00074276497,0.0003709543,0.00073256367,0.00042283544,0.00016436493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014326553,0.00042771501,0.0005352401,0.000388059,0.0008779722,0.0006990777,0.0009418864,0.00024021421,0.0000031569468],"category_scores_gemma":[0.00015647813,0.00041165616,0.0002463341,0.00093570264,0.00020653369,0.0017524813,0.00038873364,0.00032634026,0.0000040769783],"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.0006485818,0.00089268765,0.0009647448,0.002654632,0.0010613208,0.0000030671215,0.009934898,0.006464809,0.00035684954,0.6561592,0.019670654,0.30118853],"study_design_scores_gemma":[0.002930622,0.00032274702,0.00020818778,0.00013331007,0.000042436026,0.000014736204,0.00022320129,0.88780296,0.0017490165,0.098231815,0.007890867,0.000450082],"about_ca_topic_score_codex":0.000024232853,"about_ca_topic_score_gemma":0.00001092706,"teacher_disagreement_score":0.8813382,"about_ca_system_score_codex":0.000089569425,"about_ca_system_score_gemma":0.00013068141,"threshold_uncertainty_score":0.9998335},"labels":[],"label_agreement":null},{"id":"W6948961494","doi":"10.5281/zenodo.10800642","title":"Galled Perfect Transfer Networks","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Université de Sherbrooke","funders":"","keywords":"Transfer (computing); Table (database); Upper and lower bounds; Imperfect","score_opus":0.031928593006099244,"score_gpt":0.23853445751643879,"score_spread":0.20660586451033955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948961494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009284681,0.0004702862,0.9388832,0.0009604242,0.00038303042,0.00021546193,0.00002091878,0.0024836878,0.055654515],"genre_scores_gemma":[0.99464315,0.00020069175,0.0024487418,0.00024551668,0.00034317953,5.1642232e-8,0.00021435106,0.0008418,0.001062525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984784,0.00022497585,0.00017333683,0.00047708256,0.00029889186,0.00034730823],"domain_scores_gemma":[0.99916184,0.00004073265,0.000011955642,0.00048323307,0.00016491741,0.00013732244],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006119343,0.00012584079,0.00010990134,0.0002221983,0.0014138825,0.0022639036,0.0016480788,0.000050908067,0.0043581473],"category_scores_gemma":[0.000067342335,0.00012463461,0.00009096376,0.0009870322,0.000104543666,0.00045366742,0.00084389513,0.0003301278,0.0031313398],"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.000011685669,0.000074172174,4.3066206e-7,0.000056832014,0.000053243657,0.00006706729,0.0012859256,0.0004036678,0.0005276683,0.2984029,0.08851995,0.6105965],"study_design_scores_gemma":[0.00015998376,0.00013359098,0.00006784072,0.000037586768,0.000005913719,0.0001465504,0.00002167424,0.157593,0.00009741069,0.002351718,0.83922863,0.0001561052],"about_ca_topic_score_codex":0.0000046228974,"about_ca_topic_score_gemma":1.6427859e-7,"teacher_disagreement_score":0.9937147,"about_ca_system_score_codex":0.000059852955,"about_ca_system_score_gemma":0.0000036786655,"threshold_uncertainty_score":0.99988616},"labels":[],"label_agreement":null},{"id":"W6949890927","doi":"10.5281/zenodo.16782810","title":"Data for Efficient Volume Computation for SMT Formulas (KR-25 paper)","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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 Toronto","funders":"","keywords":"Computation; Volume (thermodynamics); Artifact (error); Term (time)","score_opus":0.05883467154912076,"score_gpt":0.2913341506859124,"score_spread":0.23249947913679164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949890927","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013670531,0.00006602054,0.4618947,0.00052758376,0.00043814973,0.0010498542,0.53502226,0.00037471813,0.00062536827],"genre_scores_gemma":[0.000056740784,0.00007218019,0.01496402,0.0003647937,0.00031776144,7.413707e-7,0.9833149,0.00037520417,0.0005336917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965922,0.0002446939,0.0005676058,0.0013467981,0.000587743,0.0006609284],"domain_scores_gemma":[0.9957344,0.00022667459,0.00030917057,0.0024849204,0.001052796,0.00019206556],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014078123,0.00035636048,0.00039536416,0.0005463554,0.0032761649,0.0021714813,0.00787946,0.00017017977,0.00065018615],"category_scores_gemma":[0.0013392797,0.0003928931,0.00016208511,0.00093168725,0.00016111026,0.000510342,0.0076047424,0.0004122187,0.000479733],"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.000033917277,0.00019273927,1.7937133e-8,0.0004120478,0.00007086626,0.0000032946512,0.00006676553,0.00038830106,0.000009427225,0.0059600007,0.92499346,0.06786919],"study_design_scores_gemma":[0.00072387356,0.00025883398,0.0000056090635,0.00009813615,0.000046142042,0.000022300906,0.00002443592,0.14842409,0.000006551444,0.0013063025,0.84873825,0.00034547044],"about_ca_topic_score_codex":0.000028337312,"about_ca_topic_score_gemma":0.0000030994438,"teacher_disagreement_score":0.4482926,"about_ca_system_score_codex":0.00018393667,"about_ca_system_score_gemma":0.000034245764,"threshold_uncertainty_score":0.9998523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12974624,0.00052838237,0.8624513,0.00060896843,0.0016085547,0.0006391715,0.00021180224,0.0003514695,0.0038540876],"genre_scores_gemma":[0.9636811,0.000091250186,0.035701595,0.0001801937,0.00010958108,0.000029206603,0.00006114789,0.000015492196,0.0001304607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836254,0.000023683171,0.0007121486,0.0002307889,0.00032093612,0.00034992333],"domain_scores_gemma":[0.99900305,0.00020869619,0.00014916465,0.00042307592,0.00011466923,0.00010133726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493315,0.00022432157,0.00028275576,0.0003304254,0.00021635326,0.000558895,0.0005814659,0.00010225224,0.000015744617],"category_scores_gemma":[0.000045766366,0.0001986373,0.00016183723,0.0003974508,0.000105945575,0.0018996593,0.00032687717,0.00022533876,0.000020609967],"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.000045040182,0.00023902202,0.0034337381,0.002302725,0.0003180376,0.000016850901,0.03681292,0.00024339082,0.0008578907,0.62848556,0.0035975447,0.3236473],"study_design_scores_gemma":[0.0010826517,0.00034331606,0.0014263823,0.00047012375,0.00003887274,0.000118746284,0.0005851778,0.91897243,0.004662583,0.014852019,0.05693542,0.00051227806],"about_ca_topic_score_codex":0.000016946567,"about_ca_topic_score_gemma":0.00002015215,"teacher_disagreement_score":0.91872907,"about_ca_system_score_codex":0.000038047256,"about_ca_system_score_gemma":0.00005567575,"threshold_uncertainty_score":0.81001943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029194694,0.000047194244,0.966928,0.00025501958,0.000421904,0.0018369018,0.00034035405,0.0004011286,0.0005748206],"genre_scores_gemma":[0.11016947,0.00007754318,0.88769215,0.00049531186,0.00018901358,0.0005052547,0.00022884276,0.00006438763,0.0005779997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735767,0.000052279524,0.0009390584,0.0003591136,0.00042595292,0.0008659225],"domain_scores_gemma":[0.99750507,0.0007907628,0.0004503472,0.00067860476,0.00038444065,0.00019075452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009490837,0.00039397637,0.0006268443,0.00025704887,0.00038987308,0.00031633847,0.0008700575,0.00015138449,0.000012455983],"category_scores_gemma":[0.00006807434,0.00031785207,0.0001807335,0.001020004,0.00029514442,0.0010466304,0.0003834827,0.0001986859,0.000017680804],"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.002629388,0.0015188414,0.018947458,0.0054078586,0.0027917644,0.00009881083,0.0378343,0.01871203,0.00038616615,0.5148927,0.05764626,0.3391344],"study_design_scores_gemma":[0.005837636,0.0011439287,0.0008744319,0.0005552626,0.0000868662,0.00021643845,0.0009099095,0.9455326,0.0016570997,0.023296759,0.019027498,0.00086154393],"about_ca_topic_score_codex":0.000012024392,"about_ca_topic_score_gemma":0.000010502498,"teacher_disagreement_score":0.9268206,"about_ca_system_score_codex":0.00003228383,"about_ca_system_score_gemma":0.00011606295,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W6976528289","doi":"10.60692/c4e3b-jf440","title":"Consensus Guidelines for the Definition of Time-to-Event End Points in Image-guided Tumor Ablation: Results of the SIO and DATECAN Initiative","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","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":"St. Thomas Hospital","funders":"","keywords":"Delphi method; Delphi; Consensus conference; Appropriateness criteria; Outcome (game theory); MEDLINE; Quality (philosophy); Conflict of interest","score_opus":0.11306084619515358,"score_gpt":0.27971552220949564,"score_spread":0.16665467601434206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976528289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40645093,0.000033406974,0.57246643,0.009490053,0.0009167605,0.0026277094,0.002031691,0.00012342847,0.0058595566],"genre_scores_gemma":[0.9763639,2.4227157e-7,0.02318072,0.00036074893,0.000021416865,0.000036152698,0.000013433565,0.0000029812018,0.000020406018],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984866,0.000115702474,0.0008998868,0.00013075174,0.0002509575,0.00011612657],"domain_scores_gemma":[0.99800205,0.00014159537,0.00046458968,0.0004227422,0.00094039296,0.000028621524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595578,0.00009846788,0.00018079628,0.00012280981,0.00010984636,0.00007830246,0.00027969503,0.000029562956,0.000004451139],"category_scores_gemma":[0.00041494222,0.00006316602,0.000060646573,0.00046042475,0.00006584326,0.000265959,0.00021123326,0.000050761882,0.000012607225],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015930285,0.00012756669,0.030880095,0.005651357,0.0007797363,0.00004076377,0.76389986,0.018100118,0.0007654481,0.122988276,0.024108404,0.03106534],"study_design_scores_gemma":[0.009073069,0.000280494,0.18802676,0.002489156,0.00008731095,0.0003847488,0.025449442,0.73471975,0.03486087,0.0022892943,0.0016186419,0.00072044303],"about_ca_topic_score_codex":0.000015749229,"about_ca_topic_score_gemma":0.0000023967737,"teacher_disagreement_score":0.7384504,"about_ca_system_score_codex":0.00002817574,"about_ca_system_score_gemma":0.000094429684,"threshold_uncertainty_score":0.25758356},"labels":[],"label_agreement":null},{"id":"W6976963569","doi":"10.6084/m9.figshare.c.6946243.v1","title":"Alterations to the bovine bacterial ocular surface microbiome in the context of infectious bovine keratoconjunctivitis","year":2024,"lang":"en","type":"other","venue":"Figshare","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 Saskatchewan","funders":"","keywords":"Keratoconjunctivitis; Moraxella; Context (archaeology); Polymerase chain reaction; Ribosomal RNA; Microbiome","score_opus":0.021833958259665553,"score_gpt":0.2516233448364871,"score_spread":0.22978938657682152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976963569","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003319996,0.00744053,0.002754695,0.010638795,0.0056320215,0.00819406,0.8185859,0.0010580871,0.14536396],"genre_scores_gemma":[0.13030316,0.00015250634,0.013867514,0.02305368,0.01273533,0.00631873,0.20171267,0.002592646,0.6092638],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986797,0.00015685408,0.00026205476,0.0004354098,0.00022765246,0.00023835807],"domain_scores_gemma":[0.99872124,0.0001340933,0.00012444139,0.0009213615,0.000058351525,0.00004050976],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014411574,0.00026028435,0.00029283416,0.00021105452,0.000071302726,0.000384436,0.0013502038,0.00013045406,0.026862135],"category_scores_gemma":[0.00012369157,0.00017058101,0.000148143,0.0009089197,0.000020939331,0.00009223638,0.00048685275,0.00031974417,0.0022621143],"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.000002478293,0.00003911293,9.270593e-7,0.000110188674,0.00003519899,0.000024225148,0.00075207325,0.0000050088656,0.00006633428,0.00059818925,0.99679375,0.0015725117],"study_design_scores_gemma":[0.00017964983,0.00012830456,0.000031648156,0.0013811737,0.000007951155,0.0000311763,0.000022860377,0.00043242052,0.00013066968,0.00015546485,0.99729043,0.00020824865],"about_ca_topic_score_codex":0.00027004298,"about_ca_topic_score_gemma":0.0021773495,"teacher_disagreement_score":0.6168732,"about_ca_system_score_codex":0.00003064249,"about_ca_system_score_gemma":0.00010062739,"threshold_uncertainty_score":0.9985147},"labels":[],"label_agreement":null},{"id":"W6987960037","doi":"","title":"Variants of Pseudo-deterministic Algorithms and Duality in TFNP","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"Blackberry (Canada)","funders":"","keywords":"Randomized algorithm; Bounded function; Deterministic algorithm; Quantum algorithm; Verifiable secret sharing; Relaxation (psychology); Duality (order theory); Search algorithm; Perspective (graphical)","score_opus":0.020996894585441246,"score_gpt":0.2356262123878076,"score_spread":0.21462931780236635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987960037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978762,0.0000577888,0.00064795546,0.00023679774,0.0005869964,0.00020940034,0.00005719866,0.000079050755,0.0002485729],"genre_scores_gemma":[0.5370921,0.0011063117,0.11894167,0.00004187714,0.00011987504,0.0000030813362,0.00052429,0.00009776571,0.34207302],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99856997,0.000098664146,0.00022022193,0.0005144692,0.00033136358,0.00026530653],"domain_scores_gemma":[0.998889,0.00012500447,0.0002923897,0.0004930715,0.00011715493,0.00008335376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003266873,0.00021413669,0.0005225302,0.0005343272,0.00010997574,0.000029360137,0.0008841678,0.00022472804,0.000021705366],"category_scores_gemma":[0.000027238375,0.00026519466,0.00011914021,0.0006097738,0.00014754428,0.0002736443,0.0002986196,0.0002486392,0.000012321834],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036720507,0.00094285037,0.004397641,0.004820796,0.00051946426,0.0015621776,0.7462677,0.00010699289,0.0038912995,0.03382784,0.0013313567,0.2019647],"study_design_scores_gemma":[0.0035590928,0.0008076511,0.7194211,0.0021091895,0.00022830383,0.000036139936,0.13303363,0.093378164,0.0012732662,0.04416641,0.00018493082,0.0018021255],"about_ca_topic_score_codex":0.024813011,"about_ca_topic_score_gemma":0.024604185,"teacher_disagreement_score":0.71502346,"about_ca_system_score_codex":0.00003017963,"about_ca_system_score_gemma":0.00009834794,"threshold_uncertainty_score":0.99998003},"labels":[],"label_agreement":null},{"id":"W6989107854","doi":"","title":"Algorithmic embeddings","year":2006,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Sequence (biology); Set (abstract data type); Matching (statistics); Algebra over a field; Field (mathematics); Key (lock); Stability (learning theory); Feature (linguistics)","score_opus":0.009857931847348947,"score_gpt":0.24944986277631098,"score_spread":0.23959193092896203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989107854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24251948,0.023368265,0.436959,0.021949466,0.055312887,0.0072550513,0.0012666997,0.019083213,0.19228594],"genre_scores_gemma":[0.15766807,0.00068927463,0.80627835,0.00026705442,0.0007438617,0.0004749125,0.0015208892,0.0002818387,0.032075774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956443,0.000035207173,0.001034189,0.0014473036,0.0009184075,0.0009206016],"domain_scores_gemma":[0.995962,0.000043437587,0.0010475714,0.0023533269,0.0004614279,0.00013218471],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00027936505,0.00089176267,0.0011969202,0.0028137986,0.00039710468,0.00017637569,0.0046716398,0.0017362775,0.00003127433],"category_scores_gemma":[0.00016571305,0.0009581039,0.0005132369,0.0030852193,0.00057996763,0.0008746982,0.00057005405,0.0015353757,0.00008413432],"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.000043695927,0.00082035945,0.000645525,0.00086879096,0.000771814,0.0004722984,0.00079783495,0.00016237417,0.004909432,0.47630543,0.04023845,0.473964],"study_design_scores_gemma":[0.0018134144,0.00046175823,0.0017517986,0.0014009896,0.00026555557,0.00014758186,0.00024988514,0.0075299847,0.046710756,0.10883752,0.82794446,0.0028862937],"about_ca_topic_score_codex":0.00018877386,"about_ca_topic_score_gemma":0.0004625887,"teacher_disagreement_score":0.787706,"about_ca_system_score_codex":0.00018789829,"about_ca_system_score_gemma":0.0004339932,"threshold_uncertainty_score":0.9995597},"labels":[],"label_agreement":null},{"id":"W7024048979","doi":"","title":"Politique institutionnelle d'évaluation des apprentissages du Collège MultiHexa Québec","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Power (physics); Politics; Context (archaeology); Field (mathematics); Feature (linguistics)","score_opus":0.027938165970894893,"score_gpt":0.24488069018461817,"score_spread":0.2169425242137233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024048979","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035231527,0.027241457,0.14191762,0.038172133,0.0019180871,0.0022710727,0.0011326812,0.00086525216,0.7512502],"genre_scores_gemma":[0.2330222,0.004305944,0.038092412,0.0024742535,0.0024418526,0.0006496261,0.00019710047,0.00045251424,0.7183641],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.992486,0.0009705465,0.0013258879,0.0016797258,0.00252345,0.0010143834],"domain_scores_gemma":[0.98967487,0.0069225268,0.0010588203,0.0011852806,0.00046105174,0.00069743715],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012127546,0.0012270787,0.0009977409,0.0018851763,0.001160163,0.0014248061,0.0028234345,0.0003429769,0.012862824],"category_scores_gemma":[0.00573634,0.0012969788,0.00060868653,0.002212923,0.0023403696,0.0018207346,0.0018242553,0.00087587413,0.001435197],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00022578574,0.0030334352,0.044286035,0.00090797106,0.001207377,0.00017506993,0.048693337,0.0036230336,0.00041173477,0.42329705,0.4469609,0.02717829],"study_design_scores_gemma":[0.0020101434,0.00028731488,0.06766408,0.0008348195,0.00015843767,0.00022928638,0.00027437753,0.03451527,0.00019348809,0.0068018096,0.8856087,0.0014223069],"about_ca_topic_score_codex":0.61970466,"about_ca_topic_score_gemma":0.98853666,"teacher_disagreement_score":0.43864778,"about_ca_system_score_codex":0.010211589,"about_ca_system_score_gemma":0.11950846,"threshold_uncertainty_score":0.9996118},"labels":[],"label_agreement":null},{"id":"W7024536365","doi":"","title":"Sitting Room Stories by Lindsay Zier-Vogel","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sitting; Queen (butterfly); Exhibition; Craft; Clothing","score_opus":0.005985769966687052,"score_gpt":0.18370879007493957,"score_spread":0.17772302010825253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024536365","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069713383,0.0010521658,0.00027506423,0.00021535034,0.00072762073,0.00027879933,0.00016307126,0.0004930584,0.9967879],"genre_scores_gemma":[0.0001134241,0.00009544308,0.019077731,0.0002606587,0.00028005676,0.000011838332,0.000166151,0.000085224056,0.9799095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778295,0.00008223216,0.00071194366,0.00035466795,0.0006351353,0.00043305173],"domain_scores_gemma":[0.99814767,0.00015761974,0.00072634337,0.00069719576,0.00014927168,0.00012192309],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028690344,0.0004293317,0.00048163589,0.00012667493,0.00015555028,0.00021080885,0.0012057388,0.00041590142,0.028721072],"category_scores_gemma":[0.000073095194,0.0004460205,0.00021507069,0.000025013722,0.00013374195,6.930125e-7,0.00032793,0.00039123837,0.0027972166],"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.000006421469,0.00004995771,0.0000020978555,0.0001568378,0.000040092003,0.000011732052,0.00018680937,0.00010379955,2.5280724e-7,0.00037942614,0.99308896,0.005973612],"study_design_scores_gemma":[0.00032772456,0.00009175666,0.0000029297357,0.00015559155,0.000019663725,0.000037909937,0.000047937294,0.00037029258,0.000019124798,0.000106428386,0.99834794,0.00047267863],"about_ca_topic_score_codex":0.0062245093,"about_ca_topic_score_gemma":0.00079404213,"teacher_disagreement_score":0.025923854,"about_ca_system_score_codex":0.0000515996,"about_ca_system_score_gemma":0.000042210915,"threshold_uncertainty_score":0.99979913},"labels":[],"label_agreement":null},{"id":"W7028837214","doi":"","title":"1967 House Bill 4679. An Act Authorizing The Board Of Trustees Of State Colleges To Acquire A Certain Parcel Of Land In The Town Of Bridgewater, And To Convey A Certain Parcel Of Land In Said Town To The Roman Catholic Archbishop Of Boston In Exchange Therefor.","year":2016,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Legislature; State (computer science); Legislative assembly; State legislature; Legislation; Quarter (Canadian coin)","score_opus":0.013328335664568446,"score_gpt":0.23449944616265772,"score_spread":0.22117111049808927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028837214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98398525,0.0018343951,0.00015475157,0.003929461,0.00016050153,0.0029555587,0.0013627954,0.00008036031,0.00553692],"genre_scores_gemma":[0.9848278,0.0014589569,0.0014321898,0.0001924023,0.00006524327,0.00014375847,0.000040623807,0.00025345146,0.011585563],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99361014,0.0016753143,0.0019794994,0.00090407033,0.00085044676,0.0009805385],"domain_scores_gemma":[0.9955815,0.00080191134,0.0015298298,0.001838668,0.000060123584,0.00018793961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027406,0.00068143423,0.0017588192,0.0015299997,0.00007195093,0.000090630994,0.0032896884,0.00018504527,0.000049493796],"category_scores_gemma":[0.00003555157,0.00039231937,0.00024752002,0.0015134504,0.0006944166,0.0009630323,0.0010051536,0.0005025803,4.6189186e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012023736,0.0043222606,0.41861087,0.0083213085,0.001696465,0.0003580181,0.39863765,0.0023045465,0.05161352,0.006196347,0.041532356,0.0543829],"study_design_scores_gemma":[0.016012745,0.02506625,0.2679797,0.01590854,0.00038069132,0.0001694043,0.0067397007,0.004069512,0.41006172,0.032645863,0.2157627,0.0052031484],"about_ca_topic_score_codex":0.0074265185,"about_ca_topic_score_gemma":0.0024555065,"teacher_disagreement_score":0.39189795,"about_ca_system_score_codex":0.000047105164,"about_ca_system_score_gemma":0.0006380564,"threshold_uncertainty_score":0.9998529},"labels":[],"label_agreement":null},{"id":"W7039554618","doi":"","title":"LL.D. citation for Hon. Brian Lennox, 12 June 2007","year":2007,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Citation analysis; Bibliometrics","score_opus":0.025183137492322448,"score_gpt":0.26423547779048384,"score_spread":0.2390523402981614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039554618","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001254926,0.00032747324,0.5608525,0.00019328822,0.0037329532,0.00091145234,0.00043131117,0.0005700409,0.4329684],"genre_scores_gemma":[0.00033296054,0.00012689152,0.16730742,0.00075403677,0.0018013727,0.00014776543,0.0005645381,0.000449854,0.8285152],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946817,0.00028038927,0.0010115822,0.0019051174,0.00077987195,0.001341351],"domain_scores_gemma":[0.99621004,0.0009606103,0.00076239026,0.0015050316,0.00008995796,0.00047199515],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006221637,0.001056343,0.0009882944,0.0024534154,0.00008705762,0.00048644267,0.0041570393,0.0003281237,0.0028174443],"category_scores_gemma":[0.00012346198,0.0010837071,0.00086171756,0.00036677765,0.0005679517,0.00028740184,0.0015241317,0.0009933155,0.0014770486],"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.00012262272,0.00018617466,0.00004770297,0.000183986,0.00035363156,0.00007265953,0.0017830036,0.00000525751,0.000055108376,0.0925421,0.89541143,0.009236344],"study_design_scores_gemma":[0.001228349,0.00040569933,0.00015811247,0.0010466274,0.000057541492,0.000070011374,0.000029698884,0.024905724,0.00030421856,0.029477041,0.94118315,0.0011338453],"about_ca_topic_score_codex":0.0044871992,"about_ca_topic_score_gemma":0.01763657,"teacher_disagreement_score":0.39554673,"about_ca_system_score_codex":0.000083935665,"about_ca_system_score_gemma":0.00013664489,"threshold_uncertainty_score":0.9993004},"labels":[],"label_agreement":null},{"id":"W7039988198","doi":"","title":"Nouvelles normes financières / New financial standards","year":2010,"lang":"fr","type":"other","venue":"OpenEdition (OpenEdition)","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lien; Quarter (Canadian coin); Financial management","score_opus":0.017611868905331934,"score_gpt":0.24818968609001235,"score_spread":0.23057781718468043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039988198","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031679278,0.0039627957,0.35095072,0.0789391,0.040511765,0.0023186076,0.005260998,0.0007188801,0.51702034],"genre_scores_gemma":[0.0034199655,0.0024778568,0.11855519,0.035456907,0.01838964,0.00048685024,0.0019683102,0.00049087696,0.81875443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924457,0.00032446263,0.001344084,0.0021092747,0.0023300513,0.0014464462],"domain_scores_gemma":[0.994602,0.00042190822,0.001020774,0.0019520543,0.0011127492,0.00089051406],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0010498094,0.0013983448,0.0013641978,0.000757049,0.0014750839,0.0018445709,0.0033627527,0.0015299695,0.10040234],"category_scores_gemma":[0.00089362735,0.0015040869,0.0007328074,0.0013516139,0.00096691254,0.011866298,0.0012889411,0.0019670932,0.0057922066],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044728196,0.0002831866,0.000017638067,0.000114329094,0.000060333357,0.00013183296,0.0002189594,0.000038579947,0.00006274811,0.55091095,0.32025304,0.12786366],"study_design_scores_gemma":[0.0016334935,0.00051359565,0.0069752787,0.0011061606,0.00011435371,0.00017369381,0.00003997487,0.00090705964,0.0012290359,0.038738217,0.9468198,0.0017493533],"about_ca_topic_score_codex":0.0009456119,"about_ca_topic_score_gemma":0.031647958,"teacher_disagreement_score":0.62656677,"about_ca_system_score_codex":0.00039598622,"about_ca_system_score_gemma":0.0054712724,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W7042847394","doi":"","title":"On the resilient behaviour of unbound aggregates","year":2000,"lang":"en","type":"article","venue":"NPARC","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Saud University; National Science Foundation","keywords":"Modulus; Aggregate (composite); Factorial experiment; Elastic modulus; Young's modulus; Granular material; Dynamic modulus; Triaxial shear test; Resilience (materials science)","score_opus":0.01771136611647199,"score_gpt":0.23638809322063672,"score_spread":0.21867672710416475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042847394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9126183,0.000075252545,0.003403409,0.0039279982,0.00019148737,0.00013998013,0.0000057464786,0.000077415134,0.07956041],"genre_scores_gemma":[0.99196243,0.000019686895,0.00657525,0.00030906915,0.000021481152,0.000005833367,4.5566776e-7,0.0000031221773,0.0011026779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930865,0.000045303903,0.000117245785,0.00016284767,0.00022695794,0.00013900662],"domain_scores_gemma":[0.99923515,0.0001560014,0.000034107183,0.0005186938,0.00002466114,0.000031400326],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016607062,0.00006591958,0.00007511632,0.000034705976,0.000117511445,0.00004832513,0.00074331835,0.000021020694,0.0010197702],"category_scores_gemma":[0.000016714483,0.000043987668,0.000056040437,0.00024064379,0.00010515374,0.00006704858,0.00006927057,0.000094943025,0.000075435404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074655454,0.00012328487,0.00021481549,0.0000029308803,0.0000074792792,0.0000068545987,0.00047457323,0.000048552676,0.00038506,0.82278055,0.0041931192,0.17175533],"study_design_scores_gemma":[0.0002561866,0.00026962822,0.009523345,0.00006922179,0.0000064541246,0.000013658979,0.000030535837,0.014021233,0.014225398,0.94987243,0.011522126,0.00018976195],"about_ca_topic_score_codex":0.000016567039,"about_ca_topic_score_gemma":0.0000046121418,"teacher_disagreement_score":0.17156556,"about_ca_system_score_codex":0.000008489539,"about_ca_system_score_gemma":0.000018363047,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W7043540244","doi":"","title":"Succinct Data Structures for Chordal Graphs","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"University of Waterloo","keywords":"Chordal graph; Interval graph; Neighbourhood (mathematics); Shortest path problem; Vertex (graph theory); Distance; Longest path problem; Graph; Induced path","score_opus":0.025651131041929152,"score_gpt":0.2386570289104132,"score_spread":0.21300589786848406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043540244","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96034926,0.00064343325,0.027464202,0.0015391574,0.0054273787,0.0017327887,0.001350646,0.00038679942,0.0011063141],"genre_scores_gemma":[0.08140492,0.0004183285,0.37524194,0.000115162264,0.00025096937,0.0000021404937,0.012205599,0.00010456798,0.5302564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998291,0.00004571048,0.00014122657,0.0008274085,0.0003548869,0.0003397545],"domain_scores_gemma":[0.9975696,0.00009719632,0.0002874759,0.001761007,0.00019545473,0.000089253794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001978162,0.00028059032,0.00046189336,0.00038459073,0.00028104463,0.00008185491,0.004307103,0.00026144728,0.00006862078],"category_scores_gemma":[0.000016645608,0.0003202176,0.00023106592,0.00032342534,0.000075653814,0.00071075815,0.0005776713,0.0002552469,0.000019815054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000996405,0.0005131256,0.0014609116,0.004230816,0.0017477439,0.00012511059,0.22299832,0.00020467314,0.003268826,0.43942404,0.074965075,0.25006497],"study_design_scores_gemma":[0.014642814,0.0030805368,0.08291123,0.0017714464,0.0018278615,0.00006760724,0.24464898,0.19646649,0.008190434,0.34553283,0.0921298,0.008729969],"about_ca_topic_score_codex":0.009335289,"about_ca_topic_score_gemma":0.017920906,"teacher_disagreement_score":0.87894434,"about_ca_system_score_codex":0.00002769224,"about_ca_system_score_gemma":0.00014618401,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W7084153732","doi":"10.6084/m9.figshare.30109760.v1","title":"Additional file 1 of Trends in maternal mortality and stillbirths by county in health facility data, Kenya, 2011-2022","year":2025,"lang":"en","type":"article","venue":"Figshare","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 Manitoba","funders":"","keywords":"Health facility; Perinatal mortality; Fetal death; Population; Maternal health; Pregnancy","score_opus":0.057874356744398996,"score_gpt":0.3062634764698677,"score_spread":0.24838911972546868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084153732","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018582064,0.00014416715,0.000029763418,0.00015382445,0.000029809315,0.00006626603,0.9988388,0.000023716548,0.00052785367],"genre_scores_gemma":[0.002743521,0.0000032336059,0.001111646,0.00022362696,0.000009653761,0.000095783886,0.99532425,0.000001911779,0.00048639433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878764,0.00008035215,0.00030873794,0.0004136198,0.00021611141,0.00019352093],"domain_scores_gemma":[0.9988781,0.00036912272,0.00010503598,0.0005642725,0.000033484775,0.00004995135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013448951,0.00009846562,0.0001888321,0.0001680516,0.000048056925,0.000042079777,0.00074898585,0.000043643104,0.8726132],"category_scores_gemma":[0.00023137075,0.000105210755,0.000023511378,0.00042875716,0.000022226941,0.00030957983,0.0006935433,0.00017342552,0.00003903176],"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.0000022337135,0.000049040675,0.00039325227,0.00007809835,0.0000039821907,0.0000038660282,0.0000203556,0.0000027565873,2.282128e-7,0.00006901545,0.9773973,0.021979827],"study_design_scores_gemma":[0.00016468056,0.000017811191,0.3428466,0.0005533888,3.3999112e-7,0.0000019067306,0.0000064636215,0.015520023,0.000005100781,0.0008497061,0.63994277,0.00009119797],"about_ca_topic_score_codex":0.00063399953,"about_ca_topic_score_gemma":0.001114961,"teacher_disagreement_score":0.8725742,"about_ca_system_score_codex":0.000048906393,"about_ca_system_score_gemma":0.00015442588,"threshold_uncertainty_score":0.429037},"labels":[],"label_agreement":null},{"id":"W7091187777","doi":"","title":"The Branch-and-Bound Tree Closure","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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":"Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Hierarchy; Knapsack problem; Tree (set theory); Closure (psychology); Branching (polymer chemistry); Computational complexity theory; Linear programming; Integer programming","score_opus":0.024061339789402152,"score_gpt":0.25960561717554353,"score_spread":0.2355442773861414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091187777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90535146,0.0023087934,0.06010282,0.014223613,0.0014459037,0.00015968765,0.0000016135575,0.00022009443,0.016186034],"genre_scores_gemma":[0.99418074,0.00012699232,0.0011700318,0.0010355276,0.00008052957,0.000010874319,4.941687e-7,0.000003894887,0.0033908978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991676,0.0000509133,0.00014744111,0.0002754115,0.00012673008,0.00023190142],"domain_scores_gemma":[0.9990422,0.00026061953,0.000034271838,0.0005800003,0.000039848997,0.000043025753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025092426,0.000102322854,0.00010332996,0.000050335013,0.0005626856,0.00020067953,0.000830769,0.000042311123,0.0000053692725],"category_scores_gemma":[0.00005099188,0.000073171424,0.000065615735,0.00043674052,0.00017071805,0.000180059,0.0003778767,0.00016792519,0.000040490406],"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.0000070233177,0.000043745305,0.2697236,0.000015798214,0.000057873967,0.0000086101745,0.00038833427,0.0000025850704,0.0002952773,0.45448637,0.004785832,0.27018496],"study_design_scores_gemma":[0.00035169226,0.00003972098,0.7534383,0.000029874785,0.000009728801,0.000007852236,0.00003156256,0.0022916796,0.0010070754,0.10422814,0.13840161,0.00016276338],"about_ca_topic_score_codex":0.0000295948,"about_ca_topic_score_gemma":0.000106658204,"teacher_disagreement_score":0.4837147,"about_ca_system_score_codex":0.000012113425,"about_ca_system_score_gemma":0.000044360906,"threshold_uncertainty_score":0.43277794},"labels":[],"label_agreement":null},{"id":"W7092316957","doi":"","title":"Decoding Balanced Linear Codes With Preprocessing","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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; National Research Foundation Singapore; National Research Foundation","keywords":"Decoding methods; Hamming code; Linear code; Error detection and correction; Preprocessor; Decodes; Code (set theory); Set (abstract data type); Cryptography; Hamming distance","score_opus":0.041778495898573305,"score_gpt":0.29439412298193485,"score_spread":0.25261562708336155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092316957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5044953,0.0013834839,0.48600227,0.001277753,0.0013498269,0.00025637905,0.000004891099,0.00025209622,0.004977958],"genre_scores_gemma":[0.9473933,0.00016041957,0.049256817,0.0010647356,0.00025914222,0.00002351682,0.00000325137,0.0000221278,0.0018166744],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966763,0.00013019503,0.00060297834,0.0013286537,0.0004203765,0.00084149046],"domain_scores_gemma":[0.99764025,0.000303792,0.00026424983,0.0012886719,0.0003227354,0.00018027888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005534759,0.00046432836,0.00054596167,0.00029636684,0.0011005768,0.00047941162,0.0016584971,0.00016514535,0.00007169269],"category_scores_gemma":[0.0001611381,0.00043418896,0.00015947015,0.0023085154,0.00046937607,0.00093046913,0.0008704701,0.0006101405,0.00009561391],"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.00012362056,0.00041586274,0.8361715,0.0005515026,0.00029240537,0.0001092651,0.0022717838,0.0011755483,0.0013794688,0.013254946,0.00042577504,0.14382833],"study_design_scores_gemma":[0.0023921242,0.000422329,0.24772818,0.0037965872,0.00017189648,0.000053842432,0.00040979675,0.70431215,0.024406867,0.0063695735,0.008504431,0.0014322457],"about_ca_topic_score_codex":0.0000587591,"about_ca_topic_score_gemma":0.000054357864,"teacher_disagreement_score":0.70313656,"about_ca_system_score_codex":0.00009090609,"about_ca_system_score_gemma":0.00051091856,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W7096919117","doi":"","title":"University of Alberta Correct and Efficient Search Algorithms in the Presence of Repetitions","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Search algorithm; Key (lock); Feature (linguistics); Search engine indexing","score_opus":0.02883123464871475,"score_gpt":0.23009643804069543,"score_spread":0.20126520339198067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096919117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61178994,0.00008418892,0.36982173,0.0012017129,0.0001031089,0.00022951236,0.000004830435,0.000019717703,0.016745275],"genre_scores_gemma":[0.9810398,0.000052336134,0.01854084,0.00001839699,0.000003593109,2.6523588e-7,4.126631e-7,8.7140995e-7,0.00034345238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999394,0.000085992084,0.00008731719,0.00014839096,0.00018688281,0.00009741008],"domain_scores_gemma":[0.9991682,0.00042453915,0.000026609128,0.000308461,0.000049971404,0.000022208767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386882,0.00004074411,0.000082227525,0.00007538955,0.00009847616,0.0000059154286,0.0005353783,0.000017161346,0.00001931928],"category_scores_gemma":[0.000025981915,0.000031985688,0.000029096193,0.00049370056,0.00028589976,0.00006580339,0.00020709017,0.000075730124,0.0000014487933],"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.000039749662,0.0016482945,0.028240718,0.000102369835,0.000044341567,0.00016738345,0.09623633,0.006485667,0.0006488355,0.8173957,0.0023669505,0.046623643],"study_design_scores_gemma":[0.00062861334,0.00023291654,0.116366506,0.000060339433,0.000004911739,0.00017433013,0.0023499979,0.8750695,0.0015597292,0.0020887507,0.0012886295,0.00017577979],"about_ca_topic_score_codex":0.0034297307,"about_ca_topic_score_gemma":0.0004093482,"teacher_disagreement_score":0.86858386,"about_ca_system_score_codex":0.0000050743624,"about_ca_system_score_gemma":0.000039264916,"threshold_uncertainty_score":0.51847494},"labels":[],"label_agreement":null},{"id":"W7099757918","doi":"","title":"THE UNIVERSITY OF CALGARY The Classical and Quantum Complexity of the Goldreich-Levin Problem with Applications to Bit Commitment","year":2004,"lang":"en","type":"article","venue":"","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":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"License; Bit (key); Copyright law","score_opus":0.028236035629157975,"score_gpt":0.2273549514697166,"score_spread":0.19911891584055863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099757918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012995,0.000077743665,0.9506483,0.032146826,0.000032839467,0.0009442695,0.000007746587,0.000040019775,0.0031072546],"genre_scores_gemma":[0.9075233,0.000023615772,0.09183913,0.00031989056,0.000011656715,0.000011910426,6.8930905e-7,0.0000041879825,0.00026564064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922585,0.000089390924,0.00012844431,0.0001839856,0.00023359091,0.00013870488],"domain_scores_gemma":[0.99891704,0.00017525662,0.00007903755,0.0007001973,0.000075683,0.00005277486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027220015,0.000082033344,0.000110411405,0.000019412439,0.0005979009,0.000034849527,0.0012194855,0.00002079319,0.0000036066945],"category_scores_gemma":[0.0000045556203,0.000037366768,0.000049059505,0.00047970185,0.0010814809,0.000061352344,0.0006391638,0.00012400396,0.0000023172088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007585769,0.00008104595,0.00031979673,0.0000073267943,0.000017078433,2.694834e-7,0.00046489976,0.000082575476,0.000046952955,0.99125487,0.0002537414,0.0074638356],"study_design_scores_gemma":[0.0017460008,0.0007309318,0.16020486,0.00015308968,0.000071148286,0.00004922958,0.0017247207,0.05258487,0.0023420155,0.6712447,0.108679555,0.00046891227],"about_ca_topic_score_codex":0.00047449156,"about_ca_topic_score_gemma":0.0016733977,"teacher_disagreement_score":0.89452827,"about_ca_system_score_codex":0.000027206182,"about_ca_system_score_gemma":0.00008347623,"threshold_uncertainty_score":0.4598631},"labels":[],"label_agreement":null},{"id":"W7104183500","doi":"","title":"Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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":"Banff International Research Station for Mathematical Innovation and Discovery; Johns Hopkins University; National Science Foundation","keywords":"Code word; Soundness; Equivalence (formal languages); Constant (computer programming); Code (set theory); Simple (philosophy); Decoding methods; Upper and lower bounds","score_opus":0.041800537560898174,"score_gpt":0.30927556710363674,"score_spread":0.26747502954273855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104183500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35834903,0.0009601429,0.63534504,0.003631693,0.00054617436,0.0007143584,0.00005718295,0.00012170781,0.00027468262],"genre_scores_gemma":[0.9374343,0.0003893982,0.05968824,0.00078476407,0.00012496763,0.00015475463,0.000011681548,0.00001934652,0.0013925403],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966429,0.00019396527,0.00072946533,0.0013659558,0.0003222401,0.0007454562],"domain_scores_gemma":[0.9966261,0.0010988691,0.00021401851,0.0012922698,0.00051702425,0.00025174205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000804541,0.00047236832,0.0006050793,0.00018570322,0.0012921432,0.00029742785,0.0010231475,0.00021676988,0.000046585385],"category_scores_gemma":[0.00032325767,0.0004448411,0.00018507823,0.0013314396,0.001919726,0.00085353263,0.0007173631,0.00045642105,0.000024945944],"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.002405503,0.002058448,0.5555741,0.003303866,0.0008704285,0.00006222496,0.0075163534,0.0023073931,0.00077986176,0.31167528,0.0036271708,0.109819345],"study_design_scores_gemma":[0.0037999311,0.0037743947,0.16957784,0.0015339955,0.0003552163,0.00006930711,0.00091012375,0.734811,0.004327716,0.04218993,0.03694649,0.001704026],"about_ca_topic_score_codex":0.00014367752,"about_ca_topic_score_gemma":0.0009076026,"teacher_disagreement_score":0.73250365,"about_ca_system_score_codex":0.00011153194,"about_ca_system_score_gemma":0.0006756527,"threshold_uncertainty_score":0.9998003},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008846043,0.000048412254,0.9837723,0.00050402666,0.0021774431,0.0018002425,0.0007084556,0.00033848887,0.0018046015],"genre_scores_gemma":[0.1490587,0.000020583566,0.84421414,0.0039454172,0.00031991003,0.000788522,0.0004569105,0.000056259752,0.0011395536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688506,0.000047746533,0.0012717212,0.00049208454,0.00035863623,0.0009447469],"domain_scores_gemma":[0.99735945,0.0005145998,0.0003722218,0.0010793826,0.0004526972,0.00022162328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005762505,0.00050672545,0.0005678348,0.00057786796,0.0008930588,0.00089947367,0.0014250617,0.0002475797,0.000016382828],"category_scores_gemma":[0.00008719592,0.00048567032,0.00048022083,0.0006099653,0.0001726888,0.0015355151,0.00061645394,0.00036187097,0.00005856081],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119906974,0.00073691964,0.0003786277,0.0010306942,0.0003939326,0.00012960842,0.0043661203,0.00012092341,0.0000396321,0.05612098,0.009024254,0.9275384],"study_design_scores_gemma":[0.0036646756,0.00041258935,0.00017008526,0.00027648517,0.0000908109,0.0007620385,0.0005162042,0.91061294,0.00066644093,0.013443052,0.06867341,0.0007112853],"about_ca_topic_score_codex":0.000011134304,"about_ca_topic_score_gemma":0.000018627468,"teacher_disagreement_score":0.92682713,"about_ca_system_score_codex":0.00014122284,"about_ca_system_score_gemma":0.00011733989,"threshold_uncertainty_score":0.9997595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28771478,0.0001517836,0.6802511,0.0020734172,0.0020883672,0.0024731648,0.00051428284,0.000382079,0.024351018],"genre_scores_gemma":[0.9033978,0.000025463443,0.095324144,0.000566758,0.000050455532,0.00009925381,0.00013592225,0.000022924856,0.00037728527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680346,0.00006354704,0.00145111,0.0003828072,0.0005005044,0.00079855265],"domain_scores_gemma":[0.9977181,0.00024389185,0.0004932758,0.0011290078,0.00027754213,0.00013820991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006387467,0.00041172502,0.00068033073,0.0006849274,0.0002099005,0.0002910679,0.0019778616,0.00020818932,0.000015412365],"category_scores_gemma":[0.00010013477,0.000401351,0.00029533965,0.0012668688,0.00043454135,0.0012896366,0.0009292848,0.00044367652,0.000019877838],"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.0001540685,0.0035345808,0.025166651,0.0039112368,0.0003833764,0.0000121667945,0.023308685,0.0012125275,0.0007134675,0.8526258,0.0059079914,0.08306946],"study_design_scores_gemma":[0.010399328,0.0011111725,0.010916882,0.0022250065,0.000072266834,0.000053650914,0.0030129105,0.7183742,0.011377374,0.1688376,0.071827725,0.001791861],"about_ca_topic_score_codex":0.00010071731,"about_ca_topic_score_gemma":0.00028088127,"teacher_disagreement_score":0.7171617,"about_ca_system_score_codex":0.00015767249,"about_ca_system_score_gemma":0.00014409437,"threshold_uncertainty_score":0.99984384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085384786,0.000060622027,0.89820075,0.0008913093,0.0009266456,0.0011862353,0.00017589326,0.00019250668,0.01298127],"genre_scores_gemma":[0.9712684,0.00002024354,0.025401004,0.0027963596,0.00003679545,0.00016705552,0.00006881816,0.000013987836,0.00022733292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740016,0.000060097198,0.000970381,0.00032209585,0.0005282565,0.00071900774],"domain_scores_gemma":[0.99810356,0.00033942412,0.00023106256,0.0011126887,0.00012438497,0.00008890724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087786204,0.00034660194,0.00036099,0.00045510946,0.000428504,0.0006655671,0.0026366017,0.00017436409,0.000004589919],"category_scores_gemma":[0.0000980273,0.0002743236,0.0002199322,0.0007468993,0.00012175958,0.0010895767,0.0007468393,0.00057575904,0.00002689428],"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.00015102304,0.0018475945,0.01168062,0.0016109584,0.0003462672,0.00009660083,0.07569559,0.021735834,0.00006746937,0.6455874,0.009752091,0.23142858],"study_design_scores_gemma":[0.0013461037,0.00007187942,0.0013486184,0.00018546658,0.000018009565,0.00004367254,0.0009304478,0.96135306,0.000093033974,0.028362012,0.0059252298,0.00032244413],"about_ca_topic_score_codex":0.00001962188,"about_ca_topic_score_gemma":0.00007074515,"teacher_disagreement_score":0.9396173,"about_ca_system_score_codex":0.00011718035,"about_ca_system_score_gemma":0.00015870317,"threshold_uncertainty_score":0.9999709},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018620074,0.000022168375,0.97422504,0.0002627079,0.0012489597,0.0033079756,0.00036827478,0.0003780378,0.0015667473],"genre_scores_gemma":[0.39729857,0.000008271154,0.5989412,0.0015091035,0.00020485852,0.0012023723,0.00044725806,0.000050038157,0.00033833543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965657,0.000023616498,0.0013055342,0.0005655522,0.00039962295,0.001139987],"domain_scores_gemma":[0.99711204,0.00045511225,0.00049894286,0.0011884748,0.00054731895,0.0001981207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011641859,0.0005015021,0.0006139321,0.00036115863,0.0011499171,0.0013506528,0.0022795328,0.00023417661,0.0000018644398],"category_scores_gemma":[0.00018364788,0.0004978783,0.0004305507,0.00049135345,0.0001592757,0.0026311185,0.00042150982,0.0003433029,0.000006040733],"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.00043569296,0.0014366452,0.0021146312,0.0063315867,0.00044535802,0.000004132678,0.021425446,0.006056408,0.00030349454,0.39061227,0.0036098156,0.5672245],"study_design_scores_gemma":[0.0025627946,0.00043062904,0.000062111016,0.00040030538,0.000051312658,0.000011988179,0.0003866261,0.94384044,0.00031885708,0.03330102,0.01808305,0.00055086165],"about_ca_topic_score_codex":0.000011416255,"about_ca_topic_score_gemma":0.000027225537,"teacher_disagreement_score":0.937784,"about_ca_system_score_codex":0.00012287378,"about_ca_system_score_gemma":0.00024630793,"threshold_uncertainty_score":0.9997473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18149424,0.000056917288,0.8012305,0.00030598257,0.0010579886,0.00089190324,0.00007293218,0.00014790925,0.014741643],"genre_scores_gemma":[0.91497064,0.000028992947,0.08428308,0.00038039873,0.00003495694,0.00007760493,0.000035576708,0.000013837503,0.00017491418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997903,0.00003584254,0.00094293413,0.00027978502,0.00033794108,0.00050053326],"domain_scores_gemma":[0.9984441,0.00015689596,0.000320896,0.0007434912,0.00024918426,0.00008545248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462716,0.0002694773,0.00044191806,0.00068308215,0.00016262269,0.00019018017,0.0010373172,0.00014276626,0.000009294902],"category_scores_gemma":[0.00006083693,0.00024029303,0.00015186986,0.0011345797,0.00018815685,0.001195284,0.00026831403,0.00033349707,0.000010035434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009134561,0.000568303,0.073663406,0.0013716415,0.0002513128,0.000010292217,0.006510237,0.0003765177,0.00010391957,0.19911438,0.00054378266,0.7173949],"study_design_scores_gemma":[0.025775077,0.0023201131,0.09044139,0.0053339954,0.00021496764,0.00083657546,0.006530756,0.70033467,0.035253905,0.08952745,0.0400594,0.0033717055],"about_ca_topic_score_codex":0.000037465437,"about_ca_topic_score_gemma":0.000101565536,"teacher_disagreement_score":0.7334764,"about_ca_system_score_codex":0.00009515729,"about_ca_system_score_gemma":0.00015196796,"threshold_uncertainty_score":0.97988653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032335918,0.000108470405,0.9808109,0.00042992522,0.0015932634,0.0030746346,0.00013078238,0.00033977441,0.0102786925],"genre_scores_gemma":[0.22434963,0.000060808947,0.76908314,0.0022415365,0.00028730676,0.0018003022,0.0007251706,0.00004341646,0.0014086695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970123,0.00008795455,0.0012875664,0.00041586492,0.00039116925,0.0008051214],"domain_scores_gemma":[0.99751073,0.00067098497,0.00041541026,0.00090274966,0.00035860838,0.00014151543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019877227,0.00041817184,0.00084883824,0.00056088716,0.00073776476,0.0008554254,0.001681943,0.00022411044,0.0000060567145],"category_scores_gemma":[0.00026063676,0.00037282787,0.00069353794,0.0007057704,0.00020719793,0.0016735623,0.00056102226,0.00034238148,0.000014797688],"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.004469052,0.00054548064,0.00018358217,0.001562808,0.00052568485,0.0000011728182,0.005785301,0.0005879972,0.000027605185,0.9224052,0.00862468,0.055281438],"study_design_scores_gemma":[0.07463244,0.00009257346,0.000024687386,0.0001444956,0.00007515,0.000017433335,0.00041751986,0.8484279,0.00030598257,0.028134665,0.047256753,0.00047039642],"about_ca_topic_score_codex":0.000013314035,"about_ca_topic_score_gemma":0.000003869953,"teacher_disagreement_score":0.89427054,"about_ca_system_score_codex":0.00015053066,"about_ca_system_score_gemma":0.00012481601,"threshold_uncertainty_score":0.9998724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02935086,0.00009998961,0.83345807,0.0064444854,0.0049103075,0.0026847702,0.00046950273,0.0009744757,0.12160752],"genre_scores_gemma":[0.89214325,0.00007424702,0.09042078,0.009358617,0.0004044085,0.0004835416,0.00063917594,0.000059728874,0.006416228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971864,0.000039656396,0.0010595851,0.00043288505,0.000511506,0.0007699426],"domain_scores_gemma":[0.997437,0.00020939804,0.00030281066,0.0015014359,0.0003757364,0.0001735927],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005491124,0.0004340295,0.00043502948,0.0005903808,0.0008539065,0.0011143467,0.001914548,0.00015484456,0.000030208772],"category_scores_gemma":[0.00012458792,0.0003975771,0.00028845386,0.000932664,0.00020823826,0.0018258245,0.0004900902,0.00050099613,0.00015999918],"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.0000613242,0.0005724871,0.00070513214,0.00047352776,0.00023056108,0.000005213821,0.0039996854,0.00024142156,0.00006385103,0.9232102,0.01997412,0.050462496],"study_design_scores_gemma":[0.004006408,0.00067387783,0.0030123885,0.0005780521,0.000063949505,0.00006739145,0.0007342063,0.15243758,0.0039888243,0.03969884,0.79352266,0.0012158288],"about_ca_topic_score_codex":0.00001580305,"about_ca_topic_score_gemma":0.000029901059,"teacher_disagreement_score":0.88351136,"about_ca_system_score_codex":0.0001566493,"about_ca_system_score_gemma":0.00023778153,"threshold_uncertainty_score":0.9999226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097934775,0.00008252388,0.89254117,0.0011974167,0.0023508652,0.001816354,0.0005947183,0.00041040016,0.0030717913],"genre_scores_gemma":[0.6974902,0.000025445665,0.2950133,0.004566794,0.00018955927,0.00065031275,0.0003345061,0.000059094204,0.0016707783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694353,0.00004943622,0.0010601765,0.0004874605,0.00044867364,0.0010107467],"domain_scores_gemma":[0.9972507,0.0005930583,0.000316886,0.0011674546,0.0004723363,0.00019960736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007918389,0.00049081695,0.000653489,0.0003063524,0.00091770355,0.0009705815,0.0018730375,0.00025366675,0.00001933848],"category_scores_gemma":[0.0001954855,0.00045580568,0.0004678205,0.00068556424,0.00023175048,0.0018060219,0.0007758257,0.00043361873,0.000054426986],"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.0005545579,0.0017342425,0.0028778452,0.002350346,0.0010665203,0.000014091704,0.013823726,0.003733983,0.00018836591,0.71291006,0.04640848,0.2143378],"study_design_scores_gemma":[0.0044066524,0.00034654085,0.00060986506,0.00019281733,0.000046124973,0.00002100522,0.000310673,0.773192,0.001078207,0.009234424,0.20995836,0.00060333166],"about_ca_topic_score_codex":0.000028675384,"about_ca_topic_score_gemma":0.000028270242,"teacher_disagreement_score":0.769458,"about_ca_system_score_codex":0.00013544573,"about_ca_system_score_gemma":0.00022273388,"threshold_uncertainty_score":0.99978936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009614021,0.0003568971,0.98521036,0.00047664362,0.00080338115,0.001483964,0.00016799122,0.00019716879,0.0016895988],"genre_scores_gemma":[0.5160784,0.00029617222,0.47969687,0.0019362177,0.00012377907,0.00068574573,0.0007241328,0.00004119373,0.00041744666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724835,0.00005522423,0.0012501639,0.00035448957,0.00029484485,0.0007969487],"domain_scores_gemma":[0.99748415,0.0004970464,0.00037008637,0.0012341298,0.00030223586,0.00011233945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009866314,0.00037457162,0.0004914198,0.0004386854,0.00061991514,0.00067403726,0.0021282253,0.00020105795,0.000006140763],"category_scores_gemma":[0.0001482713,0.00039049858,0.00022783547,0.0007567957,0.00017138208,0.001411452,0.0007959097,0.00045987652,0.0000070027795],"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.00035095858,0.0013322599,0.005746057,0.0020410088,0.0005205366,0.00000785492,0.014812736,0.017887663,0.000033149558,0.5563284,0.008766351,0.39217302],"study_design_scores_gemma":[0.002860756,0.00014458073,0.00028035181,0.00044308027,0.000025435922,0.00000987251,0.00044770655,0.8955959,0.000098946366,0.0034644355,0.09623213,0.0003968129],"about_ca_topic_score_codex":0.000017699303,"about_ca_topic_score_gemma":0.000040695097,"teacher_disagreement_score":0.8777082,"about_ca_system_score_codex":0.00017195618,"about_ca_system_score_gemma":0.00012480523,"threshold_uncertainty_score":0.9998547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046799406,0.00009544664,0.9403441,0.0012403079,0.0006162857,0.0008589573,0.00020631745,0.00024196594,0.009597213],"genre_scores_gemma":[0.8009088,0.000035658388,0.19776839,0.0007575288,0.000028716015,0.00006953644,0.00018895851,0.0000128430265,0.00022955309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976865,0.000065845736,0.0011253131,0.00023415555,0.00039395064,0.00049424294],"domain_scores_gemma":[0.9972456,0.0002193262,0.00046094836,0.0015522044,0.00041654537,0.00010536518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006982451,0.00029157475,0.00048115835,0.0004378414,0.0004265205,0.00024071128,0.0025766112,0.0001691513,0.000019209221],"category_scores_gemma":[0.000088837456,0.0002870782,0.00027006777,0.000803442,0.0004826429,0.0011471132,0.0012483513,0.00039198503,0.000016181484],"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.00011128354,0.0006255417,0.0042452677,0.0007158106,0.0002558809,0.0000011355454,0.0066360165,0.00076740794,0.00004615298,0.95543516,0.004214096,0.02694627],"study_design_scores_gemma":[0.003736562,0.00022482789,0.0070514097,0.0003691817,0.000033647928,0.000017524211,0.0009278111,0.8986163,0.0018820897,0.048994187,0.037580814,0.0005656488],"about_ca_topic_score_codex":0.00005016858,"about_ca_topic_score_gemma":0.000028123222,"teacher_disagreement_score":0.906441,"about_ca_system_score_codex":0.00008260509,"about_ca_system_score_gemma":0.0001176391,"threshold_uncertainty_score":0.99995816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058303226,0.00016269642,0.9384294,0.00039594248,0.00072929624,0.0010564731,0.000069124726,0.00014668131,0.00070711825],"genre_scores_gemma":[0.43283522,0.00006802287,0.5656902,0.00068988977,0.00008379087,0.00029168613,0.00016872726,0.000021361668,0.00015110716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800146,0.000016567863,0.00088498904,0.00029711865,0.00026605744,0.0005338283],"domain_scores_gemma":[0.9986522,0.00031508395,0.00022244449,0.00047296935,0.00024830925,0.0000889967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008484504,0.00026445283,0.00036219484,0.000947629,0.00030515337,0.0005293696,0.00076949206,0.00014427991,0.0000018041748],"category_scores_gemma":[0.00026895915,0.0002609068,0.00013284934,0.0012615683,0.00007211565,0.0016151405,0.0005080148,0.00026434555,0.0000028052937],"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.00011255009,0.00037667569,0.008744206,0.0022172446,0.0001424325,0.0000020953357,0.0059307846,0.00040813832,0.00006493876,0.76065415,0.0007418277,0.22060497],"study_design_scores_gemma":[0.0032897193,0.00010614614,0.00047389936,0.00024217929,0.000017763432,0.0000090608155,0.0005115586,0.9139563,0.0013838602,0.016270973,0.06338823,0.00035030543],"about_ca_topic_score_codex":0.000011595186,"about_ca_topic_score_gemma":0.00001750644,"teacher_disagreement_score":0.9135482,"about_ca_system_score_codex":0.00010241449,"about_ca_system_score_gemma":0.00006702151,"threshold_uncertainty_score":0.9999843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07207584,0.00028589217,0.8375034,0.0034736535,0.006607995,0.0022792772,0.000584696,0.002440292,0.07474897],"genre_scores_gemma":[0.6305254,0.00019696826,0.3388415,0.011577537,0.00048597745,0.0005926001,0.0009398713,0.0001178871,0.016722234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699503,0.000046653073,0.0010619962,0.00043120616,0.00051712396,0.0009480142],"domain_scores_gemma":[0.99757564,0.00025759265,0.00031468636,0.0013116442,0.00031887318,0.00022155365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005153509,0.00045632868,0.0005162843,0.0005597161,0.0007407208,0.0005535299,0.0022318605,0.0002317006,0.00005067646],"category_scores_gemma":[0.00013630629,0.000431763,0.00037438385,0.0011356149,0.00020512647,0.0013654828,0.0013817985,0.0004330503,0.00019875451],"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.00030780566,0.0013641336,0.008600652,0.0017604653,0.0011209256,0.00003945447,0.016245736,0.0006154761,0.00027762193,0.6297158,0.16157368,0.17837824],"study_design_scores_gemma":[0.0038808414,0.00022152014,0.0025647867,0.00031530112,0.000057405963,0.000058445243,0.00040107875,0.34492713,0.002791075,0.01570222,0.62804466,0.0010355094],"about_ca_topic_score_codex":0.00003048196,"about_ca_topic_score_gemma":0.000044539134,"teacher_disagreement_score":0.6140136,"about_ca_system_score_codex":0.00022607803,"about_ca_system_score_gemma":0.00013174689,"threshold_uncertainty_score":0.99981344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012523401,0.00003260351,0.9744439,0.0013850419,0.002546366,0.0008497359,0.00017513525,0.0004157411,0.007628088],"genre_scores_gemma":[0.21072227,0.0000048515317,0.78357714,0.00436827,0.0001898231,0.000138693,0.000091288035,0.000023442099,0.0008842053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728286,0.00003470862,0.001052449,0.0004003671,0.0004382295,0.00079137494],"domain_scores_gemma":[0.9977694,0.00024663832,0.0002455776,0.0011959431,0.00030423992,0.00023815634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112267,0.00036878843,0.00044510653,0.0003735272,0.0006552172,0.00082005764,0.0021485894,0.0001425919,0.000013498008],"category_scores_gemma":[0.00029394586,0.00035999832,0.0002498909,0.0010587901,0.00010778223,0.0013324055,0.0011186185,0.0004392645,0.00011271679],"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.0001053239,0.0006655566,0.0068836734,0.0014358382,0.00026505705,0.00001413616,0.012140872,0.0031398463,0.000046191515,0.6854836,0.03026023,0.2595597],"study_design_scores_gemma":[0.0012992077,0.00014474482,0.0012431733,0.00037970734,0.000019084553,0.000015504937,0.00022768773,0.8106537,0.00050365954,0.021787046,0.16315863,0.0005678849],"about_ca_topic_score_codex":0.00002484059,"about_ca_topic_score_gemma":0.00003801803,"teacher_disagreement_score":0.80751383,"about_ca_system_score_codex":0.00012828333,"about_ca_system_score_gemma":0.00011189407,"threshold_uncertainty_score":0.9998852},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40662026,0.000043476768,0.5779939,0.002730577,0.0017461088,0.0015899854,0.0008626045,0.00027406658,0.008138991],"genre_scores_gemma":[0.9130776,0.000009471157,0.08207694,0.0044257236,0.000060758983,0.00010321773,0.00010422392,0.000021517064,0.000120569355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707353,0.0000832201,0.0011476595,0.00038678956,0.00062084873,0.00068792823],"domain_scores_gemma":[0.99672073,0.00088296196,0.00043255033,0.0014778706,0.00031928907,0.00016660984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007038046,0.00040855195,0.0005575379,0.00043884278,0.000709644,0.0004620556,0.002452371,0.00014279202,0.000038970382],"category_scores_gemma":[0.0003070804,0.00031708725,0.00035348258,0.0012422021,0.00041548794,0.00067355105,0.0009806281,0.00050713506,0.000053372274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000161065,0.0005183586,0.0012414276,0.00022615967,0.00031089148,0.000003732501,0.009289864,0.00016693665,0.00027056044,0.9453501,0.008262938,0.03419794],"study_design_scores_gemma":[0.004330869,0.0007360124,0.009893387,0.0010626431,0.000076334036,0.000017412754,0.0021534418,0.17997302,0.013306576,0.74713254,0.04013789,0.0011798919],"about_ca_topic_score_codex":0.00025884825,"about_ca_topic_score_gemma":0.00010490609,"teacher_disagreement_score":0.5064573,"about_ca_system_score_codex":0.00010108483,"about_ca_system_score_gemma":0.00012376782,"threshold_uncertainty_score":0.9999281},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5322283,0.00027935076,0.42255846,0.0032754845,0.010540968,0.005146132,0.0007448551,0.0012892113,0.023937255],"genre_scores_gemma":[0.92242676,0.000078341036,0.07100477,0.0047897515,0.00009979668,0.00034544812,0.00020454406,0.000047716676,0.0010028967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964233,0.00006269327,0.0013398395,0.0005442943,0.0004918276,0.0011380349],"domain_scores_gemma":[0.9974602,0.0003668461,0.00029900967,0.001419524,0.00023950609,0.00021491919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006808814,0.0005658946,0.00061377016,0.0011409482,0.00048578865,0.00071514444,0.0020917596,0.00030439554,0.000023437817],"category_scores_gemma":[0.00017285057,0.0005251256,0.00043141618,0.001227931,0.00020768901,0.0014936881,0.0007238091,0.0007802999,0.00008142584],"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.0008798638,0.004644002,0.031005565,0.0025573536,0.0008956384,0.00006666082,0.03286326,0.0011343822,0.00073237316,0.63149863,0.018471366,0.2752509],"study_design_scores_gemma":[0.00992988,0.0005853313,0.010508616,0.00074819016,0.000043684104,0.00003105913,0.0010125514,0.85193247,0.0034516493,0.02211472,0.09820569,0.001436159],"about_ca_topic_score_codex":0.00010443419,"about_ca_topic_score_gemma":0.00014491142,"teacher_disagreement_score":0.8507981,"about_ca_system_score_codex":0.00023180257,"about_ca_system_score_gemma":0.00016240364,"threshold_uncertainty_score":0.99972004},"labels":[],"label_agreement":null},{"id":"W7111411162","doi":"10.20382/jocg.v16i2a10","title":"Fine-Grained Complexity of Earth Mover’s Distance Under Translation","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Translation (biology); Earth (classical element); Algebra over a field; Context (archaeology)","score_opus":0.0288278873048255,"score_gpt":0.24364669503923286,"score_spread":0.21481880773440737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111411162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043783724,0.00016633543,0.95043975,0.0015713652,0.000366269,0.00007339901,0.000018091125,0.000024917601,0.0035561628],"genre_scores_gemma":[0.87930876,0.000014230716,0.12006479,0.00012897253,0.000037948972,5.9209682e-8,0.0000063617754,0.0000037776742,0.00043512168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985795,0.0001157682,0.00043171662,0.00019121301,0.00051853113,0.00016327685],"domain_scores_gemma":[0.9982589,0.00041154565,0.0004348562,0.00019413122,0.000617284,0.00008330907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028853526,0.00013605389,0.00032033192,0.0012918597,0.00014644569,0.00005127482,0.0008245603,0.00006211196,0.000029917563],"category_scores_gemma":[0.00003231784,0.00014686583,0.00026115167,0.0025978272,0.00022643273,0.0006422421,0.000116365685,0.00023422712,0.000001573366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009767557,0.00018495617,0.00087530294,0.000044209253,0.00016112189,0.000030256306,0.00012748125,0.0979916,0.00015149194,0.88845927,0.00026844622,0.011608203],"study_design_scores_gemma":[0.004602382,0.00044082224,0.114160225,0.00031087268,0.00010885779,0.000064518696,0.00028439562,0.20312819,0.0010159723,0.6448951,0.030506358,0.00048232835],"about_ca_topic_score_codex":0.000012923675,"about_ca_topic_score_gemma":0.000021997374,"teacher_disagreement_score":0.83552504,"about_ca_system_score_codex":0.000062019775,"about_ca_system_score_gemma":0.00029169043,"threshold_uncertainty_score":0.5989015},"labels":[],"label_agreement":null},{"id":"W7114820834","doi":"","title":"Direct Product Theorems for Randomized Query Complexity","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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":"Direct product; Product (mathematics); Bounded function; Boolean function; Function (biology); Measure (data warehouse)","score_opus":0.057718812193491065,"score_gpt":0.29899303075830297,"score_spread":0.2412742185648119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114820834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15616332,0.009006831,0.76502824,0.015318506,0.015673988,0.007879471,0.0001211853,0.0008311838,0.029977294],"genre_scores_gemma":[0.96992445,0.00043986674,0.020567661,0.0018294555,0.0008412668,0.0005514661,0.000025257148,0.00004327528,0.005777274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936214,0.0011536146,0.0014222005,0.002023812,0.00051241566,0.0012665415],"domain_scores_gemma":[0.9933017,0.0029465402,0.00049001543,0.0024191556,0.00060276844,0.00023982054],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004576806,0.0007904611,0.002025896,0.00047983954,0.0013671957,0.0005095767,0.0027391745,0.00021127341,0.00015610464],"category_scores_gemma":[0.001951228,0.00072101026,0.0013882606,0.0019421884,0.0024602904,0.0006851772,0.0012385161,0.0006007447,0.00011130511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015178499,0.0011605242,0.010675361,0.0006759136,0.001217838,0.000020452717,0.0022157226,0.00007611297,0.00054078345,0.9025955,0.0070011374,0.058642123],"study_design_scores_gemma":[0.18005382,0.0003851048,0.022555362,0.0012436305,0.0008050078,0.000024682451,0.00023985814,0.18131457,0.022068815,0.53500205,0.05374468,0.0025624556],"about_ca_topic_score_codex":0.00033729692,"about_ca_topic_score_gemma":0.000072067814,"teacher_disagreement_score":0.8137612,"about_ca_system_score_codex":0.00013009671,"about_ca_system_score_gemma":0.0005630835,"threshold_uncertainty_score":0.9999329},"labels":[],"label_agreement":null},{"id":"W7118052205","doi":"","title":"Thin Tree Verification is coNP-Complete","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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":"K-ary tree; Interval tree; Tree (set theory); Graph; Segment tree; Gomory–Hu tree; Kruskal's algorithm; Spanning tree","score_opus":0.0661122184933786,"score_gpt":0.2855311649564319,"score_spread":0.21941894646305327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118052205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47714084,0.004297063,0.43051568,0.03434572,0.010491213,0.0011536325,0.000102338214,0.00065379526,0.0412997],"genre_scores_gemma":[0.97923386,0.00037051048,0.006349223,0.0063872803,0.00029803277,0.00003845429,0.000015467573,0.000022433242,0.007284745],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99611896,0.0002551153,0.00088359695,0.0014229891,0.00051607855,0.00080325955],"domain_scores_gemma":[0.99655634,0.0002990738,0.00030231575,0.0023291162,0.00031018804,0.00020294948],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006504754,0.0004998176,0.0005449757,0.00039842998,0.0009250334,0.00046232232,0.0026821124,0.00025403503,0.00049049925],"category_scores_gemma":[0.00013465398,0.000554402,0.00037685968,0.0022135058,0.0005174902,0.0007837408,0.0009207912,0.00066946395,0.001391772],"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.00010777355,0.0010837513,0.16018915,0.0003623554,0.0005811413,0.00007223133,0.008310886,0.00008594001,0.006702755,0.38799348,0.036779117,0.39773142],"study_design_scores_gemma":[0.0015208949,0.00024248297,0.5277847,0.0003931583,0.00011995595,0.000013769494,0.00021803686,0.20741539,0.008383131,0.032618795,0.22028333,0.0010063552],"about_ca_topic_score_codex":0.00021029836,"about_ca_topic_score_gemma":0.000046390218,"teacher_disagreement_score":0.502093,"about_ca_system_score_codex":0.00012925096,"about_ca_system_score_gemma":0.0003623784,"threshold_uncertainty_score":0.9996908},"labels":[],"label_agreement":null},{"id":"W7126101570","doi":"10.1109/comcomap68359.2025.11353181","title":"Heuristic-Guided Iterative Compression for Efficient Graph Bipartization","year":2025,"lang":"","type":"article","venue":"","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 Winnipeg","funders":"","keywords":"Scalability; Bipartite graph; Graph; Heuristic; Compression (physics); Iterative method; Comparability graph","score_opus":0.03637757582799904,"score_gpt":0.31744835008705896,"score_spread":0.2810707742590599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126101570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002290993,0.0007476668,0.979699,0.0025119553,0.004378161,0.0014451236,0.00004579964,0.00022447047,0.008656808],"genre_scores_gemma":[0.8481543,0.000091537964,0.1431625,0.0018245211,0.00020631698,0.00019594107,0.00004570697,0.000022256725,0.0062969285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966718,0.00023534894,0.00089762144,0.0011075932,0.00042765125,0.0006599922],"domain_scores_gemma":[0.9972519,0.00068349,0.00023750307,0.0009141754,0.00074577413,0.00016715234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059554994,0.0004230753,0.0004813585,0.00062304555,0.0012056526,0.00079594535,0.0011534634,0.00016853055,0.00012183888],"category_scores_gemma":[0.00022566569,0.0003933693,0.00034273128,0.0022948848,0.00029318375,0.000273872,0.00070441747,0.00022835901,0.000026106562],"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.000062859086,0.00068350416,0.00014925642,0.00022043797,0.000099731966,0.0000036733973,0.0011637212,0.018219633,0.00051953853,0.8945446,0.024211338,0.06012173],"study_design_scores_gemma":[0.0012828127,0.00018072822,0.0006640049,0.0004240694,0.000053219122,0.0000029910232,0.0000615414,0.9065505,0.00870491,0.07094827,0.010736075,0.00039087233],"about_ca_topic_score_codex":0.000034052675,"about_ca_topic_score_gemma":0.000010291684,"teacher_disagreement_score":0.8883309,"about_ca_system_score_codex":0.000077672084,"about_ca_system_score_gemma":0.00022848637,"threshold_uncertainty_score":0.9998518},"labels":[],"label_agreement":null},{"id":"W7128626216","doi":"10.1109/focs63196.2025.00114","title":"Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theorem","year":2025,"lang":"","type":"article","venue":"","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":"Constant (computer programming); Conjecture; Rank (graph theory); Polynomial; Quadratic equation; Degree (music)","score_opus":0.014302633408031493,"score_gpt":0.26011567146059156,"score_spread":0.24581303805256005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128626216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13142648,0.0023014196,0.8532444,0.0016210083,0.00062335003,0.0018934703,0.000028127924,0.00007782681,0.008783922],"genre_scores_gemma":[0.96229863,0.00044165633,0.035153363,0.0009551812,0.000078765,0.0001041476,0.000004276778,0.000028609105,0.0009353908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954249,0.00018827785,0.0010344104,0.0017215671,0.00045393757,0.0011768882],"domain_scores_gemma":[0.9973584,0.0010070216,0.00019868197,0.0009200957,0.00023135549,0.0002844923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014189007,0.0006966902,0.0010237483,0.000800044,0.00051521545,0.00081225066,0.00095651514,0.00029696693,0.000037785994],"category_scores_gemma":[0.00007790238,0.0006217653,0.00014814569,0.0019205644,0.001172909,0.000675547,0.0006349891,0.0006339471,0.0000036161305],"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.00045395814,0.00061881595,0.032313075,0.0006844524,0.00017801937,0.00018790543,0.004904856,0.00007049172,0.0007472895,0.37449598,0.000148166,0.585197],"study_design_scores_gemma":[0.013109637,0.001458293,0.011620642,0.001619604,0.00008775952,0.00017092774,0.0012406856,0.8261755,0.004325743,0.13618673,0.0024950495,0.0015093989],"about_ca_topic_score_codex":0.00048753858,"about_ca_topic_score_gemma":0.0022217662,"teacher_disagreement_score":0.8308721,"about_ca_system_score_codex":0.000102253114,"about_ca_system_score_gemma":0.0006452188,"threshold_uncertainty_score":0.99962336},"labels":[],"label_agreement":null},{"id":"W7128633611","doi":"10.1109/focs63196.2025.00038","title":"Direct Product Theorems for Randomized Query Complexity","year":2025,"lang":"","type":"article","venue":"","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":"Direct product; Product (mathematics); Bounded function; Measure (data warehouse); Function (biology); Boolean function","score_opus":0.03415585052121464,"score_gpt":0.2938558317782489,"score_spread":0.2596999812570343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128633611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002978562,0.0030250878,0.8416632,0.009664679,0.0065885275,0.0046059154,0.00004319916,0.0004315909,0.13367994],"genre_scores_gemma":[0.59896964,0.0006371189,0.35027003,0.0043229056,0.0010214504,0.0011173419,0.00003161892,0.000052485884,0.04357739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99438775,0.0010233709,0.001297224,0.0017590784,0.0004854442,0.0010471417],"domain_scores_gemma":[0.99327755,0.0035908984,0.00031654807,0.0020335705,0.000592223,0.00018923417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0054050703,0.00066057936,0.0019439557,0.0005085,0.0011085647,0.00090355484,0.0025127053,0.00015718336,0.00032836746],"category_scores_gemma":[0.0013975553,0.00055129954,0.001396678,0.001800842,0.002333797,0.0005675174,0.0011260192,0.00037521365,0.000041264946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008312781,0.00039436735,0.000014775033,0.00023744022,0.00041094425,0.0000024776336,0.0005464296,0.00003192028,0.000044877466,0.89937747,0.008737137,0.08188941],"study_design_scores_gemma":[0.07179439,0.00007637965,0.0000618868,0.00020329597,0.00015276979,0.0000048622073,0.000060210215,0.31400117,0.0041721202,0.58963364,0.019266013,0.00057326327],"about_ca_topic_score_codex":0.00044202447,"about_ca_topic_score_gemma":0.00009933147,"teacher_disagreement_score":0.5986718,"about_ca_system_score_codex":0.00009380634,"about_ca_system_score_gemma":0.000563829,"threshold_uncertainty_score":0.9996939},"labels":[],"label_agreement":null},{"id":"W7128638588","doi":"10.1109/focs63196.2025.00014","title":"Almost Tight Additive Guarantees for k-Edge-Connectivity","year":2025,"lang":"","type":"article","venue":"","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":"Multigraph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Graph; Graph factorization; Connected component; Induced subgraph isomorphism problem; Time complexity; Connectivity","score_opus":0.02057121839299205,"score_gpt":0.282924901054808,"score_spread":0.26235368266181597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128638588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020422859,0.0010348125,0.91829926,0.005676933,0.005278604,0.0012223,0.00025947814,0.00026263788,0.0659237],"genre_scores_gemma":[0.7918273,0.0003633285,0.14989038,0.0055657984,0.000886112,0.00042606768,0.00003893298,0.000042634234,0.050959397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649704,0.00018853432,0.0006200203,0.001428605,0.0003434516,0.0009223771],"domain_scores_gemma":[0.9958239,0.002094243,0.00017152923,0.0012085489,0.0005474162,0.00015431628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007342633,0.00051808567,0.00064936985,0.00043009163,0.0011466474,0.0006365901,0.0019143783,0.00023984638,0.0006832063],"category_scores_gemma":[0.00040033358,0.00050958275,0.0005779502,0.0017604948,0.0005071225,0.0008481971,0.0010042342,0.0003900529,0.00010722666],"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.00005675435,0.00038509083,0.00006889172,0.000090509064,0.00019073272,0.00000791764,0.00067544705,0.00000797588,0.00005646502,0.6244352,0.032490294,0.34153473],"study_design_scores_gemma":[0.001983793,0.0005187833,0.0036374556,0.00041112636,0.00010456496,0.000014224739,0.00032090422,0.43222752,0.01568447,0.29482922,0.2493407,0.0009272362],"about_ca_topic_score_codex":0.00012556901,"about_ca_topic_score_gemma":0.00022656519,"teacher_disagreement_score":0.7897851,"about_ca_system_score_codex":0.00011337406,"about_ca_system_score_gemma":0.00048951386,"threshold_uncertainty_score":0.9997356},"labels":[],"label_agreement":null},{"id":"W7128645685","doi":"10.1109/focs63196.2025.00040","title":"Distributed Triangle Detection is Hard in Few Rounds","year":2025,"lang":"","type":"article","venue":"","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":"Distributed algorithm; Graph; Upper and lower bounds; Vertex (graph theory); Bandwidth (computing); Distributed database","score_opus":0.026083166142783512,"score_gpt":0.2712957111889411,"score_spread":0.24521254504615758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128645685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016449945,0.0005859929,0.96767336,0.00559403,0.0033616305,0.00039501695,0.000047663758,0.0001764867,0.005715903],"genre_scores_gemma":[0.98511773,0.000118592165,0.006757205,0.0014163947,0.00010268052,0.000032119817,0.0000100788475,0.000008489843,0.0064367214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971195,0.00020819427,0.0007427489,0.00094418816,0.0003501455,0.0006352325],"domain_scores_gemma":[0.9984313,0.0002119585,0.000119188786,0.0009758034,0.00014192442,0.00011978098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070754316,0.00032185507,0.000473152,0.00064718677,0.0003922729,0.0007780355,0.0011850679,0.00022909381,0.0004029033],"category_scores_gemma":[0.00011659921,0.0003439435,0.0002919316,0.0050942353,0.000152345,0.00071995344,0.0006751876,0.0004930325,0.00008916296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000831295,0.00063555577,0.002195302,0.00010065038,0.00010012359,0.000034700704,0.0007747705,0.00010633216,0.0003489647,0.086025655,0.0060646646,0.9035302],"study_design_scores_gemma":[0.003307624,0.00031154996,0.047657337,0.00033184112,0.00003591521,0.000014186533,0.00023807122,0.7668176,0.01843435,0.089775264,0.07230654,0.0007696827],"about_ca_topic_score_codex":0.0012749619,"about_ca_topic_score_gemma":0.0009244625,"teacher_disagreement_score":0.96866775,"about_ca_system_score_codex":0.00029062908,"about_ca_system_score_gemma":0.00024570947,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W7128645802","doi":"10.1109/focs63196.2025.00057","title":"Generalized Flow in Nearly-linear Time on Moderately Dense Graphs","year":2025,"lang":"","type":"article","venue":"","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 Toronto","funders":"","keywords":"Flow (mathematics); Maximum flow problem; Enhanced Data Rates for GSM Evolution; Graph; Point (geometry); Flow network; Control flow graph","score_opus":0.025896086117352765,"score_gpt":0.27222287339320267,"score_spread":0.2463267872758499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128645802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36022237,0.0022838193,0.5589673,0.011831202,0.0059540723,0.0019263035,0.00005855695,0.0008002958,0.05795608],"genre_scores_gemma":[0.4878467,0.0010418397,0.4261847,0.016508523,0.0003586523,0.00011938845,0.00003122,0.00008533671,0.06782363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952396,0.0005028228,0.0010015854,0.0015308608,0.0006480838,0.0010770516],"domain_scores_gemma":[0.99745786,0.00034402547,0.000124487,0.0016123877,0.00021768012,0.00024357483],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008400588,0.0006450232,0.0007874122,0.0009489983,0.0005096471,0.00075374776,0.0018852814,0.00032444243,0.0009398459],"category_scores_gemma":[0.00009406852,0.00064481876,0.0004273078,0.0036666547,0.0003009654,0.00056717556,0.0008457514,0.0007959005,0.00081764394],"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.00048629506,0.0014892697,0.00024019506,0.000085408996,0.00020081195,0.0003244929,0.0011756783,0.04934278,0.00050777575,0.6675732,0.010800404,0.2677737],"study_design_scores_gemma":[0.0019401475,0.00023574139,0.00086625206,0.00021430211,0.000018664115,0.000008675815,0.000011975378,0.8838736,0.0021331056,0.1074724,0.0026464888,0.00057868287],"about_ca_topic_score_codex":0.00039249047,"about_ca_topic_score_gemma":0.00015800106,"teacher_disagreement_score":0.8345308,"about_ca_system_score_codex":0.00012490747,"about_ca_system_score_gemma":0.0004394204,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W7128646609","doi":"10.1109/focs63196.2025.00068","title":"Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices","year":2025,"lang":"","type":"article","venue":"","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":"Linear subspace; Ball (mathematics); Reduction (mathematics); Subspace topology; Completeness (order theory); Lattice problem; Hardness of approximation; Randomized algorithm; Property testing","score_opus":0.031192959823531412,"score_gpt":0.2880982432880844,"score_spread":0.256905283464553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128646609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9295474,0.003208675,0.056594167,0.0014016415,0.0008415548,0.0004953612,0.000012840466,0.000054590568,0.007843769],"genre_scores_gemma":[0.9728997,0.0003018986,0.026292436,0.00008194451,0.000015107209,0.0000076057554,0.0000010086187,0.000004554367,0.0003957419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975171,0.0002554334,0.00069253537,0.0007979456,0.00028194516,0.00045500314],"domain_scores_gemma":[0.9981872,0.0007045264,0.00018188075,0.0007337535,0.00009854532,0.00009413288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013715315,0.00027134022,0.00056936825,0.0005510513,0.00016253447,0.00020073699,0.00083842606,0.0001526968,0.000073884345],"category_scores_gemma":[0.00021033386,0.00027335345,0.00009503567,0.0022941814,0.0006868982,0.0005153189,0.0010366094,0.00036277116,0.0000019015978],"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.00004998448,0.00071024883,0.3776838,0.0009090482,0.00007136635,0.000014132565,0.0031735783,0.0001012344,0.00018127763,0.4661011,0.00013864871,0.15086557],"study_design_scores_gemma":[0.0014387249,0.00023660302,0.4174271,0.00085051387,0.00004277021,0.0000061056503,0.00078574463,0.4791011,0.0047993744,0.093548484,0.0012152507,0.0005482595],"about_ca_topic_score_codex":0.0014750168,"about_ca_topic_score_gemma":0.0021856376,"teacher_disagreement_score":0.47899985,"about_ca_system_score_codex":0.00006978836,"about_ca_system_score_gemma":0.00023693334,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W7132867898","doi":"","title":"K-clique and k-cycle counting in the streaming model","year":2006,"lang":"","type":"dissertation","venue":"TSpace","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":"University of Toronto","keywords":"Streaming algorithm; Sketch; Integer (computer science); Pseudorandom number generator; Counting problem; Set (abstract data type); Alpha (finance); Constant (computer programming)","score_opus":0.02405808419401693,"score_gpt":0.3159181598543659,"score_spread":0.29186007566034894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132867898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7630189,0.0018643434,0.20661409,0.0012818198,0.00064807525,0.0007904188,0.0000106886755,0.00009625368,0.025675384],"genre_scores_gemma":[0.98069984,0.00018331641,0.015994431,0.00026972222,0.0001555392,0.00004154292,0.00006823184,0.000029972305,0.0025574304],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732566,0.00018374549,0.0004898069,0.0008326547,0.000577161,0.00059095153],"domain_scores_gemma":[0.99839056,0.0004065439,0.0003326774,0.00069729117,0.00011131881,0.00006160435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009729894,0.00044840292,0.00040304597,0.00027397697,0.000582213,0.00075312017,0.0012199378,0.00027271066,0.000010221667],"category_scores_gemma":[0.000058360467,0.00040289178,0.000118255884,0.0007909876,0.00013678988,0.0003936849,0.00019801923,0.00089673116,0.000007147355],"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.00008384295,0.00093948934,0.0023861483,0.0009946637,0.00009328465,0.00024144407,0.37292993,0.11680637,0.0011925641,0.30333588,0.0010555765,0.19994082],"study_design_scores_gemma":[0.00029804773,0.000043025808,0.0050631184,0.0003388363,0.00002246271,0.000017583096,0.0069157113,0.96173865,0.000098991026,0.024785087,0.00022994351,0.00044854722],"about_ca_topic_score_codex":0.0037511555,"about_ca_topic_score_gemma":0.003717759,"teacher_disagreement_score":0.84493226,"about_ca_system_score_codex":0.000053747888,"about_ca_system_score_gemma":0.00019453804,"threshold_uncertainty_score":0.9998423},"labels":[],"label_agreement":null},{"id":"W7132914093","doi":"","title":"The Complexity of Composition: New Approaches to Depth and Space","year":2022,"lang":"","type":"dissertation","venue":"TSpace","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 Toronto","funders":"","keywords":"Conjecture; Disjoint sets; Function (biology); Space (punctuation); Communication complexity; Composition (language); Key (lock); Gadget","score_opus":0.1877929628544652,"score_gpt":0.33214893276220087,"score_spread":0.14435596990773567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132914093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17026934,0.029782692,0.5503108,0.15402839,0.0124289505,0.008184549,0.00016318775,0.0006239572,0.074208185],"genre_scores_gemma":[0.7826378,0.0010533257,0.18331806,0.0005428969,0.00070026587,0.00019235321,0.00035111865,0.0001306876,0.0310735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960988,0.00043152372,0.0006586458,0.0010982557,0.0010657832,0.0006469741],"domain_scores_gemma":[0.9968968,0.00055004656,0.00061248784,0.0013804239,0.00010985289,0.00045040358],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007624613,0.00058945135,0.00073569734,0.0002569574,0.0020849027,0.0005398976,0.0021972759,0.0001630152,0.00023597239],"category_scores_gemma":[0.000050128216,0.0005437092,0.00027088923,0.0015258248,0.0008131142,0.00020600649,0.0012695119,0.00084180903,0.000017226848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024825239,0.00020291723,0.00011059055,0.00022887664,0.00017067196,0.000009866984,0.055035453,0.00049884873,0.00018979971,0.87679493,0.0025402568,0.063969515],"study_design_scores_gemma":[0.0043053185,0.0045473846,0.08259048,0.0013642302,0.0007177555,0.00038533637,0.09858434,0.22062026,0.013493792,0.36224055,0.20531346,0.0058370996],"about_ca_topic_score_codex":0.001999092,"about_ca_topic_score_gemma":0.0016295979,"teacher_disagreement_score":0.61236846,"about_ca_system_score_codex":0.00009885362,"about_ca_system_score_gemma":0.00046313487,"threshold_uncertainty_score":0.99970144},"labels":[],"label_agreement":null},{"id":"W7133009582","doi":"","title":"Algebraic Methods in Query and Proof Complexity","year":2024,"lang":"","type":"dissertation","venue":"TSpace","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; University of Toronto","keywords":"Computational complexity theory; Quantum complexity theory; Unitary state; Time complexity; Algebraic number; Upper and lower bounds; Oracle; Real algebraic geometry; Polynomial hierarchy; Quantum computer","score_opus":0.07664616918694764,"score_gpt":0.43475986434274044,"score_spread":0.35811369515579283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133009582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19486025,0.065167725,0.66557896,0.008872151,0.017480806,0.004348402,0.000044785276,0.0009184846,0.04272842],"genre_scores_gemma":[0.08774855,0.0009923362,0.88329774,0.0005455558,0.0005919846,0.00027188045,0.00020048517,0.00018536647,0.026166111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947837,0.00084881607,0.00090562575,0.0019572177,0.00061551447,0.0008891222],"domain_scores_gemma":[0.997464,0.0006428894,0.00032727967,0.0011018838,0.00016701574,0.00029694763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020282404,0.0008488115,0.0010846046,0.0010164883,0.00033650472,0.00091864733,0.0013430573,0.0005449839,0.00024529267],"category_scores_gemma":[0.00019164686,0.00091102556,0.00029118898,0.0023832892,0.00051250594,0.000443834,0.00084601424,0.001852345,0.00008187886],"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.00007928947,0.00037335948,0.00014687066,0.0028970325,0.00018968164,0.000248702,0.10537471,0.000039851755,0.0009968425,0.3464021,0.0007908084,0.54246074],"study_design_scores_gemma":[0.0008279609,0.00040352816,0.010629957,0.0026833338,0.00015488433,0.00013458573,0.008221967,0.3939474,0.0061875763,0.56294006,0.011766833,0.0021018968],"about_ca_topic_score_codex":0.0016095272,"about_ca_topic_score_gemma":0.002275767,"teacher_disagreement_score":0.54035884,"about_ca_system_score_codex":0.00014671392,"about_ca_system_score_gemma":0.00046461384,"threshold_uncertainty_score":0.99933404},"labels":[],"label_agreement":null},{"id":"W7135374935","doi":"10.4230/lipics.fsttcs.2023.32","title":"Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error","year":2023,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","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":"QuantERA; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Multiplicative function; Upper and lower bounds; Protocol (science); Qubit; Communication complexity; Quantum information science; Function (biology); Constant (computer programming); Quantum","score_opus":0.062190032047302106,"score_gpt":0.24650446336122256,"score_spread":0.18431443131392045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135374935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18722543,0.00036543317,0.8027538,0.006947435,0.00014442806,0.0009168692,0.00010464573,0.00017707256,0.0013649124],"genre_scores_gemma":[0.95251346,0.000108438726,0.04672921,0.000062301704,0.0000110084275,0.0000027468343,0.00002657264,0.0000067767205,0.00053948944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990456,0.00021365703,0.0001669702,0.0002088075,0.00019561758,0.00016935109],"domain_scores_gemma":[0.9975201,0.0013553539,0.0002363551,0.0006525088,0.00019340095,0.000042299544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084568217,0.00011160367,0.00038837403,0.00013698188,0.0005013018,0.000045465793,0.0010536781,0.000042241685,0.000013399685],"category_scores_gemma":[0.00003133137,0.00009127866,0.0001377723,0.00034554783,0.0010811341,0.0002496801,0.00055333483,0.00009391466,0.000001819707],"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.004971216,0.000114636554,0.00034731286,0.00032545457,0.00036873473,0.0000043060522,0.02927692,0.00011494749,0.000115923234,0.9452702,0.0013214631,0.0177689],"study_design_scores_gemma":[0.08298896,0.0007633883,0.025662795,0.00050639827,0.00033222235,0.000022693723,0.02855923,0.612218,0.00031587062,0.22887821,0.018953908,0.0007982642],"about_ca_topic_score_codex":0.00073818845,"about_ca_topic_score_gemma":0.00079620956,"teacher_disagreement_score":0.76528805,"about_ca_system_score_codex":0.000013874805,"about_ca_system_score_gemma":0.0000422452,"threshold_uncertainty_score":0.39834833},"labels":[],"label_agreement":null},{"id":"W7145951013","doi":"","title":"Path Cover Problems withLength Cost","year":2022,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Path (computing); Longest path problem; Minimum weight; Widest path problem; Induced path; Vertex (graph theory); Cardinality (data modeling); Cover (algebra)","score_opus":0.02366442485002743,"score_gpt":0.2403529839601594,"score_spread":0.21668855911013196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7145951013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012326462,0.001255603,0.9420654,0.0016453431,0.015294996,0.0011439391,0.0020889323,0.00094628887,0.023233032],"genre_scores_gemma":[0.9313132,0.000068035726,0.06263382,0.0012349748,0.0012154009,0.0007275204,0.0010749858,0.000029767165,0.0017022917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721754,0.00012538298,0.00038235472,0.00068388594,0.0011961177,0.0003947314],"domain_scores_gemma":[0.9983551,0.00013288001,0.0001551661,0.001030487,0.00015984762,0.00016654862],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004482581,0.00022848697,0.0002005118,0.00014198237,0.0021954428,0.00031480248,0.0013840668,0.000035491612,0.0001329155],"category_scores_gemma":[0.00010013524,0.00023400772,0.00010554334,0.0008700496,0.00029046115,0.0014581643,0.0018642496,0.00046705667,0.000060532864],"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.000031583095,0.0003769982,0.0010899814,0.000048787628,0.000055554985,0.00046632328,0.00037959314,0.00461395,0.0006446281,0.9742675,0.015202785,0.0028223044],"study_design_scores_gemma":[0.00063876604,0.00016078027,0.0009223709,0.000066238266,0.0000142783965,0.00097485585,0.00005697936,0.024596017,0.00074209034,0.0057286737,0.96560913,0.0004898254],"about_ca_topic_score_codex":0.00029186258,"about_ca_topic_score_gemma":0.000014909911,"teacher_disagreement_score":0.9685388,"about_ca_system_score_codex":0.00030740656,"about_ca_system_score_gemma":0.0006595299,"threshold_uncertainty_score":0.99910355},"labels":[],"label_agreement":null},{"id":"W7548172","doi":"10.4086/toc.2010.v006a009","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Communication complexity; Combinatorics; Mathematics; Nondeterministic algorithm; Function (biology); Logarithm; Discrete mathematics; Upper and lower bounds; Binary logarithm","score_opus":0.014675079421145891,"score_gpt":0.2465031238987778,"score_spread":0.2318280444776319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7548172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49764723,0.000015894382,0.5007268,0.00016682532,0.00063221384,0.00006945472,4.3543912e-7,0.00022160274,0.00051953964],"genre_scores_gemma":[0.70831895,6.118554e-7,0.29137644,0.00016743096,0.00012231375,8.752845e-7,3.8841938e-7,0.0000068611007,0.00000611102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00025307326,0.0005547248,0.0004850421,0.00040288825,0.000505178],"domain_scores_gemma":[0.99659616,0.0014983821,0.00031623314,0.0012587716,0.00018330755,0.00014715816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033208078,0.00021693642,0.00035796067,0.00023756415,0.00040289952,0.000120140474,0.0030671617,0.000079231824,0.000008583661],"category_scores_gemma":[0.00025719783,0.00021218999,0.00018875973,0.0007521986,0.0004360728,0.0005437253,0.0012123376,0.00058773166,0.0000029768944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008156063,0.000076301054,0.0007716707,0.0000132014575,0.00001531558,0.000005192231,0.0028719748,0.0002065585,0.02185524,0.77627575,0.0000026077737,0.197898],"study_design_scores_gemma":[0.0004900583,0.00010584892,0.025603825,0.000037112644,0.0000054417424,0.00008606546,0.00015685687,0.14756085,0.036367558,0.78923017,0.00007171615,0.0002844845],"about_ca_topic_score_codex":0.000015600688,"about_ca_topic_score_gemma":0.000007949772,"teacher_disagreement_score":0.21067174,"about_ca_system_score_codex":0.000005750886,"about_ca_system_score_gemma":0.000056438406,"threshold_uncertainty_score":0.8652857},"labels":[],"label_agreement":null},{"id":"W792477341","doi":"10.1007/978-3-319-12691-3_45","title":"A Fast Greedy Algorithm for the Critical Node Detection Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Computer science; Greedy algorithm; Cardinality (data modeling); Algorithm; Vertex (graph theory); Pairwise comparison; Computational complexity theory; Node (physics); Benchmark (surveying); Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.020383153145591346,"score_gpt":0.25655851560882564,"score_spread":0.23617536246323428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W792477341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.159826e-7,0.0003445683,0.9924412,0.0021992947,0.00326746,0.00076880807,0.000014335661,0.00022154427,0.0007418998],"genre_scores_gemma":[0.007636459,0.00002413759,0.988646,0.0019296815,0.00137656,0.000080507656,0.0000029786922,0.00004222356,0.00026149978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958757,0.000047662652,0.00055095414,0.0016379474,0.0010105185,0.0008771952],"domain_scores_gemma":[0.9950906,0.0024978647,0.00020661706,0.0015870238,0.0004405459,0.00017737139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014559461,0.0005712467,0.00050916057,0.0005689249,0.0009637206,0.0009808252,0.0043935725,0.00033016174,0.000012407572],"category_scores_gemma":[0.00016534694,0.00043398794,0.00028727233,0.00064158085,0.0015078764,0.00040672402,0.001364413,0.0009909809,0.000027694936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002578425,0.000016937065,0.0000010567617,0.000033035718,0.000010701323,0.0000084355115,0.00023016798,0.003371144,0.000023128789,0.043849207,0.000018996732,0.9524346],"study_design_scores_gemma":[0.00018089,0.00019365744,0.0000139441645,0.00014495346,0.000012679134,0.00009097251,1.5300597e-7,0.7055895,0.00037068402,0.28728372,0.0057047065,0.0004141504],"about_ca_topic_score_codex":0.000036261074,"about_ca_topic_score_gemma":0.00013060232,"teacher_disagreement_score":0.95202047,"about_ca_system_score_codex":0.00018853067,"about_ca_system_score_gemma":0.00027661756,"threshold_uncertainty_score":0.9998112},"labels":[],"label_agreement":null},{"id":"W88251305","doi":"10.5555/2095116.2095168","title":"A little advice can be very helpful","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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":"York University; University of Toronto","funders":"","keywords":"Logarithm; Advice (programming); Communication complexity; Multiplicative function; Conjecture; Computer science; Set (abstract data type); Protocol (science); Mathematics; Time complexity; Theoretical computer science; Upper and lower bounds; Discrete mathematics","score_opus":0.020448014219507833,"score_gpt":0.26048270278324615,"score_spread":0.2400346885637383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88251305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05171162,0.0055579743,0.51671886,0.09880995,0.031876016,0.0034154525,0.0008182649,0.008331177,0.2827607],"genre_scores_gemma":[0.8300374,0.00036751787,0.1486918,0.010065927,0.003534111,0.0002569991,0.00011791075,0.00015510755,0.006773205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683183,0.00016419569,0.00039777713,0.0007038805,0.0007616631,0.0011406534],"domain_scores_gemma":[0.99763834,0.000207429,0.000141946,0.0013773463,0.000100801,0.0005341126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005303709,0.00042662476,0.00036244188,0.00025635483,0.0003900577,0.0002734965,0.0015625778,0.00014940303,0.00008279161],"category_scores_gemma":[0.000037385,0.0003906954,0.0002623932,0.0008518828,0.00015777847,0.00095933746,0.0005974031,0.00041449387,0.00025038136],"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.00015215209,0.0027762605,0.0035954637,0.00027651343,0.00066957483,0.00023938535,0.021271769,0.0005557976,0.008277929,0.7264768,0.056321472,0.17938687],"study_design_scores_gemma":[0.0046153497,0.002395656,0.012450412,0.00043475424,0.00017943804,0.0005350432,0.001053341,0.1872497,0.04250026,0.0253617,0.7176598,0.0055645425],"about_ca_topic_score_codex":0.00020448928,"about_ca_topic_score_gemma":0.000018257382,"teacher_disagreement_score":0.7783258,"about_ca_system_score_codex":0.0001183935,"about_ca_system_score_gemma":0.00008793204,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","score_opus":0.052736863236860866,"score_gpt":0.2655842799530101,"score_spread":0.21284741671614923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974563791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033180445,0.0012507543,0.94447124,0.01037123,0.0035947126,0.0003504189,0.00002120845,0.00005521369,0.006704769],"genre_scores_gemma":[0.8159813,0.00012518505,0.18072246,0.00085429504,0.0011393744,0.000014706561,0.0000027608594,0.000048697722,0.0011111877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977619,0.0001703008,0.00063361775,0.00018709271,0.000982573,0.00026452966],"domain_scores_gemma":[0.997887,0.00021854482,0.00062554673,0.0005722647,0.0004947284,0.0002018991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013927238,0.0001812732,0.00035770732,0.00019401402,0.00008656254,0.0001248033,0.001761891,0.000058257654,0.000018411534],"category_scores_gemma":[0.00017629238,0.00010337023,0.00026435012,0.00055996206,0.00015414624,0.00050863525,0.00023583313,0.00038365068,0.000012365349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000378258,0.0014600937,0.00043638796,0.000133951,0.0009195708,0.00034501855,0.011272628,0.0058279037,0.0031640176,0.51051325,0.08468693,0.38086203],"study_design_scores_gemma":[0.006695556,0.010262353,0.0026557227,0.0010576221,0.0001672233,0.0015966244,0.0017575885,0.29939708,0.0084732445,0.6184933,0.048153106,0.0012905838],"about_ca_topic_score_codex":0.00001641097,"about_ca_topic_score_gemma":0.000006491017,"teacher_disagreement_score":0.7828009,"about_ca_system_score_codex":0.00004155469,"about_ca_system_score_gemma":0.00016776123,"threshold_uncertainty_score":0.42153156},"labels":[],"label_agreement":null}]}