{"meta":{"query_hash":"99cd3cdc1891","filters":{"venue":"Symposium on Discrete Algorithms"},"cohort_total":59,"direct_labels_cover":0,"predictions_cover":59,"exported":59,"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/99cd3cdc1891","api":"https://metacan.xera.ac/api/v1/cohort?venue=Symposium+on+Discrete+Algorithms"},"results":[{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","score_opus":0.01650779417379294,"score_gpt":0.2897351951554409,"score_spread":0.27322740098164794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509794588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085743316,0.0012848484,0.8681496,0.0018254257,0.00030923914,0.000903468,0.0024706805,0.014289782,0.02502373],"genre_scores_gemma":[0.21868832,0.00048238027,0.765619,0.00057894987,0.00015153312,0.0007114295,0.0049481383,0.0011127578,0.0077073895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793965,0.00030872546,0.00013646278,0.00074486225,0.00037050748,0.00049982936],"domain_scores_gemma":[0.99808586,0.00086469715,0.00015661173,0.000559263,0.00018621815,0.00014736618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685606,0.0020934925,0.0019882254,0.0009984632,0.0013529564,0.0025012766,0.003468142,0.0021872688,0.016084444],"category_scores_gemma":[0.0034708919,0.00086564815,0.0012781682,0.0029069341,0.00072230655,0.0066381944,0.0027397168,0.0018340808,0.0045362543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023271495,0.0010771919,0.0022500462,0.0013849876,0.0002125075,0.00043380144,0.0006511575,0.174924,0.020471808,0.041575853,0.06266925,0.69202226],"study_design_scores_gemma":[0.0008801698,0.00047832538,0.00090721616,0.00006879738,0.000112083144,0.00059444027,0.0004001993,0.8623055,0.008416319,0.1040089,0.02175222,0.00007588092],"about_ca_topic_score_codex":0.0034675782,"about_ca_topic_score_gemma":0.0038870622,"teacher_disagreement_score":0.016084444,"about_ca_system_score_codex":0.001937021,"about_ca_system_score_gemma":0.0029091462,"threshold_uncertainty_score":0.053807795},"labels":[],"label_agreement":null},{"id":"W1512019713","doi":"10.5555/1496770.1496862","title":"Appointment scheduling with discrete random durations","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":108,"is_retracted":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; Schedule; Scheduling (production processes); Computer science; Discrete time and continuous time; Mathematical optimization; Job shop scheduling; Overtime; Probability distribution; Integer programming; Random variable; Mathematics; Statistics","score_opus":0.027851099954755952,"score_gpt":0.3676772088583154,"score_spread":0.33982610890355947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512019713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1506449,0.0018500873,0.830799,0.001975855,0.0004397718,0.00023426797,0.0016225093,0.0007991959,0.011634327],"genre_scores_gemma":[0.93194544,0.0008518722,0.05463291,0.00022078137,0.00026821406,0.00022775955,0.0006490796,0.00010410471,0.01109985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974704,0.0009826766,0.00012177782,0.00050359435,0.00043241773,0.00048909057],"domain_scores_gemma":[0.99593323,0.002467924,0.0006929221,0.00027588112,0.00020025026,0.00042987824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541626,0.0008401882,0.0018304853,0.00066175323,0.00058202393,0.0016010825,0.002337599,0.001657235,0.0072564133],"category_scores_gemma":[0.009142711,0.000898464,0.0008964946,0.0013813068,0.0009841204,0.0017546287,0.0010739435,0.0016248287,0.0011348196],"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.0006290143,0.00012950608,0.0013117512,0.00020813193,0.000057123954,0.00031201335,0.00012060121,0.89949805,0.0014730043,0.07525222,0.0030875248,0.01792113],"study_design_scores_gemma":[0.00010585234,0.00010885527,0.00047053964,0.000013417887,0.000021013691,0.00006849669,0.000036038255,0.97316766,0.00032898042,0.023813061,0.0018437601,0.000022267877],"about_ca_topic_score_codex":0.0051487284,"about_ca_topic_score_gemma":0.0033636077,"teacher_disagreement_score":0.0072564133,"about_ca_system_score_codex":0.0019847646,"about_ca_system_score_gemma":0.0013866514,"threshold_uncertainty_score":0.024275124},"labels":[],"label_agreement":null},{"id":"W1561175729","doi":"10.5555/1496770.1496824","title":"Biased range trees","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Set (abstract data type); Preprocessor; Tree (set theory); Tree structure; Query optimization; Segment tree; Interval tree; Data mining; Mathematics; Algorithm; Combinatorics; Sargable; Artificial intelligence; Web search query; Information retrieval; Search engine","score_opus":0.01441717215288716,"score_gpt":0.25912092714576584,"score_spread":0.2447037549928787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561175729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027017945,0.0011569519,0.95602554,0.00034494165,0.0001136386,0.00025969476,0.0039531733,0.0056874333,0.0054406617],"genre_scores_gemma":[0.26811144,0.0010741606,0.7073989,0.00066613575,0.00023982179,0.0009324645,0.013531246,0.0013293131,0.006716463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978878,0.00034037212,0.00021337658,0.0003396787,0.0009929251,0.00022584976],"domain_scores_gemma":[0.99375784,0.002089402,0.0005939918,0.0020388823,0.0012468407,0.0002730511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259663,0.00047171925,0.0011814209,0.0019185425,0.00077277014,0.0016873418,0.0016257494,0.0008665419,0.008014124],"category_scores_gemma":[0.011115386,0.0005509972,0.0008356399,0.0034799548,0.0005523686,0.0050290604,0.002598617,0.0009924391,0.003741942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016269323,0.00028602933,0.006539477,0.000691895,0.00014305185,0.00044076392,0.00039721277,0.039439145,0.04118219,0.13470218,0.045321237,0.7292299],"study_design_scores_gemma":[0.00045680336,0.0009905302,0.003966232,0.00031875435,0.00016887959,0.0023279048,0.0003872042,0.39350724,0.057483543,0.3970901,0.14306347,0.00023936998],"about_ca_topic_score_codex":0.0010261011,"about_ca_topic_score_gemma":0.0017893839,"teacher_disagreement_score":0.008014124,"about_ca_system_score_codex":0.00047323343,"about_ca_system_score_gemma":0.001149525,"threshold_uncertainty_score":0.026809871},"labels":[],"label_agreement":null},{"id":"W1866560977","doi":"10.5555/2884435.2884542","title":"Connectivity in bridge-addable graph classes: the mcdiarmid-steger-welsh conjecture","year":2016,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Random graph; Combinatorics; 1-planar graph; Bounded function; Discrete mathematics; Planar graph; Randomness; Class (philosophy); Graph; Chordal graph; Computer science","score_opus":0.03266091748356323,"score_gpt":0.30880514286604677,"score_spread":0.2761442253824835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866560977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6997668,0.0058826655,0.24503292,0.009326829,0.00021463401,0.0001432533,0.000892565,0.0006244898,0.038115755],"genre_scores_gemma":[0.98024464,0.0018901132,0.012981944,0.0008392159,0.00037779158,0.0001360038,0.0004669677,0.000120082594,0.002943379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.00025201793,0.00003876847,0.000514546,0.00034527047,0.00022894665],"domain_scores_gemma":[0.98337513,0.011882457,0.0013956963,0.0014358481,0.0006034242,0.0013074394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019249034,0.000615733,0.001156722,0.0021237966,0.0020179832,0.003238876,0.0019130182,0.0022933325,0.006696599],"category_scores_gemma":[0.019368425,0.00080964714,0.0011891179,0.0016458357,0.0037880912,0.0068365633,0.003204857,0.004010337,0.0006323692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002874095,0.00009114471,0.00610532,0.0003225163,0.00006309961,0.0002760286,0.000907425,0.01637349,0.0027198188,0.94511336,0.0081348615,0.01960547],"study_design_scores_gemma":[0.0000840424,0.00008079798,0.0031835097,0.000078048746,0.0000586635,0.00051139144,0.00023778214,0.07528985,0.0013151774,0.9124999,0.006623526,0.000037360303],"about_ca_topic_score_codex":0.0015175982,"about_ca_topic_score_gemma":0.0013524592,"teacher_disagreement_score":0.006696599,"about_ca_system_score_codex":0.001577558,"about_ca_system_score_gemma":0.0004585045,"threshold_uncertainty_score":0.022402406},"labels":[],"label_agreement":null},{"id":"W1970126214","doi":"10.5555/1109557.1109603","title":"Implicit dictionaries with O(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","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":"Conjecture; Constant (computer programming); Set (abstract data type); Computer science; Order (exchange); Search cost; Combinatorics; Binary logarithm; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language","score_opus":0.008316166533379635,"score_gpt":0.23509778953857782,"score_spread":0.2267816230051982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970126214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15698376,0.001688325,0.82420707,0.0016616997,0.00021702518,0.00025432068,0.000516434,0.002573302,0.011898057],"genre_scores_gemma":[0.484574,0.00074513385,0.49969447,0.00046753316,0.00032545437,0.00039357715,0.0008710949,0.000421472,0.012507262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979232,0.00039009206,0.00024531878,0.00033887292,0.0008122784,0.00029029435],"domain_scores_gemma":[0.9835374,0.007585921,0.0015691711,0.006310614,0.00074149546,0.00025552086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156721,0.00071405317,0.0012692285,0.00068095885,0.00073364796,0.0018902556,0.0023640404,0.0015925165,0.0040705167],"category_scores_gemma":[0.014745355,0.00077691535,0.0004692439,0.0020944264,0.0015098677,0.011092788,0.0028775434,0.001747844,0.0023930636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030785697,0.0005157469,0.0047848863,0.00078884244,0.00009666975,0.00036121314,0.00082804903,0.13935432,0.037983973,0.15897697,0.019062659,0.63416815],"study_design_scores_gemma":[0.00060720596,0.0011992892,0.0022274659,0.00016239115,0.000119011,0.0019846219,0.00041140796,0.7342826,0.053339057,0.17885685,0.026677636,0.00013250213],"about_ca_topic_score_codex":0.0007961873,"about_ca_topic_score_gemma":0.0018333783,"teacher_disagreement_score":0.0040705167,"about_ca_system_score_codex":0.00077287765,"about_ca_system_score_gemma":0.0013525655,"threshold_uncertainty_score":0.013617218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036146786,0.0011197126,0.9547768,0.00067090493,0.000096526965,0.00014270522,0.00023996859,0.0005733344,0.006233307],"genre_scores_gemma":[0.41689056,0.0011297923,0.57267517,0.0004079121,0.00021811319,0.0004126112,0.000826919,0.00031579932,0.0071231695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988458,0.00049787253,0.000042990017,0.000164021,0.00020928228,0.00023990167],"domain_scores_gemma":[0.99761707,0.0016828782,0.00021044958,0.00021485444,0.00015160326,0.00012301502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026881783,0.0014825489,0.0020071818,0.00081165397,0.00083268346,0.0018387195,0.0025573533,0.001723316,0.0050324877],"category_scores_gemma":[0.006358935,0.0005984383,0.0010475193,0.0023500388,0.0007701196,0.0036037827,0.0016314596,0.0025954342,0.00077734154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004116482,0.00038114024,0.0010898747,0.00037305435,0.00009824281,0.0001046891,0.00016304471,0.7495535,0.0011252917,0.09028198,0.011591609,0.14482588],"study_design_scores_gemma":[0.000042744137,0.000045481116,0.00009613809,0.000017205259,0.0000134102065,0.000048042577,0.000038097634,0.94606566,0.00025584994,0.052250996,0.0011183723,0.000008048814],"about_ca_topic_score_codex":0.0025843163,"about_ca_topic_score_gemma":0.00418009,"teacher_disagreement_score":0.0050324877,"about_ca_system_score_codex":0.0015501175,"about_ca_system_score_gemma":0.0014562946,"threshold_uncertainty_score":0.016835332},"labels":[],"label_agreement":null},{"id":"W1980569719","doi":"10.5555/338219.338586","title":"Estimating DNA sequence entropy","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Waterloo","funders":"","keywords":"Entropy (arrow of time); Sequence (biology); Computer science; Statistical physics; Computational biology; Genetics; Biology; Physics; Thermodynamics","score_opus":0.009552694781969635,"score_gpt":0.2604830810511529,"score_spread":0.2509303862691833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980569719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029832456,0.0023245648,0.963561,0.0008614155,0.00049379753,0.000026334348,0.00015538358,0.00035443212,0.0023904864],"genre_scores_gemma":[0.5268311,0.0031620124,0.4572133,0.00034175033,0.0018402277,0.00013191812,0.00080565753,0.0004587927,0.009215185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990627,0.00036427932,0.000057028647,0.00022482144,0.00023905383,0.00005212478],"domain_scores_gemma":[0.9942788,0.004000898,0.00017131427,0.00066539244,0.00062624784,0.00025735228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028119427,0.0007338494,0.0013876567,0.0030087023,0.00073496986,0.0019104023,0.00083695515,0.0011925208,0.0020643116],"category_scores_gemma":[0.013957489,0.00097602577,0.0009412845,0.0016357625,0.0015710391,0.0032294393,0.0018686097,0.0020740654,0.0005158837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021030736,0.000080287246,0.0041427384,0.00022390304,0.0001929346,0.00014664399,0.00024114456,0.31230316,0.019140836,0.3037863,0.008027535,0.3515042],"study_design_scores_gemma":[0.000008697026,0.000042252315,0.0014546192,0.000029223453,0.000025484384,0.000086304695,0.000024187339,0.7969909,0.009409112,0.18501,0.006883525,0.000035751207],"about_ca_topic_score_codex":0.0011648184,"about_ca_topic_score_gemma":0.00077079906,"teacher_disagreement_score":0.0030087023,"about_ca_system_score_codex":0.0012817932,"about_ca_system_score_gemma":0.00056913815,"threshold_uncertainty_score":0.01487112},"labels":[],"label_agreement":null},{"id":"W1984099766","doi":"10.5555/1283383.1283472","title":"Lower bounds on average-case delay for video-on-demand broadcast protocols","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Atomic broadcast; Video on demand; Matching (statistics); Computer network; Set (abstract data type); Constant (computer programming); Broadcasting (networking); Mathematics; Statistics","score_opus":0.024335974845671633,"score_gpt":0.3356211953914677,"score_spread":0.31128522054579605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984099766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0399482,0.019427786,0.89490014,0.0039057052,0.0007364564,0.00025674046,0.0012742763,0.0016430331,0.037907634],"genre_scores_gemma":[0.7099675,0.024189766,0.23702706,0.0025710298,0.002822853,0.0014255669,0.0024586797,0.002687373,0.016850214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98492604,0.0022849743,0.00089906773,0.0029825906,0.0049707354,0.003936603],"domain_scores_gemma":[0.8782163,0.094911024,0.0058799656,0.007883503,0.0099110035,0.0031981503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012939637,0.0055244947,0.0046331845,0.007246006,0.004481189,0.010301074,0.007233613,0.0035251735,0.009317373],"category_scores_gemma":[0.074910656,0.0020861062,0.00222589,0.0071679177,0.004750718,0.018967323,0.006413352,0.010661288,0.003002861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022111582,0.0008150555,0.0034023244,0.0019402507,0.00037977143,0.00045179774,0.0012997196,0.4697049,0.020093165,0.37526986,0.017593801,0.1068382],"study_design_scores_gemma":[0.000072998846,0.00024367911,0.0008264571,0.00036675122,0.00021217324,0.0005005264,0.0003998281,0.7205612,0.009797219,0.2568831,0.009989156,0.00014692437],"about_ca_topic_score_codex":0.003645867,"about_ca_topic_score_gemma":0.004298239,"teacher_disagreement_score":0.012939637,"about_ca_system_score_codex":0.012648039,"about_ca_system_score_gemma":0.0047599524,"threshold_uncertainty_score":0.091768324},"labels":[],"label_agreement":null},{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","score_opus":0.01978642089397287,"score_gpt":0.29402099037229334,"score_spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987809901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4435694,0.00016052574,0.5404619,0.00045453975,0.00006487589,0.00024410871,0.00096676644,0.0019487933,0.012129106],"genre_scores_gemma":[0.62438154,0.000093241644,0.36534908,0.00012619035,0.000010792495,0.0001243933,0.0023284594,0.0002599149,0.0073263585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952114,0.000053817927,0.000042189997,0.00015517228,0.00010246652,0.00012528458],"domain_scores_gemma":[0.99883085,0.0004042318,0.00014915597,0.00038701805,0.00013611939,0.00009259794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028336258,0.0005705446,0.0005157514,0.00033750094,0.000559186,0.0009081915,0.0008715724,0.00078501564,0.005218952],"category_scores_gemma":[0.0021135875,0.0003849194,0.0008344456,0.00065804424,0.00067935325,0.0022240027,0.001644632,0.0010117018,0.0011347525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015003689,0.0003597928,0.0133008,0.0007735338,0.00010782807,0.0014891069,0.0019908976,0.09879778,0.15927035,0.15276402,0.013440533,0.556205],"study_design_scores_gemma":[0.00019590862,0.00056863343,0.005644418,0.00010396248,0.00009605179,0.0017348286,0.0012996121,0.41108778,0.13149601,0.41623583,0.031397235,0.00013972439],"about_ca_topic_score_codex":0.001899117,"about_ca_topic_score_gemma":0.002996733,"teacher_disagreement_score":0.005218952,"about_ca_system_score_codex":0.0006233922,"about_ca_system_score_gemma":0.0008317825,"threshold_uncertainty_score":0.017459154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114547886,0.0020633892,0.8603325,0.0022124304,0.00021190559,0.0001401364,0.0005639951,0.0006113754,0.019316383],"genre_scores_gemma":[0.6805435,0.002686653,0.3042235,0.00058988953,0.0005109281,0.00028528034,0.0009581749,0.0002946837,0.00990743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980877,0.00045902608,0.000086905755,0.00042333468,0.0005308358,0.00041216385],"domain_scores_gemma":[0.9932626,0.0046555297,0.00074304565,0.00052852125,0.00041486305,0.00039547417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828305,0.0016239912,0.0011696094,0.0012250125,0.00078969327,0.0019913684,0.0042983,0.0017779759,0.005401441],"category_scores_gemma":[0.012070308,0.00057821185,0.0010566401,0.0024258452,0.0014109933,0.008027821,0.0022661833,0.004258407,0.00049227406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041484644,0.00034882338,0.0016072508,0.0005718802,0.00007828547,0.00024258754,0.00036942185,0.48790908,0.0032953024,0.42686856,0.006662276,0.07163171],"study_design_scores_gemma":[0.000046170986,0.00010356917,0.00030022828,0.000046675246,0.000032292173,0.00020267438,0.00015720345,0.7118566,0.0019252313,0.27914307,0.0061673643,0.000018893967],"about_ca_topic_score_codex":0.002918449,"about_ca_topic_score_gemma":0.0018403534,"teacher_disagreement_score":0.005401441,"about_ca_system_score_codex":0.0024872574,"about_ca_system_score_gemma":0.0014503365,"threshold_uncertainty_score":0.018069565},"labels":[],"label_agreement":null},{"id":"W1994128719","doi":"10.5555/365411.365789","title":"Linear reductions of maximum matching","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.02791080801521452,"score_gpt":0.24951552774059851,"score_spread":0.22160471972538398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994128719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053982034,0.0026366627,0.6903615,0.009401983,0.0012020916,0.00035511397,0.0016165068,0.0022358762,0.23820825],"genre_scores_gemma":[0.60978544,0.00206783,0.24208681,0.0041230386,0.0019818698,0.001105299,0.0025873699,0.002115773,0.13414651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963021,0.0015861475,0.00012657398,0.00076635164,0.0007061992,0.00051260757],"domain_scores_gemma":[0.99489516,0.0032728482,0.00022671222,0.000997034,0.00032640362,0.0002818346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907491,0.0014978517,0.0026760497,0.0020828124,0.0029242185,0.0052785915,0.00445697,0.0024484457,0.033865396],"category_scores_gemma":[0.010523544,0.0013678689,0.0035055967,0.0037823156,0.0033562293,0.008489537,0.005796684,0.008505418,0.004968097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108696746,0.00009837771,0.00006663231,0.000101715574,0.000025720914,0.000013242909,0.00013575307,0.007842678,0.00034121712,0.9553246,0.013747819,0.022193527],"study_design_scores_gemma":[0.000034392262,0.000012257444,0.000037749644,0.000014843649,0.000012562285,0.000012276078,0.000017298727,0.015309558,0.00031246987,0.9803914,0.0038378667,0.0000072573375],"about_ca_topic_score_codex":0.0022213103,"about_ca_topic_score_gemma":0.0025976803,"teacher_disagreement_score":0.033865396,"about_ca_system_score_codex":0.0049264967,"about_ca_system_score_gemma":0.002578557,"threshold_uncertainty_score":0.113291025},"labels":[],"label_agreement":null},{"id":"W2006093991","doi":"10.5555/982792.982915","title":"A maiden analysis of Longest Wait First","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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","funders":"","keywords":"Multicast; Computer science; Scheduling (production processes); Competitive analysis; Computer network; Mathematical optimization; Mathematics","score_opus":0.013779340519190672,"score_gpt":0.25979166195592013,"score_spread":0.24601232143672946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006093991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03588038,0.0062423204,0.882159,0.004838656,0.00045317694,0.00015746304,0.00045667286,0.0010405644,0.06877173],"genre_scores_gemma":[0.7036538,0.007639189,0.21462488,0.003232166,0.0020803227,0.00088239805,0.00086694985,0.0017928398,0.06522737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978702,0.00050316623,0.000070759575,0.00033776797,0.00066163205,0.0005564552],"domain_scores_gemma":[0.98806226,0.008476972,0.00088824384,0.0007422068,0.0011436035,0.0006867218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004620641,0.0022279348,0.0018936141,0.0028937059,0.0021653776,0.0032948942,0.0042386297,0.0020373603,0.023468345],"category_scores_gemma":[0.02385545,0.0010676123,0.0016543501,0.0024344178,0.002364498,0.007910718,0.0022446455,0.004856122,0.0033043644],"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.00041853153,0.00014310918,0.0009004573,0.00041649188,0.00011449083,0.00012794917,0.00028521073,0.16820648,0.0038690385,0.76813495,0.01595339,0.041429963],"study_design_scores_gemma":[0.000052710482,0.00010745157,0.00024030065,0.00007519995,0.0000679511,0.00007760251,0.000038914637,0.6661388,0.0018643906,0.32178667,0.009516742,0.000033168144],"about_ca_topic_score_codex":0.004024385,"about_ca_topic_score_gemma":0.0024679888,"teacher_disagreement_score":0.023468345,"about_ca_system_score_codex":0.0048542353,"about_ca_system_score_gemma":0.002564531,"threshold_uncertainty_score":0.07850945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26067078,0.0014816301,0.6773912,0.005320068,0.00019928397,0.00036134946,0.002073104,0.0033207028,0.04918182],"genre_scores_gemma":[0.78239816,0.0006964897,0.20254143,0.00071635057,0.000291872,0.0004592724,0.0021398528,0.00064878387,0.010107896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532616,0.0011002182,0.00023145972,0.001463197,0.0010204557,0.00085856114],"domain_scores_gemma":[0.98946697,0.007098258,0.0007913885,0.0017199627,0.00042357307,0.000499922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026751426,0.0017183559,0.0021214727,0.0012084116,0.0015303042,0.0051061055,0.003701368,0.0023409987,0.012112121],"category_scores_gemma":[0.02008492,0.0011637255,0.0028473497,0.0026720897,0.0016394501,0.00919365,0.003611875,0.004646122,0.0013295669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016703358,0.0008987318,0.009351426,0.0010473789,0.0005691767,0.00084784924,0.00088368804,0.555603,0.007842246,0.22157702,0.024144202,0.17556505],"study_design_scores_gemma":[0.0001268827,0.000088559056,0.0007786719,0.00007232985,0.00015892042,0.00071526034,0.00016943795,0.699049,0.0045057735,0.28811306,0.0061937403,0.00002849471],"about_ca_topic_score_codex":0.002211783,"about_ca_topic_score_gemma":0.0026431684,"teacher_disagreement_score":0.012112121,"about_ca_system_score_codex":0.0026067037,"about_ca_system_score_gemma":0.0017161473,"threshold_uncertainty_score":0.04051906},"labels":[],"label_agreement":null},{"id":"W2013696768","doi":"10.5555/1109557.1109575","title":"An asymptotic approximation algorithm for 3D-strip packing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","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":"Western University","funders":"","keywords":"Bin packing problem; Approximation algorithm; Mathematics; Algorithm; Combinatorics; Packing problems; Bin; Set (abstract data type); Computer science","score_opus":0.00843081260272268,"score_gpt":0.23180925757714604,"score_spread":0.22337844497442336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013696768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01873168,0.0006096512,0.9680191,0.00028329168,0.00011146676,0.00012783406,0.00037468292,0.0042418996,0.0075003076],"genre_scores_gemma":[0.14364463,0.00041672352,0.8487215,0.000249357,0.000079821584,0.00036631926,0.0020307358,0.00037924328,0.004111729],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998448,0.00022670787,0.000102374855,0.00024136012,0.0006861541,0.00029537868],"domain_scores_gemma":[0.998684,0.00040536787,0.000099284734,0.00047725486,0.00025549097,0.000078630466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072019844,0.0012966988,0.0013901899,0.0012211686,0.00081576506,0.0016124278,0.0027134237,0.0016150299,0.008476607],"category_scores_gemma":[0.0038466419,0.0006442665,0.0010206719,0.0031507292,0.00060018647,0.0028976805,0.0028488054,0.0017648855,0.004876445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006928329,0.00043267693,0.001537479,0.0003194934,0.000081572434,0.00023136636,0.0002457216,0.27477887,0.01342481,0.031373743,0.02486122,0.65202034],"study_design_scores_gemma":[0.00007955053,0.00007708339,0.00029632362,0.000018327235,0.000015464608,0.00018594244,0.00003980522,0.9679911,0.002814027,0.022779642,0.0056829383,0.000019801768],"about_ca_topic_score_codex":0.003172841,"about_ca_topic_score_gemma":0.0027719606,"teacher_disagreement_score":0.008476607,"about_ca_system_score_codex":0.0014104942,"about_ca_system_score_gemma":0.001484572,"threshold_uncertainty_score":0.028357089},"labels":[],"label_agreement":null},{"id":"W2015639925","doi":"10.5555/1283383.1283392","title":"Improved bounds for the symmetric rendezvous value on the line","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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 New Brunswick","funders":"","keywords":"Rendezvous; Conjecture; Mathematics; Semidefinite programming; Value (mathematics); Markov decision process; Line (geometry); Mathematical optimization; Quadratic equation; Markov chain; Applied mathematics; Combinatorics; Markov process; Discrete mathematics; Physics; Statistics; Geometry","score_opus":0.023880501906073954,"score_gpt":0.2873125432453776,"score_spread":0.26343204133930365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015639925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18289144,0.0029113118,0.76258236,0.001735202,0.00018683345,0.00018659094,0.0005336397,0.0008906664,0.04808197],"genre_scores_gemma":[0.88290447,0.0010796051,0.109363236,0.00032527954,0.0001396428,0.00021705724,0.0004967197,0.0003983216,0.005075601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955004,0.0013995265,0.00013810348,0.00084849313,0.0010283764,0.0010850815],"domain_scores_gemma":[0.96867174,0.022854066,0.0020380663,0.0024982917,0.002740191,0.0011977232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005171525,0.0016611101,0.0020663983,0.0024438668,0.0016036937,0.0034075803,0.0037629977,0.0018734712,0.011500232],"category_scores_gemma":[0.030782748,0.00065320544,0.0014614015,0.0019221215,0.003957401,0.007083123,0.0038328953,0.0044306153,0.0016288846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012690787,0.00025118413,0.0029184006,0.00045719693,0.00014989145,0.00024082672,0.0004583569,0.5189872,0.014947541,0.4059801,0.006263506,0.048076708],"study_design_scores_gemma":[0.000053902233,0.00016359313,0.00050125347,0.00008974102,0.000033873057,0.0001069049,0.00020961787,0.8050183,0.007188387,0.1844786,0.0020942085,0.00006155358],"about_ca_topic_score_codex":0.0022410706,"about_ca_topic_score_gemma":0.002144959,"teacher_disagreement_score":0.011500232,"about_ca_system_score_codex":0.0032507123,"about_ca_system_score_gemma":0.0018161356,"threshold_uncertainty_score":0.038472116},"labels":[],"label_agreement":null},{"id":"W2018043895","doi":"10.5555/2133036.2133045","title":"Online scalable scheduling for the lk-norms of flow time without conservation of work","year":2011,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Cloud computing; Competitive analysis; Distributed computing; Flow shop scheduling; Job shop scheduling; Parallel computing; Mathematical optimization; Computer network; Mathematics; Upper and lower bounds; Operating system","score_opus":0.034947947273841026,"score_gpt":0.26552950854941215,"score_spread":0.2305815612755711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018043895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047571998,0.00055383326,0.9407053,0.00087353383,0.00011521825,0.00023639493,0.0002967574,0.0011515295,0.008495455],"genre_scores_gemma":[0.5349597,0.00048386847,0.4555273,0.0003904913,0.00031090045,0.00065539934,0.0006044948,0.0007301226,0.0063377586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973309,0.00071791786,0.00012060546,0.0005661499,0.00072772696,0.0005368036],"domain_scores_gemma":[0.98829997,0.007438705,0.0011694536,0.0013259104,0.0010051546,0.0007608398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00358156,0.0016812434,0.0020356742,0.0009036186,0.0010753385,0.0027482037,0.0036438429,0.00152704,0.0043291254],"category_scores_gemma":[0.016774822,0.00066512264,0.00094282796,0.0016903437,0.0016965849,0.0054081515,0.002403859,0.0027464684,0.0009447379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010171079,0.00037630624,0.0010883394,0.0005414791,0.00008299662,0.0001666554,0.00037226971,0.6952349,0.010208682,0.19368896,0.010841425,0.0863809],"study_design_scores_gemma":[0.000046511068,0.00006184822,0.00010373763,0.000010796768,0.0000065157406,0.000032472344,0.000020461248,0.9513484,0.0010790488,0.046426363,0.0008522132,0.000011496804],"about_ca_topic_score_codex":0.0030270133,"about_ca_topic_score_gemma":0.0032318425,"teacher_disagreement_score":0.0043291254,"about_ca_system_score_codex":0.0038137801,"about_ca_system_score_gemma":0.0038149413,"threshold_uncertainty_score":0.02767098},"labels":[],"label_agreement":null},{"id":"W2029415290","doi":"10.5555/1496770.1496780","title":"On the hitting times of quantum versus random walks","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","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":"Perimeter Institute","funders":"","keywords":"Quantum walk; Hitting time; Random walk; Mathematics; Quantum; Quantum algorithm; Statistical physics; Markov chain; Discrete mathematics; Quantum mechanics; Physics; Statistics","score_opus":0.010634371952471982,"score_gpt":0.2439889803909162,"score_spread":0.23335460843844422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029415290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31701356,0.0022931732,0.6585167,0.0017926636,0.00017761864,0.00020971008,0.0002742524,0.00042527466,0.019296985],"genre_scores_gemma":[0.9147803,0.0010821131,0.07858179,0.00028260503,0.00025478043,0.0002439474,0.00021051332,0.0002239309,0.004339985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995359,0.0019049604,0.00026778696,0.0008169102,0.0011173699,0.00053388724],"domain_scores_gemma":[0.91758794,0.07173254,0.003279548,0.0036024353,0.0021495817,0.001647897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006622541,0.00089584774,0.0010967493,0.0022802025,0.0011348791,0.0033687698,0.0018338041,0.0019045959,0.0046746507],"category_scores_gemma":[0.046668142,0.00075771485,0.0010181532,0.0015035528,0.0048467526,0.009744985,0.0020023983,0.0032611303,0.00051541376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002442381,0.00007869736,0.0012622566,0.00014760245,0.000036775684,0.00011354001,0.0003156921,0.083182804,0.00281966,0.8991646,0.00048747612,0.012146688],"study_design_scores_gemma":[0.000039784325,0.00010073351,0.00057728955,0.000040930063,0.000024395675,0.00008805057,0.00008170464,0.544558,0.0020762444,0.45137864,0.0009910958,0.000043175303],"about_ca_topic_score_codex":0.0011140105,"about_ca_topic_score_gemma":0.0006285902,"teacher_disagreement_score":0.006622541,"about_ca_system_score_codex":0.0025903066,"about_ca_system_score_gemma":0.0010510529,"threshold_uncertainty_score":0.03502375},"labels":[],"label_agreement":null},{"id":"W2034389879","doi":"10.5555/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","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":"","keywords":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Hash chain; Function (biology); Theoretical computer science; Programming language","score_opus":0.007456395841719261,"score_gpt":0.2256655254684238,"score_spread":0.21820912962670455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034389879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06664529,0.00050358026,0.9144444,0.00037790625,0.00023152622,0.00021825591,0.00018457542,0.001084102,0.016310448],"genre_scores_gemma":[0.7694152,0.0005131195,0.21018912,0.0003171273,0.00028701941,0.00040660196,0.00033119298,0.00029742214,0.018243147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653506,0.0007851327,0.00022319928,0.00043993403,0.0013991052,0.0006176044],"domain_scores_gemma":[0.9948139,0.0011187333,0.00040760566,0.0029024875,0.0005175184,0.00023973307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023481715,0.00078948674,0.0011357297,0.00090186344,0.001421426,0.0021859496,0.0022992746,0.0013638149,0.009160792],"category_scores_gemma":[0.007679514,0.00049194193,0.00047141587,0.0016130742,0.0019982194,0.0074965255,0.0055003986,0.0014751604,0.004190854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016399014,0.00025971877,0.0010485344,0.00021330283,0.000048861853,0.00025208577,0.00033539583,0.05132722,0.030837735,0.73725903,0.0076622088,0.16911599],"study_design_scores_gemma":[0.0003102951,0.00032994672,0.00044099824,0.000058527476,0.000059230824,0.00071703346,0.000079061276,0.3951065,0.04011581,0.52801156,0.034669843,0.000101238926],"about_ca_topic_score_codex":0.00041586725,"about_ca_topic_score_gemma":0.00030409766,"teacher_disagreement_score":0.009160792,"about_ca_system_score_codex":0.0011883876,"about_ca_system_score_gemma":0.001227808,"threshold_uncertainty_score":0.030645907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024048623,0.00052904745,0.9610986,0.00036067664,0.000055349683,0.00015974714,0.00026217112,0.0038729722,0.009612781],"genre_scores_gemma":[0.14285353,0.0006114024,0.847945,0.00015284141,0.00006668486,0.00034642863,0.0013281803,0.0007824156,0.005913518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989261,0.0001622481,0.00008807305,0.00025483375,0.000336288,0.00023240523],"domain_scores_gemma":[0.9974126,0.0012635009,0.00038781576,0.00057815854,0.0002498331,0.00010813085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065472064,0.002103462,0.0010032902,0.0014702904,0.00095775194,0.0018009165,0.0024032348,0.0014432824,0.011493973],"category_scores_gemma":[0.004960315,0.00071085326,0.0014607093,0.0028641461,0.0012028277,0.0059966,0.0037441005,0.0021698808,0.003191057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007364142,0.0005016213,0.0013389367,0.0008609644,0.0001492888,0.0001624967,0.00036736022,0.21123642,0.023673533,0.11835226,0.017190047,0.62543064],"study_design_scores_gemma":[0.00026633503,0.00027312696,0.0004723851,0.000106393636,0.00010200832,0.0002778394,0.00024276551,0.6551561,0.038502917,0.28670043,0.017840013,0.00005972583],"about_ca_topic_score_codex":0.0013387882,"about_ca_topic_score_gemma":0.0022538484,"teacher_disagreement_score":0.011493973,"about_ca_system_score_codex":0.0016107468,"about_ca_system_score_gemma":0.0016034418,"threshold_uncertainty_score":0.038451195},"labels":[],"label_agreement":null},{"id":"W2044014345","doi":"10.5555/1109557.1109599","title":"Rank/select operations on large alphabets: a tool for text indexing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":190,"is_retracted":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":"Search engine indexing; Rank (graph theory); Generalization; String (physics); Variety (cybernetics); Computer science; Representation (politics); Alphabet; Combinatorics; Binary number; Binary search algorithm; Theoretical computer science; Mathematics; Algorithm; Information retrieval; Search algorithm; Artificial intelligence; Arithmetic","score_opus":0.008969900852929844,"score_gpt":0.2570800764681503,"score_spread":0.24811017561522045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044014345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013793168,0.00056322536,0.97150505,0.0008138574,0.00013596985,0.0001851048,0.00069318473,0.0079316385,0.0043788888],"genre_scores_gemma":[0.13822898,0.00081719324,0.84878606,0.00054368755,0.0004914076,0.00050921086,0.0017703761,0.0009471759,0.007905838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970132,0.0007469373,0.00029345034,0.00041423092,0.0012568071,0.0002754564],"domain_scores_gemma":[0.9888911,0.005473206,0.0008113441,0.0037830852,0.00063701754,0.00040415238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023639267,0.0010213354,0.002107982,0.0030323926,0.0018041297,0.0034342569,0.002587882,0.001668756,0.0121771665],"category_scores_gemma":[0.014116506,0.00078396156,0.0011934908,0.006319441,0.0023172903,0.010961723,0.003957884,0.0027882527,0.0064876573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00143034,0.00037815177,0.00093153387,0.0005660021,0.00006503077,0.00041892187,0.0007347135,0.027477596,0.027222423,0.24946056,0.04653882,0.64477587],"study_design_scores_gemma":[0.0003437469,0.00058628357,0.00035589378,0.00013388021,0.00008465488,0.0010662826,0.0003907521,0.35930958,0.04160917,0.5429303,0.05304059,0.00014886798],"about_ca_topic_score_codex":0.0010789525,"about_ca_topic_score_gemma":0.0013171153,"teacher_disagreement_score":0.0121771665,"about_ca_system_score_codex":0.0008916512,"about_ca_system_score_gemma":0.0011414976,"threshold_uncertainty_score":0.040736675},"labels":[],"label_agreement":null},{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"is_retracted":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; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","score_opus":0.011770735213949658,"score_gpt":0.27371233373679094,"score_spread":0.26194159852284127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051690202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156459,0.00013394647,0.9858969,0.00017617816,0.000060131624,0.0000922865,0.0001508473,0.0016791304,0.0016541309],"genre_scores_gemma":[0.0896927,0.0000870134,0.90747017,0.00011567224,0.00004996426,0.00017458327,0.00037815757,0.00027278793,0.0017589249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980977,0.00039302727,0.00014038752,0.0004971093,0.0005779173,0.00029383932],"domain_scores_gemma":[0.99824417,0.00059490907,0.00019639866,0.00052078126,0.00031499047,0.00012880297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983747,0.0009024892,0.0012955946,0.0011345748,0.0009891631,0.0013729093,0.0021837708,0.0012080582,0.01050391],"category_scores_gemma":[0.0058616246,0.00066404184,0.0010913418,0.0014114939,0.0011240735,0.003676987,0.00308703,0.0016906199,0.0027049065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017010055,0.00030203376,0.0018855835,0.0003939364,0.00010857321,0.000117171025,0.0002878233,0.12925789,0.04301792,0.108208135,0.015229081,0.69949085],"study_design_scores_gemma":[0.0004964494,0.00051371957,0.00081053417,0.000042808922,0.00004943807,0.00025018048,0.00015278882,0.8244243,0.031222152,0.1293303,0.012598362,0.00010891775],"about_ca_topic_score_codex":0.0025303026,"about_ca_topic_score_gemma":0.004918119,"teacher_disagreement_score":0.01050391,"about_ca_system_score_codex":0.0013877486,"about_ca_system_score_gemma":0.0024440202,"threshold_uncertainty_score":0.035139084},"labels":[],"label_agreement":null},{"id":"W2051837689","doi":"10.5555/1109557.1109667","title":"Scalable leader election","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":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":"Leader election; Scalability; Computer science; Protocol (science); Set (abstract data type); Parallel computing; Limit (mathematics); Distributed computing; Computer network; Mathematics; Operating system; Programming language","score_opus":0.0078637736390246,"score_gpt":0.23013710140963195,"score_spread":0.22227332777060735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051837689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013956605,0.0024889628,0.9280849,0.0012532444,0.00078890356,0.0004507815,0.00048460043,0.004444904,0.048047077],"genre_scores_gemma":[0.54291755,0.0029276137,0.41201508,0.00090904615,0.0006479044,0.0010027211,0.001873376,0.0005256215,0.037181035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987332,0.000249477,0.00005207351,0.00022894237,0.00056100055,0.00017537322],"domain_scores_gemma":[0.9986602,0.0004729329,0.00011924171,0.00032982838,0.0002960377,0.00012162775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197259,0.0006239114,0.0010381162,0.0005498779,0.0010525696,0.0009292898,0.0018162505,0.0008010853,0.010528892],"category_scores_gemma":[0.003144269,0.00036035772,0.00046406174,0.0009683158,0.0006136979,0.002290768,0.0024086025,0.0010397349,0.00293847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005482885,0.0002665207,0.001118372,0.0011834633,0.00024354369,0.0007490239,0.00035645848,0.17649588,0.03597578,0.2524824,0.11599465,0.4145856],"study_design_scores_gemma":[0.00038232736,0.0003514561,0.00045836248,0.00009907048,0.00011036448,0.0005903997,0.00020333972,0.65073717,0.015542047,0.21090353,0.12055745,0.000064558124],"about_ca_topic_score_codex":0.0007092411,"about_ca_topic_score_gemma":0.0014866529,"teacher_disagreement_score":0.010528892,"about_ca_system_score_codex":0.0005312379,"about_ca_system_score_gemma":0.00095387927,"threshold_uncertainty_score":0.03522265},"labels":[],"label_agreement":null},{"id":"W2059884147","doi":"10.5555/1070432.1070437","title":"A categorization theorem on suffix arrays with applications to space efficient text indexes","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Suffix array; Combinatorics; String (physics); Binary number; Permutation (music); Cardinality (data modeling); Compressed suffix array; Discrete mathematics; Generalized suffix tree; Suffix tree; Mathematics; Computer science; Arithmetic; Data mining","score_opus":0.008185812719306998,"score_gpt":0.24372485196968968,"score_spread":0.2355390392503827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059884147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370119,0.0006053845,0.9825065,0.0007510273,0.00014670118,0.000105952684,0.00020622488,0.0011502706,0.0041577783],"genre_scores_gemma":[0.14765385,0.0011584387,0.8410548,0.0011029849,0.0005433546,0.00052385434,0.00086709944,0.00047913348,0.006616568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686337,0.00062575965,0.000436669,0.0005604987,0.001287492,0.00022619721],"domain_scores_gemma":[0.9904365,0.00403178,0.0009305961,0.002865462,0.001504899,0.00023073706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025845487,0.0007716601,0.0010414212,0.0024672963,0.0013509754,0.0031007873,0.002211482,0.0013197159,0.0068495558],"category_scores_gemma":[0.016113892,0.00072311267,0.0009291711,0.0039306735,0.0023750023,0.0120982025,0.002977554,0.0018186918,0.0031940842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031571047,0.0001526759,0.0011978766,0.0004204592,0.000034075303,0.00015478054,0.00047101747,0.023040764,0.020227917,0.6349384,0.011890132,0.30715612],"study_design_scores_gemma":[0.00015966159,0.00064280693,0.00088723307,0.00027963365,0.00007483045,0.0012907712,0.0002490398,0.25623232,0.048761804,0.59115833,0.10014591,0.000117568314],"about_ca_topic_score_codex":0.00061874645,"about_ca_topic_score_gemma":0.00058756955,"teacher_disagreement_score":0.0068495558,"about_ca_system_score_codex":0.0017490559,"about_ca_system_score_gemma":0.0013656066,"threshold_uncertainty_score":0.022914052},"labels":[],"label_agreement":null},{"id":"W2065457428","doi":"10.5555/365411.365526","title":"Representing dynamic binary trees succinctly","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","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":"University of Waterloo","funders":"","keywords":"Binary number; Representation (politics); Amortized analysis; Binary tree; Computer science; Constant (computer programming); Binary search tree; Weight-balanced tree; Contrast (vision); Binary decision diagram; Theoretical computer science; Data structure; Binary expression tree; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Arithmetic; Programming language; Artificial intelligence","score_opus":0.011674444197509347,"score_gpt":0.26678274107081956,"score_spread":0.2551082968733102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065457428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03394069,0.0008186998,0.95354694,0.0005252912,0.0002116448,0.00011424035,0.0021012952,0.0019637262,0.006777428],"genre_scores_gemma":[0.41572466,0.0021688894,0.5619731,0.00046377012,0.00020594498,0.00042864654,0.0058093527,0.00062794547,0.012597657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993864,0.00010994329,0.00006872541,0.000099604644,0.0002511733,0.000084105326],"domain_scores_gemma":[0.99832445,0.00052221277,0.00020450106,0.00063042075,0.00026646897,0.000051956427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599627,0.00051212363,0.00067438843,0.0011851647,0.00043784626,0.0020526582,0.0011492518,0.00077652343,0.005304078],"category_scores_gemma":[0.004316065,0.00044833528,0.00037078225,0.0023890894,0.00062698725,0.005570316,0.00155849,0.0011691304,0.0014029719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005159394,0.00018165247,0.0008664461,0.000458428,0.00003723698,0.00048058468,0.0005526115,0.10999774,0.026982091,0.30714354,0.016783308,0.53600043],"study_design_scores_gemma":[0.000107072476,0.0002249418,0.00040945635,0.00023591027,0.000076780896,0.00064289884,0.0002183641,0.5073244,0.037961885,0.37456715,0.07813842,0.00009271141],"about_ca_topic_score_codex":0.00083829847,"about_ca_topic_score_gemma":0.0015076409,"teacher_disagreement_score":0.005304078,"about_ca_system_score_codex":0.00050272327,"about_ca_system_score_gemma":0.00062499335,"threshold_uncertainty_score":0.017743886},"labels":[],"label_agreement":null},{"id":"W2067326981","doi":"10.5555/545381.545481","title":"Incremental) priority algorithms","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Computer science; Simplicity; Greedy randomized adaptive search procedure; Mathematical optimization; Algorithm; Scheduling (production processes); Limit (mathematics); Approximation algorithm; Theoretical computer science; Mathematics","score_opus":0.024356093509823745,"score_gpt":0.26322250264118136,"score_spread":0.23886640913135762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067326981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128082195,0.0009446715,0.9618294,0.0009800198,0.0003811589,0.00019890544,0.00022105737,0.0013407584,0.021295844],"genre_scores_gemma":[0.35207504,0.0014843153,0.6262023,0.0011350443,0.0006373653,0.0004487362,0.00074565917,0.00047957784,0.016791891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974027,0.00065665797,0.00013479445,0.00054116815,0.00073978753,0.00052477256],"domain_scores_gemma":[0.9945878,0.0027220738,0.00040901842,0.0012292573,0.00065072713,0.00040111094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341125,0.0011321651,0.0010989294,0.001013137,0.0010285248,0.0028414042,0.0044359756,0.0016543957,0.0111122],"category_scores_gemma":[0.015973095,0.00054163847,0.0009949531,0.001633093,0.0009509447,0.0053337505,0.0025877133,0.0025182397,0.0035823835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006270834,0.0004860408,0.0020315903,0.0005485067,0.00011999565,0.0001545201,0.0003082831,0.11886966,0.003737807,0.47518063,0.03220524,0.3657307],"study_design_scores_gemma":[0.00017627781,0.00029251215,0.0003690152,0.000058560312,0.00008468612,0.00029955298,0.00011702098,0.49363083,0.0029559927,0.47690636,0.025076326,0.000033013544],"about_ca_topic_score_codex":0.0017529816,"about_ca_topic_score_gemma":0.0026096127,"teacher_disagreement_score":0.0111122,"about_ca_system_score_codex":0.0015127958,"about_ca_system_score_gemma":0.0021397471,"threshold_uncertainty_score":0.037174046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2459904,0.0014079275,0.7453572,0.0018417785,0.000082754486,0.00011360396,0.00041482598,0.0011491262,0.0036423248],"genre_scores_gemma":[0.7023569,0.001072816,0.29235083,0.0003937744,0.00028192918,0.00027245237,0.0010551469,0.00032173397,0.0018944588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956143,0.0013422357,0.00032934998,0.0009226226,0.0013334999,0.00045801044],"domain_scores_gemma":[0.94717914,0.040273894,0.0032435807,0.005070662,0.0032034754,0.0010293073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046092025,0.0009356786,0.0015631097,0.0016810779,0.0012876568,0.0019392016,0.0028044975,0.0016012563,0.002437172],"category_scores_gemma":[0.05181065,0.00055205595,0.0008029917,0.0025800278,0.0024152442,0.011571635,0.002073949,0.0029489219,0.0006605825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002353898,0.0004719456,0.022499427,0.00067079335,0.00015270847,0.00049823965,0.0012014443,0.475912,0.021093998,0.22813497,0.0045210635,0.24248949],"study_design_scores_gemma":[0.000032374308,0.00023941507,0.0014026026,0.000044845416,0.000022836834,0.00027537273,0.00012599249,0.88066906,0.006644687,0.109005526,0.0015139356,0.000023438266],"about_ca_topic_score_codex":0.0020848033,"about_ca_topic_score_gemma":0.0010525931,"teacher_disagreement_score":0.0046092025,"about_ca_system_score_codex":0.0018990219,"about_ca_system_score_gemma":0.0016481173,"threshold_uncertainty_score":0.024376035},"labels":[],"label_agreement":null},{"id":"W2071492694","doi":"10.5555/365411.365780","title":"On validating planar worlds","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Correctness; Planar straight-line graph; Planar; Planar graph; Embedding; Computer science; Graph; Robot; Book embedding; Graph embedding; Theoretical computer science; Algorithm; Artificial intelligence; Computer graphics (images); Line graph","score_opus":0.01043334910638345,"score_gpt":0.2273625299195004,"score_spread":0.21692918081311696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071492694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010808391,0.00017178663,0.98467004,0.0005307121,0.000040590527,0.00007347556,0.00012446112,0.0009145127,0.0026660266],"genre_scores_gemma":[0.25951678,0.00058475655,0.73263615,0.0004231832,0.00009977266,0.00026458714,0.0012829072,0.00071510713,0.0044767507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920849,0.0030345228,0.0003683025,0.001668924,0.0021078512,0.0007355065],"domain_scores_gemma":[0.9642593,0.025441129,0.0016399294,0.0053760675,0.0028329655,0.00045056615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047375467,0.0017062081,0.0013584677,0.0013902513,0.0018008987,0.0031861556,0.0033600288,0.0029122585,0.008676257],"category_scores_gemma":[0.040023588,0.0011037271,0.002028806,0.0017494605,0.00547709,0.011415104,0.008397879,0.0033378762,0.0018799235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007890865,0.0001559162,0.0023160425,0.0005123844,0.000119419536,0.00054053846,0.0007691365,0.4379095,0.005768419,0.32323512,0.0077955835,0.22008881],"study_design_scores_gemma":[0.00009029048,0.00010675009,0.00033691083,0.00010187573,0.000048094655,0.00018072333,0.0002913984,0.6149712,0.007830495,0.36757204,0.008423727,0.00004651817],"about_ca_topic_score_codex":0.004763053,"about_ca_topic_score_gemma":0.003971,"teacher_disagreement_score":0.008676257,"about_ca_system_score_codex":0.0015205707,"about_ca_system_score_gemma":0.0020848955,"threshold_uncertainty_score":0.029024959},"labels":[],"label_agreement":null},{"id":"W2077203993","doi":"10.5555/338219.338231","title":"Weakly chordal graph algorithms via handles","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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 Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","score_opus":0.01185173105347955,"score_gpt":0.27164410304080705,"score_spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077203993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08970794,0.0008590531,0.83448756,0.002575716,0.0005825108,0.0005414442,0.0007822179,0.0045914277,0.065872185],"genre_scores_gemma":[0.54827,0.0010756179,0.40156925,0.0011038982,0.000832236,0.0011958088,0.0021588868,0.0025397784,0.04125455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955088,0.0010675533,0.00031985104,0.0010696354,0.0013689661,0.0006651754],"domain_scores_gemma":[0.9879736,0.006176192,0.00045116202,0.0036104876,0.00074377866,0.0010448059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028929862,0.0015831951,0.0030055386,0.002659206,0.0036216835,0.008698296,0.0063291737,0.0023668061,0.015164196],"category_scores_gemma":[0.014802046,0.0013102051,0.0023851534,0.0042622825,0.0032890614,0.013714231,0.017835144,0.006533889,0.004226431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011063338,0.0004310793,0.0011702774,0.00042495452,0.00011329359,0.00012383913,0.00096074946,0.016082026,0.0059721945,0.824084,0.0135319205,0.13599929],"study_design_scores_gemma":[0.00013668684,0.000102887265,0.00015480009,0.000043051543,0.00006408094,0.00008001499,0.00020724896,0.04950787,0.003850693,0.9357324,0.0100931665,0.000027138443],"about_ca_topic_score_codex":0.0010144226,"about_ca_topic_score_gemma":0.0016320079,"teacher_disagreement_score":0.015164196,"about_ca_system_score_codex":0.0029476844,"about_ca_system_score_gemma":0.0020305696,"threshold_uncertainty_score":0.050729275},"labels":[],"label_agreement":null},{"id":"W2078615143","doi":"10.5555/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Regular polygon; Set (abstract data type); Mathematics; Computational geometry; Euclidean geometry; Point (geometry); Data structure; k-nearest neighbors algorithm; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.011868978540492582,"score_gpt":0.2646139178492995,"score_spread":0.2527449393088069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078615143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013312555,0.0004490124,0.9759261,0.00082794524,0.0001579658,0.00023074305,0.001582467,0.0053935675,0.0021196245],"genre_scores_gemma":[0.18636794,0.00039972778,0.80099505,0.0005174698,0.00023962966,0.0011539492,0.0055866563,0.0007232495,0.0040163286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658406,0.00043736552,0.00040493198,0.00069956627,0.0015299792,0.0003441411],"domain_scores_gemma":[0.992374,0.001730205,0.00066247117,0.004009815,0.0008192474,0.0004042596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016334389,0.00094653445,0.0024415208,0.0020026583,0.0021283308,0.0028053802,0.005902851,0.0020018704,0.007106629],"category_scores_gemma":[0.010802305,0.0012621075,0.0015475309,0.0047343643,0.0018567152,0.008107661,0.0077090147,0.0028648353,0.0031817004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017829165,0.0008646397,0.003631746,0.00063851767,0.00017425856,0.0004197653,0.00060648617,0.18988544,0.027833376,0.20856,0.060627256,0.5049755],"study_design_scores_gemma":[0.0003944906,0.00047452844,0.0005108601,0.00006345198,0.00006277318,0.0004374872,0.00014840247,0.82472575,0.01546964,0.118275404,0.03929243,0.00014476525],"about_ca_topic_score_codex":0.0029286875,"about_ca_topic_score_gemma":0.0036536148,"teacher_disagreement_score":0.007106629,"about_ca_system_score_codex":0.0019846766,"about_ca_system_score_gemma":0.0025304216,"threshold_uncertainty_score":0.023774028},"labels":[],"label_agreement":null},{"id":"W2081622490","doi":"10.5555/338219.338260","title":"A fast algorithm to generate unlabeled necklaces","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Handwritten Text Recognition Techniques","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 Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.009245848424656271,"score_gpt":0.2503925321792809,"score_spread":0.24114668375462464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081622490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032453523,0.000092793496,0.9916801,0.000052824464,0.00006303796,0.00015169322,0.00024719883,0.00362578,0.00084128475],"genre_scores_gemma":[0.013682785,0.0000666069,0.9819036,0.000043585536,0.000028232198,0.0001726064,0.00091226184,0.00039502973,0.0027951533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989773,0.000106878186,0.000077358134,0.00029910624,0.0004485834,0.00009077029],"domain_scores_gemma":[0.9975358,0.00065009476,0.00012895116,0.0007480248,0.00080552226,0.00013161193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093192764,0.0019082396,0.0014269346,0.0026662366,0.0016912073,0.0014795864,0.002575396,0.002137661,0.014817798],"category_scores_gemma":[0.003765664,0.0012381155,0.0012454997,0.0024431741,0.00092773896,0.0019422291,0.0029001036,0.0024370258,0.008283988],"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.00032264894,0.00011981112,0.00037641844,0.00018718455,0.00004466447,0.000117012816,0.00011516949,0.031645738,0.036440663,0.009622308,0.014772762,0.90623564],"study_design_scores_gemma":[0.00010347141,0.00015214186,0.00038008706,0.000045213914,0.000047197333,0.00033834588,0.00006741983,0.9046171,0.05850019,0.016282693,0.01940678,0.00005944924],"about_ca_topic_score_codex":0.0056943484,"about_ca_topic_score_gemma":0.0132211745,"teacher_disagreement_score":0.014817798,"about_ca_system_score_codex":0.00083382044,"about_ca_system_score_gemma":0.0021991397,"threshold_uncertainty_score":0.0495705},"labels":[],"label_agreement":null},{"id":"W2081869611","doi":"10.5555/1070432.1070548","title":"An optimal Bloom filter replacement","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":153,"is_retracted":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":"Bloom filter; Hash function; Data structure; Set (abstract data type); Computer science; Element (criminal law); Representation (politics); Amortized analysis; Filter (signal processing); Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Constant (computer programming); Bloom; Hash table","score_opus":0.01162427078857109,"score_gpt":0.25175601308317175,"score_spread":0.24013174229460066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081869611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07107142,0.0018007198,0.90750986,0.0017233896,0.0003736129,0.0003150904,0.0008269556,0.0026903567,0.013688641],"genre_scores_gemma":[0.30487305,0.00081545644,0.6775182,0.0007263798,0.000213965,0.00033243786,0.000981561,0.00028414046,0.014254862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758255,0.0005144984,0.00019426718,0.0004757983,0.00088112307,0.0003516971],"domain_scores_gemma":[0.9964348,0.00091335445,0.00019738739,0.0017632068,0.0005334082,0.00015779037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686472,0.00053174706,0.0018678514,0.0013328482,0.0013082592,0.0019046873,0.00266751,0.0017076709,0.006359504],"category_scores_gemma":[0.009030839,0.00056788424,0.0008486381,0.0023397552,0.00091594446,0.00551276,0.002124021,0.00092838303,0.0019492306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017012084,0.00054199825,0.0045773257,0.00041871477,0.00012505433,0.00034787005,0.000587506,0.058279086,0.027653864,0.209156,0.03307498,0.6635363],"study_design_scores_gemma":[0.00043462546,0.0005836484,0.001035868,0.0001598012,0.00014771728,0.0015069203,0.00034305523,0.7292411,0.029832855,0.15888226,0.0777438,0.00008838976],"about_ca_topic_score_codex":0.0023038303,"about_ca_topic_score_gemma":0.002465424,"teacher_disagreement_score":0.006359504,"about_ca_system_score_codex":0.0021219905,"about_ca_system_score_gemma":0.003265819,"threshold_uncertainty_score":0.021274686},"labels":[],"label_agreement":null},{"id":"W2118345845","doi":"10.5555/982792.982935","title":"Bipartite roots of graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line graph","score_opus":0.010987273196709698,"score_gpt":0.24195675283213933,"score_spread":0.23096947963542963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118345845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1337395,0.0014539111,0.7986434,0.0021045452,0.0003843393,0.0006063419,0.0035432754,0.0033591588,0.056165565],"genre_scores_gemma":[0.5805346,0.0010792473,0.39058816,0.0008957904,0.00036057294,0.00042506502,0.005355821,0.00061370747,0.020147072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.000302075,0.0000816515,0.00048878556,0.0003319984,0.00020934765],"domain_scores_gemma":[0.99765885,0.0011188254,0.0002526527,0.00046920602,0.0003495653,0.00015099593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044615436,0.00054822135,0.00063515676,0.0010999318,0.00085255207,0.0016560506,0.0009256362,0.0011974318,0.008853654],"category_scores_gemma":[0.0044545075,0.0004579611,0.00062191125,0.0014220224,0.0014974267,0.0034647752,0.002095833,0.0017808125,0.002129119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029192772,0.00013212749,0.0024090356,0.0006649781,0.0000674459,0.0004680116,0.0008334397,0.019145941,0.026612809,0.77793413,0.027516777,0.1439233],"study_design_scores_gemma":[0.000050815965,0.00008692762,0.0012644463,0.00007243001,0.000027902082,0.00081080414,0.00031370722,0.054720122,0.00800672,0.87439144,0.060219757,0.000034828812],"about_ca_topic_score_codex":0.0010851936,"about_ca_topic_score_gemma":0.0013732727,"teacher_disagreement_score":0.008853654,"about_ca_system_score_codex":0.0009971746,"about_ca_system_score_gemma":0.0006399765,"threshold_uncertainty_score":0.029618382},"labels":[],"label_agreement":null},{"id":"W2118893502","doi":"10.5555/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Planarity testing; Morphing; Planar graph; Vertex (graph theory); Computer science; Orthogonality; Combinatorics; Graph drawing; Planar; Graph; Book embedding; Mathematics; Pathwidth; Line graph; Computer graphics (images); Geometry","score_opus":0.007873912044065968,"score_gpt":0.22653860830052655,"score_spread":0.2186646962564606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118893502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03088446,0.0000888522,0.9604009,0.00011051551,0.0000685398,0.00010520321,0.00015714344,0.0016740566,0.006510297],"genre_scores_gemma":[0.21747649,0.00022598583,0.774057,0.00008081637,0.000027151435,0.00013241345,0.0006416034,0.0005430504,0.00681556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.0000636067,0.000036379308,0.000116547424,0.00027328572,0.00008059826],"domain_scores_gemma":[0.99935776,0.0001493074,0.0000782022,0.00024026074,0.00013184626,0.00004262803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034008792,0.0005639725,0.0005489471,0.000883428,0.0005026183,0.00090397766,0.0008374793,0.0005536178,0.006645222],"category_scores_gemma":[0.0021528588,0.0005248762,0.0007285491,0.00080401386,0.0007511299,0.001455207,0.0023716185,0.001051467,0.0010546594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021132024,0.00008105442,0.0011942048,0.00022235264,0.000040343904,0.00025473558,0.00031669482,0.088596314,0.04029445,0.17742229,0.0095526,0.6818136],"study_design_scores_gemma":[0.00010293776,0.0002086599,0.000928968,0.000057042264,0.00006757522,0.0008282285,0.00033960573,0.6299047,0.058499668,0.2255616,0.08341918,0.00008190384],"about_ca_topic_score_codex":0.0010044115,"about_ca_topic_score_gemma":0.0013112013,"teacher_disagreement_score":0.006645222,"about_ca_system_score_codex":0.00039541966,"about_ca_system_score_gemma":0.00034294522,"threshold_uncertainty_score":0.022230506},"labels":[],"label_agreement":null},{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","score_opus":0.007603731631552604,"score_gpt":0.2650003601434302,"score_spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143618826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40755782,0.002628694,0.5737762,0.0030596459,0.000119334,0.0001461956,0.00020238776,0.00044720023,0.0120625235],"genre_scores_gemma":[0.9600911,0.0012448161,0.03484376,0.00028890197,0.00028718455,0.00016655399,0.00013601598,0.000112369176,0.0028292462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983991,0.0007778598,0.00006349963,0.00026972045,0.0002747919,0.00021500155],"domain_scores_gemma":[0.97543347,0.018183522,0.0032151043,0.0011673534,0.0007624942,0.0012380694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029903399,0.0010735573,0.0011213324,0.002939524,0.0013001543,0.0020196221,0.0017912528,0.0018033526,0.0023264738],"category_scores_gemma":[0.021251924,0.0007412791,0.0009710857,0.0023322061,0.0037826588,0.0039395383,0.0025234672,0.0019543457,0.00029443874],"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.0003331056,0.00016689027,0.0046875803,0.00025620914,0.00009372773,0.0006993275,0.000571352,0.29236978,0.009658431,0.669312,0.003083783,0.01876777],"study_design_scores_gemma":[0.000035352627,0.00009760446,0.0008399888,0.000034322893,0.000028426035,0.00032641948,0.00009255204,0.7465931,0.0018835684,0.2488431,0.0011964813,0.000029123436],"about_ca_topic_score_codex":0.00087461143,"about_ca_topic_score_gemma":0.00079669204,"teacher_disagreement_score":0.0029903399,"about_ca_system_score_codex":0.0017198544,"about_ca_system_score_gemma":0.0005115911,"threshold_uncertainty_score":0.015814602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019214038,0.00071903877,0.9720091,0.0006151235,0.00008245809,0.00015834768,0.00033428473,0.0019119486,0.0049556172],"genre_scores_gemma":[0.3007548,0.0007846809,0.6894267,0.00038906958,0.00015670751,0.00044096794,0.001678409,0.0005305565,0.0058380365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748373,0.00076212327,0.00015145972,0.0005844499,0.0005658954,0.00045226407],"domain_scores_gemma":[0.9945879,0.002846535,0.00050531153,0.0014772995,0.00035554855,0.00022730889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024761176,0.0021470166,0.0018556427,0.0011686628,0.00093673065,0.0025184385,0.0038160165,0.0021223046,0.011343919],"category_scores_gemma":[0.009902523,0.0010492702,0.0014907803,0.0030901118,0.0010342657,0.0065443567,0.002542355,0.0028531405,0.0025365744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012746323,0.00063834805,0.0014877507,0.00068622886,0.00019433642,0.00016317143,0.0002886533,0.63066906,0.0058070393,0.058731046,0.019656146,0.28040358],"study_design_scores_gemma":[0.00015020264,0.00011216031,0.0001688801,0.000023124298,0.000044856315,0.00011671228,0.000051640927,0.9183702,0.001696976,0.076730825,0.0025148261,0.000019541927],"about_ca_topic_score_codex":0.0024670968,"about_ca_topic_score_gemma":0.0037564985,"teacher_disagreement_score":0.011343919,"about_ca_system_score_codex":0.0023892862,"about_ca_system_score_gemma":0.0017574005,"threshold_uncertainty_score":0.037949204},"labels":[],"label_agreement":null},{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.015776286400295332,"score_gpt":0.2901337696210354,"score_spread":0.27435748322074005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153068117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14840315,0.002947337,0.8052334,0.004281789,0.0003398799,0.00077191263,0.003576027,0.0021580553,0.03228825],"genre_scores_gemma":[0.5231116,0.0037880088,0.42779562,0.0010904383,0.00059155247,0.0007882745,0.0121124415,0.0008061172,0.029916033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984456,0.00043826565,0.00009645669,0.00038553108,0.0003030568,0.00033115264],"domain_scores_gemma":[0.99783844,0.0013465538,0.00023589126,0.00026559783,0.00016008367,0.00015348801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172668,0.0013657802,0.0011508442,0.0012885843,0.0022131053,0.0040038135,0.0021201114,0.002593096,0.01140723],"category_scores_gemma":[0.005069124,0.00082069816,0.0013828218,0.00337659,0.0015390018,0.009277414,0.002346797,0.0019167875,0.0022130483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010171771,0.0004226065,0.00202781,0.001804055,0.00018434838,0.0007324087,0.0014517336,0.23143362,0.00815865,0.47543675,0.07488298,0.20244782],"study_design_scores_gemma":[0.00023023842,0.00021079222,0.0009055639,0.00013294295,0.00010310342,0.0008900459,0.00079168053,0.26061696,0.0058251433,0.67645395,0.05376376,0.00007589663],"about_ca_topic_score_codex":0.0034938215,"about_ca_topic_score_gemma":0.0036195763,"teacher_disagreement_score":0.01140723,"about_ca_system_score_codex":0.0022364736,"about_ca_system_score_gemma":0.0015317912,"threshold_uncertainty_score":0.03816098},"labels":[],"label_agreement":null},{"id":"W2154903757","doi":"10.5555/2095116.2095161","title":"Gathering despite mischief","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Byzantine fault tolerance; Theoretical computer science; Combinatorics; Mathematics; Distributed computing; Fault tolerance; Physics","score_opus":0.018282125697853154,"score_gpt":0.2676465739180216,"score_spread":0.24936444822016846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154903757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14746135,0.0005210744,0.8219665,0.0035111979,0.00015282545,0.00030448727,0.00045631864,0.0023312056,0.02329505],"genre_scores_gemma":[0.7301435,0.0003503804,0.25227585,0.0006318966,0.000106548956,0.00032865713,0.00068899576,0.00044688967,0.015027352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648416,0.00090784475,0.00020629264,0.0012217651,0.0005384692,0.000641406],"domain_scores_gemma":[0.9819641,0.007132697,0.0017531957,0.006802524,0.0014438856,0.0009035899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031173518,0.0013535041,0.001363854,0.0006527484,0.0033294174,0.0021787372,0.0031384306,0.0021796653,0.006499572],"category_scores_gemma":[0.020853413,0.0009223937,0.0010596702,0.00094169634,0.0024656972,0.0052553103,0.005333432,0.0023203294,0.0017436751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002038427,0.00033915363,0.013095159,0.0016241492,0.00038103788,0.0019971565,0.0064050276,0.2808651,0.045264877,0.32389924,0.026682647,0.29740804],"study_design_scores_gemma":[0.00018400111,0.0006146212,0.0027524035,0.0001912497,0.00019486932,0.0014116747,0.001303713,0.64783883,0.024271479,0.26084614,0.060305543,0.00008545243],"about_ca_topic_score_codex":0.0026400052,"about_ca_topic_score_gemma":0.0036170613,"teacher_disagreement_score":0.006499572,"about_ca_system_score_codex":0.0014401211,"about_ca_system_score_gemma":0.0017936417,"threshold_uncertainty_score":0.021743178},"labels":[],"label_agreement":null},{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","score_opus":0.013238446397571412,"score_gpt":0.30807813828255165,"score_spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165352378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025238717,0.00014420041,0.9656743,0.00019854258,0.000038323386,0.00019681628,0.00024835768,0.003833368,0.0044273576],"genre_scores_gemma":[0.14876772,0.00016591075,0.8439843,0.00019878971,0.00004819988,0.00038898134,0.0016018884,0.0005318879,0.004312278],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987036,0.00020997894,0.000092937706,0.0003334629,0.00032564104,0.00033429332],"domain_scores_gemma":[0.9982009,0.00071322377,0.00015234292,0.0006248937,0.00017678982,0.00013177881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007518604,0.0010830212,0.00092281256,0.0012505953,0.0008764563,0.001446863,0.0018568187,0.0011746007,0.011392022],"category_scores_gemma":[0.0034320527,0.0006018738,0.001464559,0.001465334,0.00080878544,0.003666106,0.003554527,0.001770427,0.0035469483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010387562,0.00056545396,0.001972594,0.00063875585,0.0001226076,0.00021975073,0.0005937877,0.067145176,0.043595254,0.10045222,0.021997182,0.7616585],"study_design_scores_gemma":[0.00038416687,0.00047463682,0.0016922553,0.00007264752,0.00012947117,0.00067419774,0.0003941091,0.6802628,0.030635344,0.25551677,0.02967066,0.00009284584],"about_ca_topic_score_codex":0.0015347959,"about_ca_topic_score_gemma":0.0026100047,"teacher_disagreement_score":0.011392022,"about_ca_system_score_codex":0.0010014242,"about_ca_system_score_gemma":0.0013922361,"threshold_uncertainty_score":0.038110137},"labels":[],"label_agreement":null},{"id":"W2169088379","doi":"10.5555/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Resource allocation; Distributed computing; Distributed algorithm; Martingale (probability theory); Mathematical optimization; Load balancing (electrical power); Mathematics; Computer network","score_opus":0.02486666529941805,"score_gpt":0.31756466989913934,"score_spread":0.2926980045997213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169088379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0816753,0.0002719164,0.9041646,0.0006755156,0.00011319239,0.0001452039,0.00008197132,0.0007488602,0.012123336],"genre_scores_gemma":[0.9529711,0.00013150446,0.040741254,0.00013472575,0.00006560081,0.00013805267,0.00006322417,0.000042613075,0.0057119722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00030465622,0.00005158804,0.00024782974,0.00029009543,0.00018258908],"domain_scores_gemma":[0.9980888,0.0007164593,0.00030353552,0.00044444797,0.000246266,0.00020053788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917225,0.00047740902,0.00070151896,0.00039650904,0.0008482097,0.0014070938,0.0018252574,0.0008625577,0.0033424655],"category_scores_gemma":[0.0044730445,0.00032472055,0.0003108555,0.00042890152,0.0009993955,0.002030589,0.0020275386,0.0006252588,0.0005762019],"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.0009469089,0.00020814025,0.001903145,0.0001945808,0.00012618121,0.00050383375,0.0005532133,0.6886549,0.024986684,0.20165928,0.005407984,0.07485518],"study_design_scores_gemma":[0.00006068778,0.00006775217,0.00019150085,0.000007149278,0.000011005493,0.00010295948,0.00004867405,0.9500699,0.0021502364,0.044142287,0.0031347445,0.00001309697],"about_ca_topic_score_codex":0.0008647829,"about_ca_topic_score_gemma":0.00083176635,"teacher_disagreement_score":0.0033424655,"about_ca_system_score_codex":0.00093298167,"about_ca_system_score_gemma":0.0007602318,"threshold_uncertainty_score":0.011181712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14625256,0.0017522512,0.81969845,0.0018984353,0.00011616456,0.00012346906,0.001081718,0.00096027815,0.028116677],"genre_scores_gemma":[0.7372486,0.0015881252,0.2510248,0.00038231807,0.00014865753,0.00018255047,0.001894274,0.00035441454,0.007176259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.00054012245,0.00008002566,0.00037905664,0.0004416384,0.00022346275],"domain_scores_gemma":[0.9922047,0.0055798576,0.0005649867,0.00089596806,0.00044400568,0.0003104197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013572566,0.00089870836,0.0010797422,0.0009871023,0.0006413446,0.0020381585,0.0023211585,0.0013380673,0.0060194465],"category_scores_gemma":[0.014680047,0.00072153803,0.00085736456,0.0019412938,0.0010741067,0.005135025,0.002441752,0.0022919148,0.00075924397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038656758,0.00012069263,0.0019896224,0.0004078058,0.00007592399,0.00015167003,0.00033245247,0.7355159,0.0036782294,0.17875157,0.0089337565,0.069655806],"study_design_scores_gemma":[0.000030820167,0.000039853232,0.00038868916,0.00003676862,0.000020989664,0.000106956824,0.0000937109,0.83459574,0.0010543226,0.16000725,0.003615214,0.0000096832455],"about_ca_topic_score_codex":0.0019298053,"about_ca_topic_score_gemma":0.0030213285,"teacher_disagreement_score":0.0060194465,"about_ca_system_score_codex":0.0020359987,"about_ca_system_score_gemma":0.00079500006,"threshold_uncertainty_score":0.020137072},"labels":[],"label_agreement":null},{"id":"W2243190840","doi":"10.5555/2722129.2722244","title":"Four terminal planar Delta-Wye reducibility via rooted K2,4 minors","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Terminal (telecommunication); Mathematical proof; Computer science; Geometry; Telecommunications","score_opus":0.03958629530490731,"score_gpt":0.30459664743458625,"score_spread":0.26501035212967894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243190840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363701,0.00016613714,0.3206537,0.00050449366,0.000054264714,0.00017233058,0.000666376,0.001358665,0.040054005],"genre_scores_gemma":[0.8544525,0.00025852225,0.1266196,0.000116913376,0.000030146659,0.000092878974,0.0018716239,0.0003252162,0.016232496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999634,0.000041557516,0.000021052128,0.00010953656,0.000112029724,0.00008170071],"domain_scores_gemma":[0.9993325,0.00023674675,0.0000962472,0.00019485422,0.00007621597,0.0000634357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019739948,0.0005326066,0.00039686603,0.00057867524,0.00068167376,0.0011457289,0.0006582327,0.00040160658,0.0055847005],"category_scores_gemma":[0.0014270209,0.00042899247,0.0009811621,0.00049761933,0.0010819301,0.0014562343,0.0016269378,0.0014959003,0.0009110702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056741154,0.0002607978,0.0034848133,0.00056231313,0.00007965923,0.0015825769,0.0015608969,0.057431474,0.079972945,0.6836815,0.008257411,0.1625582],"study_design_scores_gemma":[0.0000844015,0.00021745676,0.0022800916,0.000052977426,0.00006373135,0.0012743741,0.00060311786,0.08283524,0.06793615,0.81974065,0.024853013,0.00005880565],"about_ca_topic_score_codex":0.0013761997,"about_ca_topic_score_gemma":0.0018953274,"teacher_disagreement_score":0.0055847005,"about_ca_system_score_codex":0.0006751058,"about_ca_system_score_gemma":0.00045354763,"threshold_uncertainty_score":0.018682659},"labels":[],"label_agreement":null},{"id":"W2250014226","doi":"10.5555/2722129.2722164","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems: extended abstract","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Approximation algorithm; Linear programming; Latency (audio); Leverage (statistics); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Computer network; Artificial intelligence; Telecommunications","score_opus":0.05793689123546252,"score_gpt":0.31696333685336847,"score_spread":0.25902644561790594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250014226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017276144,0.00086871476,0.96862674,0.0011366546,0.0001391721,0.00009778132,0.00021917197,0.00087031646,0.010765351],"genre_scores_gemma":[0.35046828,0.0008483324,0.6369488,0.0007223031,0.00023014574,0.00048013087,0.00083861133,0.00047176433,0.008991613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987876,0.00045994017,0.000046040954,0.00021526887,0.00022078276,0.0002703573],"domain_scores_gemma":[0.9976922,0.0015658326,0.00017936256,0.00021444546,0.0002390859,0.00010905398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815982,0.0014132169,0.0011177426,0.0007160935,0.00072335114,0.002088961,0.0022114967,0.0016168369,0.007376805],"category_scores_gemma":[0.0054981294,0.0006252007,0.0011317779,0.0017138778,0.0007792821,0.0023862647,0.0017534096,0.0030745158,0.0017775496],"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.00017661453,0.00020416258,0.00062186166,0.0001760067,0.00004820436,0.000060420138,0.00007950261,0.90944433,0.00059965695,0.031944696,0.006920706,0.04972378],"study_design_scores_gemma":[0.000019626017,0.000016972255,0.000035339363,0.000012231677,0.00000449054,0.000010108399,0.00002069588,0.98619926,0.00019542874,0.012704089,0.0007787101,0.000003000934],"about_ca_topic_score_codex":0.00767233,"about_ca_topic_score_gemma":0.008119266,"teacher_disagreement_score":0.00767233,"about_ca_system_score_codex":0.002068526,"about_ca_system_score_gemma":0.0021053255,"threshold_uncertainty_score":0.024677932},"labels":[],"label_agreement":null},{"id":"W2293881964","doi":"10.5555/982792.982868","title":"Quantum computing","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","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":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.009554623655394454,"score_gpt":0.245890453918573,"score_spread":0.23633583026317856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293881964","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012237716,0.033244416,0.104765765,0.027964197,0.018650806,0.00015486203,0.0005990022,0.00066553237,0.8017177],"genre_scores_gemma":[0.33844343,0.029250387,0.043297358,0.00392392,0.010095549,0.00029018268,0.0008355631,0.0006002918,0.5732633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993326,0.00015790029,0.000020201349,0.00009995011,0.0003075936,0.00008162538],"domain_scores_gemma":[0.9994777,0.00009921242,0.000015451014,0.0001717585,0.00015141972,0.000084438914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087233685,0.0006662317,0.0007900271,0.0013282747,0.0022765193,0.003183349,0.000711026,0.0012419719,0.030222217],"category_scores_gemma":[0.0015924983,0.00041664302,0.0004544799,0.0012653104,0.0022280228,0.0033815582,0.0023752803,0.0025753055,0.0053958106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016059095,0.00001542741,0.000046345103,0.000049400343,0.000007334902,0.000009105393,0.00005304581,0.00046875063,0.00064494385,0.938327,0.03579256,0.024569945],"study_design_scores_gemma":[0.000012913323,0.000023906516,0.00018071222,0.00006597818,0.000009794434,0.0000503509,0.00004084565,0.003916192,0.0019269793,0.64584494,0.34791297,0.000014442389],"about_ca_topic_score_codex":0.0010047082,"about_ca_topic_score_gemma":0.0013741989,"teacher_disagreement_score":0.030222217,"about_ca_system_score_codex":0.002510532,"about_ca_system_score_gemma":0.0015377941,"threshold_uncertainty_score":0.101103365},"labels":[],"label_agreement":null},{"id":"W2295288220","doi":"10.5555/2884435.2884580","title":"Weak duality for packing edge-disjoint odd (u, v)-trails","year":2016,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Duality (order theory); Time complexity; Discrete mathematics","score_opus":0.029410264380123948,"score_gpt":0.3144581138483648,"score_spread":0.28504784946824085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295288220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23849219,0.00040970944,0.749439,0.0005580104,0.00008792984,0.00010204058,0.0003233335,0.0004695393,0.010118222],"genre_scores_gemma":[0.6718094,0.00059079845,0.31720507,0.00030227596,0.00012205682,0.000196069,0.00096842385,0.0003046325,0.008501289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778205,0.0007272772,0.00016366312,0.00043545134,0.00053555303,0.0003559274],"domain_scores_gemma":[0.9932761,0.0032041834,0.0007021072,0.0016085571,0.0005294055,0.0006796385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019333821,0.00088066625,0.0014241678,0.0009791986,0.0012230449,0.0024919098,0.0017483426,0.0009171404,0.004273754],"category_scores_gemma":[0.009708078,0.0009046385,0.0013228467,0.0014785519,0.0021107933,0.009475105,0.0046356353,0.0024092842,0.0009449467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00105459,0.0003389402,0.0035568117,0.0006412976,0.000112183836,0.0003800777,0.0011605984,0.14410514,0.022223137,0.68063,0.0060528917,0.13974436],"study_design_scores_gemma":[0.00006069045,0.00047846945,0.000761787,0.00006156083,0.000043898468,0.00042981244,0.0003571127,0.35392088,0.012937184,0.62094337,0.009959425,0.000045853736],"about_ca_topic_score_codex":0.0006048261,"about_ca_topic_score_gemma":0.00042835093,"teacher_disagreement_score":0.004273754,"about_ca_system_score_codex":0.0010385994,"about_ca_system_score_gemma":0.00080892065,"threshold_uncertainty_score":0.014297068},"labels":[],"label_agreement":null},{"id":"W2395489635","doi":"10.5555/2627817.2627898","title":"Dynamic graph connectivity in polylogarithmic worst case time","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":141,"is_retracted":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; Time complexity; Binary logarithm; Amortized analysis; Computer science; Graph; Enhanced Data Rates for GSM Evolution; Preprocessor; Upper and lower bounds; Data structure; Matching (statistics); Discrete mathematics; Path (computing); Sequence (biology); Mathematics; Algorithm","score_opus":0.0061883137897224185,"score_gpt":0.23245964126258176,"score_spread":0.22627132747285933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395489635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21077752,0.00545556,0.68683434,0.020283883,0.00089780416,0.001075591,0.008608968,0.024105253,0.041961078],"genre_scores_gemma":[0.62149113,0.0014868889,0.3544714,0.0020251232,0.00060846703,0.0010131132,0.006820535,0.0023044366,0.00977897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867727,0.0022076576,0.0008988484,0.0030668494,0.0046942485,0.0023597253],"domain_scores_gemma":[0.9613441,0.025901232,0.0025923532,0.00735708,0.0017955876,0.0010096396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080792,0.0025951725,0.0023033724,0.0023479415,0.0022494167,0.007816906,0.005159807,0.003523184,0.013378687],"category_scores_gemma":[0.03013197,0.0016927128,0.0021581622,0.006499964,0.0030490565,0.016658118,0.0038320504,0.0045483825,0.0031634895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004730037,0.0011154205,0.008050062,0.001990333,0.00052287226,0.00094913907,0.0011489699,0.46529475,0.03721242,0.0889868,0.0668744,0.3231249],"study_design_scores_gemma":[0.0007033346,0.00028837883,0.0014128253,0.00012679929,0.0002802556,0.0010723723,0.00047958086,0.7546094,0.014282493,0.21149322,0.0151639255,0.00008742775],"about_ca_topic_score_codex":0.0065651513,"about_ca_topic_score_gemma":0.012516663,"teacher_disagreement_score":0.013378687,"about_ca_system_score_codex":0.006602376,"about_ca_system_score_gemma":0.0065852692,"threshold_uncertainty_score":0.047903836},"labels":[],"label_agreement":null},{"id":"W2569985645","doi":"10.5555/2627817.2627876","title":"The traveling salesman problem for lines, balls and planes","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Travelling salesman problem; Combinatorics; Plane (geometry); Approximation algorithm; Mathematics; Space (punctuation); Unit sphere; Set (abstract data type); Unit (ring theory); Mathematical optimization; Computer science; Geometry","score_opus":0.010092521598962808,"score_gpt":0.23692265881607769,"score_spread":0.22683013721711487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569985645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09902538,0.0016443374,0.8807581,0.0010252993,0.00015722004,0.000138107,0.00056664436,0.00094477163,0.015740143],"genre_scores_gemma":[0.34322006,0.0018836663,0.6366518,0.00017350324,0.00011415804,0.0002129948,0.0012434344,0.0004141717,0.016086098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.00015259712,0.00003004119,0.000116665455,0.000121187295,0.000081063044],"domain_scores_gemma":[0.9992945,0.00039887158,0.000085022475,0.00009424207,0.00008138249,0.00004597023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048299704,0.0006135564,0.0007925229,0.0006242864,0.00065962755,0.0012858607,0.0013734357,0.00095078425,0.004903793],"category_scores_gemma":[0.0035309652,0.00050973316,0.00082868896,0.0013604084,0.0005006228,0.0034382362,0.00091042253,0.0011169193,0.0010515978],"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.0002892534,0.00013819493,0.0011298482,0.00025436608,0.000047647423,0.0002143007,0.00026575627,0.66570115,0.002790479,0.1689396,0.016001618,0.14422779],"study_design_scores_gemma":[0.00002491369,0.000057173125,0.00022305,0.000022166641,0.000013778592,0.000097471675,0.000098733755,0.9332641,0.0010185469,0.05543554,0.009733648,0.000010860501],"about_ca_topic_score_codex":0.0134473145,"about_ca_topic_score_gemma":0.01084004,"teacher_disagreement_score":0.0134473145,"about_ca_system_score_codex":0.0013737457,"about_ca_system_score_gemma":0.00091681414,"threshold_uncertainty_score":0.026738107},"labels":[],"label_agreement":null},{"id":"W2570771845","doi":"10.5555/1496770.1496840","title":"Succinct geometric indexes supporting point location queries","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","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; Carleton University","funders":"","keywords":"Point location; Point (geometry); Bounded function; Entropy (arrow of time); Combinatorics; Computational geometry; Mathematics; Set (abstract data type); Planar; Computer science; Line segment; Geometric primitive; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","score_opus":0.009640366075033085,"score_gpt":0.26272147228019915,"score_spread":0.25308110620516605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570771845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055415124,0.0005536354,0.93271446,0.00050440815,0.00013012491,0.00024947186,0.0017992578,0.0048177326,0.003815864],"genre_scores_gemma":[0.43869683,0.000729595,0.5483346,0.0005247403,0.00022684156,0.0006610765,0.0055834,0.00066741946,0.00457545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636406,0.0005171886,0.00067202083,0.0004382726,0.0016522437,0.00035615888],"domain_scores_gemma":[0.98375016,0.0039979033,0.0017803177,0.007740561,0.0024091583,0.00032189267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019281501,0.0009996992,0.0019836673,0.0019218551,0.0009931594,0.0033155303,0.0030595688,0.0012095465,0.005534516],"category_scores_gemma":[0.017543895,0.0009024187,0.00068672164,0.0040653814,0.0014719254,0.011089173,0.0047433423,0.0015542116,0.0029557971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028479,0.00056997995,0.008760642,0.0010567623,0.00012136905,0.00038800223,0.0011359467,0.12206819,0.0706425,0.20198657,0.022635274,0.5677869],"study_design_scores_gemma":[0.00056599977,0.0013253139,0.0018122506,0.00024133793,0.00015518053,0.0008289301,0.00066604756,0.59311044,0.1474271,0.18690833,0.066691376,0.00026768335],"about_ca_topic_score_codex":0.0010071401,"about_ca_topic_score_gemma":0.0013079086,"teacher_disagreement_score":0.005534516,"about_ca_system_score_codex":0.001093605,"about_ca_system_score_gemma":0.0019029025,"threshold_uncertainty_score":0.018514872},"labels":[],"label_agreement":null},{"id":"W2621248669","doi":"10.5555/1109557.1109588","title":"Cake cutting really is not a piece of cake","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"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":"Protocol (science); Bounding overwatch; Upper and lower bounds; Divide and conquer algorithms; Mathematics; Computer science; Value (mathematics); Combinatorics; Algorithm; Artificial intelligence; Statistics","score_opus":0.008784925928344135,"score_gpt":0.2371651895573972,"score_spread":0.2283802636290531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621248669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07885603,0.00039012855,0.8950524,0.003635575,0.00015499444,0.00021337604,0.00021947057,0.0007496653,0.020728348],"genre_scores_gemma":[0.6118445,0.0003846261,0.36587054,0.0007371986,0.00010712356,0.00037689085,0.00033833287,0.00042073848,0.019920105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950244,0.000961487,0.00027672082,0.0015987514,0.0013030238,0.00083567307],"domain_scores_gemma":[0.98487943,0.0074209706,0.0009596367,0.0055974685,0.00065605156,0.00048636223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030437142,0.0006970107,0.001643994,0.0004941647,0.002840028,0.004587442,0.00280599,0.0032860192,0.009609706],"category_scores_gemma":[0.017269488,0.0008653323,0.0018106772,0.0011911495,0.0055027334,0.015586082,0.004410712,0.006589812,0.001296539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005513646,0.00015066056,0.00096732395,0.0002823054,0.000104906234,0.0002451601,0.00060278043,0.061658464,0.00971879,0.8724631,0.00484226,0.048412777],"study_design_scores_gemma":[0.00010168453,0.00016293522,0.00034578456,0.00006247461,0.00006736215,0.00037868615,0.00031697552,0.1630714,0.012200974,0.8043595,0.018862559,0.000069763155],"about_ca_topic_score_codex":0.0022862593,"about_ca_topic_score_gemma":0.002275036,"teacher_disagreement_score":0.009609706,"about_ca_system_score_codex":0.0017930467,"about_ca_system_score_gemma":0.0022533059,"threshold_uncertainty_score":0.032147646},"labels":[],"label_agreement":null},{"id":"W2621324178","doi":"10.5555/1283383.1283446","title":"Tree exploration with logarithmic memory","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Computer science; Node (physics); Tree (set theory); Network topology; Logarithm; Binary logarithm; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Task (project management); Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence","score_opus":0.018104980120028976,"score_gpt":0.2619032041318963,"score_spread":0.24379822401186735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621324178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19382031,0.0022844342,0.77684444,0.0013492438,0.00012763405,0.00012243466,0.00061266567,0.0023670506,0.022471737],"genre_scores_gemma":[0.7500607,0.0009946837,0.23709704,0.00027584648,0.00006100246,0.00030023887,0.00059500843,0.0002924401,0.010323139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.0000886066,0.000021384189,0.00008327147,0.00007233626,0.00012119833],"domain_scores_gemma":[0.9983608,0.001064085,0.00012215825,0.00026025332,0.00009726459,0.000095461764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039889372,0.00057838217,0.00075826887,0.0004298304,0.00061700563,0.0010916444,0.0014132399,0.0009965398,0.0071659703],"category_scores_gemma":[0.003846026,0.00027419702,0.00052976015,0.0009908231,0.00072085485,0.0038317791,0.0017218932,0.0007996842,0.0011393565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016327762,0.00018526525,0.0015714616,0.00054492225,0.000083697894,0.00040771806,0.0003759915,0.77228737,0.009961211,0.07838773,0.009081185,0.12548058],"study_design_scores_gemma":[0.00009792434,0.000114507,0.00016592092,0.000019530034,0.000022551034,0.00010631372,0.00005434522,0.9084169,0.0028034642,0.08522197,0.002964132,0.000012443772],"about_ca_topic_score_codex":0.0018794762,"about_ca_topic_score_gemma":0.0019330427,"teacher_disagreement_score":0.0071659703,"about_ca_system_score_codex":0.00065799506,"about_ca_system_score_gemma":0.0006754559,"threshold_uncertainty_score":0.02397257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036947966,0.00039325503,0.95377713,0.00032764566,0.000064504144,0.00016923546,0.0004431405,0.0018717685,0.0060054427],"genre_scores_gemma":[0.30299315,0.0006058382,0.6826014,0.0003095976,0.00010836353,0.00044963733,0.0020622655,0.000999502,0.009870203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869955,0.00026375407,0.000088980974,0.0003305603,0.00043255603,0.00018459931],"domain_scores_gemma":[0.9961462,0.0013308721,0.0003443467,0.0014068832,0.0004674476,0.00030431847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336866,0.0012579719,0.0009892079,0.0017376115,0.00080649194,0.0016483772,0.0016443728,0.00084894185,0.007611313],"category_scores_gemma":[0.006526329,0.00088254834,0.0010773912,0.0016365096,0.000980905,0.0041509517,0.003387822,0.0019712707,0.002637351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008710199,0.00026295424,0.0021443055,0.0005494635,0.00012365919,0.0003220981,0.00086970173,0.19137628,0.040056158,0.25855583,0.020437526,0.48443103],"study_design_scores_gemma":[0.000107138185,0.00017378738,0.00042254446,0.00010215001,0.000049013604,0.00031899285,0.00017813986,0.5795663,0.018218817,0.3803138,0.020498823,0.00005050353],"about_ca_topic_score_codex":0.0012025698,"about_ca_topic_score_gemma":0.0017711275,"teacher_disagreement_score":0.007611313,"about_ca_system_score_codex":0.00091971626,"about_ca_system_score_gemma":0.000692063,"threshold_uncertainty_score":0.02546233},"labels":[],"label_agreement":null},{"id":"W2962748838","doi":"10.5555/3310435.3310479","title":"Testing halfspaces over rotation-invariant distributions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Logarithm; Invariant (physics); Mathematics; Rotation (mathematics); Function (biology); Distribution (mathematics); Probability distribution; Sign (mathematics); Discrete mathematics; Combinatorics; Sign function; Algorithm; Mathematical analysis; Geometry; Statistics","score_opus":0.010179169663962507,"score_gpt":0.2524591371140157,"score_spread":0.24227996745005317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962748838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119288325,0.00021868109,0.87693167,0.000444826,0.000046531302,0.00008943229,0.00033091073,0.001028359,0.0016213204],"genre_scores_gemma":[0.75292563,0.00012363018,0.2435914,0.0003818256,0.00007784649,0.00021711206,0.0012454037,0.00019235979,0.0012447601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957426,0.0012707707,0.00033802667,0.0010423022,0.0011974433,0.0004087887],"domain_scores_gemma":[0.97393906,0.019215561,0.0015800999,0.0032421823,0.0012089631,0.0008140339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087693,0.0009133109,0.0013223201,0.0015670984,0.00073391024,0.0019549308,0.0028125031,0.0019594969,0.004290334],"category_scores_gemma":[0.03691076,0.00062238536,0.0012766229,0.0011427009,0.002841018,0.005240706,0.005190045,0.0020191234,0.00086571986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032210327,0.00038107723,0.02968181,0.00037531054,0.00038031122,0.0004743162,0.0005501587,0.24732314,0.020304443,0.14349777,0.005679803,0.54813075],"study_design_scores_gemma":[0.00010929982,0.00028326327,0.0019182735,0.000042468204,0.000021233362,0.00024291237,0.0001359973,0.8213049,0.00993912,0.16474561,0.0012099808,0.00004693804],"about_ca_topic_score_codex":0.0011504177,"about_ca_topic_score_gemma":0.00066223246,"teacher_disagreement_score":0.004290334,"about_ca_system_score_codex":0.0009435181,"about_ca_system_score_gemma":0.0012450811,"threshold_uncertainty_score":0.021618009},"labels":[],"label_agreement":null},{"id":"W2963204788","doi":"10.5555/3310435.3310519","title":"Proportional volume sampling and approximation algorithms for A-optimal design","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"","keywords":"Approximation algorithm; Mathematics; Matrix (chemical analysis); Mathematical optimization; Algorithm; Measure (data warehouse); Applied mathematics; Computer science","score_opus":0.02753062799451619,"score_gpt":0.26014384067166735,"score_spread":0.23261321267715115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963204788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017944393,0.00034974038,0.9966666,0.0001283501,0.000035059795,0.00004250132,0.000021892478,0.00013116396,0.00083027774],"genre_scores_gemma":[0.1951407,0.00096593995,0.79880065,0.00049947604,0.00021968408,0.00075290934,0.00035144924,0.00024205314,0.003027038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957159,0.0022320445,0.00022646645,0.00055043714,0.001010548,0.00026445495],"domain_scores_gemma":[0.97708595,0.019267218,0.00087238784,0.0013285025,0.0010932978,0.00035270804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065994025,0.002827501,0.0027913952,0.0019346864,0.00080116163,0.0020282287,0.0021339902,0.0024132289,0.0035708805],"category_scores_gemma":[0.033624023,0.0015578342,0.0016909835,0.0020416346,0.0025143225,0.0027394278,0.0029171547,0.0035848117,0.00086876337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020954925,0.00011120336,0.00084500446,0.0002072852,0.00008981139,0.00006886302,0.00012418722,0.86189926,0.0010009749,0.08159126,0.0016029655,0.052249625],"study_design_scores_gemma":[0.000023768422,0.00004046543,0.00004068646,0.000017162203,0.000008168284,0.000019056999,0.000009136117,0.96422,0.00025498544,0.034706056,0.00065397145,0.0000065099143],"about_ca_topic_score_codex":0.0049750158,"about_ca_topic_score_gemma":0.003372738,"teacher_disagreement_score":0.0065994025,"about_ca_system_score_codex":0.0021869629,"about_ca_system_score_gemma":0.0019755333,"threshold_uncertainty_score":0.03490138},"labels":[],"label_agreement":null},{"id":"W2963371280","doi":"10.5555/3039686.3039807","title":"Random walks and evolving sets: faster convergences and limitations","year":2017,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random walk; Mathematics; Random graph; Vertex (graph theory); Graph partition; Spectral gap; Graph; Combinatorics; Expander graph; Discrete mathematics","score_opus":0.07027895424714435,"score_gpt":0.34703074391581556,"score_spread":0.2767517896686712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963371280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06414192,0.0015273418,0.9247993,0.0016267681,0.000081429134,0.00014241911,0.00012648538,0.0007735455,0.006780713],"genre_scores_gemma":[0.6313133,0.0016039113,0.36002186,0.00077486143,0.00023142688,0.0005165433,0.00038133454,0.00074646826,0.004410325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345326,0.003139124,0.00028851157,0.0012279911,0.001483482,0.00040770494],"domain_scores_gemma":[0.9125263,0.07026715,0.0032818343,0.009764974,0.0026929574,0.0014667092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012964545,0.0015544803,0.0021715302,0.0026776905,0.0014448074,0.002807414,0.0046547893,0.0031402048,0.00487344],"category_scores_gemma":[0.07248848,0.0010804614,0.0026562714,0.0018024343,0.0044101197,0.011763305,0.0042666295,0.0067800283,0.0011519354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004026489,0.00019363224,0.005129748,0.0005466497,0.00017405933,0.00019511518,0.0008328929,0.27851364,0.00634162,0.63489306,0.0017460248,0.07103086],"study_design_scores_gemma":[0.000027228694,0.00008488717,0.00036585398,0.00006109018,0.00002893806,0.00010767967,0.00005864344,0.8331704,0.0027679757,0.16189219,0.0014096865,0.000025407833],"about_ca_topic_score_codex":0.0018622006,"about_ca_topic_score_gemma":0.0014428631,"teacher_disagreement_score":0.012964545,"about_ca_system_score_codex":0.0018533611,"about_ca_system_score_gemma":0.0010700796,"threshold_uncertainty_score":0.06856388},"labels":[],"label_agreement":null},{"id":"W2963575846","doi":"10.5555/2627817.2627912","title":"Frozen variables in random boolean constraint satisfaction problems","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Data Management and Algorithms","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":"Constraint satisfaction problem; Constraint (computer-aided design); Heuristics; Cluster analysis; Constraint satisfaction; Local consistency; Mathematics; Random variable; Algorithm; Computer science; Hypergraph; Discrete mathematics; Mathematical optimization; Statistics","score_opus":0.010199872324038213,"score_gpt":0.22240178705055139,"score_spread":0.21220191472651317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963575846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31647733,0.0014942206,0.66780555,0.0022007967,0.000060739578,0.00016990752,0.00059083564,0.0007042441,0.010496429],"genre_scores_gemma":[0.9473913,0.000632974,0.047562484,0.0002701696,0.000065430766,0.00023565779,0.0005542738,0.00015404301,0.003133831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997273,0.001158625,0.00008628702,0.0004886623,0.00046707928,0.00052630855],"domain_scores_gemma":[0.9852207,0.012002287,0.0009933023,0.0006408932,0.0005062746,0.0006365601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00340302,0.0010287797,0.001417553,0.0015120138,0.0011544363,0.002350305,0.0026765105,0.0014654694,0.004738858],"category_scores_gemma":[0.020175328,0.0010494621,0.001615166,0.0014155121,0.003076304,0.0046288436,0.0023590187,0.0026959185,0.00032978185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025768633,0.00012217573,0.002170872,0.00020276805,0.000091449656,0.00024450323,0.0003503628,0.5253381,0.0020194547,0.45498687,0.0033327425,0.010883043],"study_design_scores_gemma":[0.000042183197,0.000039818337,0.00036132798,0.000027626527,0.000016411144,0.000092891445,0.00006391457,0.7327913,0.00070717774,0.26501206,0.0008215411,0.000023730265],"about_ca_topic_score_codex":0.005491907,"about_ca_topic_score_gemma":0.0048090955,"teacher_disagreement_score":0.005491907,"about_ca_system_score_codex":0.0030854295,"about_ca_system_score_gemma":0.0011625665,"threshold_uncertainty_score":0.022386491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10845279,0.0011107756,0.846444,0.007620542,0.00025082385,0.00051588373,0.0015173225,0.0010878431,0.032999936],"genre_scores_gemma":[0.7922494,0.0013974672,0.19230983,0.0014208107,0.00040148414,0.0011223728,0.001406295,0.0007168493,0.008975576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98809075,0.0049828067,0.00066453323,0.0028792946,0.0019391823,0.0014433818],"domain_scores_gemma":[0.931049,0.05362459,0.0033817773,0.008072866,0.0015093948,0.002362494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063625486,0.0019650664,0.002657784,0.0009564748,0.0018046062,0.005543052,0.005467542,0.0035738493,0.01047215],"category_scores_gemma":[0.055978414,0.0014816208,0.0030101058,0.0014265887,0.0047806613,0.017993404,0.0052877935,0.010622882,0.0012940809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011738571,0.00033464705,0.0035407566,0.00082312216,0.0002244564,0.00027519505,0.0010138962,0.23486856,0.005276635,0.70581955,0.010511239,0.036138125],"study_design_scores_gemma":[0.00014065632,0.00013535922,0.00053496927,0.00008933713,0.00008210696,0.0002469514,0.00020755983,0.25397438,0.0020771546,0.7374439,0.005004606,0.00006302322],"about_ca_topic_score_codex":0.0017339101,"about_ca_topic_score_gemma":0.0015358501,"teacher_disagreement_score":0.01047215,"about_ca_system_score_codex":0.0040807496,"about_ca_system_score_gemma":0.0032027392,"threshold_uncertainty_score":0.03503281},"labels":[],"label_agreement":null},{"id":"W2963846312","doi":"10.5555/3310435.3310527","title":"Every collinear set in a planar graph is free","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Plane (geometry); Mathematics; Planar straight-line graph; Set (abstract data type); Graph drawing; Discrete mathematics; Computer science; Geometry; Line graph; 1-planar graph; Computer graphics (images)","score_opus":0.011157125908587074,"score_gpt":0.24427974828954613,"score_spread":0.23312262238095904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963846312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34330896,0.0009857517,0.5998617,0.00087758934,0.00019521652,0.00010455836,0.0011174409,0.0010139563,0.052534785],"genre_scores_gemma":[0.8548332,0.0009504624,0.12711169,0.00026695005,0.00013773018,0.000156313,0.0016232273,0.00038283822,0.014537636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986761,0.0001419031,0.00007410327,0.0005043046,0.00038029495,0.00022332522],"domain_scores_gemma":[0.99741226,0.0011466537,0.00040915422,0.00049566437,0.00030602067,0.0002301991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043970294,0.0009608232,0.0008344476,0.001686469,0.0017290374,0.0022141584,0.0016217914,0.0008758261,0.009605356],"category_scores_gemma":[0.0024855305,0.0009880988,0.0010926485,0.0024009335,0.0029055385,0.003621491,0.0033097789,0.0018763685,0.0011545599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014773497,0.0000589325,0.0013063137,0.0003351271,0.000080221056,0.0007243265,0.0009816586,0.018647466,0.011506139,0.9024231,0.0042552077,0.059533797],"study_design_scores_gemma":[0.000048355392,0.00012499302,0.0011215138,0.00006980729,0.00010903666,0.0011874842,0.00040176953,0.02608632,0.013982126,0.90854895,0.048246775,0.00007291189],"about_ca_topic_score_codex":0.001425704,"about_ca_topic_score_gemma":0.0013830371,"teacher_disagreement_score":0.009605356,"about_ca_system_score_codex":0.00060591084,"about_ca_system_score_gemma":0.00041054963,"threshold_uncertainty_score":0.032133102},"labels":[],"label_agreement":null},{"id":"W3136071702","doi":"10.5555/2722129.2722235","title":"Compatible connectivity-augmentation of planar disconnected graphs","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Upper and lower bounds; Planar; Morphing; Mathematics; Graph; Vertex connectivity; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.027862759519157045,"score_gpt":0.2748712602260167,"score_spread":0.24700850070685967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136071702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27857473,0.00032311137,0.7031688,0.0008490214,0.00006075733,0.00036391665,0.0007055362,0.0011540448,0.01480003],"genre_scores_gemma":[0.63789773,0.0003506303,0.35498977,0.00017053807,0.00007507874,0.00038097487,0.0019776607,0.00022865832,0.003929029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.0004853684,0.00008482685,0.0003967297,0.00033507717,0.0001477668],"domain_scores_gemma":[0.99512595,0.0028282944,0.00057040807,0.00091921235,0.0002608932,0.00029531005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009961198,0.0011812336,0.0008726078,0.0008250056,0.0008070505,0.0013852728,0.0018685743,0.0013669183,0.004530627],"category_scores_gemma":[0.006812892,0.0008014189,0.0011299159,0.0014236226,0.0016226433,0.0044207093,0.0028548518,0.0013542178,0.000633002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008300061,0.0003898054,0.005105762,0.00074503303,0.00009212542,0.001392699,0.00079788186,0.53243214,0.029647663,0.2801653,0.006141507,0.14226],"study_design_scores_gemma":[0.00009641555,0.0002556833,0.0010985989,0.000077432844,0.000049479895,0.00090252014,0.00032524654,0.7093404,0.016673319,0.26103306,0.010099012,0.000048843314],"about_ca_topic_score_codex":0.00082038343,"about_ca_topic_score_gemma":0.000916291,"teacher_disagreement_score":0.004530627,"about_ca_system_score_codex":0.00069992826,"about_ca_system_score_gemma":0.00054925797,"threshold_uncertainty_score":0.0151565075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02508046,0.0069485223,0.8993498,0.0062185666,0.000715232,0.0008845685,0.0018831915,0.0013482425,0.057571482],"genre_scores_gemma":[0.31439766,0.004772592,0.65689963,0.002603084,0.00093915913,0.0021528965,0.0030364038,0.0010066173,0.014191932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493766,0.0022163757,0.00028877213,0.0006929596,0.0009833245,0.0008808746],"domain_scores_gemma":[0.93483645,0.058949903,0.0017019828,0.0017593092,0.0020038993,0.00074852584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007129329,0.0029431598,0.0023191485,0.0024000348,0.0018851451,0.005148188,0.0031087778,0.0026458588,0.012554871],"category_scores_gemma":[0.034311656,0.0014644943,0.0034962012,0.0030772123,0.0029745502,0.006072242,0.0027720174,0.006348329,0.0016984305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003810291,0.0005410335,0.002981366,0.0018069881,0.00049035926,0.0002537067,0.0005743629,0.45801315,0.0012199299,0.40537342,0.038514797,0.08984978],"study_design_scores_gemma":[0.000157829,0.00010657562,0.00048840826,0.00021879225,0.00011217321,0.00011470187,0.00018106506,0.548651,0.00037437098,0.43940783,0.010159501,0.00002771918],"about_ca_topic_score_codex":0.007750849,"about_ca_topic_score_gemma":0.011967546,"teacher_disagreement_score":0.012554871,"about_ca_system_score_codex":0.005265226,"about_ca_system_score_gemma":0.0053082863,"threshold_uncertainty_score":0.042000294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045390103,0.0048340396,0.5089405,0.094053365,0.0039003755,0.00040583717,0.0025094838,0.009562772,0.33040348],"genre_scores_gemma":[0.48300496,0.003789251,0.23287621,0.016815903,0.0016159777,0.00073788303,0.0029433984,0.0036107665,0.25460568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950971,0.0011577134,0.00022544742,0.0013645164,0.0014788778,0.0006763055],"domain_scores_gemma":[0.9752157,0.01431304,0.0010141715,0.0062013925,0.0019687978,0.0012868948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027985491,0.0015737632,0.001415421,0.0009406839,0.003300213,0.0045905528,0.0024984826,0.004861211,0.07356017],"category_scores_gemma":[0.026778776,0.001144977,0.0013585525,0.0013288112,0.0035814065,0.017350078,0.005349311,0.0068036187,0.04001835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009471826,0.00048721526,0.001873474,0.0008681668,0.000112981485,0.000445378,0.0010454044,0.0053411303,0.013429059,0.5842596,0.16064541,0.23054497],"study_design_scores_gemma":[0.00009917645,0.00018566009,0.00065284705,0.00024519593,0.00007265813,0.00068468734,0.0004684773,0.020306278,0.009333703,0.70044255,0.2674126,0.0000961982],"about_ca_topic_score_codex":0.0011429513,"about_ca_topic_score_gemma":0.0017411436,"teacher_disagreement_score":0.07356017,"about_ca_system_score_codex":0.0019261652,"about_ca_system_score_gemma":0.0017054164,"threshold_uncertainty_score":0.24608332},"labels":[],"label_agreement":null}]}