{"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/mlphead","entry":"MLPHead","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":5,"n_samples_constructed":3,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"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":5,"unverified":1},"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":"2604.14651","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14651","title":"CURA: Clinical Uncertainty Risk Alignment for Language Model-Based Risk Prediction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sizhe04/CURA","path":"modeling_multihead_embedding.py","file_url":"https://github.com/sizhe04/CURA/blob/HEAD/modeling_multihead_embedding.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sizhe04/CURA when it was checked","code_sha256":"3322b17ac647593d","code_sha256_prefix":"3322b17ac647593d","mcp_get_code":{"code_sha256":"3322b17ac647593d"}},{"arxiv_id":"2603.18202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18202","title":"R2-Dreamer: Redundancy-Reduced World Models without Decoders or Augmentation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"NM512/r2dreamer","path":"dreamer.py","file_url":"https://github.com/NM512/r2dreamer/blob/HEAD/dreamer.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":"d9793fedb6dc1770","code_sha256_prefix":"d9793fedb6dc1770","mcp_get_code":{"code_sha256":"d9793fedb6dc1770"}},{"arxiv_id":"2105.15203","arxiv_id_is_arxiv":true,"paper":"/paper/segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarshanDeshpande/jax-models","path":"jax_models/models/segformer.py","file_url":"https://github.com/DarshanDeshpande/jax-models/blob/HEAD/jax_models/models/segformer.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":"1cca7df806bbd21f","code_sha256_prefix":"1cca7df806bbd21f","mcp_get_code":{"code_sha256":"1cca7df806bbd21f"}},{"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":"uzi0espil/research-papers-implementation","path":"Vision Transformer/models.py","file_url":"https://github.com/uzi0espil/research-papers-implementation/blob/HEAD/Vision%20Transformer/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, uzi0espil/research-papers-implementation when it was checked","code_sha256":"dfc0aa99be911685","code_sha256_prefix":"dfc0aa99be911685","mcp_get_code":{"code_sha256":"dfc0aa99be911685"}},{"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":"Ugenteraan/Vanilla-ViT","path":"ViT/ViT.py","file_url":"https://github.com/Ugenteraan/Vanilla-ViT/blob/HEAD/ViT/ViT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b337d893396aff7a","code_sha256_prefix":"b337d893396aff7a","mcp_get_code":{"code_sha256":"b337d893396aff7a"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miszkur/SelfSupervisedLearning","path":"models/model.py","file_url":"https://github.com/miszkur/SelfSupervisedLearning/blob/HEAD/models/model.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, miszkur/SelfSupervisedLearning when it was checked","code_sha256":"5ec3adcd55340bbd","code_sha256_prefix":"5ec3adcd55340bbd","mcp_get_code":{"code_sha256":"5ec3adcd55340bbd"}}],"record_sha256":"068d41eb15e961a3a045b7d7dd51633e2daceea54e5c36c6162c55a378a5e7da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}