{"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/pearson-corr","entry":"pearson_corr","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":3},"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":"2604.22562","paper":"/paper/arxiv-2604-22562","title":"Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"asimukaye/spectralfuse","path":"spectralfuse.py","file_url":"https://github.com/asimukaye/spectralfuse/blob/HEAD/spectralfuse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"24f0981a4d25c5ac","mcp_get_code":{"code_sha256":"24f0981a4d25c5ac"}},{"arxiv_id":"2603.17685","paper":"/paper/arxiv-2603-17685","title":"Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints","date":"2026-03-18","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"lzqw/FLAME","path":"analysis/plot_projection_critic_heatmaps.py","file_url":"https://github.com/lzqw/FLAME/blob/HEAD/analysis/plot_projection_critic_heatmaps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"abbd0c4947647c0e","mcp_get_code":{"code_sha256":"abbd0c4947647c0e"}},{"arxiv_id":"2512.23427","paper":"/paper/arxiv-2512-23427","title":"Towards Integrating Uncertainty for Domain-Agnostic Segmentation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"JesseBrouw/UncertSAM","path":"src/metrics.py","file_url":"https://github.com/JesseBrouw/UncertSAM/blob/HEAD/src/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"143609f490a397bd","mcp_get_code":{"code_sha256":"143609f490a397bd"}},{"arxiv_id":"2011.01536","paper":"/paper/transquest-translation-quality-estimation","title":"TransQuest: Translation Quality Estimation with Cross-lingual Transformers","date":"2020-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tharindudr/transQuest","path":"transquest/algo/sentence_level/monotransquest/evaluation.py","file_url":"https://github.com/tharindudr/transQuest/blob/HEAD/transquest/algo/sentence_level/monotransquest/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"12fed9e96649da47","mcp_get_code":{"code_sha256":"12fed9e96649da47"}},{"arxiv_id":"2006.14748","paper":"/paper/proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilanb/proper-interpretability","path":"funcs.py","file_url":"https://github.com/akhilanb/proper-interpretability/blob/HEAD/funcs.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"340b076210f6b91b","mcp_get_code":{"code_sha256":"340b076210f6b91b"}},{"arxiv_id":"2023.findings-acl.892","paper":null,"title":"arXiv:2023.findings-acl.892","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TharinduDR/TransQuest","path":"transquest/algo/sentence_level/monotransquest/evaluation.py","file_url":"https://github.com/TharinduDR/TransQuest/blob/HEAD/transquest/algo/sentence_level/monotransquest/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"12fed9e96649da47","mcp_get_code":{"code_sha256":"12fed9e96649da47"}}]}