Everybody for us here. We got case to 2022. I'm back football picker team style Andrew a Vikings Anthony s Broncos Armando Chargers Brett s Seahawks Brian s Falcons Carla Jets Charles with the commanders Clint s chiefs David s Texans ever p Cowboys Giants dolphins Isuke Rams Henry J Titans Hilton T Packers in Q K Colts Joe H Ravens Joel B Cardinals Jags Jonathan L. Bill's Lions Manny v. Saints Matthias with the Browns Mitchell K Panthers Muhammad has the Bucks Nick see Eagles or in W Steelers Robert are with the Bears Sean M. Niners Todd D. Bengals William s Raiders and Zach B with the Pats. Good luck everybody. Let's get started Again just the Titans left. Let me get you a link for that. We'll get started actually Jake and get you a link for that real quick Titans left on sale you guys Last two teams in cases three and four for last team in both cases Is what I'm trying to say Olav a garden breadsticks Olav garden. Yeah, Bears don't have a lot of cards in this though to be fair Jam you can just not watch That's also a great option for you if you're just gonna bash the product here. I'll help you out God Sealers Najee Harris number 1099 Let people enjoy things We've got a lions that is a Clearly immaculate rookie Jersey Jameson Williams 69 of 99 You're allowed to criticize things but when every single thing you say in chat is a criticism of something Maybe you just don't like cards. Maybe you should just go do something else Vikings dual Jersey Justin Jefferson Adam Thielen 46 of 49 There we go. That's pretty cool. What do you guys think Thielen ends up? Fuckin ears they get all the The bucking ears get every receiver over third. I don't know that Julio Jones Adam Thielen. They'll probably end up with Who else is older now D hop? Oh Wow, let's check this out. This is for this really cool actually dat Noyan auto to 49 cowboys That's pretty cool dat Noyan auto. I like that.  Thank you Sean M. I've grabbed the Titans in the last two daytime cases sold out daytime everybody sold out daytime Get your spots for tonight Magna Malik and a Trayvon Walker RPA Jaguars 26 of 99 Sweet Trayvon overall pick he got he got he started off kind of inconsistent. He was really good towards the end of the year though That defensive front is pretty scary. It's a cool that auto Jamar Chase numbered nine of ten bangles. I don't think you've had a really bad box so far through two cases though If I'll pat at least something nice Three color patch dolphins Mike Gisicki 70 of 99 jumbo Jersey Fran Tarkent in 20 of 49 Vikings nice Tarkent in a Jumbo Helmet relic three of ten rookie Skymore chief.  Okay, let's heat back up here Bit of a slow box that one Joseph. What's up, man? Zack. Yep that win. That's right redemption on the back Hmm got me thinking now. I'm wondering Chargers Austin Eckler 67 of 99 Jersey card chargers Kenneth Murray 30 of 49. We got next. Oh, we got a few people next Quad Jersey Jerry Rice Randy Moss Isaac Bruce and Tim Brown Number three of 49 that's a bunch of Raiders legends right there Jerry Rice Randy Moss So many Raiders legends on this card Isaac Bruce The Raiders get all the old receivers. I'm sure Isaac Bruce played a form at some point. We just don't know about it So that's Niners Vikings Rams and Raiders. I imagine that's random at the end. You have to have over 50% majority to have the card outright Minnesota is Andrew a San Franshawn M La Rams Isuke that's three different right there random at the end three or 49 so player worn all player worn. He used up Raiders At least for the rice part Moss just didn't want to be there I black auto Marcus Mariota number to 49 for the Falcons ends Gold rookie I black patch auto Jameson Williams 18 of 25 jersey numbered Hey, congrats Lions on the JMO Going out to Jonathan L. There you go Jonathan. That is sweet Everyone's got high hopes for him that printers working fast right now never heard of Prince so fast for Redemption goes to the Niners Danny Gray immaculate numbers RPA So that'll be numbered to his Jersey number Danny Gray Niners. All right, come on. Let's see some big hits now Yeah, the JMO Heaten up with the JMO that happens Joseph, especially and especially in products like this where there's only so many hits and in a case You know and some teams are gonna hit more often. It's just It is how it is, right? Mahomes chiefs to 99 Not every team has same at hits in every product Chiefs Mahomes in 99 Jersey card Rams Tyler Higby 12 out of 49 Tyler Higby Olav a garden Olaf garden The standard Jumbo Jersey Niners George Kittle 14 of 49 dude no way No way, right It's the same person with the bangles to bangles Dude Todd is having himself a hell of a day so far. Wow. This is unreal honestly Joe Shiesty one-of-one Nike swoosh. Oh My god, Todd in the last case hit a burrow auto number to 10 and now a one-of-one Nike swoosh Happy for you Todd. Make sure you grab insurance. That is disgusting Same person at the bangles last case hit a burrow auto to 10 And in a product where burrow does not have many cards just hitting all hitting all the big ones. Oh my goodness This is outrageous. What is that? It's outrageous. Dude. What is going on in this building the past like day and a half?  Caleb only comes in here. It's getting crazy crazy Nice sky more for the chiefs good three-color eye black gold RPA and True RPA breeze the beast five and ninety-nine jets breeze hall There we go. We'll get that mag for your jets on the true RPA from iMac there This is great, dude. This is awesome. I love this. This is fantastic There are spots available in breaks tonight everybody check the schedule for the next few days as well if you're looking for a specific team No, we are scheduled a few days in advance Layton sports cards calm When is Aaron Rodgers gonna go there dude? I mean we're what if you'd throw like a week away from NFL free agency And you would imagine like the Packers would want to get that the package of jets want to get that trade done early I would think Chargers Echler to 25 Assuming assuming it's gonna happen patch card Cowboys Tony Pollard to 25 got the tag got tagged Jumbo Jersey Jason Taylor Hall of Fame to 49 dolphins. It wasn't a shield there It's still be a shield Just because we pulled a swoosh one-on-one doesn't mean it can't be a shield Dual patch to Marcus where and Micah Parsons to 99. That's a really cool one actually Past and present this said this that's pretty cool Where and Parsons did wherever win defensive player of the year?  That's Brian. There you go, buddy All right guys last one again. I said shield We're and this is this is the box of the shield apparently because it's the last one Rich is saying he thinks it's like Less produced this year, so you might see a little more Every box Yeah Right, right, but Lane's saying the quiet part out loud to 99 and Nick Chubb-Browns Now last one come on shield, which one which one Champailly Jersey card Broncos to 49 This is getting this is getting pretty silly what we're getting all the one-on-ones, but the shields apparently All right William s this time. He's also one of the nicest people Genuinely that is not being nice. Let me look at this real quick. Is that gonna be team use? Yeah Tim Brown laundry tag one-of-one Vegas whoo the Mitchell and Ness patch Player warn Tim Brown laundry tag so disgusting Hall of Fame Jersey said congrats Vegas Let's get a wild William. Congrats, dude Good lord, dude guys spots available tonight Yeah, there's a few teams up on PYTs, but I think random styles are going quick I bet God Steelers now Hall of Fame signatures Donnie Shell 16 and 49 Here's Donnie. Yeah, there's gonna be a recap. So you'll see it at the end a hundred percent You'll see that that burrow at the end first Pierce today Damian Pierce. I black RPA 74 of 99 Texans Go to color patch and it with a great hit to Every box has had at least something that like okay. Yeah, it's pretty cool and George Pickens Dual patch rookie auto 40 and 99 for the Steelers Holy cow, we do have a card to random off. We'll get the pickets mag for your Steelers. Let me get that random ready We got a recap Yes, I would actually try and get we have like Manning and Russ We had like Javante and Terrell Davis. So that's probably a really cool set Like the Marcus where was legitimately one of my favorite players Yeah, both cases have had only two more cases left y'all. Yeah. Oh, they're sold out, but You guys got to get in the breaks tonight. Everything's sold out daytime Quad relic here Jerry Rice Niners Randy Moss Vikings Isaac Bruce Rams and temporary I mean this could have been a Raiders card They just put rice and moss on them on the Raiders, but it is a random. Good luck to the four of you Going four times Top spot gets it one two three and four 40 Niners 49ers day 49ers Okay, recap time So start with everything other than that quad basically All right, so relics first we had the where and Parsons for the Cowboys Gisicki James and Williams Jefferson and Thelan champ Bailey Frank Tarkenton Jason Taylor Kenneth Murray Tyler Higby George Kittle Tony Pollard and Skymore helmet helmet piece All right Niners redemption Danny Gray on the Immaculate Numbers RPA Damian Pierce I black RPA Wanda Robinson I black RPA Jalen Tolbert prime Patrick Iotto that no way an auto it's a 49 Cowboys got B doc Eagles auto Marcus Mario to Falcons Donnie shell with the Steelers Skymore RPA gold I have life RPA gold True RPA Jets Breeze Hall to 99 dual Patrick Iotto Steelers Kenny Kenny Pickens George Pickens RPA Trayvon Walker to 99 Jags I black RPA Malik Willis Titans to 49 dual Patrick Iotto Falcons as a writer to 99 Gold I black RPA 18 at 25 Jersey number James and Williams one of one Tim Brown laundry tag and A one-of-one Standard Joe Burrow Nike swoosh. I'll do it Moving on


