{"id":"W2156411090","doi":"10.1007/978-3-642-12476-1_3","title":"Fast Intersection Algorithms for Sorted Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Algorithm; Theoretical computer science; Cartography","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007966762,0.0005527087,0.0005081844,0.0007637277,0.0004767937,0.0008005381,0.003719714,0.0005047751,0.00002684444],"category_scores_gemma":[0.00008122114,0.0004709913,0.0001780757,0.0004411542,0.000684036,0.001137465,0.001405404,0.001043888,0.00002839661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002098919,"about_ca_system_score_gemma":0.0005095067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000056096,"about_ca_topic_score_gemma":0.0001385125,"domain_scores_codex":[0.9961137,0.00002089017,0.0005395293,0.001808523,0.0008338156,0.0006835536],"domain_scores_gemma":[0.9972428,0.0003792598,0.000356724,0.001450483,0.0003712196,0.0001995044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006665376,0.00002387499,0.000006385507,0.00002686537,0.000009771292,0.00002424429,0.0003356797,0.002230899,0.001190498,0.008063027,0.00003112103,0.988051],"study_design_scores_gemma":[0.0003330864,0.0002829295,0.00003616225,0.0002963992,0.000008997121,0.0001022561,2.871134e-7,0.8101804,0.005096204,0.1743299,0.00861448,0.0007189381],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000320328,0.000155609,0.9915794,0.0003859184,0.005943893,0.0005879257,0.00003091828,0.0002381549,0.00104612],"genre_scores_gemma":[0.009007205,0.0000307752,0.9883266,0.0007318618,0.001235055,0.00003513767,0.00003744213,0.00004114554,0.0005547438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.987332,"threshold_uncertainty_score":0.9997742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02275534578046922,"score_gpt":0.2680858875064642,"score_spread":0.245330541725995,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}