{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148329,0.001997798,0.001524,0.001089568,0.001056996,0.002816753,0.002945962,0.001649611,0.01043745],"category_scores_gemma":[0.006281896,0.0007080852,0.001024225,0.002211553,0.001212387,0.00653128,0.001657039,0.002875779,0.001904167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003735823,"about_ca_system_score_gemma":0.002029735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005265436,"about_ca_topic_score_gemma":0.006078884,"domain_scores_codex":[0.9983618,0.000449037,0.00004862926,0.0003377977,0.0002793562,0.0005233531],"domain_scores_gemma":[0.9969855,0.001896411,0.0003142413,0.0004086482,0.0001666221,0.0002285374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001314312,0.0006225761,0.001169668,0.0004484807,0.00008193444,0.0002437176,0.000289845,0.831351,0.005124887,0.04883453,0.01997865,0.09054042],"study_design_scores_gemma":[0.000109761,0.0001036605,0.0001559596,0.00002477713,0.00001348849,0.00007542117,0.00007008685,0.9398034,0.0009200569,0.05567462,0.003036127,0.00001266084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1699803,0.001986458,0.7831772,0.004365414,0.0002555233,0.0004264865,0.00223846,0.007696003,0.02987409],"genre_scores_gemma":[0.6293269,0.0009801091,0.3520992,0.001159678,0.0001953493,0.0003771764,0.003372729,0.001174514,0.01131423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01043745,"threshold_uncertainty_score":0.03491676,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018831,0.0006699932,0.001252853,0.001071884,0.0007144688,0.002911791,0.003016184,0.001054773,0.005265408],"category_scores_gemma":[0.01178605,0.0004985642,0.0008637086,0.002506887,0.0009316697,0.005972993,0.004799488,0.001355808,0.001239915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007534864,"about_ca_system_score_gemma":0.0009650821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002124228,"about_ca_topic_score_gemma":0.001244077,"domain_scores_codex":[0.9968701,0.0006742192,0.0002751559,0.0004961036,0.00118729,0.0004972072],"domain_scores_gemma":[0.9918723,0.002755454,0.0008575587,0.003381901,0.0008375727,0.0002951158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00119074,0.0002764974,0.004389741,0.0005374292,0.0001315528,0.0003248173,0.001497817,0.1815865,0.03241264,0.1573452,0.01954596,0.6007611],"study_design_scores_gemma":[0.0001383595,0.0004077843,0.001770599,0.00008641462,0.00005279555,0.0006186724,0.0008997271,0.821879,0.03291604,0.1264796,0.01462976,0.0001212066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1205499,0.001100988,0.8662807,0.0008738613,0.0001112582,0.0001064376,0.0008678719,0.003192483,0.006916607],"genre_scores_gemma":[0.5332325,0.0007236447,0.4598209,0.0002893937,0.000072733,0.0001905489,0.001372094,0.0004039456,0.003894262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005265408,"threshold_uncertainty_score":0.01761454,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395759,0.0004843306,0.001210536,0.001883761,0.0007634407,0.001772389,0.001715683,0.000896095,0.007444848],"category_scores_gemma":[0.01201871,0.0005754072,0.0008710772,0.00348582,0.0005839875,0.005209356,0.002625612,0.001018319,0.003627985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004787659,"about_ca_system_score_gemma":0.001213743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009853923,"about_ca_topic_score_gemma":0.001796138,"domain_scores_codex":[0.9976968,0.0003918026,0.000223691,0.000376826,0.001064518,0.0002463057],"domain_scores_gemma":[0.9931369,0.002347168,0.0006936701,0.002149858,0.001374354,0.0002980267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00163657,0.0003053736,0.006934832,0.0007318102,0.0001588116,0.0004915607,0.0004347347,0.04123896,0.04429821,0.1486799,0.04277057,0.7123187],"study_design_scores_gemma":[0.0004621559,0.001016127,0.003828863,0.0003132347,0.000187349,0.002466013,0.0003427867,0.3640901,0.05196605,0.4378354,0.1372581,0.0002339364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02555639,0.001233246,0.9590648,0.0003500249,0.0001118622,0.0002683537,0.003356124,0.004967669,0.005091502],"genre_scores_gemma":[0.2455262,0.001113272,0.7325578,0.0007037293,0.0002527925,0.0008671497,0.01115488,0.001131309,0.006692927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007444848,"threshold_uncertainty_score":0.02490556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}