{"meta":{"query_hash":"a14180e79b13","filters":{"venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/a14180e79b13","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+Twentieth+Annual+ACM-SIAM+Symposium+on+Discrete+Algorithms"},"results":[{"id":"W2950253786","doi":"10.1137/1.9781611973068.54","title":"Biased Range Trees","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Data Management 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":"Carleton University","funders":"","keywords":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Preprocessor; Set (abstract data type); Tree (set theory); Tree structure; Query optimization; Segment tree; Constant (computer programming); Interval tree; Data mining; Mathematics; Combinatorics; Sargable; Artificial intelligence; Information retrieval; Web search query; Search engine","score_opus":0.013072420826448742,"score_gpt":0.245268440160445,"score_spread":0.23219601933399625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950253786","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.36062777,0.0032151958,0.06308233,0.3162847,0.024384873,0.014151988,0.0021854169,0.007563142,0.20850462],"genre_scores_gemma":[0.8741103,0.0005552035,0.09928513,0.0055950563,0.001509987,0.00013402133,0.000055302742,0.00013045344,0.018624593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962976,0.000031068386,0.0006457839,0.00096941885,0.001238223,0.00081788807],"domain_scores_gemma":[0.99775505,0.00007099299,0.0005301016,0.0010718616,0.00033985765,0.0002321281],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007613216,0.000517853,0.00051073666,0.00031511794,0.00034763664,0.0005285626,0.006360913,0.00013945541,0.000016840655],"category_scores_gemma":[0.00016043051,0.0003631276,0.0004125597,0.0013302068,0.00018020498,0.0024561537,0.0014293868,0.00038701075,0.000056811543],"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.00058065244,0.0031459262,0.0046789143,0.0005669533,0.0007576633,0.000043326516,0.0107772965,0.0002755727,0.038956095,0.12503852,0.38292268,0.4322564],"study_design_scores_gemma":[0.02123266,0.014477438,0.13703327,0.003279952,0.0011775986,0.00017811354,0.005942455,0.19716759,0.21684153,0.1220581,0.26996526,0.01064602],"about_ca_topic_score_codex":0.000024230643,"about_ca_topic_score_gemma":9.655771e-7,"teacher_disagreement_score":0.5134825,"about_ca_system_score_codex":0.000060186336,"about_ca_system_score_gemma":0.000035565678,"threshold_uncertainty_score":0.99988204},"labels":[],"label_agreement":null},{"id":"W4213149062","doi":"10.1137/1.9781611973068.21","title":"Optimal Halfspace Range Reporting in Three Dimensions","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Range (aeronautics); Half-space; Partition (number theory); Binary logarithm; Time complexity; Mathematics; Data structure; Space (punctuation); Computational geometry; Combinatorics; Mathematical analysis; Discrete mathematics; Computer science; Algorithm","score_opus":0.017481827238139864,"score_gpt":0.26925351065210856,"score_spread":0.2517716834139687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213149062","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.9458971,0.00039844797,0.016807318,0.030404419,0.001497221,0.0010399178,0.000023249235,0.00025509574,0.0036772406],"genre_scores_gemma":[0.937492,0.000032668613,0.061130088,0.00042178505,0.00020547195,0.000024927529,0.0000044956964,0.000015983056,0.0006725438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702877,0.000023242945,0.0009816452,0.0006675734,0.0008104289,0.000488352],"domain_scores_gemma":[0.9978041,0.00008352784,0.0011092101,0.000442553,0.00042228526,0.00013832658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147786,0.0002921705,0.00037047852,0.00028118902,0.00025733703,0.00017515074,0.001392264,0.00011552784,0.0000039295796],"category_scores_gemma":[0.00057703163,0.00022307504,0.00023765398,0.0013256496,0.00007204339,0.0010162586,0.0005870017,0.00035974703,0.000008103904],"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.0010929935,0.0044858893,0.053225063,0.0006989531,0.00051134254,0.00012656876,0.038117856,0.14942846,0.25387082,0.32414493,0.038091652,0.13620546],"study_design_scores_gemma":[0.005069251,0.0034605558,0.2737713,0.0013914634,0.00015764982,0.00033323953,0.0016523708,0.4597019,0.13246258,0.1149552,0.0043352204,0.002709286],"about_ca_topic_score_codex":0.000029218776,"about_ca_topic_score_gemma":0.0000037746224,"teacher_disagreement_score":0.3102734,"about_ca_system_score_codex":0.00007291017,"about_ca_system_score_gemma":0.000071163544,"threshold_uncertainty_score":0.90967363},"labels":[],"label_agreement":null},{"id":"W4237140089","doi":"10.1137/1.9781611973068.77","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Logarithm; Approximation algorithm; Bounded function; Mathematics; Time complexity; Computer science; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.020031024562312948,"score_gpt":0.2649339222629797,"score_spread":0.24490289770066673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237140089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12758382,0.0014953149,0.6288965,0.15816869,0.018025286,0.021275448,0.0026808227,0.0046425234,0.037231613],"genre_scores_gemma":[0.44192883,0.00026714202,0.5476041,0.004058007,0.0011842413,0.0005206357,0.000085205415,0.0001397108,0.004212141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961785,0.000033227712,0.0007667927,0.0010885039,0.0010522758,0.0008807104],"domain_scores_gemma":[0.9973916,0.00018072853,0.0006004391,0.0009156696,0.0006862469,0.00022534416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358659,0.0005725902,0.00059590203,0.00041863148,0.0006062439,0.00036321577,0.0038906094,0.00022560607,0.000006376719],"category_scores_gemma":[0.00024165079,0.00043012455,0.0006155947,0.0014176656,0.00021784208,0.0011821475,0.0005816868,0.00051885407,0.000012743048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011179949,0.0033144688,0.00026221163,0.000951014,0.00044803906,0.0000052062856,0.008250826,0.0040377285,0.017008279,0.6886829,0.037239708,0.2386816],"study_design_scores_gemma":[0.0033368682,0.0061916253,0.0011669822,0.00075912196,0.00013315174,0.000040094812,0.00045296957,0.42266765,0.08473625,0.47050786,0.008604472,0.0014029626],"about_ca_topic_score_codex":0.000014629241,"about_ca_topic_score_gemma":7.9744655e-7,"teacher_disagreement_score":0.4186299,"about_ca_system_score_codex":0.00009996136,"about_ca_system_score_gemma":0.00006364876,"threshold_uncertainty_score":0.99981505},"labels":[],"label_agreement":null}]}