{"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/load-matrix","entry":"load_matrix","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":1,"ran_fixture":0,"ran":4,"unverified":2},"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":"2608.23799","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, AlifAshrafee/Restoring-Without-Forgetting when it was checked","code_sha256":"4a49f1899099bea3","code_sha256_prefix":"4a49f1899099bea3","mcp_get_code":{"code_sha256":"4a49f1899099bea3"}},{"arxiv_id":"2608.05136","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d5f6523ce69e50b","code_sha256_prefix":"1d5f6523ce69e50b","mcp_get_code":{"code_sha256":"1d5f6523ce69e50b"}},{"arxiv_id":"2503.23455","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, nust-machine-intelligence-laboratory/prune_and_merge, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"22479ea1d7d13ebb","code_sha256_prefix":"22479ea1d7d13ebb","mcp_get_code":{"code_sha256":"22479ea1d7d13ebb"}},{"arxiv_id":"2411.04425","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f96e190107daf8e","code_sha256_prefix":"1f96e190107daf8e","mcp_get_code":{"code_sha256":"1f96e190107daf8e"}},{"arxiv_id":"2410.19750","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ejmichaud/feature-geometry when it was checked","code_sha256":"f9267d46915610da","code_sha256_prefix":"f9267d46915610da","mcp_get_code":{"code_sha256":"f9267d46915610da"}},{"arxiv_id":"1807.10129","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, awf/ADBench, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e9ac370154cec5f8","code_sha256_prefix":"e9ac370154cec5f8","mcp_get_code":{"code_sha256":"e9ac370154cec5f8"}},{"arxiv_id":"1805.06504","arxiv_id_is_arxiv":true,"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":"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":"b2047e70533e1f22","code_sha256_prefix":"b2047e70533e1f22","mcp_get_code":{"code_sha256":"b2047e70533e1f22"}},{"arxiv_id":"1603.09320","arxiv_id_is_arxiv":true,"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":"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":"6232ffacb8dd099a","code_sha256_prefix":"6232ffacb8dd099a","mcp_get_code":{"code_sha256":"6232ffacb8dd099a"}}],"record_sha256":"f68752309968f646f41e729aaa45683dcc14f3545bc2d191062c6143a2d1737a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}