Everything I never told you. By Celeste Inge. Narrated by Cassandra Campbell. 1. Lydia is dead. But they don't know this yet. 1977, May 3rd, 6.30 in the morning, no one knows anything but this innocuous fact. Lydia is late for breakfast. As always, next to her cereal bowl, her mother has placed a sharpened pencil in Lydia's physics homework. Six problems flagged with small ticks. Driving to work, Lydia's father nudges the dial toward WXKP, northwest Ohio's best news source, vexed by the crackles of static. On the stairs, Lydia's brother yawns, still twined in the tail end of his dream. And in her chair in the corner of the kitchen, Lydia's sister hunches moon-eyed over her cornflakes, sucking them to pieces one by one, waiting for Lydia to appear. It's she who says, at last, Lydia's taking a long time today. Upstairs, Marilyn opens her daughter's door and sees the bed unslept in. Neat hospital corners still pleaded beneath the comforter. Pillow still fluffed and convex. Nothing seems out of place. Mustard-colored corduroy's tangled on the floor. A single rainbow-striped sock. A row of science-fair ribbons on the wall. A postcard of Einstein. Lydia's duffel bag crumpled on the floor of the closet. Lydia's green book bag slouched against her desk. Lydia's bottle of baby soft atop the dresser. A sweet, powdery, loved baby scent still in the air. But no, Lydia. Marilyn closes her eyes. Maybe when she opens them, Lydia will be there. Covers pulled over her head as usual. Wisps of hair trailing from beneath. A grumpy lump bundled under the bedspread that she'd somehow missed before. I was in the bathroom, mom. I went downstairs for some water. I was lying right here all the time. Of course, when she looks, nothing has changed. The closed curtains glow like a blank television screen. Downstairs, she stops in the doorway of the kitchen. A hand on each side of the frame. Her silence says everything. I'll check outside. She says at last. Maybe for some reason... She keeps her gaze trained on the floor as she heads for the front door, as if Lydia's footprints might be crushed into the hall runner. People complete. Ready to continue?


Welcome back to Tennis Talk. My name's Cam Williams and the WTA finals draw has just come out And we have some interesting matchups in the group stage for the WTA finals Of course, it's happening in Texas this year It was in Mexico last year and it used to be in Asia but because of restrictions It's been moved and it's gonna be a big big event over the next week Let's go have a look at the group stage and some of the matchups that we're gonna be seeing So we've got two groups of four players the top eight players of the world and Tracy Austin group We have Shveontech the world number one golf the world number four Garcia the world number six and Kazakina the world number eight So familiar names for eager Shveontech and of course we know about that Garcia matchup And then we've got the Nancy Ritchie group with Jabir the number two Pagola the number three Sakurai the number five and Sabalenka the number seven and we've seen a few of those players play over the last few months as well So that's gonna be a lot of fun to watch Let's zoom in on the Tracy Austin group to start with and look at the potential matchups Remember everyone has to play each other in the group stage and the top two players of the group with the best records go to the semi-finals So Shveontech her record against Cocoa Goff is four and zero and the last time they played was in San Diego a few weeks ago Where Shveontech got the win and ended up winning the trophy your favorable matchup there for Shveontech against Garcia She's got a 1-1 record with Garcia winning their last match Which was a clay court event in Poland just after Wimbledon and then against Kazakina Shveontech has a 4-1 record against with their last match being at the French Open in that semi-finals So two really good matches there for Shveontech and the one tough one being the one against Garcia Now if we look at Cocoa Goff's record against her group, of course, she hasn't won a match against Shveontech We just mentioned that they played a lot this year and the last time being in San Diego against Garcia She has a 2-1 record against so she's got a positive record But she did just lose to Garcia at the US Open a couple of months ago and against Kazakina She has not beaten her and the two times they played 0-2 against Kazakina The last time being in Stuttgart earlier this season so very tough group for Goff Having lost her previous matches to everyone in this group so she's going to have to turn it around Having a look at the Garcia head-to-head, of course, she's got a 1-1 record against Shveontech Winning their last match so that's very interesting to see how they pair up against Goff She has a 1 win 2 loss record But like I said, she did beat Goff at the US Open a couple months ago And she's got a 1-1 record against Kazakina With Kazakina winning their last match last year in San Jose So it's been a while since she's played Kazakina So an interesting little part there for Garcia We expect her to do well based on her form in the last six months But it's going to be a little tricky especially that Kazakina match It might be the one that decides it And then talking about Kazakina She's got a 1-4 record against Shveontech The last time they played was the French Open So not a great record there Against Goff, she's won both their matches With their last match being in Stuttgart a few months ago And as I mentioned just the two matches against Garcia Split down the middle at 1-1 They haven't played for over a year So I reckon it's going to come down to that If Shveontech wins all her matches The winner of Garcia versus Kazakina It's probably going to make up the second semifinal I think Goff's got the toughest draw for sure Let's go over and look at the Nancy Richie Group now And I think this is the one that's going to be the most random Because of the form that most of these players are in So let's start with Jabez record against the rest of the group So against Pagula she's got a 3-2 record A winning record And she won their last match was in Madrid Which was the final of Madrid Before the French Open Against Zachary she's got a 2-1 record against her And she won their last match in Rome Which was an absolute epic Coming back from I think it was 5-2 down Or something in the final set So they've played some really fun matches And then against Sabalenka She's got a losing record One win, two losses But they haven't played since Wimbledon last year So it's been a long, long time Since they've crossed paths So a good little draw there for Jabez Got some winning form over some players But I think that Sabalenka matchup Is going to be really interesting Looking at Pagula now And as I just mentioned against Jabez She's got a 2-3 losing record With their last match being that Madrid final a few months ago Against Zachary she's got a losing record as well 2-3 but she did just beat Zachary In the final of Guadalajara a couple of weeks ago So she'll be feeling good about that And she has a bad record against Sabalenka One win, three losses With their last match being in Rome Sabalenka winning it So that could be a little tricky there for Pagula And remember she's also playing doubles with Coco Goff So she might even get a little bit more tired Than the rest of them Having a look at Zachary's record She's got a losing record against Jabez One and two but of course they played that Epic in Rome A few months ago Against Pagula she's got a winning record But of course they just played two weeks ago And Pagula got the win So maybe the confidence against Pagula isn't quite there Based on the recent form So that'd be a tough matchup And then against Sabalenka She's got a losing record Two wins four losses But she did beat Sabalenka this time last year In the WTA finals But that was an epic match It was very very close So it's hard to say that Zachary could beat her again Based on the head to head But we'll see I mean Zachary did surprise us in Guadalajara And then Sabalenka the final player in this group She has a winning record against Jabez Two-one but they haven't played since Wimbledon last year She has a winning record over Pagula Three-one with her last win being in Rome against Pagula And she has a four-two record Winning record against Zachary Hasn't played her for a year And lost their last match So in terms of who's got the best record against their group Sabalenka's beaten every player multiple times in this group She has a winning record against all of them So confidence-wise Sabalenka should be feeling good Let me know down in the comments below What do you reckon is going to happen? Who do you think is going to win? Is anyone going to beat Shfiontek? I think that's the real question Does anyone pose a threat against Igor Shfiontek? Because she's beaten all these players this year Except for Garcia Except for Garcia But Garcia has gone through a lot right now She just split with her coach So is Garcia's head going to be in the game? That's the question I think it might be that Garcia-Shfiontek match That we're all looking forward to the most Let me know down in the comments below What do you reckon? Who's going to win the WTA finals this year?


