{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a14180e79b13","filters":{"venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nikhil Bansal","is_ca":false},{"name":"Zachary Friggstad","is_ca":true},{"name":"Rohit Khandekar","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02003102456231295,"gpt":0.2649339222629797,"spread":0.2449028977006667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358659,0.0005725902,0.000595902,0.0004186315,0.0006062439,0.0003632158,0.003890609,0.0002256061,0.000006376719],"category_scores_gemma":[0.0002416508,0.0004301245,0.0006155947,0.001417666,0.0002178421,0.001182148,0.0005816868,0.0005188541,0.00001274305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009996136,"about_ca_system_score_gemma":0.00006364876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001462924,"about_ca_topic_score_gemma":7.974465e-7,"domain_scores_codex":[0.9961785,0.00003322771,0.0007667927,0.001088504,0.001052276,0.0008807104],"domain_scores_gemma":[0.9973916,0.0001807285,0.0006004391,0.0009156696,0.0006862469,0.0002253442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001117995,0.003314469,0.0002622116,0.000951014,0.0004480391,0.000005206286,0.008250826,0.004037729,0.01700828,0.6886829,0.03723971,0.2386816],"study_design_scores_gemma":[0.003336868,0.006191625,0.001166982,0.000759122,0.0001331517,0.00004009481,0.0004529696,0.4226677,0.08473625,0.4705079,0.008604472,0.001402963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1275838,0.001495315,0.6288965,0.1581687,0.01802529,0.02127545,0.002680823,0.004642523,0.03723161],"genre_scores_gemma":[0.4419288,0.000267142,0.5476041,0.004058007,0.001184241,0.0005206357,0.00008520541,0.0001397108,0.004212141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4186299,"threshold_uncertainty_score":0.999815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peyman Afshani","is_ca":true},{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01748182723813986,"gpt":0.2692535106521086,"spread":0.2517716834139687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147786,0.0002921705,0.0003704785,0.000281189,0.000257337,0.0001751507,0.001392264,0.0001155278,0.00000392958],"category_scores_gemma":[0.0005770316,0.000223075,0.000237654,0.00132565,0.00007204339,0.001016259,0.0005870017,0.000359747,0.000008103904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007291017,"about_ca_system_score_gemma":0.00007116354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002921878,"about_ca_topic_score_gemma":0.000003774622,"domain_scores_codex":[0.9970288,0.00002324294,0.0009816452,0.0006675734,0.0008104289,0.000488352],"domain_scores_gemma":[0.9978041,0.00008352784,0.00110921,0.000442553,0.0004222853,0.0001383266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001092994,0.004485889,0.05322506,0.0006989531,0.0005113425,0.0001265688,0.03811786,0.1494285,0.2538708,0.3241449,0.03809165,0.1362055],"study_design_scores_gemma":[0.005069251,0.003460556,0.2737713,0.001391463,0.0001576498,0.0003332395,0.001652371,0.4597019,0.1324626,0.1149552,0.00433522,0.002709286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9458971,0.000398448,0.01680732,0.03040442,0.001497221,0.001039918,0.00002324923,0.0002550957,0.003677241],"genre_scores_gemma":[0.937492,0.00003266861,0.06113009,0.0004217851,0.000205472,0.00002492753,0.000004495696,0.00001598306,0.0006725438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3102734,"threshold_uncertainty_score":0.9096736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"John Howat","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01307242082644874,"gpt":0.245268440160445,"spread":0.2321960193339963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007613216,0.000517853,0.0005107367,0.0003151179,0.0003476366,0.0005285626,0.006360913,0.0001394554,0.00001684066],"category_scores_gemma":[0.0001604305,0.0003631276,0.0004125597,0.001330207,0.000180205,0.002456154,0.001429387,0.0003870107,0.00005681154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006018634,"about_ca_system_score_gemma":0.00003556568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002423064,"about_ca_topic_score_gemma":9.655771e-7,"domain_scores_codex":[0.9962976,0.00003106839,0.0006457839,0.0009694188,0.001238223,0.0008178881],"domain_scores_gemma":[0.9977551,0.00007099299,0.0005301016,0.001071862,0.0003398577,0.0002321281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005806524,0.003145926,0.004678914,0.0005669533,0.0007576633,0.00004332652,0.0107773,0.0002755727,0.03895609,0.1250385,0.3829227,0.4322564],"study_design_scores_gemma":[0.02123266,0.01447744,0.1370333,0.003279952,0.001177599,0.0001781135,0.005942455,0.1971676,0.2168415,0.1220581,0.2699653,0.01064602],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3606278,0.003215196,0.06308233,0.3162847,0.02438487,0.01415199,0.002185417,0.007563142,0.2085046],"genre_scores_gemma":[0.8741103,0.0005552035,0.09928513,0.005595056,0.001509987,0.0001340213,0.00005530274,0.0001304534,0.01862459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5134825,"threshold_uncertainty_score":0.999882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}