{"inputSchema":{"type":"object","additionalProperties":false,"required":["artifact"],"properties":{"artifact":{"$schema":"https://json-schema.org/draft/2020-12/schema","type":"object","properties":{"buchiInclusion":{"type":"object","properties":{"data":{"type":"object","properties":{"alphabet":{"type":"integer","minimum":1,"maximum":4},"left":{"$ref":"#/properties/artifact/%24defs/shared0"},"right":{"$ref":"#/properties/artifact/%24defs/shared0"}},"required":["alphabet","left","right"],"additionalProperties":false},"claim":{"$ref":"#/properties/artifact/%24defs/json"}},"required":["data","claim"],"additionalProperties":false}},"required":["buchiInclusion"],"additionalProperties":false,"$defs":{"json":{"anyOf":[{"type":"null"},{"type":"boolean"},{"type":"number"},{"type":"string","maxLength":16000},{"type":"array","items":{"$ref":"#/properties/artifact/%24defs/json"},"maxItems":16000},{"type":"object","additionalProperties":{"$ref":"#/properties/artifact/%24defs/json"},"maxProperties":16000}]},"shared0":{"type":"object","properties":{"states":{"type":"integer","minimum":1,"maximum":4},"initial":{"type":"integer","minimum":0,"maximum":3},"finals":{"$ref":"#/properties/artifact/%24defs/shared2"},"transitions":{"$ref":"#/properties/artifact/%24defs/shared1"}},"required":["states","initial","finals","transitions"],"additionalProperties":false},"shared1":{"type":"array","items":{"$ref":"#/properties/artifact/%24defs/shared3"},"maxItems":64,"minItems":0},"shared2":{"type":"array","items":{"type":"integer","minimum":0,"maximum":3},"maxItems":4,"minItems":0},"shared3":{"type":"array","prefixItems":[{"type":"integer","minimum":0,"maximum":3},{"type":"integer","minimum":0,"maximum":3},{"type":"integer","minimum":0,"maximum":3}],"items":{"type":"integer"},"minItems":3,"maxItems":3}}}}},"method":"POST","url":"https://detect.halowerk.com/v1/F-TD2000-DATASTRUCTURES-11/nondeterministic-buchi-infinite-word-language-inclusion-ramsey-witness"}