{"id":"coloring-count-check","version":"1.0.0","description":"Check a proper indexed coloring and an exact canonical-decimal claim for its number of distinct colors.","supported_operations":["check claimed coloring count","validate number of colors used","verify coloring and distinct color total","check exact graph color count claim","audit a coloring count certificate","compare claimed count with used colors"],"unsupported_operations":["computing the chromatic number","finding a smaller coloring","renaming or repairing colors"],"semantics":["The supplied assignment must first be a proper total coloring under the same indexed-graph rules as coloring-validity-check.","claimed_count uses canonical ASCII decimal grammar 0 or [1-9][0-9]*; arithmetic is exact because its bounded value is converted only after grammar checking.","Distinct colors are exact string values, counted by a prototype-safe Set; null is not a color.","Every verdict names Diestel Graph Theory 5th ed. (2017), sections 1.6 and 5.2.","Discrepancies are ordered by vertex coverage, then supplied edge index, then the count comparison."],"limits":{"max_vertices":10000,"max_edges":50000,"max_color_bytes":64},"pricing":{"status":"unpriced","charge_usd":null},"input_schema":{"type":"object","additionalProperties":false,"required":["vertex_count","edges","colors","claimed_count"],"properties":{"vertex_count":{"type":"integer","minimum":0,"maximum":10000},"edges":{"type":"array","maxItems":50000,"items":{"type":"object","additionalProperties":false,"required":["from","to"],"properties":{"from":{"type":"integer","minimum":0,"maximum":9999},"to":{"type":"integer","minimum":0,"maximum":9999}}}},"colors":{"type":"array","maxItems":10000,"items":{"type":["string","null"],"maxLength":64}},"claimed_count":{"type":"string","pattern":"^(0|[1-9][0-9]*)$","maxLength":5}}},"output_schema":{"type":"object","additionalProperties":false,"required":["valid","reference_version"],"properties":{"valid":{"type":"boolean"},"reason":{"type":"string"},"discrepancy":{"type":"object","additionalProperties":false,"required":["path","index","expected","actual"],"properties":{"path":{"type":"string"},"index":{"type":"integer","minimum":0},"expected":{"oneOf":[{"type":"string"},{"type":"integer"},{"type":"null"}]},"actual":{"oneOf":[{"type":"string"},{"type":"integer"},{"type":"null"}]}}},"reference_version":{"type":"string"}}},"examples":[{"input":{"vertex_count":4,"edges":[{"from":0,"to":1},{"from":2,"to":3}],"colors":["a","b","a","b"],"claimed_count":"2"},"output":{"valid":true,"reference_version":"Diestel Graph Theory 5th ed. (2017), sections 1.6 and 5.2"}},{"input":{"vertex_count":1,"edges":[],"colors":["a"],"claimed_count":"0"},"output":{"valid":false,"reason":"color_count_mismatch","discrepancy":{"path":"claimed_count","index":0,"expected":"1","actual":"0"},"reference_version":"Diestel Graph Theory 5th ed. (2017), sections 1.6 and 5.2"}}],"execute_url":"/v1/tools/coloring-count-check/versions/1.0.0/execute"}