All right, welcome everybody to our presentation on minimum Bible governance. We're sorry we couldn't be there in person, but we're excited to share some work we've been doing on lightweight rules for collaboration with me on the legal side at GitHub and Ashley on the OSPO side. Very excited to be here virtually as well. If you have any questions throughout the presentation, feel free to drop them in Slack and we'll try to get to them. If we don't during the talk, we'll get to them at the end. We'll set aside some time for Q&A. So just a quick description of who we are. I'm Justin Colonino. I'm a director of developer policy here at GitHub and also an open source lawyer, both I'm on the GitHub side and I also dabble from time to time over on the Microsoft side as well. And I'm Ashley Wolf. I joined GitHub a few months ago to lead our open source program office. I help staff here with their open source engagements and I also work with companies that are building out and growing their open source program offices. So we'll get started today by talking a little bit about OSPO's, not necessarily what an OSPO is, but I do want to share what the OSPO does at GitHub. At the core, our OSPO helps developers to reduce friction points. We're a resource for engineers that have questions about any of their open source engagements like contributing to open source projects if they have a question about signing CLAs, bringing third party code into the company as well as releasing new code out there to GitHub. And we help with company open source strategy and policy as well. Our OSPO really relies on our internal and external partners to be successful and set up those policies and processes around open source at GitHub. And what we found that we're really great at is creating simple processes for our engineers to help them with open source.  You want it to be something lightweight and efficient for you. And at GitHub, open source is in our DNA. We know people, we know the open source community inside and out here. And like many organizations, it's really easy for us to work with open source when we have total control of projects. But when we want to collaborate outside of this organization and outside of these partnerships, it gets challenging. Working in OSPOS at other companies, I've experienced this firsthand. Engineers come to us and ask about creating an open source project, wanting to work with others and third parties. And we start going to all those internal partners to get the conversation started, figure out what it will look like and how it's going to work. We ask questions like, do we need to go to a foundation? Do we need funding? Should it be in private repos? Do we need NDAs signed across the board? And it takes time with all the responses. And a lot of back and forth happens. And that's even before the lawyers get involved. Sorry, Justin. And all the while, the developers are halting work on this project or not even able to get started until they get an answer from us and all of the folks involved. So when I heard Justin was working on NBG, I was super excited and wanted to learn more about it. So here's what NBG is solving. Everything starts out well and good when it's just one maintainer on a project. When you have that total control and direction, things operate fairly smoothly. The problems start when the project moves from having one maintainer to expanding. We've called this the one plus N problem. Things get complicated when you move from one maintainer to one plus N maintainers of your open source projects. So for example, you might want to work with another company or organization on a project together. A bunch of questions come up around where to host it, questions about governance and decision making. Suddenly, you need to figure out how to address all of these things before you can get started. And that's where NBG comes into play. And I'll pass it over to Justin to talk about that. Thanks, Ashley. And I want to echo some of the things that Ashley said earlier around the idea of driving efficiency and processes and partnerships. In the legal department at Microsoft and at GitHub, one of the things we try to do is to cut through red tape to make the process as simple and efficient as possible. But also so that it's done in a responsible legal manner. And so NBG is an outcropping of that philosophy for solving that one plus N problem. And I'm very happy to have such a great partner and Ashley to kind of drive these solutions home. So what NBG is its essence is really just encapsulating the way that communities work in a lightweight way done well once so that lawyers don't need to be involved again. And you don't need to go around and reinvent the wheel if you want to stand up a lightweight collaboration that doesn't need, for example, a lot of funding or funding, a whole money, that kind of thing. You just want to sit down and collaborate with some third party on an open source project in a way that's safe and responsible in a way that you can co-maintain that project or an affiliated suite of projects. And so we already have that on GitHub. You may have heard of it. It's called an organization. A lot of people will stand up organizations with friends to do particular things.  And so what NBG does is it provides that organizational structure for the organization and the projects underneath. So at the top level, there's what we'll call a technical steering committee. That steering committee makes decision about the overall direction of the organization and the collaboration and touch points between the organization's projects. And that's governed in a consensus-based way, but you can fall back to a vote.  You have a bunch of folks, maybe companies, maybe independent developers, getting together, you need to think to yourself, okay, who are the right set of people so that we can have a good conversation in that steering committee? Who do we want to add to that steering committee? And how are we going to, how does that steering committee set up the power dynamics inside our organization based on its makeup and who's there? And so that's at the top level of that organization. Then underneath, you have individual projects, each with a lightweight consensus-based governance model. And frankly, consensus-based governments, it's, you know, it's how a lot of open source projects already operate. Again, we're just trying to encapsulate and capture the way that most open source projects and organizations work today so that we don't need to rewrite it every time we create a new organization or project. Next slide, please. So let's get a little bit deeper into that structure. So MBG is an agreement and it lived, the agreement lives in the organization's repository and it's signed there and, you know, the signatories are public for, you know, who is on the steering committee and who are the maintainers. And the agreement essentially covers, you know, five things. The first is a decision-making process I just described. The second is a trademark policy. So if you're getting together with a bunch of folks to build an open source project, those people should control how the trademark works. And if you have a bunch of companies or independent developers all working on a project, the hallmark of a true open source project is that the trademark is used by anybody under the same terms. And typically what those terms look like, and as we're capturing the trademark policy, is that you can't call your product, your commercial product, like what our project name is. You can't trade on the project's goodwill in your commercial project and that's capturing the trademark policy. All the participants agree to be bound by that project, that policy, so there really is a neutral trademark ownership and people can kind of trust that project moving forward and trust that people won't be trading off its goodwill. There's an antitrust policy. A lot of people think that this feels a little bit heavyweight. The antitrust policy is designed, you know, again, so that we don't need to reinvent the wheel. This is designed to work both for, the big heavyweight companies collaborating together, the same way it would if Ashley and I wanted to get together and start our own project on the side, not affiliated with any of our companies. Would Ashley and I need an antitrust policy? Maybe not, but it's there and it's a good reminder if we hit it big in our competitors that we shouldn't be collaborating on the project in violation of antitrust laws. There's a code of conduct and again, we're not trying to reinvent the wheel. We chose the code of conduct that is the most popular one on GitHub, which is the contributor covenant, and then there's project selection criteria around kind of like licensing, you know, except for various types of projects, open source, open data, you know, et cetera. And so we launched MBG about a month ago with a blog post. It's live in the repo. It's in beta. We are really excited to get more feedback on it. The feedback so far has been around, you know, what about Singleton projects? You have this two-tier structure. Is that really minimum viable governance? You know, should that be collapsed in certain scenarios? I think it's a good question. There's an issue tracking that. Come, tell me what you think. Tell us what you think and we really want to hear it. Again, the antitrust point I just addressed and, you know, why do you need a trademark policy? Again, the idea is so that others don't trade off of the goodwill of the project that the group has, you know, collaborated on and people can trust that origin of source that is the community that's been sprung up around the project. So in the links there, it's pretty easy to remember and type in if you want to visit us. Awesome. Thanks, Justin. And thank you, everyone, who's been with us throughout the talk and to the folks behind the scene that set this all up for us so we could present during OsvoCon. We'd love to hear your thoughts about MVG. So if you're still here, drop in a note in Slack. We're happy to answer any questions, take comments and feedback. And thank you all for being with us here today. That's right. And if you want to reach out, if you're watching this, you know, async and we're not in the Slack channel, you know, our contact information, our GitHub handles are at the beginning of this presentation. Feel free to reach out directly. We'd love to hear from you. Definitely. Thanks all.


