Event JSON
{
"id": "efe45d2e102b53a3d5946efaa84255aa66434ad32e7db0d7a722e5c5b455ed1b",
"pubkey": "0efb7bc903f4c6716cd4d07830d344d7abe5b607a156de3cde1ac1a5bf22ae1c",
"created_at": 1723224440,
"kind": 1,
"tags": [
[
"p",
"70c2013699fe30212ff158a0a2dbab7a09ecbe5039f0c85f0c90d72554f1fea6",
"wss://relay.mostr.pub"
],
[
"p",
"d347dc8e033a7660c4f0cfb0115c7cbc824ea00cccacbc9ffd74c01be175f5b3",
"wss://relay.mostr.pub"
],
[
"t",
"functionalprogramming"
],
[
"t",
"haskell"
],
[
"proxy",
"https://mathstodon.xyz/users/Jose_A_Alonso/statuses/112933236953686021",
"activitypub"
]
],
"content": "Competitive programming in Haskell: Tree path decomposition, part II. ~ Brent Yorgey (nostr:npub1wrpqzd5elcczztl3tzs29kat0gy7e0js88cvshcvjrtj2483l6nqa597pa). https://byorgey.github.io/blog/posts/2024/08/08/TreeDecomposition.html #Haskell #FunctionalProgramming",
"sig": "359cad17a26c82e377824b26623dfbede76869421a238b9c33286109391bdc42add5530be113cce0d160241e8da73362c67f19c86eaf62110702868d4db4aaee"
}