{"meta":{"query_hash":"70df5d166ff1","filters":{"venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/70df5d166ff1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+seventeenth+annual+ACM-SIAM+symposium+on+Discrete+algorithm+-+SODA+%2706"},"results":[{"id":"W2952250066","doi":"10.1145/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Distributed computing; Resource allocation; Distributed algorithm; Mathematical optimization; Load balancing (electrical power); Martingale (probability theory); Multi-agent system; Mathematics; Computer network; Artificial intelligence","score_opus":0.015425297057347168,"score_gpt":0.28647595615258414,"score_spread":0.27105065909523696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952250066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0853254,0.0002556427,0.90019333,0.00068466656,0.00012049777,0.00015572556,0.0000887421,0.00076418626,0.0124118],"genre_scores_gemma":[0.9529914,0.00012706229,0.040178757,0.00013036458,0.000060725964,0.00015067248,0.00006702631,0.000045719786,0.00624815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00028403994,0.00004961747,0.0002540539,0.00029202492,0.0001767591],"domain_scores_gemma":[0.99827766,0.0006057016,0.00027507785,0.0004119252,0.00023917896,0.0001904255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647641,0.00048129036,0.0007002752,0.00038564278,0.0008683308,0.001389446,0.0019569984,0.00084197137,0.0036502315],"category_scores_gemma":[0.0042623635,0.00031934574,0.000314963,0.00042078673,0.0009948844,0.0020109469,0.0020499816,0.00063275534,0.00060545333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008584269,0.00021376637,0.0020246746,0.00020034742,0.00012293636,0.0005063142,0.00060720835,0.6838487,0.02566433,0.20966597,0.0057309866,0.070556365],"study_design_scores_gemma":[0.000055647208,0.00006901599,0.00020808275,0.0000072209828,0.000011806917,0.00010511635,0.00005330793,0.94912124,0.0021799712,0.04476003,0.003415549,0.000013012218],"about_ca_topic_score_codex":0.00089787605,"about_ca_topic_score_gemma":0.00086672103,"teacher_disagreement_score":0.0036502315,"about_ca_system_score_codex":0.00095758314,"about_ca_system_score_gemma":0.00080935244,"threshold_uncertainty_score":0.012211204},"labels":[],"label_agreement":null},{"id":"W4230719382","doi":"10.1145/1109557.1109603","title":"Implicit dictionaries with <i>O</i>(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Constant (computer programming); Computer science; Set (abstract data type); Order (exchange); Combinatorics; Binary logarithm; Search cost; Search problem; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language","score_opus":0.00571366836197134,"score_gpt":0.23407605207875373,"score_spread":0.22836238371678239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230719382","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.1613961,0.0017960082,0.8135396,0.0019831797,0.00030702687,0.00029511593,0.00073298824,0.0035577565,0.01639222],"genre_scores_gemma":[0.45317608,0.00081249006,0.52637136,0.0006517754,0.0004369874,0.00044868593,0.0011892389,0.00081196555,0.016101316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974408,0.0004207319,0.00029084107,0.00053252134,0.000878884,0.00043618586],"domain_scores_gemma":[0.9824473,0.006781947,0.0020928164,0.0074220416,0.00090398197,0.0003519097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012875594,0.00082500355,0.0016181745,0.0005995124,0.00097066705,0.002829825,0.0033820856,0.0018410209,0.0059184534],"category_scores_gemma":[0.01587225,0.0011187451,0.0007672643,0.0023874873,0.0023975554,0.015586398,0.003607992,0.002519149,0.0036497705],"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.0032706035,0.0006325871,0.006238894,0.0013407358,0.00012947855,0.0005587483,0.0014276849,0.12518811,0.046426788,0.22900768,0.03010303,0.5556756],"study_design_scores_gemma":[0.0007259132,0.0015928166,0.0029738636,0.00025488198,0.00017786335,0.0023578904,0.00061979133,0.60921407,0.05825653,0.27972242,0.043891527,0.00021244015],"about_ca_topic_score_codex":0.0012082164,"about_ca_topic_score_gemma":0.0022811193,"teacher_disagreement_score":0.0059184534,"about_ca_system_score_codex":0.0010403185,"about_ca_system_score_gemma":0.0018122102,"threshold_uncertainty_score":0.019799173},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.006974374443870286,"score_gpt":0.22273242763541046,"score_spread":0.21575805319154018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232943531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019682413,0.0004757719,0.974861,0.00030544246,0.000057379108,0.00005450277,0.00023938717,0.0018369888,0.0024871093],"genre_scores_gemma":[0.35646117,0.0006400464,0.63343704,0.00028852426,0.00013877875,0.00033347565,0.0012519388,0.0005590546,0.0068899603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635327,0.0008605585,0.00027525253,0.0008759529,0.0012933884,0.00034163418],"domain_scores_gemma":[0.9915592,0.0034017055,0.000760979,0.0036417425,0.00045623956,0.00018003304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012719823,0.0013615057,0.0015150829,0.0013470621,0.0007320627,0.002604861,0.004009307,0.0022346473,0.004242427],"category_scores_gemma":[0.01679778,0.0009143192,0.000987153,0.0027042483,0.0015537854,0.01038757,0.0037207894,0.0033069458,0.0020489262],"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.0007541944,0.0002930541,0.0013613953,0.0003721482,0.00010758575,0.00024648113,0.00040173094,0.5978806,0.009300991,0.19054425,0.0061726472,0.19256492],"study_design_scores_gemma":[0.00005359076,0.00009631454,0.00018179313,0.000023970242,0.000024866227,0.00021084954,0.00004930002,0.8024178,0.0066504814,0.18545067,0.004812004,0.000028365643],"about_ca_topic_score_codex":0.0016736853,"about_ca_topic_score_gemma":0.0017480529,"teacher_disagreement_score":0.004242427,"about_ca_system_score_codex":0.0023864803,"about_ca_system_score_gemma":0.0011854458,"threshold_uncertainty_score":0.017315209},"labels":[],"label_agreement":null},{"id":"W4240527869","doi":"10.1145/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":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Computational geometry; k-nearest neighbors algorithm; Regular polygon; Mathematics; Set (abstract data type); Euclidean geometry; Plane (geometry); Data structure; Point (geometry); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Geometry","score_opus":0.00865335346951196,"score_gpt":0.2471302054288218,"score_spread":0.23847685195930984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240527869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013214194,0.00043949796,0.9750611,0.00090095395,0.00015955725,0.00024006874,0.0018241188,0.005961315,0.0021991753],"genre_scores_gemma":[0.18882567,0.00037991154,0.7975419,0.000534906,0.00022482628,0.0012316215,0.006239123,0.0008282258,0.0041937814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640876,0.00046524475,0.00043010482,0.00073558616,0.0016079686,0.00035233883],"domain_scores_gemma":[0.9918527,0.001865526,0.000673527,0.004312178,0.00086896354,0.00042714938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017281306,0.000980309,0.00239216,0.0020832522,0.0021022323,0.0028448368,0.0061737145,0.0020666893,0.00750082],"category_scores_gemma":[0.011663027,0.0013028571,0.0016140437,0.004966989,0.0018863452,0.008303378,0.008064879,0.0029710722,0.0033760236],"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.0019431335,0.0008848081,0.004181194,0.0006688155,0.00017551819,0.00042051895,0.00065758306,0.18888898,0.026697109,0.20640811,0.06328851,0.50578564],"study_design_scores_gemma":[0.0004021287,0.00044840292,0.0005370597,0.00006411768,0.000059897826,0.00040905338,0.00016063049,0.8215416,0.014551489,0.12394663,0.03774539,0.0001335866],"about_ca_topic_score_codex":0.0029665725,"about_ca_topic_score_gemma":0.0039433218,"teacher_disagreement_score":0.00750082,"about_ca_system_score_codex":0.002021526,"about_ca_system_score_gemma":0.0026107172,"threshold_uncertainty_score":0.02509278},"labels":[],"label_agreement":null},{"id":"W4249211545","doi":"10.1145/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planarity testing; Morphing; Vertex (graph theory); Planar graph; Orthogonality; Computer science; Combinatorics; Planar; Book embedding; Graph drawing; Graph; Mathematics; Line graph; Pathwidth; Geometry; Computer graphics (images)","score_opus":0.006601419581088751,"score_gpt":0.2205228613318167,"score_spread":0.21392144175072794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249211545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030054512,0.00008829161,0.9609537,0.00011374641,0.000070420545,0.000109994966,0.00017582528,0.0017988761,0.00663458],"genre_scores_gemma":[0.21099344,0.00021110944,0.7800451,0.000084495936,0.000026391988,0.00013370096,0.00070335396,0.0006343199,0.007168123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999435,0.000060100658,0.000034264547,0.00011641165,0.00027515547,0.00007908683],"domain_scores_gemma":[0.99936515,0.00014529792,0.00007391356,0.000240077,0.0001323321,0.00004325363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581273,0.00059304363,0.00056366913,0.0009419368,0.00052023877,0.00090798474,0.00091463584,0.00057517586,0.0071813986],"category_scores_gemma":[0.002192973,0.0005508423,0.0007539985,0.00081035134,0.0007754357,0.0014117991,0.0025689027,0.0011334815,0.0011359103],"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.00020836863,0.00008362439,0.0013480344,0.00023731557,0.000043630476,0.00027396358,0.0003324641,0.10523248,0.041257475,0.16984539,0.010621758,0.6705155],"study_design_scores_gemma":[0.0000920839,0.00019197482,0.00088681944,0.00005526776,0.000061974744,0.0007621345,0.0003249833,0.6642469,0.049189396,0.20893359,0.075182654,0.00007231761],"about_ca_topic_score_codex":0.0011145816,"about_ca_topic_score_gemma":0.0015188848,"teacher_disagreement_score":0.0071813986,"about_ca_system_score_codex":0.00043247128,"about_ca_system_score_gemma":0.00037309143,"threshold_uncertainty_score":0.024024189},"labels":[],"label_agreement":null},{"id":"W4252592952","doi":"10.1145/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Algorithms and Data Compression","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":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Function (biology); Scheme (mathematics); Hash chain; Theoretical computer science; Algorithm; Mathematics","score_opus":0.006219280445767619,"score_gpt":0.21952164956945983,"score_spread":0.21330236912369221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252592952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066469766,0.0005558283,0.9134891,0.00041688356,0.00024202773,0.00023180968,0.00019876502,0.0011863285,0.017209603],"genre_scores_gemma":[0.7628538,0.00050322927,0.21593672,0.00035210943,0.00028016474,0.00043201708,0.00033885453,0.00029809473,0.019005064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964089,0.00079918856,0.00023184478,0.0004459616,0.0014824043,0.0006317203],"domain_scores_gemma":[0.9947349,0.00110911,0.00039292668,0.0030083554,0.00052790804,0.00022679073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023993065,0.00077980064,0.0011167316,0.00093149045,0.0014726733,0.0022105365,0.0023657638,0.0013946746,0.009335534],"category_scores_gemma":[0.007960805,0.00048531796,0.00044635643,0.001666841,0.0019759443,0.0075320946,0.005716812,0.0015195248,0.004216805],"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.0016063685,0.00027193927,0.0011574437,0.00021005774,0.00004828632,0.00025209246,0.0003587723,0.052619334,0.029890109,0.7202071,0.008253293,0.18512523],"study_design_scores_gemma":[0.00031452114,0.0003367809,0.00047422983,0.000061826315,0.000059255693,0.00071191345,0.000090204936,0.40272123,0.041018102,0.5169528,0.037156694,0.000102470425],"about_ca_topic_score_codex":0.00044798688,"about_ca_topic_score_gemma":0.0003403221,"teacher_disagreement_score":0.009335534,"about_ca_system_score_codex":0.0012342341,"about_ca_system_score_gemma":0.0012925946,"threshold_uncertainty_score":0.03123051},"labels":[],"label_agreement":null},{"id":"W4254779780","doi":"10.1145/1109557.1109599","title":"Rank/select operations on large alphabets","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":86,"is_retracted":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); Alphabet; Variety (cybernetics); Representation (politics); Computer science; Combinatorics; Binary number; Binary search algorithm; Theoretical computer science; Mathematics; Algorithm; Search algorithm; Arithmetic; Information retrieval; Artificial intelligence","score_opus":0.006358395880270913,"score_gpt":0.23519723564458858,"score_spread":0.22883883976431768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254779780","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.23012811,0.00129481,0.7352485,0.0024220843,0.0003011656,0.0003582899,0.002374929,0.0073021576,0.020569913],"genre_scores_gemma":[0.6165663,0.00080941006,0.35925528,0.0007935178,0.0005201496,0.00030749704,0.0027179257,0.00068419735,0.018345635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972264,0.00048381698,0.00025012592,0.00047979472,0.0010905917,0.00046922613],"domain_scores_gemma":[0.99140704,0.00416594,0.0006882462,0.0028198403,0.0005971694,0.00032178857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014594669,0.00061988505,0.0017559739,0.0012658396,0.0013483916,0.0025370764,0.0017715598,0.0014745333,0.012366417],"category_scores_gemma":[0.009729339,0.00040794318,0.00073847995,0.003232681,0.001338231,0.008518698,0.0027574701,0.0016386658,0.003829368],"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.003091218,0.00059780956,0.00227008,0.00081662345,0.00006490247,0.00092703116,0.0007937951,0.07352174,0.042607345,0.21578568,0.040493898,0.6190299],"study_design_scores_gemma":[0.00042834348,0.00089771335,0.000764027,0.00011362569,0.00008632644,0.0014498684,0.0008940404,0.46785176,0.07605795,0.41093087,0.0403974,0.00012803052],"about_ca_topic_score_codex":0.0010320963,"about_ca_topic_score_gemma":0.0014626544,"teacher_disagreement_score":0.012366417,"about_ca_system_score_codex":0.0006898492,"about_ca_system_score_gemma":0.0010901687,"threshold_uncertainty_score":0.041369796},"labels":[],"label_agreement":null}]}