{"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/extract-embeddings","entry":"extract_embeddings","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":6,"unverified":4},"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.18888","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-18888","title":"Assessing Quality of Experience in Natural Language Generation of German Text","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"DFKI-NLP/TextQ","path":"models/ats_svm.py","file_url":"https://github.com/DFKI-NLP/TextQ/blob/HEAD/models/ats_svm.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, DFKI-NLP/TextQ when it was checked","code_sha256":"ad2529b3edeff214","code_sha256_prefix":"ad2529b3edeff214","mcp_get_code":{"code_sha256":"ad2529b3edeff214"}},{"arxiv_id":"2608.18888","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-18888","title":"Assessing Quality of Experience in Natural Language Generation of German Text","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"DFKI-NLP/TextQ","path":"models/ats_torch_hybrid.py","file_url":"https://github.com/DFKI-NLP/TextQ/blob/HEAD/models/ats_torch_hybrid.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, DFKI-NLP/TextQ when it was checked","code_sha256":"765f6077799e4aa5","code_sha256_prefix":"765f6077799e4aa5","mcp_get_code":{"code_sha256":"765f6077799e4aa5"}},{"arxiv_id":"2601.03401","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03401","title":"Rendering Data Unlearnable by Exploiting LLM Alignment Mechanisms","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cat-claws/unlearnable","path":"learn-info.py","file_url":"https://github.com/cat-claws/unlearnable/blob/HEAD/learn-info.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, cat-claws/unlearnable when it was checked","code_sha256":"67d10fd3e5710c00","code_sha256_prefix":"67d10fd3e5710c00","mcp_get_code":{"code_sha256":"67d10fd3e5710c00"}},{"arxiv_id":"2601.02031","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02031","title":"Output Embedding Centering for Stable LLM Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"flxst/output-embedding-centering","path":"nanoGPT/analysis/embeddings.py","file_url":"https://github.com/flxst/output-embedding-centering/blob/HEAD/nanoGPT/analysis/embeddings.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, flxst/output-embedding-centering when it was checked","code_sha256":"746bf8b091dcf89b","code_sha256_prefix":"746bf8b091dcf89b","mcp_get_code":{"code_sha256":"746bf8b091dcf89b"}},{"arxiv_id":"2503.07259","arxiv_id_is_arxiv":true,"paper":"/paper/comodo-cross-modal-video-to-imu-distillation","title":"COMODO: Cross-Modal Video-to-IMU Distillation for Efficient Egocentric Human Activity Recognition","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Breezelled/COMODO","path":"comodo/utils/svm_util.py","file_url":"https://github.com/Breezelled/COMODO/blob/HEAD/comodo/utils/svm_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2d90cc702165a7d","code_sha256_prefix":"b2d90cc702165a7d","mcp_get_code":{"code_sha256":"b2d90cc702165a7d"}},{"arxiv_id":"2310.11028","arxiv_id_is_arxiv":true,"paper":"/paper/matrix-compression-via-randomized-low-rank","title":"Matrix Compression via Randomized Low Rank and Low Precision Factorization","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pilancilab/matrix-compressor","path":"src/mnet/utils.py","file_url":"https://github.com/pilancilab/matrix-compressor/blob/HEAD/src/mnet/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, pilancilab/matrix-compressor when it was checked","code_sha256":"246fd19433ca457a","code_sha256_prefix":"246fd19433ca457a","mcp_get_code":{"code_sha256":"246fd19433ca457a"}},{"arxiv_id":"2211.04279","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-shortcuts-in-medical-images-a-case","title":"Detecting Shortcuts in Medical Images -- A Case Study in Chest X-rays","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"volesen/slicing-through-bias","path":"embed.py","file_url":"https://github.com/volesen/slicing-through-bias/blob/HEAD/embed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"855d1152f9bc31db","code_sha256_prefix":"855d1152f9bc31db","mcp_get_code":{"code_sha256":"855d1152f9bc31db"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhouDaShan123/vit","path":"src/npz_converter.py","file_url":"https://github.com/ZhouDaShan123/vit/blob/HEAD/src/npz_converter.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":"0ed2369c3f959ad2","code_sha256_prefix":"0ed2369c3f959ad2","mcp_get_code":{"code_sha256":"0ed2369c3f959ad2"}},{"arxiv_id":"1904.11397","arxiv_id_is_arxiv":true,"paper":"/paper/deep-constrained-dominant-sets-for-person-re","title":"Deep Constrained Dominant Sets for Person Re-identification","date":"2019-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leule/DCDS","path":"reid/evaluators.py","file_url":"https://github.com/leule/DCDS/blob/HEAD/reid/evaluators.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":"97aedbd892caba6e","code_sha256_prefix":"97aedbd892caba6e","mcp_get_code":{"code_sha256":"97aedbd892caba6e"}},{"arxiv_id":"1902.00751","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-efficient-transfer-learning-for-nlp","title":"Parameter-Efficient Transfer Learning for NLP","date":"2019-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberZHG/keras-bert","path":"keras_bert/util.py","file_url":"https://github.com/CyberZHG/keras-bert/blob/HEAD/keras_bert/util.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":"a8a537c8d7277f7e","code_sha256_prefix":"a8a537c8d7277f7e","mcp_get_code":{"code_sha256":"a8a537c8d7277f7e"}}],"record_sha256":"9f207aa9309ebe9f26279aa9aa3bb05b262a3e386a924d662877df718c4236b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}