Okay, thanks everybody for making it out. Thank you to Hu Guo, our speaker today, who will be talking to us out of Georgia Tech about packing nearly optimal Ramsey R3T graphs. Go ahead and take us away. And that's the next screen. Yep, looks good. All right, so that's going in meditation on the introduction. Today, I'm going to tell you about contracting triangle-free graphs in our pseudo-random properties in dense graphs, where previous results only had such construction in complete graph. It is like in the intersection of random graph processes on the random therapy. But at the beginning, let me just approve the definition of random number in blue context. Random number RSP is the mean number N, such like for every right on the blue edge coloring of conveyance and work as graph KN, contains either a red KS or a blue KT. On understanding the behavior of random number, it's a major problem in combinatorics. And it is well-known to be very difficult, even to determine the asymptotics of it. On the step where it results in random theory, it's like the order of magnitude of the random number R3T is Q squared over log K. Where the upper bound is due to a 5 commotion as already in 1980, where the lower bound is due to K in 1995. Nowadays, we have a much better understanding of the random number R3T in the work of Oma and Kibash, as well as on the various recipes and theories. But today, we only focus on the order of magnitude. On the indeed, the group technique of the random number has been very influential. On the upper bound by a 5 commotion as already in 1980, it was considered to be the first theory of application of semi-random approach. Well, for the lower bound, Heritage, already in 1961, used a clever alteration method defined by random number R3T, roughly Q squared over log Q squared. As you can see, there is an actual log factor in the denominator. Later on, this result was reported by Spencer in 1977, using lowest local lemur. And in 1994, for the lowage, used an even simpler optimization approach to improve this result. Well, finally, in 1995, he managed to get the correct lower bound by removing the log factor until he convinced semi-random variation of channel free process as concentration in qualities on differential equations. And for King's major achievement, he also received a focus on price in 1997 for this result. And the topic of this talk is to introduce an extension of King's result, which implies a syntotics of some other random parameter. Again, by removing some log factor. Is there any question on this point? All right, then we will move on. Before introducing our result, let me briefly reveal some of the previous results. To find the lower bound of R3T, people have found the following. Erlisch in 1961, Spencer in 1977, and Greville-Lovic in 1994. All of them found that Enver has graph G in the complete graph KN. Besides, the graph G is channel free on this individual's number at most some constant C and square root of N as log N. And all of them construct such graph G in the binomial random graph GNP model. Where the binomial random graph GNP is the graph that you included each edge of the complete graph KN independently with probability P. And later on, their result was improved by King in 1995 and improved by Bowman in 2008. Both of them found that Enver has graph G in the complete graph KN, such that the graph G is still channel free with smaller input number compared to the previous result. As you can see, there is a log minimum improvement over here. And Kingman Bowman's result is nearly optimal. It means the input number is tied up to the constant C by the result of a tied motion from already. And this result also leads to a right order on magnitude of the random number R3T they discussed. And before introducing the proof idea of King and Bowman's result, then we mentioned that what such a result is difficult. So for example, if you want to prove such a result, by a standard approach, the alteration method in binomial random graph GMP, then you will try to remove one edge from each triangle to distract all the triangles and get a triangle free graph. But here are some facts. We know that with high probability, the number of edges in binomial random graph GMP is roughly N choose two times P. On the number of triangles, it's roughly N choose three times P to the cube. And because we want removing one edge from each triangle, the resulting graph does not have large uneven side. Therefore it's natural to assume that the number of triangles is much less than the number of edges. So that the resulting graph does not have large uneven side. But that will imply P is roughly one over square root N. But here is another fact. We know that with high probability, the maximum uneven side of binomial random graph GMP is roughly two times log N over P. And if you plot this P in, you will figure out that the unit's number is roughly this one, which is similar as the previous result, which is much larger than our targeting bond. So that's why previous proof based on binomial random graph GMP does not lead to the correct unit's number. So that's why Kimman and Bowman need to use some refund way to prove that they're resolved. On both of them use the idea of triangle three process. Where the idea of triangle three process is simple. We start with an empty graph. And at each side, we add one random page that does not create a triangle. And then we repeat. And here I will illustrate the process for you. So for example, at the beginning, we have not chosen any edges and all the edges are available to choose and we call them open. It means each of them can be added. On that each side, we add one random edge. For example, this one. Then next side, we add another one. At third side, we add another one. But at this moment, you can see that these two edge become closed because adding them will create a triangle. So we call them closed edges and they will never be added. And then we're coming to that. This edge on this one becomes closed. And that is the triangle three process on what's applied by Bowman in his 2008 book. Much earlier, Kim used a semi-random variation of triangle three process. Your semi-random means at each side, instead of adding just one random edge, we add many random edges at each side. For example, at one side, we add many random edges at each side. So that is the difference between Kim and Bowman's pool. Well, instead of finding just one nearly optimal or 3D graph as Kim and Bowman did, we find that almost a packing of nearly optimal or 3D graphs. It means given it keeps them greater than zero, you can find a collection of edge destroyant graphs, GI in the complete graph KN. But like each graph GI is nearly optimal or 3D graph. It means GI is triangle three on this small unit number. And secondly, the union of the graph GI in this collection contains at least a one minus epsilon fraction of edges of the complete graph KN. And that is our unpacking result. On the idea to prove our unpacking result is simple. Actually, we start with H zero equal to the complete graph KN. And then we find the graph GI in this collection in HI by semi-random variation of triangle three process. And then we remove edges of GI from HI to LH at plus one, and then we repeat. Therefore, we can obtain our packing result by a simple polynomial time random math algorithm, not just showing a distance. Is there any question about this unpacking result? Okay, then we will continue. On what is the motivation? Why should we care about such packing result? Well, first of all, packing objects in random discrete structure has been a recent trend. On yearly, you will have fixed objects, such as triangles, uniting cycles, or matching. While we pack objects with similar properties, then these are triangle three on the small unit number. Therefore, our result is a natural packing extension of Kim's result. Secondly, if you are not into the unpacking problem, but in random graph processes, then you know that even in one run on the triangle three process or the semi-random variation of triangle three process, controlling the arrows is very difficult. Well, we need to run the process for many iterations. Therefore, very important to control arrows. Otherwise, the arrow term will pick over. For this purpose, we actually introduce some self-structuralization mechanism to control arrows, which we will discuss later. And thirdly, if we are not interested in random graph processes, but in random theory, then similar as Kim's result, remove the actual load factor in the load bound of random number R3K. Our result also pays damages from conjecture in random theory by folks and others. Which I will discuss in next slide. Is there any question at this point? Okay, let me move on to discuss such random conjecture. So here we consider the archival version of random theory and we consider a copy of some fixed graph H. We call a graph G is R-random for H. And you know by this notation, G arrow H, it will any R-coloring on the edge of G, it contains a monochromatic copy of H. And we use this notation MRH in all the collection of our R-random emograph G or H. Where R-random emote H means the graph G itself arrows H. But for any proper subgraph G prime of G, it has no arrow H. And many problems in random theory can be understood by studying the property of this collection MRH. For example, randomly theorem tells us that this collection is not empty. And if you take the graph H to be the key for next complete graph, and if you take the memo over the number of vertices in this collection, then you will recover the classic random number. And if you take the minimum over the number of edges, then you will recover the value studied by the random number. Well, we are interested in some other extremal parameter and that was introduced by Burrow, Erdisch and Lowell's in 1976. Here, we take the smallest minimum degree of the graph G in this collection undenoted by this notation SRH. And in the two color case, when H is a k-word aspect, then Burrow, Erdisch and Lowell's completely determine this parameter in 1976. For many, by tartar graph H, this parameter is determined by books and me as well as Zabel, Winston and Zetcher. In 2015, books, Grispoon, Derbino, Persian and Zabel, they initially study of the multiple color case. On the H is a k-word aspect, we determine SRKK up to some logarithmic factor. On here for k-fix and r-tending to infinity, really determine SRKK up to some logarithmic factor over here. Well, with k equals three, in the special k equals three case, they also make some effort to make their bound as good as possible and for the logarithmic factor, there is a difference in the logarithmic factor in the upper bound and the lower bound in their pool. On the conjecture, their lower bound is correct, but the conjecture like SRK three is big O, R square, and log R. Well, we pull this conjecture as a corollary of aberrant pecking result. So it implies that when we confirm this conjecture, it implies that SRK three has the order of magnitude of R square times the log R. Let me mention that they have a net number to convert pecking result, such as hours to a bound on SRK three. On in their paper, they actually, they actually peck GI will go as local number argument. So that's why there is an actual log factor in their upper bound. And to remove the logarithmic factor, this check is to pipe GI sequentially with a triangle three process. Well, for some technical reasons, we use semi-random variation of triangle three process to get our pecking result. So is that a question at this point? Yeah, this upper bound is, that's a construction, right? Yeah, for the upper bound, you need to get a conjecture. Yeah, you want to show there is some work. So let's move on to our main technical result to prove our pecking result. So here is our main technical result to find the triangle three graph G in this graph H. So the result states that if you assume row is some edge density, and ice is the size of some large vertex size. Then if your host graph H is multi-sparse, it means the number of edges between any strong vertex at A and B offsets ice. The number of edges between A and B in H is at least, if so, and size of A and size of B. Then we can find the triangle three graph G as a soft graph of H. So that the number of edges between A and B in G is roughly the edge density row times the number of edges between A and B in H. And that's true for all these strong vertex at A and B offsets ice. So first of all, you can see that this number is greater than zero. Therefore, such graph G that's now has even side outside at most of two ice. Therefore, such a graph G is a nearly optimal R3P graph. This formula also tells us that graph G behaves random like because the number of edges between A and B in G is concentrated around the edge density row times the number of edges between A and B in H. And this property we call semi-random property. And actually this semi-random property, sorry, this is the random property. Actually this one really we call it random property. And actually this random property guarantees that we can, after taking the graph G from H, then a similar fraction over all the local parts of edges remain. So that will imply our packing result. So here is why. Because we start with H zero, you go to the combative graph KN, and then we sequentially choose graph GI in HI by using our learning technique result where HI face a row of H on GI face a row of G. And then we remove edges of GI from HI got HI plus one on repeat. Then this pseudo-random property guarantees like the number of edges between A and B in HI is roughly this parameter times the number of edges between A and B in H zero, which is size of A times size of B. Therefore, we can indirectly apply our non-packing result as long as this parameter is greater than usual. And then we will stop with the number of edges between A and B in HI. It's roughly usual fraction. And then a double-county argument implies that they have covered at least one minus usual fraction of edges by the graph GI that we have taken out. So that's how our learning technique result implies our packing result. And let's discuss the proof of our learning technique result is based on semi-random variation of channel-free process. So that we do not require degree or code-degree regularity of the host graph H. Therefore, the graph H can just be a dense graph and not necessarily a complete graph. And let's discuss because we need to control the arrows over many iterations of the semi-random variation of channel-free process. Therefore, it's important to control arrows. And for this purpose, we introduce some self-stabilization mechanism built into the process to control arrows. And some of the probabilistic tools we used are boundary differences in qualities and some upper-tier in quality of one key. So next, I will tell you how actually our learning technique result works and how do we prove this learning technique result. This may be an excellent point for questions. Or is there any question about this one technique result? So maybe you just, you can tell us a little bit about what... So what is being stabilized? Is it the degree sequence or what exactly are you controlling? Okay, yeah. I will discuss the self-stabilization in next slide. So actually, we just include more edges. Yeah, I will discuss it a couple minutes later. Okay, thanks. Okay, so let's move on to tell you how actually we prove our learning technique result. So we call that to prove our learning technique result. We try to find a pseudo-random channel-free graph by semi-random variation of channel-free process in a host graph H. Therefore, to construct this channel-free graph with what we call Tj for many steps on the semi-random variation of channel-free process. So we keep track in curriculum of three kind of edge side. So the first kind of edge side is Ej, which you consume that is the random side of edges. On the second kind of edge side is Tj, which is a sub-side of the random edge side Ej. On Tj, it is channel-free, has approximately maybe equal size as the size of Ej. On the third kind of edge side we need to track is the open edge side. But for open edge side, because edge is open, if it is now in the random edge side Ej, and it has now created a triangle with any two edges of Ej. So as we have seen, if we have a triangle on two of the edges are in the edge side Ej, then the third one we call it closed and it cannot be in the open edge side Oj. So these are the three kind of edge side. We want to track and the idea to track them in each side of the semi-random variation, triangle-free process, is that first we generate some random edge side, what we call gamma j plus one in the open edge side Oj. And then we do some alteration of this random edge side gamma. We get a sub-side of gamma prime, so like the union of the triangle-free side Pj with this gamma prime is still triangle-free. And certainly we will update the open edge side Oj, which is the sub-side that we remove this random edge side gamma from the open edge side Oj. So that is the idea of each side. And then I will give you the definition of these three kind of auxiliary edge side. So indeed, we start with O zero equal to the edge side of the host graph H, which is a dense graph. On this side E zero, on the T zero equal to empty side, empty side at the beginning. Then as you can see, these three kind of side satisfy the variation over here. So that is the initial beginning of the algorithm. And then we need to define, and then we need to control them in that way. So first, we have the idea here. So first we need to get some random edge side. So we get this random edge side gamma as the P random sub-side of the open edge side Oj. So we just include each edge of Oj internally with probability P through this random edge side gamma j plus one. And to construct the random edge side Ej plus one, which has a P union of Ej with this random edge side. We have chosen. Therefore we have updated the random edge side Ej plus one. So at this moment, we have finished the first step over here. Next, we call that we need to do some alteration on the edge side gamma j plus one. We get a sub-side gamma prime. And we want to ensure that the triangle three side Ej plus one comes back in this way as the similar size as the random edge side Ej plus one. Therefore we need to ensure that the size of the sub-side gamma prime is roughly same as the size of the random edge side gamma. And how do we ensure that? That because we can choose this P small enough so that you can imagine the random edge side gamma j plus one is really small. And means very few new triangles are created in the union of this gamma with Ej. Therefore it's enough for us to remove very few edges to destroy all new triangles. Therefore if we take the union of the sub-side with the triangle three side Pj, the graph is still triangle three. So that is our idea for us to ensure that our process may equal. So let me point out what kind of new triangles can be created in this type. So there are two cases. So the first case of creating a new triangle is that if we have a triangle and one of the edge is in the random edge side Ej and the other two edges are in the open edge side Oj. On this side, if we include both of them into the random edge side gamma j plus one, then a new triangle will be created. And we call such pair of edges in the random edge side, bad pairs. And here is another case. If we have a triangle and all three edges of it are open and we include them all together into the random edge side gamma j plus one to create a new triangle. So in this case, a new triangle is created and we call such three edges bad triples. Therefore to destroy all the new triangles after a moment solved, if we remove the edges of a maximum edge of this joint collection of bad pairs and bad triples, then we can destroy all the new triangles moving such a maximum collection. And that's how we define the subset gamma prime. We just remove the maximum collection of edges from the random edge side gamma. And then if we take a unit of this gamma prime with the triangle free side pj, then we will get a triangle free side pj plus one. Therefore we have updated the triangle free side pj plus one. That is by the maximality of this collection we remove. And the reason that we remove a maximum collection of edges over here rather than remove one edge from each bad pairs and bad triples is that it's actually much easier to analyze because of the disjoint maze. So that's why we remove a maximum collection rather than remove each edge from the bad triples of bad pairs. At this moment, we have updated the triangle free side pj plus one and finish the second side. On the last side is to update the open edge side pj plus one. I will show you how that works. So we call that we want pj plus one. That's not intersect with pj plus one. Therefore we need to remove the randomized side gamma j plus one from pj. And because we want the edges in the open edge side open, that means we need to remove some closed edges. So for the closed edges in this side, and there are two cases for the first case, is that if we have a triangle and one of the edge is in ej and the other two edges are in oj. And if we include one of them into the randomized side gamma j plus one, then the third edge will become closed. Therefore we need to remove these closed edges from oj to get oj plus one. And another case is that if we have three edges for a triangle in the open edge side oj, and we include two of them into the randomized side gamma j plus one, then the third one will become closed. I mean, you can remove these closed edges from the open edge side oj. So the first of two parts are easier to understand. And actually, we also remove some actual edges for technical reasons, and I will explain it to you. And actually, this part of edges is related to the sales position mechanism. Let me explain to you why we need to remove such actual edges for technical reasons. So actually, we remove some actual random edges and here is the reason why. So for example, if you have an h e, which is u v, and if you consider the co-pair of edges on it, and one of the pair of edges is in the edge side e j, on the other edge, it's in the edge side open edge side oj. And as you can see, if we add any of the open edge side over here, we will close this edge u v. And we denote the number of such co-pairs by y e. So such co-pair mean, I mean, one pair is in e j and the other pair is in o j. And therefore, the probability is like an edge e is not closed. Next step is roughly none of these open edges is included in the random edge side gamma j plus one. Therefore, it is roughly one minus p for the power of number of such co-pairs. And let me mention that we have a process mainly equal here. It is because there is another case that we have a co-pair and two of them are open. And we include both of them into the random edge side gamma. But as you can imagine, in that case, the probability is very small. So that is rather negligible. So therefore, we have the probability that e is not closed. It's roughly this probability. But as you can see, this probability really depends on the edge e, depends on this parameter. On this parameter, y e can actually vary edges from edges because we do not assume regularity of the host graph. And that will cause some problem. But to overcome this difficulty, we actually remove some actual random edges independently with a probability qe. So we remove the edges independently with probability qe. And therefore, an edge is not closed, or an actual edge is roughly this probability times one minus qe. And because we can choose this parameter, probability p, qe, up to different edges, e, therefore, we can make this probability is roughly the same for all the edges, e.  That is also a key difference between ours proof and Kim's proof. Well, in Kim's proof, to get this self-deposition, Kim used some earlier regulation result by Khan to artificially modify the graph to make it self-deposition. Well, here we just include some actual random edges which is much easier to implement in algorithms.  And at this moment, we have updated the open edge side which is plus one. That is, we remove the random edge side and the closed edge side and some actual random edge side from the open edge side in last step. And therefore, at this moment, we have updated all of these three kinds of observatory edge side, and then we can move on to next step. So that's how the semi-random variation of triangle-free process works in the proof of our technical result. And by analyzing such semi-random variation of triangle-free process, we can show that the number of edges between any two large vertex sides, A and B, the number of edges between them in the open edge side, is roughly a parameter qj times size of A times size of B. Where qj setifies some differential equation. And here we assume the host graph H is the conveyed graph for ease of illustration. So that's why we have size of A times size of B over here. Otherwise, if you just assume H is a dense graph, then we should have the number of edges between A and B in H. And I will tell you how this result imply our main technical result. Because I do get our main technical result, the one, the number of edges between A and B in the final triangle-free side pj, is roughly the estimate show times size of A times size of B. And let me tell you how does it work. So here we choose the probability p, would be some small parameter sigma over square root of n. Where p is the probability that H in the open edge side is included into the random edge side gamma. And let me tell you how this result will imply our main technical result. So actually consider the number of edges between A and B in the final triangle-free side. We can decompose such edge side to the side that they are included in the triangle-free side pj. Therefore, the number of edge side A and B in the final triangle-free side is the sum of the side that they are included into the triangle-free side. So that's why the first equality holds here. Recall that we want the difference between the triangle-free side is roughly the same as the size of the random edge side gamma j plus one. So that's why we have our main equal over here. Because we need to keep gamma prime is roughly same as the size of gamma. And because this gamma random edge side is just a p random edge side of the open edge side oj, therefore, the size of this term is roughly the probability p times the number of edges between A and B in the open edge side. And if we plug p in, if we use this concentration and plug it in, we will have this side. Because qj satisfies some differential equation, therefore, this discrete sum is approximately equal to this interval. Therefore, we can approximate this discrete sum by this interval. And then if we apply the fundamental theorem of calculus, this interval is roughly equal to this function over square root of n times size of b times size of b. And by studying the behavior of this function, we can show that this function is approximately equal to square root of beta times the number of edges. And because of this parameter, it's what we define for the edge density row. Therefore, we have shown that the triangle free side pj, the number of edges between A and B in the triangle free side pj is roughly edge density roughly row, according to the whole square page. So recall that if we use whole square graph page, not to be a complete graph or some dense graph, then here instead of size of A times size of B, we will get the number of edges between A and B image. So that's how we prove our Mentecner result. Let me mention that actually things are not so quite easy to get this concentration result. And I will explain to you why. It's because we try to get such concentration for all the large vertex at A and B. And that will cause some difficulty. And here is why. So as soon as we have a vertex v1, and it has many edges, many neighbors use the randomized side ej. So they have neighbors over here. On v1, I have some open neighbor, that is what we call v2. So v1 and v2 is an open edge. And as you can imagine, there are many common open neighbor of v2 with the neighbor of v1 that is in the randomized side ej. So you can assume there are many common neighbors over here. And then we can choose the large vertex at A to be a vertex side that contains the neighbor of v1, ej. So we choose this one to be A, and then we choose some vertex at B, which contains the vertex at v2. Then for this pair of large vertex side, if at next step, we include this open edge v1, v2, we include this open edge v1, v2 into the randomized side gamma j plus one. Then as you can see, there are such common neighbor will become closed. And as you can see, a large number of open edges between A and B are closed. So that will cause some difficulty for us to apply concentration in qualities because of this large change at this step. And we want to, we want the concentration close for all the large vertex at A and B. And that will cause some difficulty and need some more careful analyze. So I may not go into the details about these technical details. Rather than I will go through summary. So as a summary, instead of finding just one nearly optimal R3T graph as key on Bowman data, we found out all of the packing of nearly optimal R3T graphs, it means give any eaves on greater than there. We can nearly decompose the complete graph Kn by a collection of edge disjoint graph GI, such that the graph GI in this collection contains at least a one-month eaves on fraction of edges of the complete graph Kn. And each of the graph GI in this collection is channel-free and with small universe number. So as a remark, our result is a natural packing extension of Kim's result. And we can obtain our packing result with type of a beta by a polynomial time random math of the result, not just showing the existence. Secondly, our packing result establishes the conjecture about this parameter SRK3 in random theory by folks and others. So let me start with two questions. So for the first one, actually to prove this upper bound on this random parameter SRK3, it is enough to just cover eaves on fraction of edges. Well, we cover one-month eaves on fraction of edges by our packing result. So we are wondering is there any application about our stronger packing result? So maybe in random theory. On the second question, if one generalize the greedy packing result, then it turns out that it does not help to improve the upper bound on SRKK for larger K. It is because there are better construction based on projected presence. Therefore, we are wondering, is there any application of the random greedy version of KK3 process will be useful? And this talk is based on a paper by me and Wonky, which has the same title as this talk. And it has recently been published at Commentarica. Let me stop here. Thank you. Is there any question? Thank you, Vah. Let's go ahead and thank our speaker if we could. And then we'll go ahead and open it up for any questions. Okay, do we have any questions for our speaker? You may have mentioned this. But so with this algorithm, when do you stop? Or when, I guess, are you forced to stop at some point, right? Because you would have put too many edges in. I don't know if that is a, I don't know if that question makes sense, but. Actually, there are two level of integration here. This is the higher level of integration. We interactively use our mental result because of graph GI in the packing collection. So because each time we remove so many fraction of edges, then the remaining fraction of edges is roughly this one. I know that if you want to apply this mental result, you need to guarantee that there are still enough number of edges left. So that's why we need to keep this parameter as at least the usual. And then we will stop when this parameter is roughly. Okay, that makes sense. Thank you. Actually, follow up question of that. So how dense is the graph that's left over? It was absolutely basically. So for the graph left over, actually we still have some fraction of edges that's left over. Actually you can use this formula to guarantee that in the leftover graph in HI, this parameter is roughly Epsom. So roughly Epsom fraction of edges are left over. Yeah, well, what is epsilon, I guess, is what I'm asking? How sparse is the remaining piece? Yeah, for the Epsom, you can choose the Epsom to be any constant greater than zero. But you could also take attending to zero. How fast? You don't know, maybe? Yeah, but then you see maybe change. That is the unit number, yeah, real change. See, actually it depends on something like one word, Epsom square or something. I guess another question actually that, of course, the K4 is, be nice to have the Ramsey result for K4 as well, because that's not tight still, I recall. And you don't need the packing result for that, right? We just need the instructions. So have you tried your methods on K4? Yeah, actually we have some work in progress, not just for K4, but for H3 graphs. H can be many kind of graphs. So we're really very similar at this one, it powers one method from fractional badges on S from unit number. Do we have any other questions for our speaker? Okay, in that case, thanks Huff for coming around. It was a great talk, good to have you. We're all happy to have you here. And I guess we'll go ahead and sign off unless Josh, is there something else you wanna say? Nope, thanks very much. So actually for H3 result, we can guide H2B, maybe take a cycle, that part of graph. Thanks for attending. Thanks. Thanks everybody. That was a very nice talk, it's a very nice technique. So thank you. All right, thanks.


