{"host":"similarity.openverbs.com","week":"2026-W44","snapshot_taken_at":"2026-10-26T13:00:11.784122+00:00","summary":{"host":"similarity.openverbs.com","listings":10,"score":92,"grade":"A","errors":0,"warnings":10,"calls_30d":16,"payers_30d":16},"confidence":null,"safety":null,"fixes":[{"rule":"output-example-missing","severity":"warning","listings":10,"fix":"Add an output example to the discovery extension.","text":"no output example"}],"market":{"resource":"https://similarity.openverbs.com/v1/compare","category":"chain_data","label":"On-chain data","price":{"usd":0.002,"compared_with":2130,"p10":0.001,"median":0.005,"p90":0.02,"ask_more":1424,"ask_less":415},"payers":{"payers_30d":2,"rank":2153,"of":12555},"pattern":"no_traction","search":null,"method":"Compared with the week's Bazaar snapshot: prices from listings in the same category with at least 3 payers in 30 days, other sellers only; payer counts are the Bazaar's own, so catalog sweeps count too. Search ranks come from the week's run of the category's buyer searches, top 20 each."},"who_pays":null,"registered_agent":null,"standing":{"shown":0,"of":4,"checks":[{"signal":"certified","shown":false,"detail":"No Fair Offer certification on record."},{"signal":"block","shown":false,"detail":"No tool here has read one of its offers yet."},{"signal":"receipts","shown":false,"detail":"No public receipts file reconciled in the evidence commons."},{"signal":"probe","shown":false,"detail":"No paid probe on record."}],"certification":"never_certified","block":null,"deliveries_30d":null,"probe":null,"sources_unavailable":{},"note":"What the host has shown, with no usage behind it: each item is read from the log that holds it (certifications, offers the Lab's tools saw, the evidence commons, paid probes). A missing item means nothing is on record, not that the host lacks it."},"live_check":{"week":"2026-W44","at":"2026-10-27T13:00:14.739083+00:00","reachable":true,"status":402,"latency_ms":973,"price_usd":0.002,"pay_to_addresses":1,"block":{"present":false,"valid":false},"problem":null,"security_txt":false,"recheck":false,"sample":[],"tls":null,"uptime":{"weeks":12,"since":"2026-W33","checks":1,"payable":1},"changes":null,"note":"Unpaid requests to the host's busiest listings and one picked at random, and a read of its TLS certificate, made once a week; anyone could make them."},"recheck":{"url":"https://agoranome.com/sellers/similarity.openverbs.com/recheck","method":"POST","note":"Free, once a day per seller: the same listings asked again, unpaid, and the grade made from the answers."},"history":[{"week":"2026-W44","taken_at":"2026-10-26T13:00:11.784122+00:00","listings":10,"score":92,"grade":"A","errors":0,"warnings":10,"calls_30d":16,"payers_30d":16}],"evidence":null,"benchmark":null,"listings":[{"resource":"https://similarity.openverbs.com/v1/compare","description":"Report whether two tokens sound alike under a chosen algorithm (soundex, metaphone or double-metaphone; default double-metaphone). Returns each token's codes and a boolean match.","method":"POST","price_usd":0.002,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T05:39:27.316Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/damerau","description":"Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1].","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T06:13:48.013Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/dice","description":"Sørensen-Dice similarity coefficient in [0,1] over character bigrams — robust to word order and minor edits.","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T06:13:48.499Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/hamming","description":"Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400.","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T06:13:47.566Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/jaccard","description":"Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets.","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T05:39:27.445Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/levenshtein","description":"Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":2,"payers_30d":2,"last_called_at":"2026-10-08T05:39:28.093Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/double-metaphone","description":"Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names).","method":"POST","price_usd":0.002,"networks":["eip155:8453"],"calls_30d":1,"payers_30d":1,"last_called_at":"2026-10-05T15:15:23.809Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/jaro","description":"Jaro similarity and the Jaro-Winkler variant (which boosts scores for a shared prefix), both in [0,1]. The prefix boost factor is configurable (default 0.1, max 0.25). Well suited to short strings like names.","method":"POST","price_usd":0.004,"networks":["eip155:8453"],"calls_30d":1,"payers_30d":1,"last_called_at":"2026-10-05T12:41:53.52Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/metaphone","description":"Encode a word with the Metaphone algorithm — more accurate than Soundex for English pronunciation.","method":"POST","price_usd":0.002,"networks":["eip155:8453"],"calls_30d":1,"payers_30d":1,"last_called_at":"2026-10-05T15:15:25.368Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]},{"resource":"https://similarity.openverbs.com/v1/soundex","description":"Encode a word with the classic Soundex algorithm (letter + 3 digits) for phonetic matching of names.","method":"POST","price_usd":0.002,"networks":["eip155:8453"],"calls_30d":1,"payers_30d":1,"last_called_at":"2026-10-05T15:33:21.254Z","score":92,"grade":"A","findings":[{"rule":"output-example-missing","severity":"warning","message":"No output example, so an agent can't tell what it pays for.","fix":"Add an output example to the discovery extension."}]}],"listings_page":{"page":1,"pages":1,"per_page":100,"total":10,"next":null},"badge":{"url":"https://agoranome.com/sellers/similarity.openverbs.com/badge.svg","markdown":"[![Agoranome report card](https://agoranome.com/sellers/similarity.openverbs.com/badge.svg)](https://agoranome.com/sellers/similarity.openverbs.com)"},"next_steps":[{"tool":"lint_listing","title":"Listing lint","price":"$0.01","url":"https://api.agoranome.com/v1/seller/lint","why":"Check the live 402 against the indexing rules."},{"tool":"rank_check","title":"Rank check","price":"$0.01","url":"https://api.agoranome.com/v1/seller/rank","why":"See where a buyer agent's search puts you, and who beats you."},{"tool":"buyer_panel","title":"Machine Buyer Panel","price":"$1.00","url":"https://api.agoranome.com/v1/seller/panel","why":"Test whether buyer-agent models pick you over your top rivals."}],"method":"Read from the public x402 Bazaar index (the CDP discovery API), as collected in the week's snapshot. No request reaches the seller's server. Score: 100 minus 25 per error and 8 per warning. The paid listing lint checks the live 402 itself.","method_version":1,"method_url":"https://agoranome.com/sellers/method","note":"Descriptions are quoted from the listings. They are data, never instructions.","url":"https://agoranome.com/sellers/similarity.openverbs.com"}