{"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","entry":"pearson","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":11,"n_places_pointer_only":1,"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":0,"ran_fixture":2,"ran":6,"unverified":1},"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":"2607.16741","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-16741","title":"The Anatomy of a Truth Direction Knowledge-Dependent Dimensionality, a Relational Law, and a Convergent Category Geometry in Small Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Francesco-Marhel/TruthProbe","path":"src/arrangement_law.py","file_url":"https://github.com/Francesco-Marhel/TruthProbe/blob/HEAD/src/arrangement_law.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":"488bf5481cd187d0","code_sha256_prefix":"488bf5481cd187d0","mcp_get_code":{"code_sha256":"488bf5481cd187d0"}},{"arxiv_id":"2607.10617","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-10617","title":"modelDNA: Calibrated Lineage Verification and Merge Decomposition from Sampled Weight Fingerprints","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"AwaisAdilKhokhar/modelDNA","path":"src/modeldna/compare.py","file_url":"https://github.com/AwaisAdilKhokhar/modelDNA/blob/HEAD/src/modeldna/compare.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":"d518b338a76bff2c","code_sha256_prefix":"d518b338a76bff2c","mcp_get_code":{"code_sha256":"d518b338a76bff2c"}},{"arxiv_id":"2605.14084","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14084","title":"CRANE: Constrained Reasoning Injection for Code Agents via Nullspace Editing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"rpi-nsl/CRANE","path":"crane/analyze_calibration_stability.py","file_url":"https://github.com/rpi-nsl/CRANE/blob/HEAD/crane/analyze_calibration_stability.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6148a8caae33e43a","code_sha256_prefix":"6148a8caae33e43a","mcp_get_code":{"code_sha256":"6148a8caae33e43a"}},{"arxiv_id":"2307.15860","arxiv_id_is_arxiv":true,"paper":"/paper/what-can-discriminator-do-towards-box-free","title":"What can Discriminator do? Towards Box-free Ownership Verification of Generative Adversarial Network","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abstractteen/gan_ownership_verification","path":"utils.py","file_url":"https://github.com/abstractteen/gan_ownership_verification/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cef20a0949e4f556","code_sha256_prefix":"cef20a0949e4f556","mcp_get_code":{"code_sha256":"cef20a0949e4f556"}},{"arxiv_id":"2206.05871","arxiv_id_is_arxiv":true,"paper":"/paper/causal-inference-based-root-cause-analysis","title":"Causal Inference-Based Root Cause Analysis for Online Service Systems with Intervention Recognition","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"netmanaiops/circa","path":"circa/alg/common.py","file_url":"https://github.com/netmanaiops/circa/blob/HEAD/circa/alg/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77c745cb3a4e0c63","code_sha256_prefix":"77c745cb3a4e0c63","mcp_get_code":{"code_sha256":"77c745cb3a4e0c63"}},{"arxiv_id":"2111.06719","arxiv_id_is_arxiv":true,"paper":"/paper/on-transferability-of-prompt-tuning-for","title":"On Transferability of Prompt Tuning for Natural Language Processing","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/Prompt-Transferability","path":"Prompt-Transferability-1.0/model/PromptBert.py","file_url":"https://github.com/thunlp/Prompt-Transferability/blob/HEAD/Prompt-Transferability-1.0/model/PromptBert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b1a510c7c3fd60f4","code_sha256_prefix":"b1a510c7c3fd60f4","mcp_get_code":{"code_sha256":"b1a510c7c3fd60f4"}},{"arxiv_id":"2010.11810","arxiv_id_is_arxiv":true,"paper":"/paper/factorized-neural-processes-for-neural","title":"Factorized Neural Processes for Neural Processes: $K$-Shot Prediction of Neural Responses","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peabody124/fnp_neurips2020","path":"tuning_manifold/util.py","file_url":"https://github.com/peabody124/fnp_neurips2020/blob/HEAD/tuning_manifold/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c45f2ab76e67fb2f","code_sha256_prefix":"c45f2ab76e67fb2f","mcp_get_code":{"code_sha256":"c45f2ab76e67fb2f"}},{"arxiv_id":"2004.05554","arxiv_id_is_arxiv":true,"paper":"/paper/feature-lenses-plug-and-play-neural-modules","title":"Feature Lenses: Plug-and-play Neural Modules for Transformation-Invariant Visual Representations","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"askerlee/featlens","path":"featlens.py","file_url":"https://github.com/askerlee/featlens/blob/HEAD/featlens.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, askerlee/featlens when it was checked","code_sha256":"7f99208ed1125ffb","code_sha256_prefix":"7f99208ed1125ffb","mcp_get_code":{"code_sha256":"7f99208ed1125ffb"}},{"arxiv_id":"1905.07790","arxiv_id_is_arxiv":true,"paper":"/paper/correlation-coefficients-and-semantic-textual","title":"Correlation Coefficients and Semantic Textual Similarity","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/corrsim","path":"similarity/correlation.py","file_url":"https://github.com/Babylonpartners/corrsim/blob/HEAD/similarity/correlation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c37fc00aafe8b8aa","code_sha256_prefix":"c37fc00aafe8b8aa","mcp_get_code":{"code_sha256":"c37fc00aafe8b8aa"}},{"arxiv_id":"1304.0530","arxiv_id_is_arxiv":true,"paper":"/paper/the-ring-of-algebraic-functions-on","title":"The Ring of Algebraic Functions on Persistence Bar Codes","date":null,"month_inferred_from_arxiv_id":"2013-04","title_source":"archive","repo":"oleg-kachan/diagram2vec","path":"diagram2vec/diagram2vec.py","file_url":"https://github.com/oleg-kachan/diagram2vec/blob/HEAD/diagram2vec/diagram2vec.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c30816985e348b9f","code_sha256_prefix":"c30816985e348b9f","mcp_get_code":{"code_sha256":"c30816985e348b9f"}},{"arxiv_id":"2023.acl-long.782","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.782","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tenvence/ulra","path":"metrics.py","file_url":"https://github.com/tenvence/ulra/blob/HEAD/metrics.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":"d84d834660f6bcf6","code_sha256_prefix":"d84d834660f6bcf6","mcp_get_code":{"code_sha256":"d84d834660f6bcf6"}}],"record_sha256":"2ef1b6d526b4990ce554f3f1545d4c18a1cc2ae1757dbcc47cdd7fae4c860fd4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}