{"id":"W2131777380","doi":"10.1016/j.jfa.2011.09.006","title":"Infinite divisibility and a non-commutative Boolean-to-free Bercovici–Pata bijection","year":2011,"lang":"en","type":"preprint","venue":"Journal of Functional Analysis","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Bijection; Divisibility rule; Mathematics; Infinite divisibility; Commutative property; Operator (biology); Pure mathematics; Convolution (computer science); Discrete mathematics; Limit (mathematics); Combinatorics; Algebra over a field; Computer science; Mathematical analysis; Chemistry","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.001318279,0.0007922764,0.001127926,0.001994708,0.002296745,0.003154381,0.001351113,0.001424838,0.009478274],"category_scores_gemma":[0.005983857,0.0006131405,0.0007331113,0.0009506829,0.004405459,0.005568652,0.00292768,0.003262854,0.001095775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008576457,"about_ca_system_score_gemma":0.0006206834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004838576,"about_ca_topic_score_gemma":0.0004031357,"domain_scores_codex":[0.9987791,0.000326476,0.00006535938,0.0003197964,0.0003134522,0.0001958041],"domain_scores_gemma":[0.9964749,0.001775136,0.0003622097,0.0004178314,0.0004029103,0.0005669526],"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.00003424603,0.00001680988,0.00007859827,0.0000188611,0.000005259642,0.00008153355,0.0001076942,0.0003067493,0.0007768228,0.9960592,0.0005369181,0.001977224],"study_design_scores_gemma":[0.00001317131,0.000008473284,0.00008645833,0.00000501969,0.000003108503,0.0001774433,0.00002073888,0.001983471,0.000467804,0.9963393,0.0008836437,0.00001137565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5790904,0.002331105,0.2431054,0.005203115,0.0009404576,0.00008312349,0.0004663252,0.0005076388,0.1682724],"genre_scores_gemma":[0.9625383,0.0004770427,0.01226356,0.0006020484,0.0005578833,0.00006620388,0.0001553039,0.0001779159,0.02316166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009478274,"threshold_uncertainty_score":0.031708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06779739463516625,"score_gpt":0.3230341486402385,"score_spread":0.2552367540050723,"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."}}