{"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/matrix-sqrt","entry":"matrix_sqrt","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":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":6,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":2},"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":"2505.15407","paper":"/paper/efficient-differentiable-approximation-of","title":"Efficient Differentiable Approximation of Generalized Low-rank Regularization","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naiqili/EDLRR","path":"calrank.py","file_url":"https://github.com/naiqili/EDLRR/blob/HEAD/calrank.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b80f7548908ae7dc","mcp_get_code":{"code_sha256":"b80f7548908ae7dc"}},{"arxiv_id":"2410.07167","paper":"/paper/deciphering-cross-modal-alignment-in-large","title":"Deciphering Cross-Modal Alignment in Large Vision-Language Models with Modality Integration Rate","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikiw/modality-integration-rate","path":"mir_util.py","file_url":"https://github.com/shikiw/modality-integration-rate/blob/HEAD/mir_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65698a07f2e8f8c7","mcp_get_code":{"code_sha256":"65698a07f2e8f8c7"}},{"arxiv_id":"2309.00570","paper":"/paper/mechanism-of-feature-learning-in","title":"Mechanism of feature learning in convolutional neural networks","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/convrfm","path":"conv_nets/utils.py","file_url":"https://github.com/aradha/convrfm/blob/HEAD/conv_nets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"feadac03d2798a03","mcp_get_code":{"code_sha256":"feadac03d2798a03"}},{"arxiv_id":"2307.03176","paper":"/paper/learning-curves-for-noisy-heterogeneous","title":"Learning Curves for Noisy Heterogeneous Feature-Subsampled Ridge Ensembles","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benruben87/Learning-Curves-for-Heterogeneous-Feature-Subsampled-Ridge-Ensembles","path":"EnsembleLib.py","file_url":"https://github.com/benruben87/Learning-Curves-for-Heterogeneous-Feature-Subsampled-Ridge-Ensembles/blob/HEAD/EnsembleLib.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8cfff408b7cee6d7","mcp_get_code":{"code_sha256":"8cfff408b7cee6d7"}},{"arxiv_id":"2208.12190","paper":"/paper/cas4dl-christoffel-adaptive-sampling-for","title":"CAS4DL: Christoffel Adaptive Sampling for function approximation via Deep Learning","date":"2022-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmcardenas/cas4dl","path":"src/PDE_data.py","file_url":"https://github.com/jmcardenas/cas4dl/blob/HEAD/src/PDE_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"18d4c7c2e516da00","mcp_get_code":{"code_sha256":"18d4c7c2e516da00"}},{"arxiv_id":"2002.01711","paper":"/paper/a-reinforcement-learning-framework-for-time","title":"Dynamic Causal Effects Evaluation in A/B Testing with a Reinforcement Learning Framework","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"callmespring/causalrl","path":"src/_monitor.py","file_url":"https://github.com/callmespring/causalrl/blob/HEAD/src/_monitor.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1a803ea44ca09965","mcp_get_code":{"code_sha256":"1a803ea44ca09965"}}]}