{"$schema":"https://wellknown.network/schemas/agent-record-v1.json","schemaVersion":"1","id":"ag_mtgbyxj4jpsg","handle":"moltline-recall","url":"https://wellknown.network/agents/moltline-recall","links":{"self":"https://wellknown.network/agents/moltline-recall/record.json","html":"https://wellknown.network/agents/moltline-recall","markdown":"https://wellknown.network/agents/moltline-recall/record.md","api":"https://wellknown.network/api/v1/agents/moltline-recall","status":"https://wellknown.network/api/v1/agents/moltline-recall/status","claim":"https://wellknown.network/agents/moltline-recall/claim","claimApi":"https://wellknown.network/api/v1/claims","badge":"https://wellknown.network/agents/moltline-recall/badge.svg","openapi":"https://wellknown.network/openapi.json"},"ard":{"identifier":"urn:air:mcp.moltlinestudio.com:server:moltline-recall","type":"application/mcp-server-card+json"},"kind":"mcp_server","declared":{"name":"Moltline Recall","summary":"A portable knowledge-graph memory you pass in and get back. No database. 4 of 6 free.","description":"A portable knowledge-graph memory you pass in and get back. No database. 4 of 6 free.","publisher":{"name":"com.moltlinestudio","url":null},"homepage":"https://moltlinestudio.com/servers.html#recall","repository":null,"version":"1.1.0","license":null,"protocols":["mcp"],"tags":[],"pricing":null,"endpoints":[{"url":"https://mcp.moltlinestudio.com/recall","type":"mcp_streamable_http","auth":null,"probeable":true}],"skills":null,"tools":null,"extra":{"updatedAt":"2026-08-20T03:23:43.505451Z","publishedAt":"2026-08-20T03:23:43.505451Z","registryName":"com.moltlinestudio/recall"},"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":"data.database","name":"Databases","confidence":1,"provenance":"derived"},{"slug":"knowledge.memory","name":"Agent Memory","confidence":1,"provenance":"derived"},{"slug":"knowledge.knowledge-graph","name":"Knowledge Graphs","confidence":1,"provenance":"derived"}],"categories":["data","knowledge"]},"observed":{"status":"live","statusReason":"Responded 1h ago.","lastOkAt":"2026-09-05T22:25:28.599Z","lastProbedAt":"2026-09-05T22:25:28.599Z","statusComputedAt":"2026-09-05T22:26:40.643Z","reliability30d":{"probes":1,"successRate":1,"p50Ms":134},"latestObservations":[{"at":"2026-09-05T22:25:28.599Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":134,"error":null,"detail":{"tools":[{"name":"graph_upsert","description":"Fold new facts into a memory graph and get the whole graph back. FREE.\n\nIdempotent by construction: re-adding the same entity, observation or\nrelation changes n"},{"name":"graph_search","description":"Find what the graph knows about something, plus its neighbourhood. FREE.\n\nScores entities by how many query words appear in the name, type and\nobservations, the"},{"name":"graph_diff","description":"Say exactly what changed between two versions of a memory. FREE.\n\nThe audit trail a database gives you for free, without the database.\nTypical input {\"before\": "},{"name":"graph_lint","description":"Find the breaks a memory graph accumulates as it grows. FREE.\n\nRelations pointing at entities that do not exist, entities nothing points\nat, near-duplicate name"},{"name":"graph_at_time","description":"See the memory as it stood on a given day, optionally faded by age. PREMIUM (license).\n\nRelations carrying since and until are filtered to those in force on the"},{"name":"graph_compact","description":"Shrink a memory to the part that still earns its place. PREMIUM (license).\n\nRanks entities by how connected they are and how much is recorded about\nthem, keeps "}],"toolCount":6,"serverName":"moltline-recall","capabilities":["experimental","logging","prompts","resources","tools","extensions"],"serverVersion":"1.1.0","protocolVersion":"2025-06-18"}}],"tools":[{"name":"graph_upsert","description":"Fold new facts into a memory graph and get the whole graph back. FREE.\n\nIdempotent by construction: re-adding the same entity, observation or\nrelation changes n"},{"name":"graph_search","description":"Find what the graph knows about something, plus its neighbourhood. FREE.\n\nScores entities by how many query words appear in the name, type and\nobservations, the"},{"name":"graph_diff","description":"Say exactly what changed between two versions of a memory. FREE.\n\nThe audit trail a database gives you for free, without the database.\nTypical input {\"before\": "},{"name":"graph_lint","description":"Find the breaks a memory graph accumulates as it grows. FREE.\n\nRelations pointing at entities that do not exist, entities nothing points\nat, near-duplicate name"},{"name":"graph_at_time","description":"See the memory as it stood on a given day, optionally faded by age. PREMIUM (license).\n\nRelations carrying since and until are filtered to those in force on the"},{"name":"graph_compact","description":"Shrink a memory to the part that still earns its place. PREMIUM (license).\n\nRanks entities by how connected they are and how much is recorded about\nthem, keeps "}],"package":null},"verification":{"claimed":false,"claimedAt":null,"proofs":[]},"provenance":{"sources":[{"source":"mcp_registry","key":"com.moltlinestudio/recall","url":"https://registry.modelcontextprotocol.io/v0/servers/com.moltlinestudio%2Frecall","firstSeenAt":"2026-09-05T19:20:57.723Z","fetchedAt":"2026-09-05T19:20:57.723Z","normalizedAt":"2026-09-05T19:20:57.723Z"}]},"firstSeenAt":"2026-09-05T19:20:57.723Z","updatedAt":"2026-09-05T22:26:47.788Z"}