So I wanted to talk about this video. This was shared by Ryan Grimm. I think that the headline here kind of says it all This is courtesy of the intercept media presses for weapons instead of diplomacy in Ukraine Now I've critiqued the coverage of the Ukraine Russia invasion because I don't like the way that the media very Flippantly advocates for World War three by coding that in a no fly zone language I mean when you call something as As serious as a no fly zone a no fly zone you kind of sanitize it when in actuality that is Essentially a declaration of war against Russia So if you are on the mainstream media and you're asking the president or the vice president or some senator If we should have a no fly zone you can't just say Do you support no flies on you have to explain to the public what that is? There was a poll and I think that David Dole actually did a video about this that I looked at public support for a no fly zone and most Americans supported it until They found out what was entailed with the no fly zone So people are supporting something because there's this implication Because of the way that it's discussed in the media that it's good and would bring about peace what an actuality the opposite is True, but overall this just really shows you that The media they are pushing for a particular position and they are trying to Opt for escalation. I don't know how else to put it, but thankfully Jen sake I feel like has been doing a pretty good job Biden Harris They've all been doing a fairly good job or I should say decent job I don't want to give them too much credit But they've been resisting calls to escalate with regard to a no fly zone and I'm thankful for that But take a look here at the the questions that they asked the way that the media reporters here frame it it's really frustrating to me because There's no sense that they care at all about diplomacy. It's all escalate escalate escalate. Why aren't you escalating further? It's insane So one ski another Ukrainian officials have made so clear that what they believe they need the most is more war planes and fighter jets So why is the US assessing? something different What is the US believe they know better what I need than what Ukrainian officials are saying they need the most Sounds like you know, we're pretty dug in on our position when it comes to the no-fly zone when it comes to World War three Despite this growing call by person called Congress to shift a little bit So to put it bluntly, it's let's you wasting his time tomorrow asking for these things President's life is going to be speaking to Congress tomorrow. He's been pushing for fighter jets on no-fly zone Here's some of those same requests tomorrow as well as immigration ship thinking ship them that at all Member they share a border with Russia. How do we view their calls for a no-fly zone? And on president's long case address tomorrow, of course He is expected to ask for more assistance as my colleague noted a lot of the US positions on that haven't changed Just you just said when it comes to the knife no-fly zone But on the aircrafts just specifically the Pentagon said last week that Secretary Austin said they do not support the transfer of Additional fighter aircraft at this time. Is that still the United States position? Would a strike in Poland on supplies or or anything really? Automatically met with a military forceful response, which would be a conversation amongst allies about how to respond There are reports that a Russian drone made its way into Polish airspace before going back to Ukraine and being shot down. Does a drone into Poland count? Former ambassador to Ukraine Maria Ivanovich has been quite outspoken recently And she said you need to mitigate risk But it's also true that not taking greater action comes with a risk as well Because Putin is a bully and he only Is the president showing enough strength against Putin? Putin were to use chemical weapons. Would it change the president's thinking when it comes to these nakes taking the no-fly zone on the table? But at least on the no-fly zone. If you prepare, can you give us any more details about what that threat means of severe consequences? The president obviously made the same threat last week. Is that purely? Economic consequences or would there potentially be a military cut? Good aside from the request for weapons president Zelensky has also requested that the US be more involved in negotiations toward a peaceful Resolution to the war. What is the US doing to push those negotiations forward? Well, one of the steps we've taken a significant one is to be the largest provider of military and humanitarian and economic Assistance in the world to put them in a greater position of strength as they go into these negotiations we also engage and talk to the Ukrainians on a daily basis and the president and this national security team has has Rallyed the world in being unified in their opposition to the actions of President Putin So those are the steps we're taking we also engage oftentimes before and after any conversations that any of these Global leaders are having with both Russians and Ukrainians and encourage them to make sure they're engaging with Ukrainians directly would Zelensky be empowered by the United States to Reach an agreement with Russia and have US sanctions. Notice how Ryan Grimm is the only person who's asking about diplomacy I'm gonna pause it right here because I want to show you this video from Biden So when they ask about a no-fly zone and why the administration hasn't shifted or has their position shifted That would be a direct Confrontation with Russia and I think that Biden made it very clear what that means here As you pride this support to Ukraine We're gonna continue to stand together with our allies in Europe and send unmistakable message That we will defend every inch of NATO territory every single inch With the United Galvanized NATO One movement. That's why I've moved over 12,000 American forces along the borders with Russia Latvia, Estonia, Lithuania, Romania, etc Because they move once Granted if we respond in this World War 3, but we are a sacred obligation on NATO territory a sacred obligation article 5 So it was quick, but he's he laid it out If we respond it's World War 3 and we should we should watch that again because it's kind of a big deal We respond it is World War 3, but we if we respond it is World War 3. So he's laying out the stakes here So when these journalists are asking this question, you know about well, I mean Zelensky is calling for a no-fly zone Is he wasting his time? Do you understand this isn't some light thing? I mean you all understand it, but the reporters I feel like don't yeah As Ford puts it it's like adding gas to a fire. I mean if you want to create a world war and Expand suffering orders of magnitude more than that's how you go about doing it There was I think it was Gale King. Maybe I can't remember who said it in an interview with Kamala Harris But she was like you rolled out boots on the ground But there are people who are suffering children suffering You know how what will it take to get you to change your mind? I'm paraphrasing the way that she phrased it But the implication was hey, isn't it bad that you're not willing to directly confront Russia over what they're doing in Ukraine But again, if you're sad because of the suffering I understand that that's a human thing But that expands suffering it becomes a World War 3 it becomes something much bigger than what we're currently seeing and then you pit Two nuclear armed countries who have 90% of the world's stockpile of nuclear missiles against each other Not a risk I want to take because we're talking about humanity here, so it's huge absolutely huge. Let's let's just finish this We're almost done here Released as a result. Well, he's the leader of Ukraine So he's empowered to have a negotiation with Russia and we're here to support those efforts Again, I'm not gonna get ahead of a negotiation, but we are here to support those efforts We discuss and have conversations with him with his team on a daily basis Yeah, so I wish that Reporters didn't frame their questions to suggest that not being antagonistic is You know bad, but here we are Viking North Gamer says this is the beginning of World War 3. Sorry, but I think it is. I hope not. I hope you're I hope you're wrong about that I absolutely don't want this to Be bigger than it is. It's already Catastrophic and awful. So I think that you know the Biden administration has a responsibility to do everything in their power to try to de-escalate and focusing on diplomatic talks, you know focusing on the ways that we can facilitate Some sort of ceasefire a peace agreement. That's what's really important Not forcing the Biden administration or pressuring the Biden administration rather to be more aggressive