Hi, thank you for coming to the talk and thanks to the organizers for organizing. I hope you can hear me. I'm going to talk about the average case complexity of counting cliques in order to run your hypergraphs. And this is joint work with Matt Brennan and Guy Bresler, who's my advisor. So first I'm going to give you the setup of the problem, then I'm going to motivate the problem, and then I'm going to explain the results and give you a brief proof sketch, but we don't have that much time, so I won't be able to give you all the details. So the setup of the problem is the following. You're given a Nerdish-Renny hypergraph, like a random hypergraph, where each s subset of the vertices is in hyperedge in this hypergraph with independent probability p. It's the simplest model for random hypergraphs, and you're asked to count the number of k cliques in this hypergraph, where k is a small constant. So think about, for example, the case of graphs, where the rank of the hypergraph is 2. Then each possible edge is in this graph with probability p, and you might want to count the number of triangles, three cliques, or you might want to count the number of four vertices with all the edges between them, four cliques, etc. So this is the basic problem that we're going to consider. So the question that we're going to ask is, how does the optimal running time for counting the number of k cliques in an Nerdish-Renny hypergraph trade off with the number of vertices, with the density of the graph, and with the rank of the hypergraph? And in particular, how does it differ in this average case versus in the worst case? So now I'm going to motivate why we would ever consider this question of k-quick counting on Nerdish-Renny hypergraphs. Well, it turns out that clique problems on Nerdish-Renny graphs have been studied for a while, and maybe the most famous or well-known example of this is the planted clique problem. In the planted clique problem, you're given some Nerdish-Renny graph and k-quick planted in it, and you're asked to find this k-quick. And it's known that this is a difficult problem in certain regimes for a wide variety of restricted models of computation, in the sense that if you want, for example, an SOS algorithm for this problem, well, it'll take super polynomial time. And it's also a question that has interesting implications from the point of view for statistical computational gaps. So if you assume that finding a planted clique is hard, then you get statistical computational gaps. Another problem that's studied on GNP is to find the largest clique in a randomly sampled Nerdish-Renny graph. And again, there are lower bounds for restricted models of computation, another problem finding critical cliques, and many others such as finding large independent sets in Nerdish-Renny graphs. So there's a wide body of work studying clique problems on Nerdish-Renny graph, but all of these papers prove only hardness under a restricted model of computation. And ideally, we would want to base the average case hardness of these problems on the Nerdish-Renny graph distribution on the worst case hardness. So we would want to say, for example, that planted clique is NP-hard. Unfortunately, we don't know how to do this. And there are, in fact, barriers against worst case to average case reductions of this kind. So instead, in this talk, in this paper, we're going to consider a different problem, a problem that's in fact in polynomial time. The counting the number of clique cliques when k is a constant is in polynomial time, because you can just do it in n to the k time by enumerating all possible tuples of k vertices. There are n choose k tuples that enter the k time and checking whether each one is a clique. So instead of proving that counting k cliques is NP-hard, because it isn't in polynomial time, instead we'll try to like pin down the exact runtime that's necessary. Based on the worst case hardness assumption that counting k cliques is hard on worst case graphs, we're going to show that it's hard on average case graphs. In fact, it's hard on Erdos-Renyi graphs, which is sort of the simplest random graph distribution. So here's the plan for the rest of the talk. In the first part of the talk, I'm just going to overview the algorithmic results. So I'm going to just mention the previously known worst case algorithms for clique cliques counting on adversarily chosen graphs. And I'm going to mention some algorithms that we have in this paper for clique cliques counting on Erdos-Renyi graphs, but I'm not going to be able to get into the details of this. Then I'm going to provide the main hardness result where we show the average case hardness of counting k cliques on Erdos-Renyi graphs based on the worst case hardness assumption. And I'm going to provide a brief proof sketch. And we're going to conclude with some open problems. There are a lot of interesting directions. So first off, algorithms for counting the order of k cliques on general graphs or hypergraphs. So in the worst case, there's for hypergraphs with rank more than or equal to three exhaustive search. So enumerating overall and choose k tuples of vertices and checking whether each tuple is a quick is the best that's known. And for graphs, when the rank is two, there's a speed up using the fast matrix multiplication trick. But these are the best algorithms that are known. So we can ask, okay, what if we take a dense hypergraph so the edge density is constant. So each edge has a constant probability of being in the in the graph is the complexity the same as the worst case and doesn't seem like we can do anything better. So in the worst case, when the edge density is like into the minus alpha for some parameter alpha, then we can achieve, we can get better algorithms we show better algorithms based on greedy random sampling and for the graph case greedy random sampling with the fast matrix multiplication speed up similar to the one in message So a couple of points. One, there are faster algorithms for counting k cliques and sparse orders when you graph, then the worst case is interesting. Two, we can ask, what can be improved. So can we actually speed up any of these algorithms anymore. Well, it turns out that under a standard complexity theory assumption called exponential time hypothesis. So the worst case runtime of quick counting on graphs and hypergraphs takes n to the omega k. So, in any case, we wouldn't be able to speed up the worst case algorithms too much. But we can ask, can the average case be improved. And the main result is then in fact, the average case runtimes really can't be improved that much. In particular, the counting k cliques in dense order spending hypergraphs is has the same exact. runtime complexity as if I were to give you a worst case graph. So it's no easier to count the number of k cliques exactly in a dense order spending hypergraph than if I were to give you an adversarily chosen graph. And also, in fact, we can show that the runtime that we have for the sparse order spending hypergraph counting is optimal in some regimes. If we assume that the worst case exhaustive search algorithm for hypergraphs is optimal. Okay, so I'm going to get more and I'm going to show you some diagrams that maybe make this a bit easier to visualize. But the takeaway is dense order for any hypergraphs, same complexity as the worst case sparse order spending hypergraphs, the faster algorithms for them for the worst case, but and we can prove that they're optimal in some regimes, assuming that the worst case algorithms are optimal. The worst case algorithms that we know. So yeah, so our main result now is that is just this we're going to assume that into the key is the optimal running time for counting k cliques in an order spending hypergraph with rank more than three and into the omega k over three is the optimal running time for graphs for worst case graphs. And we're going to show that order spending to equal counting is hard. So, in this diagram, the y axis is the log of the amount of time the algorithm for counting the number of cake weeks in a hypergraph has to take and the x axis is the size of the cake weeks that you're that you're counting it's k. And if you assume that the worst case algorithm is optimal. You get a sort of a feasible regime. You can derive this blue area in the feasible machine where you can prove that there are no algorithms that run in the in that time that count cake weeks in these sparse orders running hypergraphs and and these in fact before up to the cake week per collation threshold match. So this is the algorithm that we sort of derive in the paper for counting cake weeks for for any hypergraphs. Similarly, you've got another diagram for graphs but here, the region that's open is a little wider but we can pin down the optimal exponent to be live with between omega alpha for nine and alpha where alpha gives this sort of the sparsity of the of the graph. So, just going to put this wall of text here you have to read it. The takeaway is that our main theorem is a worst case to average case reduction, which shows that if you have an algorithm for cake week counting on orders running hypergraphs, then you can use it you can convert it with slow with not too much of a slowdown into an algorithm that counts cake weeks on any worst case hypergraph. But so the punchline is that you get some intricate sort of average case complexity on the problem of counting cake weeks and orders running hypergraphs just from a very simple worst case complexity assumption. Okay, so I'm going to give now a two slide proof sketch where I'm going to explain some of the ingredients of the proof there's not enough time unfortunately to explain the proof. But this should give you an idea. And the starting point is the following. You can express and let's just restrict ourselves to graphs for ease of notation. The cake week count in graph is a low degree polynomial in the adjacency matrix a. So you can write the number of cake weeks is P of a is just the sum over the subsets of size k over the vertices of the product of the entries of the adjacency matrix between every pair of elements in that subset. Okay, so this is a degree roughly case squared polynomial. And there's a classical trick for worst case to average case reductions for polynomials. So if you have some polynomial on a finite field, a large enough finite field, then, and want to evaluate it on the worst case input, then it's going to be able to be able to evaluate an average case input. And the proof is essentially by, you know, low degree polynomial interpolation. And this proof works if the finite field a few is large enough, which is going to be sort of a technical issue that will have to overcome in the next slide. This was recently applied fine grain complexity, which is the context of this problem. And there's a paper from a couple years ago by Goldreich and Rothblum, which applied in fact to cake leak counting and particularly this polynomial. And they run to this issue where they want this average case distribution to be over elements of the of the hypercube and not over elements of fq to the end, where the finite field is much larger than just two elements. And their solution is to replace each finite field element with sort of a gadget of unweighted. And they get a distribution of over graphs that's artificial, they get very good error tolerance, but it doesn't seem possible to arrive at Erdos-Renny hypergraphs just directly applying their method. And so this is the main, the main sort of technical contribution of our paper is to show how to apply these techniques and adapt these techniques to get this very natural distribution over hypergraphs. The main technical obstacle is to map a random element of fq to the end to the Erdos-Renny distribution and in greens of a proof include the following one, we reduce to the k part type cake leak counting problem. And the reason we do this is because then we can use the special structure of this k part type cake leak counting polynomial. There's just a color coding trick to algebraically manipulate the expression and apply some results that we provide on the convergence of bias binary expansions, modulo prime. And this is somehow like how we, how we get from random elements over fq to the end to potentially sparse Erdos-Renny hypergraphs. And we also keep the field size small using Chinese ring and ring. These are just some of the ingredients in this proof. So I'm just going to conclude by summarizing the contributions. The contribution is actually to study cake leak counting under Erdos-Renny hypergraphs. We have faster algorithms in the sparse regime, and we base the average case hardness of this problem on its worst case hardness and this differs from other hardness results for quick problems under Erdos-Renny graphs that I've mentioned like a quick finding large a quick, etc, because we're basing the average case hardness of the problem based on the worst case hardness of the column, which is something that you can't really do for those other problems. And moreover, our results are tight in the dense regime and they're tight in some parts of the sparse regime. And the open problems, some open problems are the following, closing those gaps, so finding a way to match the upper bounce and lower bounce, or maybe extending these techniques to approximate the number of cake leaks, improving that that's hard. If you want to get a good enough approximation of the number of cake leaks, and also maybe improving the error tolerance of the reduction. And for more details, I welcome you to read our paper. Thank you. Great. Thanks, very nice.


