{"id":"W2008487746","doi":"10.1515/jmc.2007.003","title":"Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Binary number; Computer science; Boolean function; Theoretical computer science; Server; Boolean conjunctive query; Function (biology); Private information retrieval; Query optimization; Information retrieval; Mathematics; Algorithm; Sargable; Web search query; Search engine; Arithmetic; Computer security; Computer network","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.001582986,0.0001426862,0.0002907434,0.0003640034,0.0001824411,0.0001323547,0.0002956245,0.0001737401,0.000006316502],"category_scores_gemma":[0.001455206,0.0001117185,0.00009710166,0.0003518257,0.0000965998,0.002458268,0.00006680983,0.0002984529,0.000009620681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004221812,"about_ca_system_score_gemma":0.0001593741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.549889e-7,"about_ca_topic_score_gemma":0.000001836742,"domain_scores_codex":[0.998279,0.00005562335,0.0009425923,0.0001621267,0.000326489,0.0002341804],"domain_scores_gemma":[0.9977031,0.000726511,0.0007060373,0.000221987,0.0005087251,0.0001336436],"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.001637201,0.0002859947,0.00008938167,0.0005539274,0.00005907671,0.00001369383,0.000418935,0.0000122821,0.0002015406,0.9921995,0.002319144,0.002209365],"study_design_scores_gemma":[0.002289629,0.002062862,0.00195131,0.000324171,0.00003017909,0.001464674,0.0002548458,0.0004106401,0.0009603061,0.9847875,0.005266846,0.0001970362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1615864,0.00004473396,0.8329089,0.002346882,0.0003994364,0.002374287,0.00006306727,0.00004983188,0.0002265233],"genre_scores_gemma":[0.4147176,0.00006169573,0.5819413,0.001407818,0.001354418,0.0003883863,0.00008783103,0.00002782253,0.00001313943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2531312,"threshold_uncertainty_score":0.4555748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0236044729694288,"score_gpt":0.2915814528388346,"score_spread":0.2679769798694058,"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."}}