{"id":"W6910320367","doi":"10.4230/lipics.icalp.2023.28","title":"Nondeterministic Interactive Refutations for Nearest Boolean Vector","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; European Commission","keywords":"Nondeterministic algorithm; Boolean function; Cube (algebra); Randomness; Maximum satisfiability problem; Linear subspace; Matrix (chemical analysis); Two-element Boolean algebra","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.003714452,0.0007650969,0.001428747,0.0007858602,0.002156771,0.002381961,0.004115241,0.00205334,0.00777117],"category_scores_gemma":[0.03254786,0.0006418628,0.001752832,0.001060282,0.003371084,0.005521035,0.007284672,0.003786554,0.001488816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002190487,"about_ca_system_score_gemma":0.003178353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002555724,"about_ca_topic_score_gemma":0.005213931,"domain_scores_codex":[0.9947976,0.0014471,0.0004092395,0.00124994,0.001203972,0.0008921802],"domain_scores_gemma":[0.9583722,0.0284201,0.001667768,0.008747056,0.001992305,0.0008004998],"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.002639462,0.0006777181,0.01369342,0.0009060498,0.0002278831,0.0009110306,0.002685843,0.1700953,0.0207077,0.3889536,0.0175166,0.3809854],"study_design_scores_gemma":[0.0002034969,0.0001760524,0.0007641296,0.00006824519,0.00007880064,0.0003440345,0.0003264972,0.5719965,0.02460945,0.3969965,0.00434348,0.00009276806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3068306,0.0004696125,0.669156,0.003118444,0.0002612638,0.0003278473,0.0006745659,0.007676159,0.01148562],"genre_scores_gemma":[0.8736089,0.0001038584,0.1200284,0.0004036803,0.00006424152,0.0001721785,0.000684956,0.0006060986,0.004327513],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00777117,"threshold_uncertainty_score":0.02599716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0219407974307442,"score_gpt":0.2976769124618461,"score_spread":0.275736115031102,"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."}}