{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihfdwv4ablvwewemgmpnzo5fknbakmft4h2zndfdsc5c5bsio4cmi",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mgqzppoe5742"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.09379v1",
  "publishedAt": "2026-03-11T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Kirill Krinkin"
  ],
  "textContent": "**Authors:** Kirill Krinkin\n\nThe observation that optimum circuit size changes by at most $O(n)$ under a one-point truth table perturbation is implicit in prior work on the Minimum Circuit Size Problem. This note states the bound explicitly for arbitrary fixed finite complete bases with unit-cost gates, extends it to general Hamming distance via a telescoping argument, and verifies it exhaustively at $n = 4$ in the AIG basis using SAT-derived exact circuit sizes for 220 of 222 NPN equivalence classes. Among 987 mutation edges, the maximum observed difference is $4 = n$, confirming the bound is tight at $n = 4$ for AIG.",
  "title": "A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation"
}