Hey everybody, welcome back to Magic Orthodoxy. My name is David and this is a Magic Review. Hey, today we're going to look at Locked in Thought from Paul Brooks. What is this trick? Basically, this is a brass padlock. It's a real brass padlock that you have locked on your keychain or in your pocket or maybe on your gym bag. You're able to take it off, hand it to the spectator. They change the combination themselves without writing anything down, without any equivocation from you, without any questions from you. With your back turned, you could even do it blindfolded and when they give the lock back to you, you're able to discern exactly what the number is. You want to see what the trailer looks like? This is it. Imagine having a small combination padlock on your keychain. The kind that's used for travelling or for gym lockers, that sort of thing, that is able to deal devastating mentalism wherever you go. Simply have a participant enter their own number into the padlock. Then apparently through mind reading, you're able to open the lock. Must be some kind of trick lock, right? Wrong. You're able to turn that lock around and show the person the exact number they were thinking of. There's no writing down, there's no funny procedures, just direct mind reading using that padlock. It's fully examinable from start to finish and it's ready to go wherever you are. Unlock their mental security with Locked in Thought. Alright, so that was Locked in Thought from Paul Brook and this is a self-published release, I think. So a couple questions we always ask about all of our magic reviews and the first of which is, what's in the box? What's in the box?  Alright, so is it what I thought? No, it's not what I thought. I really thought I'd be getting some sort of gimmick. For 65 bucks and getting something that was a brass padlock and I'm going to learn this really cool trick, I was really expecting a gaff for a gimmick and it's not an expensive gaffed padlock. This is an actual real locker, you know, cheap padlock that you could get from Amazon for 15 bucks or so. It's a real padlock and the cost really is Paul Brook, number one, finding the padlock for you that would do this trick and number two, getting all of his expert advice, getting all of his routines and ideas. How are the angles? There are none to speak of. There are some movements that you're doing as you're trying to unlock the key code with your hands. I wouldn't call them angles because there's really nothing the spectator is going to see. There's no flashing. They might notice that you're down there struggling, but Paul Brook does give you some cover ideas for that which should work to your advantage. Can it be inspected? Absolutely. This is a real padlock. Part of the trick is you giving it to the spectator and they change the key. They change the passcode on it and hand it back. So they have to hold it, they have to inspect it and they're never going to find a thing. What's the overall quality and production value of the teaching? The teaching is a 46 page PDF with absolutely no pictures. Paul Brook is going to teach you how to honestly crack a padlock. He's going to teach you how to lock pick basically without a lock pick. He's going to teach you how to crack it with just using your fingers and your sense of touch. It's going to be like in the movies where you see the guy with his ear up against the lock and spinning the tumblers. That's what you're doing, really. Spoiler alert. So he's going to teach you how to do that. But like I said, it's a 46 page PDF and there's one picture and there's no one set method. He'll say try this and if that doesn't work try this. So there's a lot of trying and failing on your part until you get it down. So how much practice does it require? I have no idea because I really couldn't follow the instructions. I had the padlock in my hand. I tried it this way and failed, tried it that way and failed, tried it that way and failed and I gave up. I was a little disappointed. I really wanted a gimmick that was going to work nine times out of ten or at least ten times out of ten. And to get an actual padlock and to have him try to teach me how to actually crack a padlock code without pictures or without video just didn't work for me and it just fell short and I was really sad because I really wanted to learn this trick. How much setup and reset is there? Really the only reset is you should always reset the lock back to a number that you recognize or that you remember. Set it back to 0, 0, 0, set it back to 1, 1, 1, set it back to 1, 2, 3. You get to set it back to something easy so that when you give it to the spectator they know how to unlock it. So they put in 1, 2, 3 and then they change the code and then you'll have to teach them how to change the code too. Positives. Alright so what are some of the positives to locked in thought? Paul Brook has created a clever effect using real props and by teaching you real techniques this is the real deal. Alright so what are the negatives? What are the negatives to locked in thought?  I couldn't ever stop it on a specific number. Like if you said stop it on 6 I would pass it. And then the other thing was the numbers were so small in the lock. I mean I always get weirded out when I have to put my glasses on to do magic because then I'm kind of alerting the spectator that I actually need to read something. You don't want to have eye-decker cards and have them be reader backs or mark backs and you put your reader glasses on to see the backs. That's a definite clue that you can read something there. And so to put my glasses on to read the tiny numbers I mean I had to hold it back and to see the numbers or take it outside in sunlight. Like the numbers were too small for me to read so kind of lost some points for me there as well. Is it worth your money? Is it worth your money? It is $65. $65 and like I said you're only getting a tiny little brass padlock that you could get on Amazon for a lot less. Okay so value wise, value wise no it's not worth your money. Performance wise, performance wise if you can get mileage out of this, if this speaks to you, if this is still like yeah I want to learn how to crack locks and do this. And that's definitely in my style of character. Performance wise $65 is nothing because this is the trick you can do over and over and over again. If you can actually hand out a bowl, that's a real word, expected it will never catch on that you know how to really crack locks. It's a great mentalism effect, great lock picking effect. So I say if you can get mileage out of this, if you can make it work for you, it's definitely worth your money. And Paul Brook did tell me, I mean I reached out to him, I told him I was having trouble with this. Paul Brook did tell me that he was releasing a video. So he will release video instructions as of this recording, as of this review he still has not. And I was really holding back on my review waiting for the video so that I could add that into my review. But deadlines and so as of now it's not released but it might be released by now. And if you've seen it, maybe comment below in the section underneath and let us know if the video really helped you out a lot. That would help out some of our viewers. Alright so who would like this? Mentalists and people that want to do a lock picking routine. I think that's really the audience right there. Alright so that is Locked in Thought from Paul Brook. I want to thank Murphy's Magic for providing this trick for me so that I can do the review for you. And if you want to purchase it for yourself, you can find it from your favorite Murphy's Magic dealer. Thanks, bye.


