{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/euclidean","entry":"euclidean","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.20134","paper":"/paper/arxiv-2608-20134","title":"Feature Evolution and Migration during Vision Transformer Training *","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"joonasrooben/VIT-Feature-Evolution-and-Migration","path":"src/distance_metrics.py","file_url":"https://github.com/joonasrooben/VIT-Feature-Evolution-and-Migration/blob/HEAD/src/distance_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"899e2f26d44960a2","mcp_get_code":{"code_sha256":"899e2f26d44960a2"}},{"arxiv_id":"2410.18926","paper":"/paper/lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejaasaari/lorann-experiments","path":"ann_benchmarks/distance.py","file_url":"https://github.com/ejaasaari/lorann-experiments/blob/HEAD/ann_benchmarks/distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58e6e4420d6b0cef","mcp_get_code":{"code_sha256":"58e6e4420d6b0cef"}},{"arxiv_id":"2305.01777","paper":"/paper/representation-learning-via-manifold","title":"Representation Learning via Manifold Flattening and Reconstruction","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michael-psenka/manifold-linearization","path":"models/umap_scripts/distances.py","file_url":"https://github.com/michael-psenka/manifold-linearization/blob/HEAD/models/umap_scripts/distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87b8ffee09c21fd9","mcp_get_code":{"code_sha256":"87b8ffee09c21fd9"}},{"arxiv_id":"1908.10084","paper":"/paper/sentence-bert-sentence-embeddings-using","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Susheel-1999/Sentence_Similarity","path":"sentence_similarity/similarity_functions.py","file_url":"https://github.com/Susheel-1999/Sentence_Similarity/blob/HEAD/sentence_similarity/similarity_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f066e3a9c1823a5d","mcp_get_code":{"code_sha256":"f066e3a9c1823a5d"}},{"arxiv_id":"1807.05614","paper":"/paper/ann-benchmarks-a-benchmarking-tool-for","title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","date":"2018-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erikbern/ann-benchmarks","path":"ann_benchmarks/distance.py","file_url":"https://github.com/erikbern/ann-benchmarks/blob/HEAD/ann_benchmarks/distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad492dc47d8560b5","mcp_get_code":{"code_sha256":"ad492dc47d8560b5"}},{"arxiv_id":"openreview_LMrsqvShfy","paper":null,"title":"arXiv:openreview_LMrsqvShfy","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gift-novellab/InfoGlobe","path":"InfoGlobe/metrics.py","file_url":"https://github.com/gift-novellab/InfoGlobe/blob/HEAD/InfoGlobe/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"541e109e67236912","mcp_get_code":{"code_sha256":"541e109e67236912"}}]}