{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003213123,0.0008479894,0.001737938,0.002528512,0.002654926,0.00681515,0.001901468,0.001918878,0.008902527],"category_scores_gemma":[0.03124604,0.0005746298,0.002533114,0.00227872,0.007097817,0.01285142,0.004586828,0.005428251,0.001312977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005335924,"about_ca_system_score_gemma":0.002055907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002360372,"about_ca_topic_score_gemma":0.001069919,"domain_scores_codex":[0.9956024,0.001122475,0.0001867199,0.001087085,0.001359785,0.0006415693],"domain_scores_gemma":[0.9750232,0.01790791,0.001114209,0.00390704,0.001309377,0.0007383048],"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.00006604692,0.00001410287,0.0002575465,0.00004529574,0.000007153546,0.00004920366,0.0001325828,0.007658447,0.0005879435,0.9855635,0.001037527,0.004580575],"study_design_scores_gemma":[0.0000192499,0.0000170568,0.0001524929,0.00002623484,0.00001353836,0.00006739146,0.00003707239,0.04266859,0.001332289,0.9526779,0.002968649,0.00001958022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1782946,0.001623619,0.76437,0.006130754,0.0002440233,0.0001648399,0.0009847251,0.001051705,0.04713573],"genre_scores_gemma":[0.9372641,0.0009784698,0.05099841,0.0008075402,0.0004775717,0.0002158617,0.0004821606,0.0002982382,0.008477809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008902527,"threshold_uncertainty_score":0.03871506,"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."}}