to TCP V4 Connect. This is the corresponding user space code. By the way, this code is really from the original BCC code. As you can see, the user space code in this example, it handles command line arguments in this case, passing the configuration of the user, and it loads and clean up the EBPF programs, clean up the maps so it doesn't leak any memory. And it also loop to read the data of the map and then format the output to something the user can easily to read. So now on the next question, as you can see, the user program is actually pretty complicated. What if we could just write the kernel program? Because the user space program actually take way more lines of code than the kernel in this example. And also, we love the Docker experience. How many of you use Docker before? Do you like the Docker to be able to build, to be able to push, and then you can pull somebody else's registry? So we all love that Docker experience. So this is the open source Bumblebee project was born. So solo along Bumblebee, I believe in January this year. So if you scan that QR code, that would take you to bumblebee.io. We recently applied Bumblebee to be a CNCF sandbox project, so finger crossed. We will be accepted. So essentially, Bumblebee is enable you to easily build your ABPF programs and to be able to publish that program to OCI compliant registry and enable your audience, your users, to be able to take the program from the registry so you can easily run the program. On top of that, Bumblebee also allow you to focus on writing EBPF code while taking care of the user space component for you, automatically exposing your data as metrics and logs. So Bumblebee supports LibbPF compatible BPF code. It doesn't support the legacy BCC-based EBPF code. It provides a containerized building environment so you can easily build your EBPF program and then push it and run the programs with the OCI registry. So let's talk about building with Bumblebee. So as I mentioned, we provide pre-built containerized building environment. As part of this environment, which is this image you see here, it essentially includes the compiler, which is the LLVM and CLUNC, because we only support C at the moment. It also supports some, we also embed the BPF headers along with the operating system, dabbing here as part of the builder image. When you take your EBPF program and build with Bumblebee, you essentially run the B build command, and then you can, Bumblebee is going to take your EBPF program, build into the LFL, which is the bytecode we talk about early, and then Bumblebee also packages the LFL into the Bumblebee OCI image, which you can take that image to push it to any OCI registry compliant registry. When you run the Bumblebee OCI images, what you can do is using our runner. So you can run a local image, you can run a remote image, you can run somebody else's image as long as you trust it. So let's walk through how this works. So with the moment you specify B wrong command to run the images, what's this going to do is we're going to try to pull down the images to the local machine if it doesn't exist, and then we're going to load your EBPF program as part of the image. Remember the bytecode is part of the image, so we're going to load your EBPF program in the kernel for you. In the meanwhile, we're also going to create the map for you so your EBPF program can interact with the map. And as part of the running, Bumblebee also watch the desired map and output the data from the map and emit the metrics for you so you can config the premises to read that data. All right, so writing EBPF programs with Bumblebee. In this example, this is the same TCP Connect C. In this example, we walked through earlier where we focus on just the EBPF program portion. So this is the event which hash map, which contains the dimension structure, which has source destination address. And on the right side, we have the interaction of the map. So we are reading the source and destination from the event, and then we are updating all that relevant information to the map. So the hash map has all the information related to the TCP Connect event that we want to capture. So running with Bumblebee, in this example, you can see the source and destination address where you specify in your struct. We're going to display it as part of the Bumblebee UI. And the value, which is the map of the counter of the map, we're going to display how many times from the source and destination here.  So you can see all the events related to TCP V4 Connect with source and destination all captured as the events in the metrics. This is another screenshot of the events from premises. With that, I would love to show you guys a demo. Yesterday, as I was showing demo, I had a lot of Wi-Fi issues. So hopefully, fingers crossed today, I would be doing better. But I did get the demo recorded. So this is a demo I developed to run out of memory on Kiosk application to detect out-of-memory Kiosk with the help with EBPF. In case you are not familiar with what does on Kiosk mean. So if you Google this, this blog was very helpful. So on Kiosk, it's all about Linux on Kiosk kernel process. So Linux kernel detects this process continuous monitors the node memory to determine memory exhaustion. So if such a condition was detected, it will attempt to kill the best process. So it kills the least number of process to minimize the damage. So this is not something related to Kubernetes. It's actually related to about Linux kernel process. When I first saw my pods as on Kiosk status in my Kubernetes, I actually thought it was from Kubernetes. So this blog really explained that well. So what I'm doing right now is we are provisioning a virtual machine in the cloud. And that virtual machine is going to be our playground for the demo to help us to observe on Kiosk event inside of a Kubernetes cluster. So we're hoping to, you know, with this to get a Kubernetes cluster with kind. And we're hoping to deploy some pods with memory leaks. And then we're hoping to leverage Bumblebee to detect the pod and the process within the pod that's causing the on Kiosk events. Does anyone have any questions where we stand up the environment? I know the room is pretty cold. I feel like my hands are so freezing. All right, so we do have an environment. And hopefully the Wi-Fi stayed with me. So now in my environment, it's a VM in the cloud. We're starting a Kubernetes cluster now. So you can see I probably have my Kubernetes cluster running. I don't have anything in the default namespace. And, you know, I just have a core DNS. And I have some nodes, hopefully. Yeah, I have three nodes, one master to work. All right, so the first thing we're going to do is we're going to look at the lead BPF tools, which has the on Kiosk. So we're going to look at this BPF.C program, which I have it open here. So this is very similar as the TCP connector I showed you earlier, which we have a map that's been created. And it's hooked up to the on Kiosk process in the Linux kernel. And it's trying to read out some of the data, like the from, where the, which process is from, which target process got on Kiosk. And, you know, it's trying to write that data to the map so the user program can consume. There is also a matching on Kiosk.C program, which I believe is the user program. So the user program is actually a lot longer. In this user program, we have the arguments related to the commands. We're passing the arguments. We handle the events. And, you know, we have a main method, which we need to pass the map and output the data so the user can consume that. So as you can see, it's like 189th of user code. So let's see how Bumblebee can help out, right? So you don't have to worry about user space code. So the first thing we're going to do is we're going to download this EBPF program, Omkio, that we just reviewed together on my machine. And then, also on my machine, I already have another version of the Omkio that works with Bumblebee. So what I'm going to do is I'm going to open up the two programs so we can take a look at the difference together. So the first difference is we didn't include a header here because it's a small program. So we didn't need to have multiple files. And the second difference is instead of using a perform event array, we're using a ring buffer. This is because a ring buffer allows you to reserve. And also, it's better performing. And Bumblebee also supports ring buffer. It does not perform event array at the moment. And we also change this to the map.counter so that Bumblebee can display the counter on the Bumblebee's UI. And then, as part of the K-Probe, it's relative the same except we deal with ring buffer with the event, the proof event array. As you can see, we can reserve a good size for the ring buffer. And then we essentially get the current PID ID. We're also getting the target process ID and the target communication. And then we're submitting right that data back to the ring buffer so the user space program, which is Bumblebee, can access that data. So with that, we're going to get out of the WIM differ program. And what we're going to do next, let me see how much time I have. So what we're going to do next is we're going to download Bumblebee. So the download Bumblebee is really simple. We just run the code command, specify which version we want to download. And now we should have the B command on the path. OK, so now we can review this program, which actually is very similar, which we just reviewed through the DIFF program. So we're not going to review in detail, but the key thing is we're using a ring buffer. We'll capture the from, which is the source of the PID, and also the target PID that got Armcare. And we'll also capture the pages of the memory when it happens, right, when the Armcare events happened. And then we're writing all that data into the map through the EBPF program as part of the K probe here. All right, so we have our Armcare program. And we're going to copy that program into the current working directory. And then we are using Bumblebee to build it. So what Bumblebee does right now, remember, the B builder has the compiler, right? So it's going to build the EBPF program, which is Armcare.c here. And it's going to try to build it as a byte code, right? So the L file we talked about earlier. So it's going to build that L file. And then it's going to package it as OCI images.  Actually, I shouldn't say on my machine, but somewhere in the cloud, which you are seeing locally, 2.vm. So now we build the image. I already have a registry running locally, which you can see. I'm running registry 2. So what we are going to do next is push that image. We just build together to my local registry. Well, that was pretty fast. I'm so thankful about the Wi-Fi today. And now we are going to take a minute to run that image. So this is the Bumblebee UI when you run that image. So you can see nothing happens, right? Because we don't have any interesting events. So let's try to generate some events, some omkio events. So the first thing we are going to do is we're going to create a demon set together. The reason we create a demon set is we want to have a bee runner to run the images we just created together, which is omkio version 1. And the demon set, one thing I want to highlight is have a label, which is app called Bumblebee. And also the demon set exposes a port named the HTTP monitoring with container port 1981. So that's for premises part monitoring later on, which we will show you shortly. So we just deploy the demon set to my Kubernetes cluster. You should see the demon set as parts. So it's running. Remember, at the beginning, we said we have three nodes for my Kubernetes cluster. So demon set deploy one part for each of the node. So that's just running. And the next thing we're going to do is we're going to install premises. So the first thing we're going to do is add through Helm. I did have Helm pre-installed. So we're going to add the premises community Helm charts and do a Helm repo update. And then we're going to install the Kube premises stack in the monitoring namespace. So now we just add it to the repo, and we got repo updated. And now it's installed the premises stack. So hopefully finger crossed. I think this is also using Wi-Fi space. So let's check if that's running. All right, looks like maybe we have one. It's not running, but the rest are thankfully running. OK, that sounds good. In addition to that, let's see if this reaches running. Yes, it did. All right, we're going to deploy a pod monitor to scrape our bumblebee paths. So if you remember, when we deployed the bumblebee demon set, we had app equals bumblebee. So that's how the pod monitoring is configured to select our bumblebee app. And if you remember the metrics endpoint, we had a port called HTTP monitoring. And the path is on slash metrics. So that's how we can fake the pod monitoring to scrape the bumblebee pod on the HTTP monitoring pod. All right, so we got that deployed. Now the next thing we are doing is to do a port forwarding. The reason we do a port forwarding to premises is just mainly making sure we can access the premises UI. So hopefully the UI is because of that port forwarding. Now the next thing we are going to do together is we're going to deploy a bad memory leak pod. So as part of this pod, it's going to trigger memory because it's keeping leak memory. So it's going to trigger on key events. So as you can see, it requested a 64 megabit of memory. But it has the limit of 128 megabit memory. So when it hits the limit, it's going to trigger on key events. So let's check it out. Get pods because you can see it already crushed once. Now if I go back to bumblebee, what do you think is going to happen? So bumblebee was through our EBPF program hooked to the on key event. And bumblebee was able to detect from which PID that's causing the on key event. And eventually this is the target PID that's got killed. As you can see, in this case, because our example was very simple. So the from to the to the target, it's the same PID number. So that's the PID number where you get into the out of memory leak pod. That's the PID number gets killed. The pages is interesting. So I actually did a calculation of the pages. So one page is 4K. So 32, 7, 6, 8 pages is about 131 megabyte. So if you remember when we deployed this pod, the limit is 128 megabyte. So whenever it hits this over the limit, that's when the on key events get triggered. And that's when the pod gets killed and restarted. So with that, I also want to show you one last thing. I know we are close to run of time. I want to show you that you can also curate the data in permissives. The way to curate the data is curate the events. If I can have my permissives back here. Sorry. Yeah, it's responding now. So this is a convention. It's the OMKEA, it's the EBPF program. So the events. So you can see every single event that you saw on the Bumblebee interface here is also captured in permissives. So this is really useful so you can set up with alert or you can generate your own UI to render this. So very nice way to get all the events on this. With that, I think that reaches the end of the demo. Now I want to pause one thing to mention. We are at the booth. If you are interested to ask more questions about EBPF, e-steal, Envoy, and we are also hiring. In fact, we run an EBPF workshop tomorrow, one of my co-worker, Adam. So if you want to do some hands-on with EBPF, I highly recommend that. That's all I have. I want to open up, see if you guys have any questions. I'm very thankful the Wi-Fi was good today. Yesterday, I had so much panic moments. And the best part is the audience actually helped me think of what's going on with my commands. And you guys were there, so it was very engaging. So any questions? I mean, if you guys wanted to learn about EBPF, I highly recommend Bumblebee. I also wrote a blog about Get Started with EBPF with Bumblebee. It shows the program, a Hollywood program, which is a little bit simpler than this program. So that's a great way to get started with the EBPF. It shows you all the steps you need to do. Like I said, the best way to learn is actually hands-on, because you could listen to a lot of talks. But the hands-on really gets me to understand the interaction between the EBPF program and the user space and why you need both, what are the scenarios, how you can potentially leverage Bumblebee, so you don't have to write the user space program. So we're really excited about Bumblebee. We're taking it to CNCF as a sandbox project. If any of you are interested to the project, we certainly welcome any type of contribution or collaboration help us shape the roadmap of Bumblebee. Thank you so much.


