ATProto Browser

Record data

{
  "uri": "at://did:plc:v2ex7xmwc44boycfxs5bicdg/app.bsky.feed.post/3lmw3ogt5ds2g",
  "cid": "bafyreie5g2vnb2odqrksrpjjq3m5ehh5dtsdwdhnlbwtesojvf5z4hbvyi",
  "value": {
    "text": "arxiv.org/abs/2407.12372 (discussion p.26)\n\nOh crap, you said \"natural\" xD",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.external",
      "external": {
        "uri": "https://arxiv.org/abs/2407.12372",
        "thumb": {
          "$type": "blob",
          "ref": {
            "$link": "bafkreieo2hivyhdzmccyiwhlogkzwkdgmcauit643ysuavjamzs5nctvgm"
          },
          "mimeType": "image/jpeg",
          "size": 182203
        },
        "title": "Geometric and computational hardness of bilevel programming",
        "description": "We first show a simple but striking result in bilevel optimization: unconstrained $C^\\infty$ smooth bilevel programming is as hard as general extended-real-valued lower semicontinuous minimization. We..."
      }
    },
    "langs": [
      "en"
    ],
    "reply": {
      "root": {
        "cid": "bafyreie6wnapdbsfwfosqetyaa3tvekp2j6dbeixhlevs22s7ewl5hddmu",
        "uri": "at://did:plc:v2ex7xmwc44boycfxs5bicdg/app.bsky.feed.post/3lmvspwhgjg2z"
      },
      "parent": {
        "cid": "bafyreid5ukidv646q4twkzl7azuvvw7jxiggc2zfrdjlvvtvgzqkrk6ege",
        "uri": "at://did:plc:ppamp6bqrppcvjukxxe3avch/app.bsky.feed.post/3lmvt4jayw227"
      }
    },
    "facets": [
      {
        "index": {
          "byteEnd": 24,
          "byteStart": 0
        },
        "features": [
          {
            "uri": "https://arxiv.org/abs/2407.12372",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2025-04-16T07:41:12.563Z"
  }
}