{"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":"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.025556391,0.0012332456,0.9590648,0.00035002487,0.000111862195,0.0002683537,0.0033561238,0.0049676695,0.005091502],"genre_scores_gemma":[0.2455262,0.001113272,0.7325578,0.0007037293,0.00025279252,0.00086714973,0.011154884,0.0011313093,0.006692927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976968,0.00039180263,0.00022369104,0.000376826,0.0010645184,0.00024630572],"domain_scores_gemma":[0.9931369,0.002347168,0.00069367007,0.002149858,0.0013743538,0.0002980267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013957589,0.00048433055,0.0012105365,0.0018837606,0.00076344074,0.001772389,0.0017156826,0.000896095,0.0074448483],"category_scores_gemma":[0.012018714,0.00057540723,0.0008710772,0.0034858203,0.00058398745,0.0052093556,0.0026256123,0.001018319,0.0036279853],"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.0016365696,0.00030537363,0.006934832,0.0007318102,0.00015881164,0.0004915607,0.0004347347,0.04123896,0.04429821,0.14867988,0.042770572,0.71231866],"study_design_scores_gemma":[0.00046215588,0.001016127,0.0038288631,0.00031323475,0.00018734897,0.002466013,0.00034278675,0.36409009,0.05196605,0.43783537,0.1372581,0.00023393643],"about_ca_topic_score_codex":0.0009853923,"about_ca_topic_score_gemma":0.0017961381,"teacher_disagreement_score":0.0074448483,"about_ca_system_score_codex":0.00047876593,"about_ca_system_score_gemma":0.0012137428,"threshold_uncertainty_score":0.024905562},"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":"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.12054986,0.0011009882,0.8662807,0.0008738613,0.00011125819,0.00010643763,0.0008678719,0.0031924834,0.006916607],"genre_scores_gemma":[0.5332325,0.00072364474,0.4598209,0.0002893937,0.000072733,0.00019054892,0.0013720941,0.00040394563,0.0038942622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968701,0.00067421916,0.00027515588,0.0004961036,0.0011872896,0.0004972072],"domain_scores_gemma":[0.99187225,0.0027554538,0.00085755874,0.0033819014,0.00083757273,0.00029511578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830998,0.00066999317,0.0012528527,0.001071884,0.00071446877,0.0029117907,0.0030161836,0.0010547729,0.005265408],"category_scores_gemma":[0.011786048,0.00049856416,0.0008637086,0.0025068866,0.00093166967,0.0059729926,0.004799488,0.0013558083,0.0012399147],"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.0011907401,0.00027649742,0.0043897405,0.00053742924,0.00013155282,0.00032481726,0.0014978175,0.18158653,0.032412637,0.15734518,0.019545961,0.6007611],"study_design_scores_gemma":[0.00013835948,0.00040778428,0.0017705993,0.00008641462,0.000052795545,0.0006186724,0.0008997271,0.821879,0.03291604,0.1264796,0.01462976,0.00012120661],"about_ca_topic_score_codex":0.0021242283,"about_ca_topic_score_gemma":0.0012440769,"teacher_disagreement_score":0.005265408,"about_ca_system_score_codex":0.00075348635,"about_ca_system_score_gemma":0.0009650821,"threshold_uncertainty_score":0.017614543},"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":"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.16998033,0.0019864584,0.7831772,0.0043654144,0.0002555233,0.00042648654,0.0022384601,0.007696003,0.029874094],"genre_scores_gemma":[0.62932694,0.0009801091,0.3520992,0.0011596775,0.00019534933,0.00037717645,0.003372729,0.0011745141,0.011314225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00044903698,0.00004862926,0.0003377977,0.0002793562,0.00052335305],"domain_scores_gemma":[0.9969855,0.0018964112,0.00031424128,0.00040864816,0.0001666221,0.00022853738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832902,0.0019977982,0.0015240003,0.0010895681,0.0010569959,0.0028167525,0.0029459624,0.001649611,0.010437449],"category_scores_gemma":[0.0062818956,0.0007080852,0.0010242254,0.0022115528,0.0012123869,0.0065312805,0.0016570386,0.002875779,0.0019041671],"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.0013143122,0.0006225761,0.0011696683,0.00044848074,0.00008193444,0.0002437176,0.000289845,0.831351,0.005124887,0.048834532,0.019978654,0.09054042],"study_design_scores_gemma":[0.00010976101,0.0001036605,0.0001559596,0.000024777133,0.000013488486,0.000075421165,0.00007008685,0.93980336,0.0009200569,0.055674624,0.0030361272,0.000012660836],"about_ca_topic_score_codex":0.0052654357,"about_ca_topic_score_gemma":0.0060788845,"teacher_disagreement_score":0.010437449,"about_ca_system_score_codex":0.0037358233,"about_ca_system_score_gemma":0.002029735,"threshold_uncertainty_score":0.03491676},"labels":[],"label_agreement":null}]}