{"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/cool-mean","entry":"cool_mean","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":5,"n_papers_ran":4,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":0,"unverified":1},"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":"2506.22427","paper":null,"title":"arXiv:2506.22427","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"Nokia-Bell-Labs/Loss-Vector-based-Clustered-Federated-Learning","path":"FINCH-patch/finch.py","file_url":"https://github.com/Nokia-Bell-Labs/Loss-Vector-based-Clustered-Federated-Learning/blob/HEAD/FINCH-patch/finch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause-Clear","inline_ok":false,"code_sha256_prefix":"c34d92475d1ffdbc","mcp_get_code":{"code_sha256":"c34d92475d1ffdbc"}},{"arxiv_id":"2501.02504","paper":"/paper/watch-video-catch-keyword-context-aware","title":"Watch Video, Catch Keyword: Context-aware Keyword Attention for Moment Retrieval and Highlight Detection","date":"2025-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visualaikhu/keyword-detr","path":"keyword_detr/keyword_attention.py","file_url":"https://github.com/visualaikhu/keyword-detr/blob/HEAD/keyword_detr/keyword_attention.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d57d0d9f47ab9ac","mcp_get_code":{"code_sha256":"6d57d0d9f47ab9ac"}},{"arxiv_id":"2203.12997","paper":"/paper/hierarchical-nearest-neighbor-graph-embedding","title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","date":"2022-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koulakis/h-nne","path":"hnne/cool_functions.py","file_url":"https://github.com/koulakis/h-nne/blob/HEAD/hnne/cool_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"837397a9051a72c6","mcp_get_code":{"code_sha256":"837397a9051a72c6"}},{"arxiv_id":"2103.11264","paper":"/paper/temporally-weighted-hierarchical-clustering","title":"Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation","date":"2021-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssarfraz/FINCH-Clustering","path":"TW-FINCH/python/twfinch.py","file_url":"https://github.com/ssarfraz/FINCH-Clustering/blob/HEAD/TW-FINCH/python/twfinch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b82e4cf700e1ffd","mcp_get_code":{"code_sha256":"8b82e4cf700e1ffd"}},{"arxiv_id":"1902.11266","paper":"/paper/efficient-parameter-free-clustering-using","title":"Efficient Parameter-free Clustering Using First Neighbor Relations","date":"2019-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssarfraz/FINCH-CLustering","path":"finch/finch.py","file_url":"https://github.com/ssarfraz/FINCH-CLustering/blob/HEAD/finch/finch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c34d92475d1ffdbc","mcp_get_code":{"code_sha256":"c34d92475d1ffdbc"}}]}