{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9316576,0.00023506154,0.0032402715,0.021782335,0.00085208664,0.0021747455,0.0046661,0.0005012463,0.034890566],"genre_scores_gemma":[0.9876739,0.000015993804,0.0023379377,0.00034182126,0.0005462998,0.000104966486,0.000078499346,0.00005758542,0.008842991],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99363214,0.00008716414,0.0014409383,0.0011364166,0.002833466,0.00086984964],"domain_scores_gemma":[0.995555,0.00055825134,0.0011419615,0.0010067594,0.0014725479,0.00026548092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025753386,0.0005540891,0.000705285,0.00022664641,0.00068857113,0.0004048674,0.0038850363,0.00021597849,0.0001054771],"category_scores_gemma":[0.0011755624,0.0003728855,0.00060918235,0.0018685303,0.00046066352,0.0008327718,0.001114332,0.0005195237,0.0003306142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000684799,0.0037303534,0.0595573,0.0002749593,0.0005493303,0.000014451261,0.0060575204,0.0019203367,0.04693817,0.12061463,0.7266488,0.03300935],"study_design_scores_gemma":[0.004476578,0.0008879933,0.08070387,0.00074426265,0.00048074604,0.00016220384,0.013920694,0.007289282,0.14767268,0.36995468,0.37098047,0.0027265565],"about_ca_topic_score_codex":0.00010168669,"about_ca_topic_score_gemma":0.000007803882,"teacher_disagreement_score":0.35566834,"about_ca_system_score_codex":0.00021665923,"about_ca_system_score_gemma":0.00010820774,"threshold_uncertainty_score":0.9998723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41249958,0.008468738,0.4144404,0.13685231,0.00088659045,0.0075297183,0.0024921515,0.0054125106,0.011418027],"genre_scores_gemma":[0.7355933,0.00010286546,0.26208618,0.00039052984,0.0002139835,0.00012457142,0.000036054884,0.00006060369,0.0013918852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997116,0.00002889755,0.00047047512,0.00083725475,0.0009392752,0.0006080913],"domain_scores_gemma":[0.99817324,0.00006317734,0.00034860312,0.0005952749,0.0006711737,0.00014854167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035471944,0.00042897215,0.00036023356,0.00023946147,0.00060837046,0.0004440928,0.002316058,0.00013722449,0.0000040688024],"category_scores_gemma":[0.000035655274,0.0002861091,0.00014006703,0.00074804196,0.00043449417,0.0014404465,0.0012298159,0.00048808343,0.000010319498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033765446,0.00164973,0.014087714,0.0009196105,0.0005149129,0.000015801981,0.008803829,0.00034682974,0.053962413,0.8145075,0.030563138,0.07429087],"study_design_scores_gemma":[0.005246606,0.0029363078,0.026864884,0.0022550079,0.0005611288,0.0011406126,0.0056605567,0.048696794,0.644381,0.22311132,0.0340827,0.0050630704],"about_ca_topic_score_codex":0.00015737892,"about_ca_topic_score_gemma":0.000004651166,"teacher_disagreement_score":0.59139615,"about_ca_system_score_codex":0.000093588635,"about_ca_system_score_gemma":0.00007070493,"threshold_uncertainty_score":0.9999591},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.006974374443870286,"score_gpt":0.22273242763541046,"score_spread":0.21575805319154018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232943531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54305434,0.0030600876,0.3515787,0.051940694,0.0057392213,0.007557295,0.0029897678,0.0032622374,0.030817635],"genre_scores_gemma":[0.8841506,0.00013767798,0.11140321,0.00042048964,0.0009662409,0.00015118436,0.000041451265,0.00008808266,0.0026410515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620163,0.000033233773,0.0007886583,0.0010253391,0.0011158937,0.00083523453],"domain_scores_gemma":[0.9978788,0.00015780432,0.0006277444,0.0006908718,0.00043114985,0.00021362717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054447027,0.0005557214,0.0005299973,0.0003005002,0.00075768295,0.0004911797,0.0029461398,0.0001586857,0.000005893668],"category_scores_gemma":[0.00011232841,0.00044957487,0.0003383676,0.0011931806,0.00043825875,0.0015714986,0.0018272266,0.0005363292,0.0000122007405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285935,0.0021600553,0.009607502,0.0010513718,0.00047101633,0.000018607147,0.009404365,0.00059475994,0.00442465,0.85799015,0.053016067,0.06114862],"study_design_scores_gemma":[0.0073796767,0.0021014612,0.033942427,0.0032670614,0.00051253795,0.00052423344,0.005181706,0.28610417,0.059940834,0.47963,0.11559888,0.0058170143],"about_ca_topic_score_codex":0.00010518297,"about_ca_topic_score_gemma":0.0000055207806,"teacher_disagreement_score":0.37836012,"about_ca_system_score_codex":0.00011521122,"about_ca_system_score_gemma":0.000049670354,"threshold_uncertainty_score":0.9997956},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69907016,0.0018867573,0.23355792,0.043387283,0.0030374585,0.006351812,0.010282314,0.0007438758,0.0016824227],"genre_scores_gemma":[0.88673186,0.000051107643,0.10985055,0.00047258858,0.00044960072,0.000060913473,0.00058722636,0.00004893128,0.0017472509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975306,0.000023384951,0.0005110517,0.0008704371,0.00061432406,0.00045021923],"domain_scores_gemma":[0.99823225,0.00014611236,0.00042268806,0.0006217911,0.00045798923,0.000119178134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033742306,0.00036418997,0.00036448683,0.0001650346,0.000413956,0.00034804546,0.0022625225,0.00012735717,0.000005485927],"category_scores_gemma":[0.00013321397,0.00027970114,0.00013044728,0.00052599446,0.00018618323,0.0013743568,0.0014507247,0.00021289673,0.0000039094243],"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.0010496059,0.0024705578,0.012254754,0.0033978382,0.0015063824,0.000016875152,0.010220285,0.0098080225,0.100713685,0.44190428,0.1618329,0.25482482],"study_design_scores_gemma":[0.004233625,0.0014119411,0.028362574,0.00050199387,0.0002753737,0.00017231579,0.001180307,0.7891692,0.04045589,0.069192275,0.06319441,0.0018501017],"about_ca_topic_score_codex":0.000047902427,"about_ca_topic_score_gemma":0.00001267509,"teacher_disagreement_score":0.7793612,"about_ca_system_score_codex":0.000055892822,"about_ca_system_score_gemma":0.000086020744,"threshold_uncertainty_score":0.9999655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81575054,0.00071758573,0.13673413,0.027592488,0.0027288238,0.0023607942,0.0006860798,0.0009819086,0.012447622],"genre_scores_gemma":[0.9434463,0.000031514654,0.051813066,0.00076649745,0.0009693163,0.00006644573,0.00010984708,0.000054973367,0.0027420407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963912,0.000037804715,0.0007382656,0.00085545727,0.0013234579,0.0006538278],"domain_scores_gemma":[0.99814564,0.00011738099,0.00057837745,0.00044441884,0.0005398651,0.00017432065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006127068,0.00046034832,0.00040183723,0.00038768843,0.0005597042,0.00031385774,0.0023325165,0.00014624775,0.000009174373],"category_scores_gemma":[0.00008308202,0.00036585197,0.00041576085,0.0012856844,0.00015190018,0.0013694772,0.0007066553,0.00039285727,0.00003370844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035499275,0.0031515646,0.020970851,0.0008205105,0.0009005388,0.00004864442,0.007488407,0.021957185,0.07087651,0.633946,0.17683503,0.06264977],"study_design_scores_gemma":[0.008390503,0.0028265885,0.1015413,0.0018650495,0.000530135,0.0007492015,0.0021841628,0.18284665,0.2729125,0.3252743,0.095039755,0.005839838],"about_ca_topic_score_codex":0.0000705201,"about_ca_topic_score_gemma":0.000003062748,"teacher_disagreement_score":0.3086717,"about_ca_system_score_codex":0.000096161784,"about_ca_system_score_gemma":0.000086142456,"threshold_uncertainty_score":0.99987936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17937668,0.0013603434,0.73924685,0.028141282,0.0032931692,0.0068320604,0.0030149168,0.002681941,0.03605275],"genre_scores_gemma":[0.9167901,0.000073407085,0.07623648,0.00050599553,0.00082845095,0.00020789792,0.0003205968,0.00010705393,0.0049299835],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615,0.00003770514,0.00068916223,0.0010266103,0.0013328819,0.00076362473],"domain_scores_gemma":[0.997339,0.00010914522,0.00069321,0.00093958975,0.00071384,0.0002051975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042587373,0.0005334148,0.00048138737,0.0003703877,0.0006268645,0.0003444926,0.0028821162,0.000163474,0.000010572268],"category_scores_gemma":[0.00008010958,0.0003596639,0.00025911737,0.001945332,0.00018788336,0.0018119778,0.0012793792,0.00042830256,0.000053888514],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071148225,0.0064637796,0.03606915,0.0009509601,0.0010700563,0.000030136242,0.003120492,0.0061942553,0.020446327,0.075100854,0.60679007,0.24305245],"study_design_scores_gemma":[0.014012379,0.006493737,0.14541243,0.002278304,0.00079002447,0.0004486816,0.0034287507,0.3415755,0.13626613,0.030360445,0.31261078,0.0063228426],"about_ca_topic_score_codex":0.00026645267,"about_ca_topic_score_gemma":0.0000075142375,"teacher_disagreement_score":0.73741347,"about_ca_system_score_codex":0.00015343004,"about_ca_system_score_gemma":0.00009348222,"threshold_uncertainty_score":0.99988556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57621574,0.0026164881,0.24776708,0.08083202,0.009403009,0.013389737,0.010511503,0.0044889594,0.054775454],"genre_scores_gemma":[0.9323636,0.0001270232,0.057131656,0.0016408766,0.0013634795,0.00022980756,0.00026890432,0.00014247373,0.006732172],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954686,0.00006195262,0.0008366218,0.0011708807,0.0014301814,0.0010317211],"domain_scores_gemma":[0.99764144,0.00011107832,0.000411563,0.0010429707,0.00055316684,0.00023979842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064998335,0.00063963706,0.00057577307,0.00028764544,0.0008914202,0.00044489102,0.0040129116,0.00021081959,0.0000246255],"category_scores_gemma":[0.000112080015,0.00045288648,0.00042560694,0.0009773214,0.00014765166,0.0016951212,0.0018176746,0.0005910155,0.00011326103],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004950535,0.0093995705,0.0053230417,0.0006227093,0.0008501148,0.000049110567,0.006130023,0.004943384,0.041348945,0.31981602,0.53970253,0.0713195],"study_design_scores_gemma":[0.01227397,0.0054445844,0.020300774,0.0025660149,0.00041076826,0.0002303789,0.0018541219,0.41948032,0.30016977,0.023714786,0.20845048,0.0051040426],"about_ca_topic_score_codex":0.00015567653,"about_ca_topic_score_gemma":0.000007760523,"teacher_disagreement_score":0.41453692,"about_ca_system_score_codex":0.00013918424,"about_ca_system_score_gemma":0.0000919248,"threshold_uncertainty_score":0.9997923},"labels":[],"label_agreement":null}]}