{"id":"W2903710486","doi":"10.1145/3459096","title":"Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Rounding; Hyperplane; Semidefinite programming; Mathematics; Approximation algorithm; Constraint satisfaction problem; Mathematical optimization; Brownian motion; Constraint (computer-aided design); Computer science; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000302062,0.0001929827,0.0001730859,0.000374264,0.001494768,0.000191565,0.0007431643,0.00004192363,0.0001660956],"category_scores_gemma":[0.00001726627,0.0002224214,0.00007757173,0.001070649,0.00005264797,0.0003441331,0.00009316365,0.0004430716,0.00004580204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001607886,"about_ca_system_score_gemma":0.00006670437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001143503,"about_ca_topic_score_gemma":0.00005187804,"domain_scores_codex":[0.9982536,0.00009252781,0.0002760742,0.000610398,0.0004282157,0.0003391991],"domain_scores_gemma":[0.9987417,0.0002294053,0.00006630657,0.0006827126,0.00006369554,0.0002161702],"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.000005128345,0.0001542051,0.00002054699,0.00001671482,0.0000397089,0.000005044522,0.0009114332,0.00856865,0.0005774249,0.02210717,0.00003650636,0.9675575],"study_design_scores_gemma":[0.004064649,0.00335965,0.01115798,0.0001620763,0.0001965944,0.001893311,0.003695453,0.6152342,0.005371873,0.1644347,0.1867664,0.003663128],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00257695,0.00008712464,0.9924389,0.002953453,0.0005198522,0.0007857459,0.00009623519,0.0003254999,0.0002163039],"genre_scores_gemma":[0.7957032,0.00004888494,0.2018696,0.0006884345,0.00006669696,0.001313304,0.000005902401,0.00002297683,0.0002810148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9638944,"threshold_uncertainty_score":0.9998052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03982695069133185,"score_gpt":0.2730103534020659,"score_spread":0.233183402710734,"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."}}