{"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/create-encoder","entry":"create_encoder","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":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_fixture":1,"ran":1,"unverified":3},"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.07713","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-07713","title":"Tokenizer-Generator Coupling in Medical Image Generation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"liamchalcroft/medlatents","path":"src/medlatents/conditioning/encoders.py","file_url":"https://github.com/liamchalcroft/medlatents/blob/HEAD/src/medlatents/conditioning/encoders.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":"614326f7bc65a4c4","code_sha256_prefix":"614326f7bc65a4c4","mcp_get_code":{"code_sha256":"614326f7bc65a4c4"}},{"arxiv_id":"2602.00381","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00381","title":"Modeling Image-Caption Rating from Comparative Judgments","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"hil-se/comparative_image_caption","path":"src/compare_same_image.py","file_url":"https://github.com/hil-se/comparative_image_caption/blob/HEAD/src/compare_same_image.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, hil-se/comparative_image_caption when it was checked","code_sha256":"2144a71f14fd2cc0","code_sha256_prefix":"2144a71f14fd2cc0","mcp_get_code":{"code_sha256":"2144a71f14fd2cc0"}},{"arxiv_id":"2405.18217","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-inter-concept-relationships-in","title":"Understanding Inter-Concept Relationships in Concept-Based Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naveenr414/Concept-Learning","path":"src/models.py","file_url":"https://github.com/naveenr414/Concept-Learning/blob/HEAD/src/models.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, naveenr414/Concept-Learning when it was checked","code_sha256":"8c5436aaf4f86091","code_sha256_prefix":"8c5436aaf4f86091","mcp_get_code":{"code_sha256":"8c5436aaf4f86091"}},{"arxiv_id":"2402.13555","arxiv_id_is_arxiv":true,"paper":"/paper/full-atom-peptide-design-with-geometric","title":"Full-Atom Peptide Design with Geometric Latent Diffusion","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp-mt/pepglad","path":"models/autoencoder/model.py","file_url":"https://github.com/thunlp-mt/pepglad/blob/HEAD/models/autoencoder/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":"5bebb16ab75fb874","code_sha256_prefix":"5bebb16ab75fb874","mcp_get_code":{"code_sha256":"5bebb16ab75fb874"}},{"arxiv_id":"2312.02843","arxiv_id_is_arxiv":true,"paper":"/paper/are-vision-transformers-more-data-hungry-than-1","title":"Are Vision Transformers More Data Hungry Than Newborn Visual Systems?","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buildingamind/vit-cot","path":"models/common.py","file_url":"https://github.com/buildingamind/vit-cot/blob/HEAD/models/common.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4b12ef2736a3dae","code_sha256_prefix":"b4b12ef2736a3dae","mcp_get_code":{"code_sha256":"b4b12ef2736a3dae"}},{"arxiv_id":"2308.02351","arxiv_id_is_arxiv":true,"paper":"/paper/a-parameter-efficient-multi-subject-model-for","title":"A Parameter-efficient Multi-subject Model for Predicting fMRI Activity","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmi-dair/algonauts23","path":"algonauts23/models/registry.py","file_url":"https://github.com/cmi-dair/algonauts23/blob/HEAD/algonauts23/models/registry.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":"6da3e9ff065e4f4b","code_sha256_prefix":"6da3e9ff065e4f4b","mcp_get_code":{"code_sha256":"6da3e9ff065e4f4b"}}],"record_sha256":"1c98794cb9aa64178ddb5bd629ff6a2c844baf5fd3f17e80b51841618bef8b83","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}