{"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/mlplayer","entry":"MLPLayer","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":15,"n_samples_ran":14,"n_samples_constructed":9,"n_samples_ran_checked":14,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":15,"n_places_pointer_only":9,"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":14,"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":"2607.04782","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-04782","title":"Predicting Drafted Deck Strength for \"Magic: the Gathering\"","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"akulen/MtGDraftEncoder","path":"models/draft_attention.py","file_url":"https://github.com/akulen/MtGDraftEncoder/blob/HEAD/models/draft_attention.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, akulen/MtGDraftEncoder when it was checked","code_sha256":"1f5cba5e644dda1c","code_sha256_prefix":"1f5cba5e644dda1c","mcp_get_code":{"code_sha256":"1f5cba5e644dda1c"}},{"arxiv_id":"2603.13434","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-13434","title":"Modality-free Graph In-context Alignment","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"JhuoW/MF-GIA","path":"model/pt_model.py","file_url":"https://github.com/JhuoW/MF-GIA/blob/HEAD/model/pt_model.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, JhuoW/MF-GIA when it was checked","code_sha256":"8475cb62293539a2","code_sha256_prefix":"8475cb62293539a2","mcp_get_code":{"code_sha256":"8475cb62293539a2"}},{"arxiv_id":"2502.01989","arxiv_id_is_arxiv":true,"paper":"/paper/t-scend-test-time-scalable-mcts-enhanced","title":"T-SCEND: Test-time Scalable MCTS-enhanced Diffusion Model","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Science-WestlakeU/VFScale","path":"vfscale_src/model/models.py","file_url":"https://github.com/AI4Science-WestlakeU/VFScale/blob/HEAD/vfscale_src/model/models.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":"b172f5e1fa3d4d6a","code_sha256_prefix":"b172f5e1fa3d4d6a","mcp_get_code":{"code_sha256":"b172f5e1fa3d4d6a"}},{"arxiv_id":"2407.05374","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-prompt-learning-with-missing","title":"Multimodal Prompt Learning with Missing Modalities for Sentiment Analysis and Emotion Recognition","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/MPLMM","path":"src/model.py","file_url":"https://github.com/zrguo/MPLMM/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"381d0174c24eaf6a","code_sha256_prefix":"381d0174c24eaf6a","mcp_get_code":{"code_sha256":"381d0174c24eaf6a"}},{"arxiv_id":"2402.02097","arxiv_id_is_arxiv":true,"paper":"/paper/settling-decentralized-multi-agent","title":"Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigmabm/mace","path":"src/algo/r_mappo/hdd_net.py","file_url":"https://github.com/sigmabm/mace/blob/HEAD/src/algo/r_mappo/hdd_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sigmabm/mace when it was checked","code_sha256":"235b02a593e7a345","code_sha256_prefix":"235b02a593e7a345","mcp_get_code":{"code_sha256":"235b02a593e7a345"}},{"arxiv_id":"2210.14975","arxiv_id_is_arxiv":true,"paper":"/paper/mabel-attenuating-gender-bias-using-textual","title":"MABEL: Attenuating Gender Bias using Textual Entailment Data","date":"2022-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/mabel","path":"training/model.py","file_url":"https://github.com/princeton-nlp/mabel/blob/HEAD/training/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae2a0a8e929ffb22","code_sha256_prefix":"ae2a0a8e929ffb22","mcp_get_code":{"code_sha256":"ae2a0a8e929ffb22"}},{"arxiv_id":"2209.09433","arxiv_id_is_arxiv":true,"paper":"/paper/non-linguistic-supervision-for-contrastive","title":"Non-Linguistic Supervision for Contrastive Learning of Sentence Embeddings","date":"2022-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiren-jian/NonLing-CSE","path":"AudioCSE/src/models.py","file_url":"https://github.com/yiren-jian/NonLing-CSE/blob/HEAD/AudioCSE/src/models.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, yiren-jian/NonLing-CSE when it was checked","code_sha256":"7d7789da5378c84b","code_sha256_prefix":"7d7789da5378c84b","mcp_get_code":{"code_sha256":"7d7789da5378c84b"}},{"arxiv_id":"2206.15369","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-generalization-of-supervised","title":"No Reason for No Supervision: Improved Generalization in Supervised Models","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/trex","path":"trex.py","file_url":"https://github.com/naver/trex/blob/HEAD/trex.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver/trex (NOASSERTION)","code_sha256":"1c58a693c3409799","code_sha256_prefix":"1c58a693c3409799","mcp_get_code":{"code_sha256":"1c58a693c3409799"}},{"arxiv_id":"2204.10931","arxiv_id_is_arxiv":true,"paper":"/paper/mcse-multimodal-contrastive-learning-of","title":"MCSE: Multimodal Contrastive Learning of Sentence Embeddings","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uds-lsv/mcse","path":"src/model.py","file_url":"https://github.com/uds-lsv/mcse/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9c0e720e8c01537","code_sha256_prefix":"d9c0e720e8c01537","mcp_get_code":{"code_sha256":"d9c0e720e8c01537"}},{"arxiv_id":"2201.04337","arxiv_id_is_arxiv":true,"paper":"/paper/promptbert-improving-bert-sentence-embeddings-1","title":"PromptBERT: Improving BERT Sentence Embeddings with Prompts","date":"2022-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kongds/prompt-bert","path":"prompt_bert/models.py","file_url":"https://github.com/kongds/prompt-bert/blob/HEAD/prompt_bert/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kongds/prompt-bert when it was checked","code_sha256":"c724bbfa7007a836","code_sha256_prefix":"c724bbfa7007a836","mcp_get_code":{"code_sha256":"c724bbfa7007a836"}},{"arxiv_id":"2104.08821","arxiv_id_is_arxiv":true,"paper":"/paper/simcse-simple-contrastive-learning-of","title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpods/layerattpooler","path":"cl/models.py","file_url":"https://github.com/nlpods/layerattpooler/blob/HEAD/cl/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, nlpods/layerattpooler when it was checked","code_sha256":"8e0d3e09d28f3b02","code_sha256_prefix":"8e0d3e09d28f3b02","mcp_get_code":{"code_sha256":"8e0d3e09d28f3b02"}},{"arxiv_id":"2102.06828","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-time-series-forecasting-with","title":"Domain Adaptation for Time Series Forecasting via Attention Sharing","date":"2021-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leejoonhun/daf","path":"models/generator.py","file_url":"https://github.com/leejoonhun/daf/blob/HEAD/models/generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, leejoonhun/daf when it was checked","code_sha256":"58ef5ba9d62ef969","code_sha256_prefix":"58ef5ba9d62ef969","mcp_get_code":{"code_sha256":"58ef5ba9d62ef969"}},{"arxiv_id":"2011.07439","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-variational-inference-for-sparse-1","title":"Efficient Variational Inference for Sparse Deep Learning with Theoretical Guarantee","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinchengBai/sparse-variational-bnn","path":"models/sparsefunc.py","file_url":"https://github.com/JinchengBai/sparse-variational-bnn/blob/HEAD/models/sparsefunc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JinchengBai/sparse-variational-bnn when it was checked","code_sha256":"b68271e56ba25185","code_sha256_prefix":"b68271e56ba25185","mcp_get_code":{"code_sha256":"b68271e56ba25185"}},{"arxiv_id":"1908.10084","arxiv_id_is_arxiv":true,"paper":"/paper/sentence-bert-sentence-embeddings-using","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puerrrr/focal-infonce","path":"focalNCE/models.py","file_url":"https://github.com/puerrrr/focal-infonce/blob/HEAD/focalNCE/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ac67fa1b927fc99","code_sha256_prefix":"9ac67fa1b927fc99","mcp_get_code":{"code_sha256":"9ac67fa1b927fc99"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning","path":"algorithms/happo_policy.py","file_url":"https://github.com/anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning/blob/HEAD/algorithms/happo_policy.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":"052cdd66a800bf26","code_sha256_prefix":"052cdd66a800bf26","mcp_get_code":{"code_sha256":"052cdd66a800bf26"}}],"record_sha256":"d92a78174304df3b161d6ce331583d8840e9e2904a571bb13f2b060669767b2b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}