{"id":"W2807385899","doi":"10.1007/978-3-319-93031-2_34","title":"A $$O(n \\log ^2 n)$$ Checker and $$O(n^2 \\log n)$$ Filtering Algorithm for the Energetic Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Satisfiability; Computer science; Binary logarithm; Interval (graph theory); Algorithm; Time complexity; Process (computing); State (computer science); Running time; Constraint (computer-aided design); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language","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.0007048222,0.0003897985,0.0003240802,0.0003714034,0.0005220425,0.0006887015,0.001340198,0.0002234919,0.00005502931],"category_scores_gemma":[0.0001182403,0.0003020276,0.00009824854,0.000323701,0.0008388378,0.0004395668,0.0008092026,0.0003813432,0.000009988223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001283858,"about_ca_system_score_gemma":0.0002580938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001538309,"about_ca_topic_score_gemma":0.00007190279,"domain_scores_codex":[0.9975336,0.00002339157,0.000371049,0.001117529,0.0004608486,0.0004935389],"domain_scores_gemma":[0.9980566,0.0005401956,0.0002260479,0.0008168595,0.000236032,0.0001242834],"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.000002294572,0.000004615963,0.00001539274,0.00001317857,0.00001179204,0.000006827515,0.0005813726,0.005237139,0.00002926905,0.005557039,0.00004995827,0.9884911],"study_design_scores_gemma":[0.0002173512,0.0000975252,0.0001449719,0.0001742725,0.00001224277,0.0001058449,4.85029e-7,0.9745398,0.0004120397,0.02036732,0.003547081,0.0003810654],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002010851,0.0004575528,0.9960256,0.0007603856,0.001654565,0.0004608123,0.00000692332,0.0001269234,0.0004871102],"genre_scores_gemma":[0.007335352,0.0001547453,0.9900042,0.001380277,0.0006063508,0.00002935775,0.000004622687,0.00003111036,0.0004539226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9881101,"threshold_uncertainty_score":0.9999432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0145130423926603,"score_gpt":0.2391570942852763,"score_spread":0.224644051892616,"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."}}