{"id":"W2949505605","doi":"10.48550/arxiv.1406.6920","title":"On tight bounds for binary frameproof codes","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics; Binary number; Mathematics; Permutation (music); Binary code; Hash function; Discrete mathematics; Degree (music); Permutation matrix; Arithmetic; Physics; Computer science; Philosophy","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.005672677,0.002848135,0.002770599,0.003694402,0.003752364,0.007691908,0.00415287,0.003188011,0.01484356],"category_scores_gemma":[0.05202881,0.001491419,0.00120241,0.004447286,0.00597768,0.01741699,0.0082263,0.007730456,0.002935975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006391439,"about_ca_system_score_gemma":0.003007628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342347,"about_ca_topic_score_gemma":0.003142156,"domain_scores_codex":[0.9918388,0.001961065,0.0002335196,0.00108124,0.002704351,0.002181169],"domain_scores_gemma":[0.9558768,0.03404829,0.002102265,0.003947461,0.002414328,0.001610948],"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.0006115633,0.0001429509,0.0008092677,0.0004046375,0.00006251416,0.0002060715,0.0005872162,0.03710606,0.003785424,0.9070725,0.01264137,0.03657038],"study_design_scores_gemma":[0.00007131517,0.0001306177,0.0003545255,0.0002290143,0.00006657862,0.0002265553,0.0001865621,0.1152041,0.003126739,0.8696105,0.01071749,0.00007613407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794514,0.01783595,0.6546608,0.009361413,0.001078589,0.0003407461,0.00201118,0.002252973,0.133007],"genre_scores_gemma":[0.8724363,0.008557181,0.09323566,0.002675888,0.001482987,0.0007046702,0.001792474,0.001204361,0.01791047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01484356,"threshold_uncertainty_score":0.04965663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03572200341129734,"score_gpt":0.1637894179720434,"score_spread":0.1280674145607461,"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."}}