What's up guys? Joe Holland here. I am out here in Central Maine fishing for one of my absolute favorite fish to catch through the ice. I just got done catching the state's second most hated invasive, the crappie. Crappie. Calico. That's one I forgot last time. And now I'm moving on to one of my absolute favorites and one of the favorites of most of the ice fishermen in Maine now. I'm going after number one on the hit list for the state of Maine, the great Northern Pike. Pike have been in the state of Maine longer than I've been alive. They're still considered an invasive species. They're thriving in lakes that trout and salmon have really dwindled on for a long time. I just saw the biggest fish. They had fangs. They don't need to be stopped. Northern Pike gets an invasive species. It's not supposed to be here. And they're very dangerous to our ecosystem. They're terrifying. We're gonna look to try to break that. My personal best for the ice was just under 21 pounds and I've caught hundreds over the 10 pound mark over the years. It's been a few years since I put out a pike video because it's just such a it's such a weird thing here in Maine like going for these big fish people lose their minds and I've had a lot of people like come follow me to pike spots and set up right on top of me and use the same holes I used the day before and it just it gets a little nasty and kind of rub me the wrong way and we just have so many opportunities in the state to catch other fish that I decided last year just to move on and keep a good mindset and go catch other fish and take advantage of all our other opportunities. But I'm out here early on the first guy out here for pike. I'm hoping to get a big one. I am not leaving till I catch a double digit. I didn't bring a lot of food so hopefully I catch one within a couple days. Lucky for me I've been storing all this fat for years just in case I get into a situation like this and the fishing stuff and I'm not able to catch a double digit fish. My favorite part about pike fishing through the ice is you get a flag on your tip-off or trap and you have no idea if it's gonna be a 10 pounder, a 5 pounder or 25 pounder. That's the best part and you're going to that flag and it could be bigger than your leg and there's very few other opportunities we have in the state. Now that's a big part. We have musky and we have some lake trout like that but we don't have a great lake trout fishery for size. We have a we have great lake trout fisheries for numbers where you can go catch a hundred or more two to three pound fish. What pike gives us is that opportunity to catch something giant like a 20 pound fish. The second sled here go back at the floor some propane and a couple of last minute things some food and be back in hopefully get set up for dark. That floor is kind of a beast. I know I got to switch over to rubber, foam, interlocking ones eventually. It would have been perfect for this trip but I haven't done it yet so I really like my floor a lot. It's just dry and flat and nice so I brought it in. Took me two trips to get everything in. It wasn't too bad but trail riding is a little bit tough when you're bringing in a whole lot of weight. I didn't get a exact measurement on the ice. It's somewhere between five and a half and eight inches in that range there. I'm going to go ahead and set up on the ice. I don't think I'll fish from the tent itself you know like jigging in the tent but I will fish from it so the weather looks pretty mild for the next week you know 14 to 25 degrees which isn't too bad so I'm going to I'm really late today getting out here so what I'm going to try to do is hurry up and get set up as quick as I can so I have a place to sleep tonight. Looks like about six seven inches. Double check. I'm going to get a chance to clean my floor off. All right now that I'm set up let's check out camp. Here I have my cook station. I bring a little table here. These are like 40 dollars at your lows. It's like a plastic rubberized table. Metal leg seems to hold up. It's super lightweight and it fits perfectly in these pop-up tents I found you know there's plenty of room with a door and plenty of room between the wall and it's nice it's nice to have something you know this high to cook on so there's my cook stove. That's a new Coleman I'm trying out. I burnt a little bit of food last time. It's really hard. I think these things are made to do some deep frying or something with some serious heat because it's hard to control the temperature and keep it low enough I think. So I'll give you a good honest report on that after I use it a couple trips. Underneath I have like food and kitchen stuff and probably some fishing stuff in there. A couple things of water. I got my light over here. If you notice this year I don't have a bunch of lights hanging from the ceiling because I've pretty much replaced everything with this Milwaukee light this tower here and that thing's set on its lowest setting now. It'll go three settings. On a five amp hour battery I think it runs just over 10 hours on the lowest setting from what we used it for in deer camp. All right bag of clothes right there. Got my bed set up here with a cot and a cot pad. Got my trusty aluminum chair right here. Fish and stuff there. Got the live scope and garment unit there. A bag full of batteries there for the auger for the Milwaukee stuff and that's about it for camp. Got the floor underneath me so I'm super sturdy. Gonna be really dry. Gonna be really nice and then out here I have my bait which I have some amazing shiners in there for pike. I brought the Markham to use. Try out the camera a little bit see if we can get the pike biting on camera. A lowering pack basket these things are indestructible. Got my pike traps in there and some jig rods and then out here I brought the 40 volt 10 inch auger. I also still have the pistol bit light flight there and I throw my propane canister outside just in case any leaks or to have some more room outside too. Snowmobile set up and we are ready to go for for that early bite first thing in the morning. I probably won't get a lot of sleep tonight and it won't be because of a 40 to 60 mile an hour wind like last time. It's gonna be because I'm excited to get that first line and first flag in the water and see if I can get a double digit here. Well they are pretty quick all set up guys. That didn't take long. If you guys are planning on doing some winter ice camping yourselves one thing I would recommend is not waiting till late in the day like I did you know that's one thing I try to avoid just kind of happen that way today just in case you have any trouble with your your snowmobile your four-wheeler or whatever you're using for transportation or if something goes wrong or you realize you forgot something it leaves you a lot of time with the light of day so if you're new at it for sure make sure you get an early break on it in the morning get all your packing down the day before or the night before. If you've done it a bunch obviously you know what you need to do and you could be pretty quick at it but you still want to leave yourself some room just for air especially this time of year when the weather's rough or it's cold but I got him here pretty quick and set up super quick tonight. I just broke down from a trip two days ago where I was up north catching crappie there's a tag right here if you haven't seen that one that was a three-day trip with some really rough weather so everything's ready to go it's everything's actually still frozen and wet it's pretty mild I'd say so setting up was a breeze there's no breeze or wind which is crazy nice I like that a lot pretty awesome day just being able to get all the way in here and everything ran flawlessly snowmobile no problems sleds behind me no problems got everything in here didn't break anything it's really going pretty good weather's good like crazy mild right now I don't even know what to do it's 19 degrees Fahrenheit and blowing five to ten so nothing crazy there I don't know what to do it's not blowing 40 or 50 miles an hour and below zero kind of feels weird I'm like wonder if this is some kind of calm before the storm but it looks good for the week coming up looks good there crazy excited to get out fishing tomorrow the pike man they just kind of get my blood boil especially in the winter it's really really a fun fish to catch they're smart they're uh you know they you can catch smaller ones pretty easy and you could run into a big one too but to target just big ones and actually catch them is is a challenge and it's uh man it's nothing like it when you get a flag and you're going up to it and could be bigger in your leg you know and big old teeth and just an awesome predator fish and you know there's a lot of a lot of people that that really enjoy catching big fish and you can't do it here for for much you know some guys will run into a big tog once in their life maybe or decent salmon or decent brown but to get something up over 20 pounds is your best bet's a pike or a musky I'm stoked for tomorrow I got all the gear pretty well ready I got the coffee pot is ready to go I just got to turn a button and turn it on and breakfast is ready to go I got the potatoes already in the pan and got the bread old buttered up ready to go on the griddle it's I'm just excited I I'm ready to go in the morning I'll probably be upright and early coyotes were howling a little bit earlier the ice is making some cracks making some noise that's always a good sound I want to take this opportunity to really thank you guys for supporting the channel the channel has been growing really well I put a ton of hard work into it this it's it's basically a small channel and you know pretty much small budget channel I run it off go pros I don't have a guy videoing or two guys videoing and another guy editing and working on all the footage and you know working everything out behind the scenes like your other big fishing channels have to me it's the go pros and it's out here just working as hard as I can to not only get you guys a good footage but also to get it uploaded and edit it and it's just so much fun for me to do and I can't thank you guys enough for the support you know there's nothing better for me than opening up my youtube studio and getting a bunch of really positive comments and and and learning that I inspired people to either go ice camping or go ice fishing or just getting outside or or do stuff like that there's three things that are really important to my channel and and every time I shoot a video if I hit these three things then I consider the video a success the first is to be able to inspire someone you know whether it be to just get out and try ice fishing or try winter camping or or just try going to catch a crappy or or using electronics or anything pretty much that you see me doing the second is to educate and pass on the wealth of information that people have taught me and educated me for fishing and going outdoors and and just being able to get yourself out of bad situations and even getting yourself into bad situations but uh education is a really important part to the channel and then the third and the least most important is the entertainment value you know it's it's got to be entertaining too and in my opinion so some videos you get one some you get two and to me a successful video would have three and you know those are the things that I shoot for when I'm making the videos and I really enjoy bringing you guys along and and I really enjoy the community that that's growing around this channel so I just want to say thank you guys to that heartfelt thank you right there and and I look forward to making a ton of videos this winter and hopefully you guys keep enjoying them as much as I enjoy making them guys this is not a rerun but for dinner tonight guess what we're having I'm going to have a pack of dea burger got some pablo auto peppers going in the pan and I just so happened to have a can of some classic beef gravy made by Food Club in 2001 that's been on the shelf for a while I bet you she's still good it won't go bad but I'm gonna throw that all in the pot and let it simmer for a little while and boy that's good gravy good grub well dinner's looking good it's almost done if I hadn't spent all my money on fish and stuff I would have had enough to get put some potatoes and onions in there that's amazing once his head starts you could drop him right on the ice go ahead yeah that feels better that might be a jumbo that might be a jumbo that's a good one oh yeah that's a mega jumbo look at that one guys what's up what's going on you brought the bolster demon I forgot brother was your gas don't worry about it I got you a breakfast I come back tomorrow anyways I'll bring you bread sweet I got some huge yeah yeah we just wailed like three or four crappy that's something big came up just nailed it so I've been fighting it for a couple minutes all right now bring him up yes sir new pb yes sir nice 15 easy I'm on like seriously 20th run right now there he comes again there he is grab it grab it get him get him get him get him yeah 30 40 it's 40 inches 20 inches around I'm almost out of breath I'm so excited look at this oh my god that big gator they're terrifying they're terrifying


