{"id":"W3112174315","doi":"10.4230/lipics.ccc.2021.30","title":"Fractional Certificates for Bounded Functions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; University of Waterloo; Ministry of Education - Singapore; National Research Foundation; Agence Nationale de la Recherche; National Science Foundation","keywords":"Gadget; Communication complexity; Upper and lower bounds; Mathematics; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Quantum computer; Bounded function; Adversary model; Secure two-party computation; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001137909,0.0002252759,0.0002187077,0.0001820607,0.0003335798,0.0002242847,0.001338316,0.0002159004,0.00005327772],"category_scores_gemma":[0.00004734153,0.0002738365,0.0003474225,0.0005504281,0.00009798182,0.0004729014,0.001052287,0.0004510656,0.0001064779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007621456,"about_ca_system_score_gemma":0.0001866474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007199291,"about_ca_topic_score_gemma":0.00003780453,"domain_scores_codex":[0.9983702,0.00005014828,0.0001552885,0.001096424,0.0000750458,0.0002529338],"domain_scores_gemma":[0.9984105,0.0001811107,0.0001632492,0.0009067715,0.0001555739,0.0001828178],"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.00006340988,0.0001296947,0.0005934966,0.00005971197,0.000133786,0.00002703906,0.0001044876,0.005889853,0.00005528963,0.9789631,0.01361693,0.0003632268],"study_design_scores_gemma":[0.0004320129,0.00006032252,0.001019105,0.00002318193,0.00008841269,0.000002601806,0.00006542285,0.2873442,0.0001170186,0.6517153,0.05868002,0.0004524166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007489629,0.0000440939,0.9882433,0.001230314,0.001032142,0.000316676,0.0003282768,0.0003694277,0.0009461124],"genre_scores_gemma":[0.9909413,0.00004551039,0.008211615,0.0002008678,0.0001715929,0.000004560203,0.0002924897,0.00001137301,0.000120626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9834517,"threshold_uncertainty_score":0.9999714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1470995957393569,"score_gpt":0.2048118933952643,"score_spread":0.05771229765590738,"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."}}