{"id":"W2034819091","doi":"10.1007/s10623-015-0037-y","title":"On tight bounds for binary frameproof codes","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics; Binary number; Permutation (music); Mathematics; Hash function; Binary code; Degree (music); Discrete mathematics; Permutation matrix; Physics; Arithmetic; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392315,0.0002183223,0.0002504486,0.0002262178,0.0001264459,0.00009533212,0.0001266056,0.0001288693,0.00001318067],"category_scores_gemma":[0.00001492484,0.000191314,0.0001337104,0.0002830567,0.00009955597,0.00009629312,0.00001117661,0.0001111989,0.000009633887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001014756,"about_ca_system_score_gemma":0.000009848928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004780466,"about_ca_topic_score_gemma":0.000004018502,"domain_scores_codex":[0.9991062,0.00004732446,0.0001904248,0.000222928,0.0001378193,0.0002953392],"domain_scores_gemma":[0.9993592,0.0001425546,0.00002840859,0.000231133,0.00005215006,0.0001865503],"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.000513768,0.0002232341,0.003339932,0.0005093018,0.0005217206,0.00002316038,0.00212702,0.00429013,0.01269876,0.8997178,0.06686167,0.009173503],"study_design_scores_gemma":[0.004124742,0.003258649,0.001831739,0.0003883188,0.0002154398,0.00004832215,0.001962693,0.02956628,0.01278688,0.7547005,0.1891887,0.001927757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8121378,0.005305262,0.1682822,0.00006261375,0.0008936299,0.0007885262,0.0001214584,0.0007123159,0.0116962],"genre_scores_gemma":[0.9974399,0.00007022576,0.002060294,0.00009386167,0.000089159,0.0001452121,0.00002313006,0.00004056513,0.00003764452],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1853021,"threshold_uncertainty_score":0.7801557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0312588281043503,"score_gpt":0.2366463420175295,"score_spread":0.2053875139131792,"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."}}