It's still plus politics. Now the presidential ticket for the African Democratic Congress ADC party for the 2023 general elections was picked by Dumebi Kachiku. Kachiku emerged the overall winner with 978 votes ahead of the former deputy governor of the central bank of Nigeria, who polled 589 votes and Chukuka Moye scored 339 votes. Kachiku promised a purposeful leadership to rescue the country from the current challenges facing it. The ADC candidate will be contesting the 2023 presidential elections alongside former vice-president Atikwa Buboka of the PDP, Bola Med Tinibu of the All Progressive Congress APC, and former Anambara State Governor Pete Albi of the Labour Party. Joining us to discuss this and more is Kunlilawal, he's the executive director of the Electoral College of Nigeria, and Ufomai Gwamuna, he's the head of news in Nigeria Info FM 99.3. It's good to have you gentlemen join us in the studio. Hi, hi, I'm Marianne. I'm not sure why you decided to bring myself and Kunlil. But anyway, it's good to be here. Kunlil, it's good to have you join us. It's a pleasure always Marianne, and of course, it's a pleasure to be with you, Ufomai. I know this. Let me start with you. Because one would have thought that with the kind of clout, let me use that word loosely here, that a Kingsley Mogalu who has this, this is not his first rodeo at this presidential ticket thing, and a Chukuka Moye who also seemed to have garnered some favour from Nigerians, seemed to have pulled lesser votes as against the, maybe who people barely really know. We don't even know if he really campaigned. He had that much media exposure. And so he leaves a lot of people wondering what exactly transpired at the ADC presidential primaries. Okay, so which information may have available to me? I'll try to make a little bit if you can square. So the ADC, of course, adopted an intelligent resource that every primary is being held. Everyone was going to pull resources together. And those resources were formally jacked forth, which delegates would be transported. They agreed to this at national level. And the truth is, this actions even come up from the Lagos gobernatorial primaries, which had the same problem. So they pulled this resources together. But of course, on the day of the primaries, a few bend downs happened. I would like to say Lagos gobernatorial primaries, too, was played like that. There was access to which I overheard with some people that and aspirants, the one that won on both sides, were actually combusting raising funds for delegates. I think in the Lagos issue, there were even people that would meet members and delegates on the same day. I'm not sure whether that happened in the presidential primaries, but it seems to become a set of things. ADC simply forgot to go to the political party and freedom of association. The first person to bring them to limelight, of course, was King Seymour Calouen, who was running for president. And then with money coming also to put the money coming into the game team. A few other aspirants were going to delay ADC. The game now is now choked up. And somewhere down the line, there might be a press from nowhere. Less than it gets, it clenches the form. Who's the average move? So we can effectively say primaries in a few parties have been the same. Okay, their name is ADC, but I think in their primaries, they practiced an ADG, any Lagos. Thank you. Wow. I mean, because there are rumors when these kinds of events take place, you hear that these things are dollarised. And for a small party, using the word small loosely here, like the ADC, one would think that there would be pure internal party democracy, being that parties like this are striving not to be like the two major political parties. But from what Kunle saying, that might not necessarily be the case. Why do you think that is? It just shows you how much the country has deteriorated, not just in the last seven years, but you could argue since independence. That's why stomach infrastructure would always work in most parts. That's why most politicians believe that all they need to do is wait for you on election day at different polling units and buy your votes with the 1,000-hour, 2,000-hour or 3,000-hour allegedly that they usually sell. But at the end of the day, it also tells you that the move by the National Assembly, if you remember, just a few months ago when they were working on the electoral act 2022, they actually wanted it to be indirect primaries. That's what they initially put out. But of course, you would argue that constitutionally that doesn't necessarily work because it doesn't give everybody room or people freedom of choice. And so that's why the president decided not to agree and asked them to go back and add other forms. But coming back to the ADC issue, yes, there are allegations. We possibly do not have facts to back it up right now. But they say from every aorta of rumors, there's some possibly atom of truth. And of course, when these things, it's sad that reportedly these delegates were bought with as low as $100. When the major parties were allegedly sharing 10, 15, 20, even here as much as $50,000 allegedly, the ADC reportedly, some of these delegates got just $100. Let's give or take about $50,000 or $60,000 there about and voted the eventual winner. Again, all of these are allegations. We do not have facts to back it up. But it just sums up where the country is headed, such that these persons, because of course, you remember, it's not the general election. This is just primary. It's just a small circle. So all of your popularity really doesn't come into play. Because, again, if I go back to the major political parties, that you could argue that there are a number of politicians in the major political parties who possibly would have gotten the nod of their parties. But did they have enough war chests? Well, the answer is staring at you. Cool. I'm back to you because one of the things that the Electoral College that I understand the Electoral College is trying to do is to move away from the norm and educate people, not just political parties now, but people, the average voter, about how we can have free and fair elections. But how do we even start to talk about these things if the political parties themselves do not necessarily believe in this free, fair process? Now, let's take, for example, like the normal man would say that, oh, we have not credible people in these parties.  But then the people who are members of these political parties are Nigerians. They're not from Mars. So obviously, and these people who call themselves delegates who allegedly take these monies are also Nigerians. Does that not also reflect that we, the people, have come to be okay with that modus operandi? Or am I wrong? So the Electoral College, of course, has worked closely with you, that I'm not saying, but I would work closely with every other political party and to have been part of primaries and see the kind of things we've got to see. You know, the ADC, we even thought had a different ideology, they called them third force, which of course they thought or assumed that they were a little different. But you know, to hear allegations of people receiving five dollars and when they voted and then receive like five dollars is quite depressing. The Electoral College has worked with the ADC, tried to train if you even try to send some of our graduated associates to the ADC for grooming within the party. And I, you know, from what I've seen, I think we rather just keep our students who are associates at home. But anyway, going on to, you know, the issues within all other political parties and the ADC inclusive, you know, why the ADC comes as a surprise is because you find out that the basis of which we now understand clearly, because this is the first election year the Electoral College is going to, we have now found out that the pay off corruption is actually being spiced, eaten and cooked by the middle class. So of course, if the middle class is in direction and say they are not, because the price tag has not been put on their head as we've seen on case of ADC. I remember when things in Mogalo and Chukwema Calais Moe joined, it was such a big thing. They were so happy they were attracting clouds. And the moment the former PDP guy bust in the game, it became, you know, game as usual. So I find it a little sad that the ADC didn't take or its neck or its members do not take value above status quo of things. I think as I've won the primaries and have been part of conduct sitting about four or five, and I'll tell you that if you were at that level as a party, what you should have done is direct primaries and not an indirect primaries and thereby find delegates. Now this is what the Electoral College finds most complacent in what Congress is which are held in oil state and legal state by the ADC. You didn't have an attendance of 100. Then how the hell in the primaries of Gobernatorial you have over 500 and what they call it in the presidential primaries do you have close to a thousand? It's highly depressing. Well format because we don't have time. I'm going to toss this question to you. The sinned to be so much hope to borrow his word ginger, you know, that we were having newcomers especially for the ADC. They had at some point a lot of presidential aspirants and one would have thought that it would have been, you know, a very good way to see democracy work inside that party, but that's not the case right now. Do you see a lot of criss-crossing from the ADC? Do you see people moving away because of what has happened and the outcome of the elections and looking at maybe does he stand a chance? To be very honest with you, I try not to reduce people's chances. I can tell them privately, excuse me, but I try not to do that maybe publicly because of course I'm supposed to be unbiased and all of that as a journalist. But I remember telling one of the presidential aspirants in 2018, talking about so where he came to our office by the way in Port Hacott and you know, I told one of his aides, please stop kidding around. You're not going to win this thing. Let's not even joke. But one word here that I've also realized that you don't want to reduce, you know, the efforts other people are putting into the picture. Are they going to go away? Well, I think I saw what was his name, Mone, earlier today put out a tweet just two words, Peter would be, those two words, make of that what you wish for the ADs, for the kings of the morgue, I think I saw his comments, you know, suggesting that for now he doesn't know where, what he's going to do. He's going to take his time, you know, before reacting to this loss. But I think we have a third force. I think we have an option that people are already looking at. People, I've seen a lot of people say, oh, it's just online, it's just on Twitter. But trust me, there is a third force. And if you do not take a certain, Peter would be in the Labour Party seriously, well, maybe you might just about be taken in seriously because even the two major political parties, the PDP and the APC are looking at it and wondering, wow, what is going on? And I was hoping that there would be another, I mean, because there's so many third forces and we're seeing a Kwan Kwan so on the other end. Yes, of course. Kwan Kwan Kwan is another, another powerful force. Maybe it might not do so much in the southern part of the country, but Kanu, Jigawa and a couple of the states in the north, well, he's definitely going to pull some weight. Well, we'll keep our fingers crossed and keep watching these stories as they develop. Kune Laul is the Executive Director of the Electoral College of Nigeria. And Ufua Ma'amuna is the Head of News, Nigeria Info FM 99.3 here in Lagos. Thank you so much, gentlemen. Thank you for having me. Being part of the conversation. All right. Well, thank you all for staying with us. That's the show tonight. We will round off the show this today with our weekly highlights. So we give you an idea of what we've been discussing all through the week. Post-Politics Returns on Monday. I am Mary Annacone. Have a great weekend. Y'all better have a great weekend. There is no way, based on the capacity he's been building for him to get to lose this, because pretty much everybody there, one way or the other, has benefited from his generosity, or from his politics, or from his guidance, however you want to look at it. And there is no way. I wasn't even surprised. For me, at the end of the day, you could say if you were looking at social media a few days back, you might think others had a chance, but if you understood politics, there is no way. I would say that, frankly, I would rather not have been able to continue with us from the context that I love the vice president. Why? My reasons are profound. If you were not able to see what he himself is practically too old, wavy, and hard, but there is no more responsibility of shifting, resetting, and re-walking Manjia. And that is why it becomes very difficult for the supporters of the vice president to make him step down. The truth is that from the start, the candidacy of the vice president is more attractive to people across the nation. But beyond the fact that until I did this, we need to go figure out if you mind. In spite of the sentiments about the situation between the North and the South and what have you, we must remember that at the end of the day, the people that are involved in all of these calculations and strategizing and all of that are politicians. And to them, the overriding interest is their own interest. So, you know, as the measures of al-Adhyatika and Subakar was more about which of the candidates, those politicians, felt to the greatest chance of defeating an incompetent government, regardless of whichever candidate that has incompetent government or incompetent party, eventually presents, you know. So, in the eyes of the delegates and what have you, they felt whether, regardless of the zoning arrangements, articles to the biggest chance. That's not to say, you know, that's without prejudice the very short shift that we saw with how money became, also became a major factor. Facing out the politicians is not the best. The old politicians are similar in nature. You see, this time around, people have to look at the track record of all the politicians that are aspiring to go into positions, especially the executive arm of government, because that is probably the most important arm of government out of the three. Because if you get that right, other two are certainly going to be new ones. So, I think that's what we can do. We don't miss not the time really for us to go and start any experiment. Some of the young men and women that we have seen taking power, especially at state level, some of them were hugely disappointed at people.