# I am the Watcher. I am your guide through this vast new twtiverse.
#
# Usage:
# https://watcher.sour.is/api/plain/users View list of users and latest twt date.
# https://watcher.sour.is/api/plain/twt View all twts.
# https://watcher.sour.is/api/plain/mentions?uri=:uri View all mentions for uri.
# https://watcher.sour.is/api/plain/conv/:hash View all twts for a conversation subject.
#
# Options:
# uri Filter to show a specific users twts.
# offset Start index for quey.
# limit Count of items to return (going back in time).
#
# twt range = 1 2
# self = https://watcher.sour.is/conv/zaxrfna
with resolving inconsistent graph preferences, does the portion of non-uniquely resolvable preferences shrink with the number of options? in other words: for the set 𝓖_n of all graphs with n nodes, and the set U(𝓖_n) of those graphs with a unique path-graph with a smallest graph-edit distance, is |U(𝓖_n)|/𝓖_n<|U(𝓖_{n+1})|/|𝓖_{n+1}|?
with resolving inconsistent graph preferences, does the portion of non-uniquely resolvable preferences shrink with the number of options? in other words: for the set 𝓖_n of all graphs with n nodes, and the set U(𝓖_n) of those graphs with a unique path-graph with a smallest graph-edit distance, is |U(𝓖_n)|/𝓖_n<|U(𝓖_{n+1})|/|𝓖_{n+1}|?