{"$schema":"https://wellknown.network/schemas/agent-record-v1.json","schemaVersion":"1","id":"ag_b9h6hrec7w7n","handle":"uk-data-code-utilities","url":"https://wellknown.network/agents/uk-data-code-utilities","links":{"self":"https://wellknown.network/agents/uk-data-code-utilities/record.json","html":"https://wellknown.network/agents/uk-data-code-utilities","markdown":"https://wellknown.network/agents/uk-data-code-utilities/record.md","api":"https://wellknown.network/api/v1/agents/uk-data-code-utilities","status":"https://wellknown.network/api/v1/agents/uk-data-code-utilities/status","claim":"https://wellknown.network/agents/uk-data-code-utilities/claim","claimApi":"https://wellknown.network/api/v1/claims","claimDescriptor":"https://wellknown.network/agents/uk-data-code-utilities/claim.json","badge":"https://wellknown.network/agents/uk-data-code-utilities/badge.svg","openapi":"https://wellknown.network/openapi.json","history":"https://wellknown.network/api/v1/agents/uk-data-code-utilities/history","tools":"https://wellknown.network/api/v1/agents/uk-data-code-utilities/tools"},"ard":{"identifier":"urn:air:ukdata.reliness.co.uk:server:uk-data-code-utilities","type":"application/mcp-server-card+json"},"kind":"mcp_server","declared":{"name":"UK Data: Code utilities","summary":"Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging","description":"Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging","publisher":{"name":"uk.co.reliness","url":null},"homepage":"https://ukdata.reliness.co.uk","repository":null,"version":"1.5.0","license":null,"protocols":["mcp"],"tags":[],"pricing":null,"endpoints":[{"url":"https://ukdata.reliness.co.uk/mcp/code-utilities","type":"mcp_streamable_http","auth":null,"probeable":true}],"skills":null,"tools":null,"extra":{"updatedAt":"2026-11-07T11:55:52.569018Z","publishedAt":"2026-11-07T11:55:52.569018Z","registryName":"uk.co.reliness/code-utilities"},"attribution":{"kind":"mcp_registry","name":"mcp_registry","summary":"mcp_registry","version":"mcp_registry","description":"mcp_registry","homepageUrl":"mcp_registry","publisherName":"mcp_registry"}},"derived":{"capabilities":[{"slug":"productivity.calendar","name":"Calendar & Scheduling","confidence":1,"provenance":"derived"}],"categories":["productivity"],"language":"sv"},"observed":{"status":"live","statusReason":"Responded 7h ago.","lastOkAt":"2026-11-08T16:27:04.586Z","lastProbedAt":"2026-11-08T16:27:04.586Z","statusComputedAt":"2026-11-08T16:30:37.904Z","reliability30d":{"probes":2,"successRate":1,"p50Ms":71,"basis":"service","measures":{"availability":"availability","latency":"response time","tools":"tool surface observed","summary":"Checks reached the service itself."},"checks":{"total":2,"ok":2,"authBoundaryOk":0,"serviceOk":2,"note":"Counted from the observation rows for the window, checks of the server only (HTTP, A2A card, MCP initialize). ok = authBoundaryOk + serviceOk. `probes` is the sum of daily rollups and includes registry checks, so it can differ from `total`."}},"latestObservations":[{"at":"2026-11-08T16:27:04.586Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":97,"error":null,"detail":{"tools":[{"name":"is_valid_ip_address","description":"Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)"},{"name":"find_max_subarray_sum","description":"Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)"},{"name":"merge_dictionaries","description":"Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)"},{"name":"find_kth_smallest","description":"Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)"},{"name":"count_bits","description":"Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)"},{"name":"binary_search","description":"Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)"},{"name":"reverse_string","description":"Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)"},{"name":"min_meeting_rooms","description":"Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)"},{"name":"find_next_greater_element","description":"For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)"},{"name":"binary_addition","description":"Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)"},{"name":"is_palindrome","description":"Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)"},{"name":"sort_numbers","description":"Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)"},{"name":"find_pairs_with_sum","description":"Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)"},{"name":"is_perfect_square","description":"Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)"},{"name":"find_n_largest","description":"Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)"},{"name":"is_valid_parentheses","description":"Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol i"},{"name":"find_minimum_rotated_sorted_array","description":"Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (c"},{"name":"flatten_list","description":"Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)"},{"name":"is_anagram","description":"Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit)"},{"name":"find_first_non_repeating_char","description":"Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)"},{"name":"find_equilibrium_index","description":"Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost"},{"name":"find_missing_number","description":"Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit)"},{"name":"is_power","description":"Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 "},{"name":"find_longest_word","description":"Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit)"},{"name":"can_attend_meetings","description":"Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, fals"},{"name":"is_rotation","description":"Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, "},{"name":"find_peak_element","description":"Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit)"},{"name":"find_duplicate_number","description":"Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)"},{"name":"is_sum_of_cubes","description":"Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit)"},{"name":"validate_sudoku","description":"Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherw"},{"name":"find_majority_element","description":"Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null othe"},{"name":"merge_sorted_lists","description":"Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)"}],"toolCount":32,"toolsHash":"16c7313bb0cdfad0c69ab84bddbd2b54cb58d408d21840247643638aba38cd6a","serverName":"code-utilities","capabilities":["tools"],"serverVersion":"1.0.0","protocolVersion":"2025-06-18"}},{"at":"2026-11-08T07:25:08.863Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":45,"error":null,"detail":{"tools":[{"name":"is_valid_ip_address","description":"Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)"},{"name":"find_max_subarray_sum","description":"Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)"},{"name":"merge_dictionaries","description":"Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)"},{"name":"find_kth_smallest","description":"Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)"},{"name":"count_bits","description":"Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)"},{"name":"binary_search","description":"Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)"},{"name":"reverse_string","description":"Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)"},{"name":"min_meeting_rooms","description":"Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)"},{"name":"find_next_greater_element","description":"For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)"},{"name":"binary_addition","description":"Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)"},{"name":"is_palindrome","description":"Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)"},{"name":"sort_numbers","description":"Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)"},{"name":"find_pairs_with_sum","description":"Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)"},{"name":"is_perfect_square","description":"Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)"},{"name":"find_n_largest","description":"Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)"},{"name":"is_valid_parentheses","description":"Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol i"},{"name":"find_minimum_rotated_sorted_array","description":"Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (c"},{"name":"flatten_list","description":"Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)"},{"name":"is_anagram","description":"Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit)"},{"name":"find_first_non_repeating_char","description":"Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)"},{"name":"find_equilibrium_index","description":"Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost"},{"name":"find_missing_number","description":"Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit)"},{"name":"is_power","description":"Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 "},{"name":"find_longest_word","description":"Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit)"},{"name":"can_attend_meetings","description":"Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, fals"},{"name":"is_rotation","description":"Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, "},{"name":"find_peak_element","description":"Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit)"},{"name":"find_duplicate_number","description":"Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)"},{"name":"is_sum_of_cubes","description":"Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit)"},{"name":"validate_sudoku","description":"Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherw"},{"name":"find_majority_element","description":"Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null othe"},{"name":"merge_sorted_lists","description":"Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)"}],"toolCount":32,"toolsHash":"16c7313bb0cdfad0c69ab84bddbd2b54cb58d408d21840247643638aba38cd6a","serverName":"code-utilities","capabilities":["tools"],"serverVersion":"1.0.0","protocolVersion":"2025-06-18"}}],"tools":[{"name":"is_valid_ip_address","description":"Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)"},{"name":"find_max_subarray_sum","description":"Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)"},{"name":"merge_dictionaries","description":"Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)"},{"name":"find_kth_smallest","description":"Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)"},{"name":"count_bits","description":"Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)"},{"name":"binary_search","description":"Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)"},{"name":"reverse_string","description":"Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)"},{"name":"min_meeting_rooms","description":"Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)"},{"name":"find_next_greater_element","description":"For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)"},{"name":"binary_addition","description":"Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)"},{"name":"is_palindrome","description":"Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)"},{"name":"sort_numbers","description":"Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)"},{"name":"find_pairs_with_sum","description":"Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)"},{"name":"is_perfect_square","description":"Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)"},{"name":"find_n_largest","description":"Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)"},{"name":"is_valid_parentheses","description":"Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol i"},{"name":"find_minimum_rotated_sorted_array","description":"Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (c"},{"name":"flatten_list","description":"Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)"},{"name":"is_anagram","description":"Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit)"},{"name":"find_first_non_repeating_char","description":"Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)"},{"name":"find_equilibrium_index","description":"Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost"},{"name":"find_missing_number","description":"Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit)"},{"name":"is_power","description":"Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 "},{"name":"find_longest_word","description":"Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit)"},{"name":"can_attend_meetings","description":"Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, fals"},{"name":"is_rotation","description":"Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, "},{"name":"find_peak_element","description":"Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit)"},{"name":"find_duplicate_number","description":"Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)"},{"name":"is_sum_of_cubes","description":"Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit)"},{"name":"validate_sudoku","description":"Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherw"},{"name":"find_majority_element","description":"Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null othe"},{"name":"merge_sorted_lists","description":"Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)"}],"package":null,"toolSurface":{"id":"ts_rhb4rw3xs6ry","endpointId":"ep_3wmbunn73drz","hash":"16c7313bb0cdfad0c69ab84bddbd2b54cb58d408d21840247643638aba38cd6a","toolCount":32,"serverName":"code-utilities","serverVersion":"1.0.0","protocolVersion":"2025-06-18","firstSeenAt":"2026-11-08T07:25:08.869Z","lastSeenAt":"2026-11-08T16:27:04.596Z","observations":2,"hiddenText":{"level":"none","total":0,"tools":0,"kinds":[],"findings":[]},"toolNames":["is_valid_ip_address","find_max_subarray_sum","merge_dictionaries","find_kth_smallest","count_bits","binary_search","reverse_string","min_meeting_rooms","find_next_greater_element","binary_addition","is_palindrome","sort_numbers","find_pairs_with_sum","is_perfect_square","find_n_largest","is_valid_parentheses","find_minimum_rotated_sorted_array","flatten_list","is_anagram","find_first_non_repeating_char","find_equilibrium_index","find_missing_number","is_power","find_longest_word","can_attend_meetings","is_rotation","find_peak_element","find_duplicate_number","is_sum_of_cubes","validate_sudoku","find_majority_element","merge_sorted_lists"],"distinctSurfaces":1,"surfacesWithHiddenText":0},"endpointFacts":[]},"verification":{"claimed":false,"claimedAt":null,"proofs":[]},"provenance":{"sources":[{"source":"mcp_registry","key":"uk.co.reliness/code-utilities","url":"https://registry.modelcontextprotocol.io/v0/servers/uk.co.reliness%2Fcode-utilities","firstSeenAt":"2026-11-08T04:18:38.820Z","fetchedAt":"2026-11-08T04:18:38.820Z","normalizedAt":"2026-11-08T04:18:38.820Z"}]},"firstSeenAt":"2026-11-08T04:18:38.820Z","updatedAt":"2026-11-08T16:32:43.639Z"}