{"id":"W4226074176","doi":"10.1007/978-3-030-99253-8_19","title":"Complete and tractable machine-independent characterizations of second-order polytime","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Order (exchange); Completeness (order theory); Polynomial; Algorithm; Computer science; Type (biology); Characterization (materials science); Discrete mathematics; Artificial intelligence; Mathematics; Physics; Finance","routes":{"ca_aff":true,"ca_fund":true,"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.002028371,0.001101647,0.001307634,0.001553433,0.001561422,0.005544349,0.002886371,0.001530153,0.01057145],"category_scores_gemma":[0.01101622,0.0009519886,0.002656621,0.002248809,0.00334805,0.009586507,0.002548866,0.005797412,0.0009614185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003540935,"about_ca_system_score_gemma":0.00194661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003854899,"about_ca_topic_score_gemma":0.004448722,"domain_scores_codex":[0.9960818,0.0008089939,0.0002183295,0.000931529,0.001229876,0.0007293802],"domain_scores_gemma":[0.9859007,0.009460493,0.0009444957,0.002067813,0.001079396,0.0005471198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000217753,0.0000953945,0.001180403,0.0001912091,0.00003357945,0.0001559052,0.0005270416,0.02906724,0.001941128,0.9558111,0.002835175,0.007944191],"study_design_scores_gemma":[0.00005639894,0.0000498653,0.0007554847,0.000043321,0.00003350123,0.0001711295,0.000168636,0.1236971,0.002433083,0.8654081,0.007144479,0.00003899274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2654228,0.0007613734,0.6719435,0.003813233,0.0001221266,0.0002025953,0.004028603,0.002510013,0.0511959],"genre_scores_gemma":[0.9245235,0.0003049521,0.05718014,0.0004911537,0.0002302907,0.0003105426,0.002545123,0.0006261191,0.013788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01057145,"threshold_uncertainty_score":0.03536505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01963319319742773,"score_gpt":0.2399941909816101,"score_spread":0.2203609977841823,"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."}}