They did WHAT
https://retractionwatch.com/2024/02/05/no-data-no-problem-undisclosed-tinkering-in-excel-behind-economics-paper/

I know the answer to this is probably "thats exactly the opposite of what they're supposed to do," but the thought has been sticking with me - I am wondering if there is some kind of "semantic hash" algorithm, sort of like vector embeddings, that puts hashes nearby in hash space that are nearby in source space.

Usually you hash over undifferentiated binary, but say you were instead hashing over a graph where you wanted similar graphs (similar terms, structure) to have close but unique hashes, but still collision resistant in the sense that you couldnt trivially tell which terms were giving you proximity (and thus engineer a collision).

This feels like a thought that will get me fedi spanked by cryptographers

@clacke @elduvelle I don't think masto does this? https://github.com/mastodon/mastodon/blob/main/app/services/favourite_service.rb