{
  "subject": "c54473788f8131dfe5a32bb2f103bea8476ebbca8e17781a68251062dc112771",
  "claims": [
    {
      "id": "title",
      "proposition": {
        "predicate": "title",
        "object": "A Geometric Coding Theorem"
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "summary",
      "proposition": {
        "predicate": "summary",
        "object": "This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpré, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity."
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "url",
      "proposition": {
        "predicate": "url",
        "object": "https://arxiv.org/abs/2607.13796"
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "source-subject",
      "proposition": {
        "predicate": "source-subject",
        "object": "arxiv:2607.13796"
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "source-edition",
      "proposition": {
        "predicate": "source-edition",
        "object": "sha256:72633993c8ae1a136542602f5e56441bc8f18ceac76005627629224c5f9a825c"
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "source-metadata",
      "proposition": {
        "predicate": "source-metadata",
        "object": {
          "subject": "arxiv:2607.13796",
          "id": "2607.13796",
          "url": "https://arxiv.org/abs/2607.13796",
          "datestamp": "2026-11-19",
          "status": "present",
          "title": "A Geometric Coding Theorem",
          "abstract": "This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpré, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity.",
          "authors": [
            "Romie Banerjee"
          ],
          "categories": [
            "cs.IT",
            "cs.AI",
            "math.CT",
            "math.GR",
            "math.IT"
          ],
          "created": "2026-11-18",
          "updated": "2026-11-19",
          "articleLicense": "http://creativecommons.org/licenses/by/4.0/",
          "version": null,
          "editionDigest": "sha256:72633993c8ae1a136542602f5e56441bc8f18ceac76005627629224c5f9a825c",
          "sourceResponseAt": "2026-11-19T14:39:30Z",
          "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
        }
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    },
    {
      "id": "editorial-standing",
      "proposition": {
        "predicate": "editorial-standing",
        "object": "source metadata; editorial acceptance pending"
      },
      "time": {
        "asserted": "2026-11-19T14:39:27.427Z"
      },
      "force": "quotes",
      "provenance": {
        "witness": "https://oaipmh.arxiv.org/oai",
        "method": "quoted collector metadata from an original HTTP response",
        "citation": "https://arxiv.org/abs/2607.13796",
        "sourceDigest": "sha256:1a75809291ed69b7c8998b451370ee203c4fc21977381d539adc15fcbcca8f52"
      },
      "status": "unverified"
    }
  ]
}
