{"id":"W2399230524","doi":"","title":"Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Secrecy; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Computer security; Mathematical analysis; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737424,0.0004754256,0.0006296281,0.0010612,0.001136089,0.001695992,0.0008581566,0.000910865,0.004243692],"category_scores_gemma":[0.004232954,0.000342094,0.0004892946,0.001446942,0.001707128,0.002402822,0.002676358,0.0013424,0.0009158074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009864339,"about_ca_system_score_gemma":0.0008810838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720922,"about_ca_topic_score_gemma":0.001537827,"domain_scores_codex":[0.9988087,0.0004691603,0.00005788129,0.0001533432,0.0002480411,0.0002628856],"domain_scores_gemma":[0.9950223,0.002695798,0.0008298667,0.0005760468,0.0004123007,0.0004637127],"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.0001622954,0.00003253106,0.0004461114,0.00007572554,0.0000175827,0.0002232021,0.0002212361,0.02029728,0.001398327,0.9653089,0.004314349,0.007502372],"study_design_scores_gemma":[0.000038971,0.00003158172,0.0002641432,0.00002679426,0.00001114319,0.0002387197,0.0001467805,0.07687617,0.0007574207,0.9186972,0.002890645,0.00002040997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5537432,0.001664806,0.3494201,0.004044436,0.0002359315,0.0001447369,0.002470812,0.0005865159,0.08768959],"genre_scores_gemma":[0.9651878,0.0006467729,0.02015031,0.0003636041,0.0001297217,0.0001111749,0.0007235198,0.00006414812,0.01262302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004243692,"threshold_uncertainty_score":0.01419657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02737121355285163,"score_gpt":0.2582780932216538,"score_spread":0.2309068796688022,"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."}}