{"id":"W1528227909","doi":"10.1023/a:1016501125022","title":"Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science","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.01114475,0.003234392,0.003115749,0.004075244,0.005662488,0.0152932,0.009476336,0.005844024,0.01564902],"category_scores_gemma":[0.04266531,0.003437834,0.003230844,0.006623103,0.008702802,0.03055005,0.01998633,0.02309554,0.005515755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01087767,"about_ca_system_score_gemma":0.006040762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387615,"about_ca_topic_score_gemma":0.0016314,"domain_scores_codex":[0.9816563,0.004021409,0.0009612907,0.002686284,0.007301041,0.00337365],"domain_scores_gemma":[0.9332033,0.04696933,0.002768905,0.01148666,0.0029399,0.002631894],"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.000193855,0.000112709,0.0002092152,0.000135939,0.000031011,0.0000587225,0.000337131,0.01172592,0.00121573,0.9730032,0.00264733,0.01032915],"study_design_scores_gemma":[0.00003831895,0.00004089571,0.0001179119,0.0000922101,0.0000501461,0.00006416978,0.00007218464,0.04272301,0.003094668,0.9496188,0.004030102,0.00005765988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05963128,0.003119423,0.8367394,0.00698472,0.0004977508,0.0004223943,0.00108533,0.00197033,0.0895494],"genre_scores_gemma":[0.7624867,0.003286057,0.1960291,0.001425713,0.0009016187,0.001566509,0.001582493,0.000981662,0.03174025],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01564902,"threshold_uncertainty_score":0.0789234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01400849361375752,"score_gpt":0.2070894277002008,"score_spread":0.1930809340864432,"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."}}