Hi, how are you doing today? This is your host, Rich. Here I'm going to have a Rich TV Live with a very special guest. It is Joshua Barch, the CEO of Midasine Innovations. How are you doing today? I'm doing great. Thank you so much for having me. Thank you for being here. Now, Midasine Innovations is a life science parent company dedicated to the development and production of adaptive pathway medicine, natural health, and digital health solutions stemming from fungi, otherwise known as mushrooms. Can you give us a brief overview of the company and the different areas of your business? Absolutely. So Midasine Innovations Group has broken down into what we call three divisions. So two were brought on by way of acquisition over the last few months, and then the other one was in-house. So you have Midasine Health Sciences, which is our IP branch. So that's headed by our CSO, Rob Roscoe, who was formerly the head of genetics for canopy growth. And before that was the head of genetics for a company by the name of Ebu, which was acquired by canopy growth in 2018. That's revolving around a number of different really unique IP sets, both in the psychedelic realm as well as in the functional mushroom realm as well. Neurofarm is a company we acquired and actually closed on just a couple months ago. So Neurofarm is a very interesting company that's comprised of upper echelon, both current and former mental health experts from various military constituencies ranging from the Canadian military to the EU military and obviously the US military as well. And what their focus is on is utilizing salicybe and salicin in conjunction with very proprietary treatment and therapy sessions for the treatment of PTSD, both in veterans and EMS workers. And then the well-rounded end of that is our last division, which is Mindleap Health. Mindleap Health is a very exciting telehealth platform that combines mood and emotion coupled with mental health solutions in a very intuitive way and predictive way that solves a very large problem for mental health and specifically the follow-up of these various treatments that individuals are undergoing using different psychedelic treatments. So obviously we're very excited about that as well. And what sets Mitocin apart from other psychedelic medicine companies? So I think there's a couple of things, one of which is obviously that the management and the individuals involved ranging from our extensive scientific advisory team and obviously our core management. Each and every one of our core management has had incredible successes in previous businesses ranging from consumer packaged goods products, obviously in the educational field and different various applications for emerging market growth companies, whether that be cannabis or also alternative forms of wellness. And then obviously in the scientific realm, I think that our scientific advisory team really is world-class and world-renowned and definitely sets us apart. The secondary piece of that is really our pointed focus and our capabilities that we've been able to accomplish. So Mitocin right now under a very robust Health Canada license that's attached to an incredible multi-hundred million dollar lab, we're the only company in the world that has the full ability to go from A to Z on psychedelic mushrooms. We have a license amendment that allows us to do full cultivation on site all the way to R and D, all the way to extraction and proprietary methodologies. And then that's attached to a CGMP pharmaceutical manufacturing lab that then gives us the ability to actually spit out whatever our formulations are, whether we're doing a compound pharmacy standpoint for other companies and or developing our own proprietary formula for our clinical trials in-house. So something that's very, very unique and not a lot of people have the ability to do or will have the ability to do. I love telemedicine and I love what you guys are doing, bringing two of the hottest sectors together. I think it's genius. Now Mitocin's telehealth app, MindLeap, is officially launching tomorrow. Super excited about that. Can you tell us a little bit more about that? Absolutely. So MindLeap, like I said, is the first application that combines telehealth medicine for mental health with mood and emotion tracking.  Additionally, something very unique and as it pertains to psychedelics, when you're taking a psychedelic or undergoing a psychedelic treatment, whether that's therapy or a different regimen on your own, et cetera, some of the most important aspects of that and results of that happen sometimes weeks or months after your actual treatment. So the aftercare is equally, if not more important than the actual psychedelic treatment. So for us, giving you the tools and giving you an intuitive platform that you're able to connect with mental health professionals around the globe that are professionals in securing and in translating whatever you underwent into real life successes is just so important and there was no solution to that. So we have over 30 specialists already, ranging in difference expertise that are actively using the application and connecting with different patients in our beta phase. And like you said, we officially launch tomorrow, which we're incredibly excited about. Now, the company has several clinical trials coming down the pipeline in the coming months. Can you tell us a little bit about those? Sure. So given our constituency from NeuroFarm, which is just incredibly impressive, ranging from Dr. Rakesh Jetley, who is the COO of NeuroFarm, who's currently the head of psychiatry for the entire Canadian Armed Forces as well as NATO, all around the globe with upper echelon individuals basically on the same level as him. We were able to obtain a number of partnerships throughout the globe that gave us a very unique set of approval. So for the first time in the world, we had an approved PTSD clinical study starting on that study. We'll be launching at Leiden University Hospital in the Netherlands in conjunction with the Royal Dutch Army for veterans with PTSD. That study will be utilizing a single synthetic molecule of psilocybin in multiple macro doses with the hopeful outcome to prove that psilocybin is actually efficacious and is a viable treatment for PTSD. And totally, we know in various studies that it is by far, to our opinion, the most successful format of treating PTSD. Well, the success rate could be in excess of over 80 percent. So secondly, we have additional test sites that will be that will be announcing here in the very near future, ranging from very prestigious Canadian universities and the hospitals, also very prestigious US universities with some of the top PIs in the world as it pertains to PTSD and specifically military EMS frontline workers in various constituencies. So something that we're very, very excited about. The second clinical that we'll be launching will be looking at the difference between our single molecule, which is very proprietary to us, naturally derived psilocybin up against a single molecule synthetic format of psilocybin and also a very unique patent that we just recently filed combining psilocybin and MDMA and any other tryptamine as well, which we think is going to be incredibly successful for the use of PTSD for various reasons. Wow, you guys are doing a lot of great work. Congratulations on all your success so far. Now, in August, Mitocin launched the world's first natural sourced CGMP psilocybin for global research, sales and distribution enterprise. What is the significance of this milestone? So like I just touched on, there's an open ended argument as to what is more effective for the treatment of various indications, whether that's a synthetic form of psilocybin, much like a compass is using, or a naturally derived psilocybin, actually extracted from the fruiting body of various psilocybin produced in mushrooms. So currently, if you look at things such as cannabis and some of the work that our science team did at EBU, which is uncover basically the other tryptamines that are found in that plant when coupled with THC and then being able to have that result in a predictive outcome by different ratios of the various other tryptamines, this is known as the entourage effect. So in the naturally derived psilocybin, there's a lot of other tryptamines that ultimately are having adverse or synergistic results on psilocybin as a formal outcome. So for us, we're diving into the plant and we think that there's a huge benefit of using a naturally derived psilocybin, whether that's a single molecule and or specific ratios, as opposed to just a synthetic lab made psilocybin. So for us, we're the first people that are going to actually be able to launch and solve that problem. But also, if there is added benefits, which we strongly think that there are, we'll be able to uncover that. Wow, that's impressive. Now Mitocin has quite a roster of experts. Who are your key members and what do they bring to the table? Sure, and absolutely. I think our team definitely sets us apart. You have our COO and our CSO, Damon Michaels and Rob Roscoe, who both, again, were management team of a company by the name of Ebu. Ebu was really the first pharmacology side of things for the cannabis. They built the first pharmacology lab ever that was dedicated to actually uncovering what's really going on in the cannabis plant. They developed an IP portfolio over 48 patents. Ultimately, that company was acquired by Canada Growth in November of 2018 for $429 million based on their inventions. Being able to take them on and bring them to our field, which is a ton of synergies between cannabis and psychedelic mushrooms as well as functional mushrooms, specifically from an IP standpoint, is obviously a huge benefit for us. Additionally, when you look at the team at NeuroFarm, the constituency at NeuroFarm really is incredible. So you look at somebody like Dr. Ray Trayuda at NYU, one of the number one forces to be reckoned with in PTSD and is responsible for some of the most monumental discoveries as it pertains to alternative medicine and applications towards PTSD. Obviously, she's a very strong believer in what we're doing here and the potential of salicybe and is incredibly excited to be on the team. I touched on Dr. Rakesh Jetley and who he is as a person and who he currently is. How he's the head of psychiatry for the entire Canadian Armed Forces and also chairs a number of research groups at NATO throughout the globe. Obviously, we're very excited about him as well. And then also to couple that with our Mindlead team. Mindlead team is young, hungry entrepreneurs that have been incredibly successful in both the software and IT world over their past endeavors. And then now have really jumped down this path to solve a huge problem that I think that they're going to be very successful in. So if you couple all of us together, we bring a multifunctional, very diverse management team that's also working towards an incredible purpose and an incredible goal that we're very passionate and excited about. Now, we've got a community of investors that are looking for undervalued, underappreciated, underexposed opportunities like Mitocene Innovations. What should investors look out for Mitocene Innovations next? So I think that there's a number of things. We have, obviously, we keep our cards very close to our chest. Anytime that you're in an IP world that we are, in a clinical world like we are, it's not something that you want to just go out and talk to everybody about. So there's a lot that goes behind the scenes that we feel has massive upside potential. The marketplaces that we're dealing with have huge goals in them, specifically PTSD. And when you're dealing with military constituencies, et cetera, they are constantly looking for more viable solutions. And then giving you easier and quicker pathways to success to be accomplished at if you have a viable solution. To us, there's not a single thing on the planet right now that is more promising towards solving that goal than salicydin as it pertains to coupling that with therapy for PTSD. We strongly and firmly believe that we will be the first and be the most successful in accomplishing that goal. Additionally, so we are other IP that's coming out and you'll see some of the partnerships that we're going to be announcing here very soon. Our very late stage in the development and something that will easily quickly catapult us to the front of the line further than we already have been able to accomplish in such a short time. So I hope that answers your question. Yeah, a lot of our investors already started getting into the stock just so you know, they're very excited about the upside of this company. What is the best way for investors to get in touch with you if they have a question or if they're interested in, you know, learning more directly from the company? Sure. So if you go to our website, which is minuson.com, that will have a full investor presentation that goes much more in detail than I was able to do in such a short time so they can really dive into some of the details, some of the additional clinical test sites. Also read the bios from our scientific advisory team, which is over 30 PhDs that we're incredibly excited about. And additionally, it will also have a contact information for them to directly connect with the company through our investor relations team that will answer any questions directly and or give them a further rundown of anything that we could potentially help them with. That's fantastic. Well, thank you for joining us today. I know you're on location today, so we're unable to actually see you face to face. Maybe in the future we can do it face to face. But we appreciate you joining us, the CEO of Mitocene Innovations, a new company that we are bringing to our community now that we think has incredible upside, taking two of the hottest sectors in the world, psychedelics and telemedicine and combining it, I think it's brilliant and I wish you all the best of luck in your future endeavors. CEO of Mitocene Innovations, Joshua Barch. Thank you guys so much, appreciate it. Thank you for joining us today. Thank you guys for watching. If you like this video, smash the like button, comment down below, share the video everywhere, and thank you for watching.


