{"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/matrix-sqrt","entry":"matrix_sqrt","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":3,"n_papers_ran_instrument_only":3,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":2,"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":"2505.15407","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b80f7548908ae7dc","code_sha256_prefix":"b80f7548908ae7dc","mcp_get_code":{"code_sha256":"b80f7548908ae7dc"}},{"arxiv_id":"2410.07167","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65698a07f2e8f8c7","code_sha256_prefix":"65698a07f2e8f8c7","mcp_get_code":{"code_sha256":"65698a07f2e8f8c7"}},{"arxiv_id":"2309.00570","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aradha/convrfm when it was checked","code_sha256":"feadac03d2798a03","code_sha256_prefix":"feadac03d2798a03","mcp_get_code":{"code_sha256":"feadac03d2798a03"}},{"arxiv_id":"2307.03176","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, benruben87/Learning-Curves-for-Heterogeneous-Feature-Subsampled-Ridge-Ensembles when it was checked","code_sha256":"8cfff408b7cee6d7","code_sha256_prefix":"8cfff408b7cee6d7","mcp_get_code":{"code_sha256":"8cfff408b7cee6d7"}},{"arxiv_id":"2208.12190","arxiv_id_is_arxiv":true,"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":"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":"18d4c7c2e516da00","code_sha256_prefix":"18d4c7c2e516da00","mcp_get_code":{"code_sha256":"18d4c7c2e516da00"}},{"arxiv_id":"2002.01711","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, callmespring/causalrl when it was checked","code_sha256":"1a803ea44ca09965","code_sha256_prefix":"1a803ea44ca09965","mcp_get_code":{"code_sha256":"1a803ea44ca09965"}}],"record_sha256":"2e330a8fe16ec915a7b874900fc9bd00b138ba84b4f22da221b92d135e29790e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}