{"id":"W4289655492","doi":"10.1109/isit50566.2022.9834771","title":"Two-terminal source coding with common sum reconstruction","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Modulo; Source code; Algorithm; Distributed source coding; Computer science; Computation; Coding (social sciences); Binary number; Theoretical computer science; Rate distortion; Lossy compression; Terminal (telecommunication); Discrete mathematics; Variable-length code; Mathematics; Decoding methods; Arithmetic; Artificial intelligence; Computer network; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147929,0.001295363,0.001533606,0.0007205718,0.0007374546,0.001915433,0.001870882,0.00185821,0.002187119],"category_scores_gemma":[0.007550367,0.0003656746,0.0009348966,0.001346955,0.002173764,0.002758742,0.005460315,0.00276362,0.0005841475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005362,"about_ca_system_score_gemma":0.001185354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004940503,"about_ca_topic_score_gemma":0.0003537226,"domain_scores_codex":[0.9976735,0.0008391446,0.0001027329,0.0003426276,0.0007833737,0.0002585725],"domain_scores_gemma":[0.9960295,0.002417732,0.0003667283,0.0006019969,0.0004180718,0.0001659701],"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.0004784948,0.0001407281,0.0006769295,0.000353905,0.00008605036,0.0009634133,0.0004935685,0.2931323,0.01123887,0.6390283,0.00235303,0.0510544],"study_design_scores_gemma":[0.00007554912,0.0001475302,0.0001127452,0.00004881853,0.00002754018,0.0004699311,0.00008054773,0.7896376,0.00905001,0.1986082,0.001701946,0.00003961283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02191553,0.0002512026,0.9711739,0.0005402485,0.0000678405,0.00007776187,0.0001079901,0.0001144039,0.005751115],"genre_scores_gemma":[0.792722,0.0005686595,0.2011436,0.0002996658,0.0001257843,0.0002386134,0.0002736828,0.00004670373,0.004581255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002187119,"threshold_uncertainty_score":0.01135945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0074796377199129,"score_gpt":0.2318155201879125,"score_spread":0.2243358824679996,"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."}}