{"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/moore-penrose-iter-pinv","entry":"moore_penrose_iter_pinv","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":10,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":8,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":8},"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":"2603.15774","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-15774","title":"Domain Adaptation Without the Compute Burden for Efficient Whole Slide Image Analysis","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"umarikkar/eWSI","path":"models/wsi_models.py","file_url":"https://github.com/umarikkar/eWSI/blob/HEAD/models/wsi_models.py","status":"unverified","verification_level":0,"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, umarikkar/eWSI when it was checked","code_sha256":"a81e4fb3c258958f","code_sha256_prefix":"a81e4fb3c258958f","mcp_get_code":{"code_sha256":"a81e4fb3c258958f"}},{"arxiv_id":"2603.08328","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08328","title":"Beyond Attention Heatmaps: How to Get Better Explanations for Multiple Instance Learning Models in Histopathology","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"bifold-pathomics/xMIL","path":"models/attention.py","file_url":"https://github.com/bifold-pathomics/xMIL/blob/HEAD/models/attention.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":"75200d628af9d31c","code_sha256_prefix":"75200d628af9d31c","mcp_get_code":{"code_sha256":"75200d628af9d31c"}},{"arxiv_id":"2412.00678","arxiv_id_is_arxiv":true,"paper":"/paper/2dmamba-efficient-state-space-model-for-image","title":"2DMamba: Efficient State Space Model for Image Representation with Applications on Giga-Pixel Whole Slide Image Classification","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atlasanalyticslab/2dmamba","path":"2DMambaMIL/models/TransMIL.py","file_url":"https://github.com/atlasanalyticslab/2dmamba/blob/HEAD/2DMambaMIL/models/TransMIL.py","status":"unverified","verification_level":0,"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, atlasanalyticslab/2dmamba when it was checked","code_sha256":"1aa879b87d59c39f","code_sha256_prefix":"1aa879b87d59c39f","mcp_get_code":{"code_sha256":"1aa879b87d59c39f"}},{"arxiv_id":"2406.09009","arxiv_id_is_arxiv":true,"paper":"/paper/fredformer-frequency-debiased-transformer-for","title":"Fredformer: Frequency Debiased Transformer for Time Series Forecasting","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenzrg/fredformer","path":"layers/cross_Transformer_nys.py","file_url":"https://github.com/chenzrg/fredformer/blob/HEAD/layers/cross_Transformer_nys.py","status":"unverified","verification_level":0,"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, chenzrg/fredformer when it was checked","code_sha256":"36e02082e07b1539","code_sha256_prefix":"36e02082e07b1539","mcp_get_code":{"code_sha256":"36e02082e07b1539"}},{"arxiv_id":"2403.06800","arxiv_id_is_arxiv":true,"paper":"/paper/mambamil-enhancing-long-sequence-modeling","title":"MambaMIL: Enhancing Long Sequence Modeling with Sequence Reordering in Computational Pathology","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isyangshu/mambamil","path":"models/TransMIL.py","file_url":"https://github.com/isyangshu/mambamil/blob/HEAD/models/TransMIL.py","status":"unverified","verification_level":0,"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, isyangshu/mambamil when it was checked","code_sha256":"1aa879b87d59c39f","code_sha256_prefix":"1aa879b87d59c39f","mcp_get_code":{"code_sha256":"1aa879b87d59c39f"}},{"arxiv_id":"2402.17228","arxiv_id_is_arxiv":true,"paper":"/paper/feature-re-embedding-towards-foundation-model","title":"Feature Re-Embedding: Towards Foundation Model-Level Performance in Computational Pathology","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"1aa879b87d59c39f","code_sha256_prefix":"1aa879b87d59c39f","mcp_get_code":{"code_sha256":"1aa879b87d59c39f"}},{"arxiv_id":"2402.17228","arxiv_id_is_arxiv":true,"paper":"/paper/feature-re-embedding-towards-foundation-model","title":"Feature Re-Embedding: Towards Foundation Model-Level Performance in Computational Pathology","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dearcaat/mhim-mil","path":"modules/rrt.py","file_url":"https://github.com/dearcaat/mhim-mil/blob/HEAD/modules/rrt.py","status":"unverified","verification_level":0,"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, dearcaat/mhim-mil when it was checked","code_sha256":"46262157db207436","code_sha256_prefix":"46262157db207436","mcp_get_code":{"code_sha256":"46262157db207436"}},{"arxiv_id":"2307.15254","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-instance-learning-framework-with","title":"Multiple Instance Learning Framework with Masked Hard Instance Mining for Whole Slide Image Classification","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DearCaat/MHIM-MIL","path":"modules/mhim.py","file_url":"https://github.com/DearCaat/MHIM-MIL/blob/HEAD/modules/mhim.py","status":"unverified","verification_level":0,"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, DearCaat/MHIM-MIL when it was checked","code_sha256":"ace5e24876cba9e9","code_sha256_prefix":"ace5e24876cba9e9","mcp_get_code":{"code_sha256":"ace5e24876cba9e9"}},{"arxiv_id":"2306.08330","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-optimal-transport-based-co","title":"Multimodal Optimal Transport-based Co-Attention Transformer with Global Structure Consistency for Survival Prediction","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JJ-ZHOU-Code/RobustMultiModel","path":"models/model_coattn.py","file_url":"https://github.com/JJ-ZHOU-Code/RobustMultiModel/blob/HEAD/models/model_coattn.py","status":"unverified","verification_level":0,"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, JJ-ZHOU-Code/RobustMultiModel when it was checked","code_sha256":"763d48b1144254cd","code_sha256_prefix":"763d48b1144254cd","mcp_get_code":{"code_sha256":"763d48b1144254cd"}},{"arxiv_id":"2102.03902","arxiv_id_is_arxiv":true,"paper":"/paper/nystromformer-a-nystrom-based-algorithm-for","title":"Nyströmformer: A Nyström-Based Algorithm for Approximating Self-Attention","date":"2021-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/nystrom-attention","path":"nystrom_attention/nystrom_attention.py","file_url":"https://github.com/lucidrains/nystrom-attention/blob/HEAD/nystrom_attention/nystrom_attention.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":"1aa879b87d59c39f","code_sha256_prefix":"1aa879b87d59c39f","mcp_get_code":{"code_sha256":"1aa879b87d59c39f"}},{"arxiv_id":"1909.11942","arxiv_id_is_arxiv":true,"paper":"/paper/albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvvm23/albert","path":"albert/model.py","file_url":"https://github.com/vvvm23/albert/blob/HEAD/albert/model.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":"8434ec6cb6412213","code_sha256_prefix":"8434ec6cb6412213","mcp_get_code":{"code_sha256":"8434ec6cb6412213"}}],"record_sha256":"c4eb6ffe08ec267359906e95fe3c4d248df4f00617dd5a64b22f30c4d78a8a80","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}