{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001874649,0.001854977,0.002462838,0.004846514,0.002358766,0.005022748,0.003220313,0.001335686,0.02522912],"category_scores_gemma":[0.007605787,0.001493914,0.00188815,0.009672431,0.001463216,0.01095751,0.005189981,0.003721113,0.007435435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425789,"about_ca_system_score_gemma":0.002645381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002194787,"about_ca_topic_score_gemma":0.002817704,"domain_scores_codex":[0.9970871,0.0003658022,0.0002791161,0.0004643888,0.001451132,0.0003524867],"domain_scores_gemma":[0.9955137,0.002112535,0.0002008543,0.0008927897,0.001116615,0.0001635764],"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.0006044635,0.0001485554,0.0006031776,0.0004421287,0.00006927687,0.00005784867,0.0004695024,0.01251052,0.005338871,0.2223139,0.02026316,0.7371786],"study_design_scores_gemma":[0.0002327333,0.0002807468,0.0005321629,0.0002569138,0.000110232,0.0004449828,0.0005639691,0.2262967,0.02631895,0.6828001,0.06205268,0.0001097498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01815701,0.00208577,0.9572809,0.0002655137,0.0002911988,0.0001504065,0.0006060083,0.005479395,0.01568381],"genre_scores_gemma":[0.09709387,0.001389199,0.8817075,0.0001424646,0.0002459047,0.0003422923,0.003182373,0.001385969,0.01451055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02522912,"threshold_uncertainty_score":0.08439982,"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."}}