{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/pearson-corr","entry":"pearson_corr","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":2,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24f0981a4d25c5ac","code_sha256_prefix":"24f0981a4d25c5ac","mcp_get_code":{"code_sha256":"24f0981a4d25c5ac"}},{"arxiv_id":"2603.17685","arxiv_id_is_arxiv":true,"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":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzqw/FLAME when it was checked","code_sha256":"abbd0c4947647c0e","code_sha256_prefix":"abbd0c4947647c0e","mcp_get_code":{"code_sha256":"abbd0c4947647c0e"}},{"arxiv_id":"2512.23427","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, JesseBrouw/UncertSAM, is not in the permissive set Syntology serves inline","code_sha256":"143609f490a397bd","code_sha256_prefix":"143609f490a397bd","mcp_get_code":{"code_sha256":"143609f490a397bd"}},{"arxiv_id":"2011.01536","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"12fed9e96649da47","code_sha256_prefix":"12fed9e96649da47","mcp_get_code":{"code_sha256":"12fed9e96649da47"}},{"arxiv_id":"2006.14748","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"340b076210f6b91b","code_sha256_prefix":"340b076210f6b91b","mcp_get_code":{"code_sha256":"340b076210f6b91b"}},{"arxiv_id":"2023.findings-acl.892","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"12fed9e96649da47","code_sha256_prefix":"12fed9e96649da47","mcp_get_code":{"code_sha256":"12fed9e96649da47"}}],"record_sha256":"ef0e28f347a386365bb0d6de6282b11a2df0cc80fefd28c8f3eb0ae30031ee88","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}