{"id":"W2495523385","doi":"","title":"Resource Fairness and Composability of Cryptographic Protocols.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Universal composability; Composability; Impossibility; Commit; Protocol (science); Cryptography; Cryptographic primitive; Proof-of-work system; Cryptographic protocol; Computer security; Secure multi-party computation; Resource (disambiguation); Theoretical computer science; Distributed computing; Computer network; Cryptocurrency","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001014863,0.0006567055,0.001211937,0.0006486514,0.0002010481,0.0001444076,0.002985859,0.0005561398,0.00003824059],"category_scores_gemma":[0.0001614218,0.0006560269,0.0004681949,0.0004509138,0.001905362,0.0002386567,0.008395399,0.00174941,0.00001219134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003154189,"about_ca_system_score_gemma":0.0002339007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001136456,"about_ca_topic_score_gemma":0.0001724249,"domain_scores_codex":[0.9950213,0.0008661614,0.001087819,0.001868619,0.0004706429,0.0006854261],"domain_scores_gemma":[0.9949312,0.0007402444,0.0007541953,0.003088346,0.0001739499,0.000312042],"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.0001209981,0.0004408812,0.02570596,0.0005204118,0.0001385014,0.00001969486,0.002847162,0.0001097556,0.0003631834,0.9577287,0.0002403137,0.01176441],"study_design_scores_gemma":[0.0006735462,0.0001577965,0.06729713,0.000245204,0.00003502987,0.00005916426,0.00007763201,0.002624487,0.0007607819,0.919165,0.008302209,0.000601986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09686528,0.0002521682,0.8916301,0.001184718,0.0001954727,0.007095553,0.0002439995,0.0002969663,0.002235726],"genre_scores_gemma":[0.1788679,0.00009591904,0.8172897,0.0001796733,0.0001405949,0.003296935,0.00009773937,0.00003142057,1.487811e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08200265,"threshold_uncertainty_score":0.9996245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01821921392728335,"score_gpt":0.2822069954822428,"score_spread":0.2639877815549594,"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."}}