{"id":"W2193906675","doi":"10.1109/allerton.2015.7447122","title":"Lossless secure source coding: Yamamoto's setting","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Converse; Lossless compression; Coding (social sciences); Source model; Source code; Encoding (memory); Information source (mathematics); Computer science; Multi-source; Data source; Combinatorics; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Information retrieval; Artificial intelligence; Statistics; Data compression","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"],"consensus_categories":[],"category_scores_codex":[0.0009795344,0.0004074083,0.0004074881,0.0002210169,0.0001644541,0.0009367288,0.003169867,0.0004350131,0.00006066683],"category_scores_gemma":[0.0001076692,0.0003801939,0.0002425917,0.0003722798,0.00008609964,0.0004099326,0.006831082,0.001091725,0.00009273124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005832856,"about_ca_system_score_gemma":0.0002838782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001800212,"about_ca_topic_score_gemma":0.00004751036,"domain_scores_codex":[0.9972377,0.0001317124,0.0003985103,0.00113449,0.000594248,0.0005032742],"domain_scores_gemma":[0.9969506,0.0001436297,0.0002582538,0.00208188,0.000250841,0.000314784],"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.00001782858,0.0003047058,0.004167637,0.0006249535,0.0001912928,0.0001121853,0.008738283,0.0005863447,0.00009222262,0.7770424,0.1777218,0.03040043],"study_design_scores_gemma":[0.0012876,0.0001230739,0.001462652,0.0006295854,0.00008774986,0.0001219548,0.0006999074,0.2692241,0.00101813,0.3931649,0.3289592,0.003221132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008042909,0.0004063329,0.974268,0.001109643,0.001344563,0.0003558198,0.00008137892,0.0009414091,0.01344994],"genre_scores_gemma":[0.8131846,0.00007367547,0.1839178,0.00131899,0.0008364846,0.00005750703,0.0002914119,0.00004852505,0.0002710152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8051417,"threshold_uncertainty_score":0.999865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02559290957324366,"score_gpt":0.2656351383082166,"score_spread":0.2400422287349729,"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."}}