Chimeric antigen receptor T-cell therapy for multiple myeloma: a consensus statement from The European Myeloma Network

Adoptive cellular therapy using chimeric antigen receptor T-cell (CART) therapy is currently being evaluated in patients with relapsed / refractory multiple myeloma (MM). The majority of CAR-T cell programs now being tested in clinical trials are targeting B-cell maturation antigen. Several recent phase I / II trials show promising preliminary results in patients with MM progressing on proteasome inhibitors, immunomodulatory drugs and monoclonal antibodies targeting CD38. CAR-T cell therapy is a potentially life-threatening strategy that can only be administered in experienced centers. For the moment, CAR-T cell therapy for MM is still experimental, but once this strateg

Prevention and management of adverse events of novel agents in multiple myeloma: A consensus of the European Myeloma Network

During the last few years, several new drugs have been introduced for treatment of patients with multiple myeloma, which have significantly improved the treatment outcome. All of these novel substances differ at least in part in their mode of action from similar drugs of the same drug class, or are representatives of new drug classes, and as such present with very specific side effect profiles. In this review, we summarize these adverse events, provide information on their prevention, and give practical guidance for monitoring of patients and for management of adverse events

New Bounds on the Strength of Some Restrictions of Hindman’s Theorem

We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman’s Finite Sums Theorem. For example, we show that Hindman’s Theorem for sums of length at most 2 and 4 colors implies ACA 0 . An emerging leitmotiv is that the known lower bounds for Hindman’s Theorem and for its restriction to sums of at most 2 elements are already valid for a number of restricted versions which have simple proofs and better computability- and proof-theoretic upper bounds than the known upper bound for the full version of the theorem. We highlight the role of a sparsity-like condition on the solution set, which we call apartness