{"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/pooler","entry":"Pooler","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":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_constructed":7,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":7,"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":9,"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":"2403.09490","arxiv_id_is_arxiv":true,"paper":"/paper/hyper-cl-conditioning-sentence","title":"Hyper-CL: Conditioning Sentence Representations with Hypernetworks","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HYU-NLP/Hyper-CL","path":"sim-kgc/models_tri_encoder.py","file_url":"https://github.com/HYU-NLP/Hyper-CL/blob/HEAD/sim-kgc/models_tri_encoder.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, HYU-NLP/Hyper-CL when it was checked","code_sha256":"645ed0ea53345924","code_sha256_prefix":"645ed0ea53345924","mcp_get_code":{"code_sha256":"645ed0ea53345924"}},{"arxiv_id":"2305.15093","arxiv_id_is_arxiv":true,"paper":"/paper/csts-conditional-semantic-textual-similarity","title":"C-STS: Conditional Semantic Textual Similarity","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/c-sts","path":"utils/sts/modeling_encoders.py","file_url":"https://github.com/princeton-nlp/c-sts/blob/HEAD/utils/sts/modeling_encoders.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, princeton-nlp/c-sts when it was checked","code_sha256":"85d63561750f19d5","code_sha256_prefix":"85d63561750f19d5","mcp_get_code":{"code_sha256":"85d63561750f19d5"}},{"arxiv_id":"2305.14599","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-continuous-and-discrete-spaces","title":"Bridging Continuous and Discrete Spaces: Interpretable Sentence Representation Learning via Compositional Operations","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyhuang36/intersent","path":"model.py","file_url":"https://github.com/jyhuang36/intersent/blob/HEAD/model.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, jyhuang36/intersent when it was checked","code_sha256":"bdf401d5bc74f060","code_sha256_prefix":"bdf401d5bc74f060","mcp_get_code":{"code_sha256":"bdf401d5bc74f060"}},{"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":"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, yiren-jian/NonLing-CSE when it was checked","code_sha256":"31695b3bea2d46ee","code_sha256_prefix":"31695b3bea2d46ee","mcp_get_code":{"code_sha256":"31695b3bea2d46ee"}},{"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":"bhuvanakundumani/SimCSE_unsupervised","path":"model.py","file_url":"https://github.com/bhuvanakundumani/SimCSE_unsupervised/blob/HEAD/model.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, bhuvanakundumani/SimCSE_unsupervised when it was checked","code_sha256":"cf28308ecfc2c9fd","code_sha256_prefix":"cf28308ecfc2c9fd","mcp_get_code":{"code_sha256":"cf28308ecfc2c9fd"}},{"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":"ccd86b57fd87c336","code_sha256_prefix":"ccd86b57fd87c336","mcp_get_code":{"code_sha256":"ccd86b57fd87c336"}},{"arxiv_id":"2004.06165","arxiv_id_is_arxiv":true,"paper":"/paper/oscar-object-semantics-aligned-pre-training","title":"Oscar: Object-Semantics Aligned Pre-training for Vision-Language Tasks","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milvlg/rosita","path":"rosita/modeling/pretrain_tasks/rosita.py","file_url":"https://github.com/milvlg/rosita/blob/HEAD/rosita/modeling/pretrain_tasks/rosita.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":"14d39fe285bd537f","code_sha256_prefix":"14d39fe285bd537f","mcp_get_code":{"code_sha256":"14d39fe285bd537f"}},{"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":"nuochenpku/sscl","path":"sscl/models.py","file_url":"https://github.com/nuochenpku/sscl/blob/HEAD/sscl/models.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":"084cdb52bc764df4","code_sha256_prefix":"084cdb52bc764df4","mcp_get_code":{"code_sha256":"084cdb52bc764df4"}},{"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":"jcyk/mse-amr","path":"simcse/models.py","file_url":"https://github.com/jcyk/mse-amr/blob/HEAD/simcse/models.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":"14d8220d0ad290ce","code_sha256_prefix":"14d8220d0ad290ce","mcp_get_code":{"code_sha256":"14d8220d0ad290ce"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/easyrec","path":"model.py","file_url":"https://github.com/hkuds/easyrec/blob/HEAD/model.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, hkuds/easyrec when it was checked","code_sha256":"dba0b61c9d62f82f","code_sha256_prefix":"dba0b61c9d62f82f","mcp_get_code":{"code_sha256":"dba0b61c9d62f82f"}}],"record_sha256":"4de72b78ee158796a150918b439ce1fd3752eb4f0d38400505a8a3d343eff9aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}