{"id":"W4390072547","doi":"10.1007/978-3-031-49815-2_13","title":"Any-Order Online Interval Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Computer science; Bounded function; Scheduling (production processes); Interval (graph theory); Algorithm; Randomized algorithm; Selection (genetic algorithm); Deterministic algorithm; Order (exchange); Mathematical optimization; Mathematics; Upper and lower bounds; Artificial intelligence; Combinatorics","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.0008281082,0.0004183408,0.0004027772,0.001168847,0.0002503599,0.0006491166,0.002645167,0.0002951856,0.00005679071],"category_scores_gemma":[0.0001557659,0.0003899719,0.0001076565,0.001664977,0.0003845889,0.0006732365,0.00144263,0.0009617992,0.0001914107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002612028,"about_ca_system_score_gemma":0.0006419304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002553281,"about_ca_topic_score_gemma":0.000245955,"domain_scores_codex":[0.996363,0.00004551015,0.0004924457,0.001383575,0.001027226,0.0006881867],"domain_scores_gemma":[0.9979907,0.0002709238,0.0001918369,0.0008295363,0.0005196358,0.0001973139],"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.000005231624,0.00006222921,0.00006049284,0.00004847601,0.00001772304,0.00005697644,0.0007132119,0.2527488,0.00008589307,0.0333147,0.0002004301,0.7126859],"study_design_scores_gemma":[0.0001987171,0.0001730885,0.0001000396,0.000218695,0.000003023118,0.00003602153,1.273491e-7,0.934821,0.0001429689,0.06169624,0.002170773,0.0004393478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001653909,0.00005611327,0.9928467,0.001994467,0.001930944,0.0003412738,0.000006360587,0.0005213884,0.0022862],"genre_scores_gemma":[0.008314271,0.0001596127,0.9792465,0.002905665,0.000774582,0.0000141632,0.0000337468,0.00008442234,0.008467042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7122465,"threshold_uncertainty_score":0.9998552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03156848898930621,"score_gpt":0.2833799822059502,"score_spread":0.251811493216644,"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."}}