{"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/load-matrix","entry":"load_matrix","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":8,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":7},"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":"2608.23799","paper":"/paper/arxiv-2608-23799","title":"Restoring Without Forgetting: Continual Learning Across Image Degradations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AlifAshrafee/Restoring-Without-Forgetting","path":"compute_cl_metrics.py","file_url":"https://github.com/AlifAshrafee/Restoring-Without-Forgetting/blob/HEAD/compute_cl_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a49f1899099bea3","mcp_get_code":{"code_sha256":"4a49f1899099bea3"}},{"arxiv_id":"2608.05136","paper":"/paper/arxiv-2608-05136","title":"The Loss Does Not See the Basis, but Adam Does","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"idevender/loss-basis-adam","path":"experiments/hyperspectral_completion.py","file_url":"https://github.com/idevender/loss-basis-adam/blob/HEAD/experiments/hyperspectral_completion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d5f6523ce69e50b","mcp_get_code":{"code_sha256":"1d5f6523ce69e50b"}},{"arxiv_id":"2503.23455","paper":"/paper/efficient-token-compression-for-vision","title":"Efficient Token Compression for Vision Transformer with Spatial Information Preserved","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nust-machine-intelligence-laboratory/prune_and_merge","path":"pm-vit/visualize.py","file_url":"https://github.com/nust-machine-intelligence-laboratory/prune_and_merge/blob/HEAD/pm-vit/visualize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"22479ea1d7d13ebb","mcp_get_code":{"code_sha256":"22479ea1d7d13ebb"}},{"arxiv_id":"2411.04425","paper":"/paper/delift-data-efficient-language-model","title":"DELIFT: Data Efficient Language model Instruction Fine Tuning","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agarwalishika/delift","path":"visualization/create_embeddings.py","file_url":"https://github.com/agarwalishika/delift/blob/HEAD/visualization/create_embeddings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1f96e190107daf8e","mcp_get_code":{"code_sha256":"1f96e190107daf8e"}},{"arxiv_id":"2410.19750","paper":"/paper/the-geometry-of-concepts-sparse-autoencoder","title":"The Geometry of Concepts: Sparse Autoencoder Feature Structure","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/feature-geometry","path":"brain/experiments/all-occurrences0/cluster.py","file_url":"https://github.com/ejmichaud/feature-geometry/blob/HEAD/brain/experiments/all-occurrences0/cluster.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f9267d46915610da","mcp_get_code":{"code_sha256":"f9267d46915610da"}},{"arxiv_id":"1807.10129","paper":"/paper/a-benchmark-of-selected-algorithmic","title":"A Benchmark of Selected Algorithmic Differentiation Tools on Some Problems in Computer Vision and Machine Learning","date":"2018-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awf/ADBench","path":"ADBench/check_J.py","file_url":"https://github.com/awf/ADBench/blob/HEAD/ADBench/check_J.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e9ac370154cec5f8","mcp_get_code":{"code_sha256":"e9ac370154cec5f8"}},{"arxiv_id":"1805.06504","paper":"/paper/analogical-reasoning-on-chinese-morphological","title":"Analogical Reasoning on Chinese Morphological and Semantic Relations","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Embedding/Chinese-Word-Vectors","path":"evaluation/ana_eval_sparse.py","file_url":"https://github.com/Embedding/Chinese-Word-Vectors/blob/HEAD/evaluation/ana_eval_sparse.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b2047e70533e1f22","mcp_get_code":{"code_sha256":"b2047e70533e1f22"}},{"arxiv_id":"1603.09320","paper":"/paper/efficient-and-robust-approximate-nearest","title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","date":"2016-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unum-cloud/usearch","path":"python/usearch/io.py","file_url":"https://github.com/unum-cloud/usearch/blob/HEAD/python/usearch/io.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6232ffacb8dd099a","mcp_get_code":{"code_sha256":"6232ffacb8dd099a"}}]}