Hmm. Yeah, we on boss talk one-on-one Yeah, we gonna talk when you think about like even to Raji cuz you know the other day We were talking about you know the color purple she did the color purple But she came out on on that interview and was talking about the pay for black females and how she's been underpaid And how she felled and so forth What and you've been in the industry somewhat What do you feel about what she said? You know that was part of my saying That I tied into the Kevin the cat Williams situation, you know, I mean, I know you want to jump into that This is a thing where I when I first seen it I mean he slid across the board on everybody He didn't leave nobody out when he was talking about people that he had done evidently had some type of encounter with over the years You know, so I I feel like okay when he got it off Already know how he yields, you know, so I know that but he don't talk a lot He ain't just getting on the big platforms of doing podcast. So when they hit I Didn't expect to do what he did but that thing went crazy, man Yeah, you know listen and I'm catching flack for it like a motherfucker on my page, you know It's like I'm I'm scarface at the end of the movie. Well, I'm on the balcony with a thousand Colombians Trying to shoot at me, you know, I mean, but I stand on what I said and and you know I know I feel like honestly part of the reason Why people are upset or there's the backlash is because they see themselves in that mirror that I'm pointing in a direction Yeah, you know my original point was, you know, listen There's a reason why the saying exists within the black community crabs in a barrel You know, I mean and slavery has done such a number on us that, you know Rather than just come together the way that we should for the betterment of us This is what we do. We love drama. We love gossip.  He's a talented motherfucker. He's one of the best in the game So I can understand that subjective feeling But you said Richard Pry is the goat that he's the goat but goat talk aside. My thing was When you go protect him at all costs, let's have some perspective He didn't turn the world on his access. He's not curing cancer. He's not curing AIDS He's not solving racism. He's not solving black poverty So When you say protect him, what are you what are you protecting him about and you go? Well, he told his truth All right, but how did his truth help you? How did his truth change your life?  They're still gonna work people still gonna respect them and adore them What was the purpose of that My thing is this why not use that mouthpiece and that platform and that energy for the betterment of us So now you got beef with all these people.   How does that help us?  They all face that problem So why not go instead of beefing Kevin cat let's do a movie together Let's hire those black actresses Let us and the black community and black hollywood come together and form like votron So that we can do what white folks do without needing white folks, you know It's like, why do we have to uh wait for them to give us our flowers on their oscars or their emmy's or their golden Globes where's our own award shows We've been too separated for too long and this is what we talk about Yeah, but new cycle but because she stepped out and said what she said 50 cent reached out to her and wanted to work with her and trying to help her to get that bag A bigger bag than what she's ever gotten because he even said, you know Because I think people thought that he was joking around when he said what he said he came back and said Look at what I got for mary jay from stars because of me. I can do that for her Okay, but why are we waiting for her to come to tears? We should have been done this You know they that that studio called dream works. That's made up of uh david geffen Uh, uh eisenberg and spielberg Where is our dream works? Yeah, we got tyla perry, but that's all we got all we got We got we got billionaires. We got oprah. We got jz. We got michael jordan We got magic johnson robertsman When are we going to come together so that we can build our own empire to amass our own wealth And then take that money and funnel it back into our communities So that we could be like tosa oklahoma again before the massacre and the riots and the murders That's true. Why wait why are we focused on? A gossip high school type beef over jokes When we got black women in our industry crying about unfair treatment and pay But what are we doing? But you can't I gotta be the devil's advocate because you've had beefs or different situations with different People that you've said this or that about whether it be who have a phase on all y'all back and forth All y'all have done you and mike i seen the thing where you was just joking and y'all had a little joking back and forth, you know But all i'm saying is That's the way looking from the outside looking in it's like all of y'all look comedians and y'all have all had y'all day You know where y'all went back and forth with each other He just came out and just slid across everything that he ever thought he had a issue with. Okay, but what did the change? How did it move the needle? How did it move us forward and and and and people really paid attention to my post I said in the post. Yes. I'm guilty of doing the same thing.  Yeah at what point do we grow up? Grow up. That's real. But what you're saying that but what you're saying that I look at um a different perspective of it Um, I hear a lot of people say the reason why I do stand-up comic. Yes It's also to make people laugh, but it's also it's my cheaper way of having therapy He's of going to a therapist I come out here and tell all my business all everything that I go through and laugh about it I get it off my chest. That's what rappers do. They put in their music and just let it out So in my mind He's been holding all of this for so long. So when he came on It didn't benefit nobody but for him letting it go to the world. Maybe that helped him mentally. I don't buy that for one day We all have egos we're entertainers and entertainers have egos You have to have a little bit of an ego to make it in this business because there's a certain amount of belief You absolutely have to have within yourself because this business is designed to strip you of your Your confidence and your and felt in your worth So in order to fight that yeah, you gotta be a little arrogant, but but I believe most of that is ego driven Most of that is ego driven. You know