{"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/batch-to-device","entry":"batch_to_device","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":18,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":14,"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":14,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":10,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":4,"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":10,"ran_fixture":0,"ran":3,"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":"2510.00523","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-00523","title":"VIRTUE: Visual-Interactive Text-Image Universal Embedder","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"sony/virtue","path":"codes/src/utils.py","file_url":"https://github.com/sony/virtue/blob/HEAD/codes/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5210e1b5ee25838a","code_sha256_prefix":"5210e1b5ee25838a","mcp_get_code":{"code_sha256":"5210e1b5ee25838a"}},{"arxiv_id":"2505.11293","arxiv_id_is_arxiv":true,"paper":"/paper/2505-11293","title":"Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raghavlite/b3","path":"eval_mmeb.py","file_url":"https://github.com/raghavlite/b3/blob/HEAD/eval_mmeb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5210e1b5ee25838a","code_sha256_prefix":"5210e1b5ee25838a","mcp_get_code":{"code_sha256":"5210e1b5ee25838a"}},{"arxiv_id":"2502.12974","arxiv_id_is_arxiv":true,"paper":"/paper/learning-more-effective-representations-for","title":"Learning More Effective Representations for Dense Retrieval through Deliberate Thinking Before Search","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"74b280cb6a91117e","code_sha256_prefix":"74b280cb6a91117e","mcp_get_code":{"code_sha256":"74b280cb6a91117e"}},{"arxiv_id":"2410.10605","arxiv_id_is_arxiv":true,"paper":"/paper/boltzmann-priors-for-implicit-transfer","title":"Boltzmann priors for Implicit Transfer Operators","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"olsson-group/bopito","path":"bopito/utils/utils.py","file_url":"https://github.com/olsson-group/bopito/blob/HEAD/bopito/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"14f0e23d9b147a4c","code_sha256_prefix":"14f0e23d9b147a4c","mcp_get_code":{"code_sha256":"14f0e23d9b147a4c"}},{"arxiv_id":"2403.18684","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-laws-for-dense-retrieval","title":"Scaling Laws For Dense Retrieval","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingtaozhan/drscale","path":"modeling.py","file_url":"https://github.com/jingtaozhan/drscale/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"784e8a98f055bde0","code_sha256_prefix":"784e8a98f055bde0","mcp_get_code":{"code_sha256":"784e8a98f055bde0"}},{"arxiv_id":"2402.15449","arxiv_id_is_arxiv":true,"paper":"/paper/repetition-improves-language-model-embeddings","title":"Repetition Improves Language Model Embeddings","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"74b280cb6a91117e","code_sha256_prefix":"74b280cb6a91117e","mcp_get_code":{"code_sha256":"74b280cb6a91117e"}},{"arxiv_id":"2402.12908","arxiv_id_is_arxiv":true,"paper":"/paper/realcompo-dynamic-equilibrium-between-realism","title":"RealCompo: Balancing Realism and Compositionality Improves Text-to-Image Diffusion Models","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLing0818/RealCompo","path":"inference_layout.py","file_url":"https://github.com/YangLing0818/RealCompo/blob/HEAD/inference_layout.py","status":"unverified","verification_level":0,"contract_check":"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, YangLing0818/RealCompo when it was checked","code_sha256":"6e5276dc429a7d87","code_sha256_prefix":"6e5276dc429a7d87","mcp_get_code":{"code_sha256":"6e5276dc429a7d87"}},{"arxiv_id":"2402.09642","arxiv_id_is_arxiv":true,"paper":"/paper/answer-is-all-you-need-instruction-following","title":"Answer is All You Need: Instruction-following Text Embedding via Answering the Question","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhang-yu-wei/inbedder","path":"lm_encoders_hf/causallm_encoder_hf.py","file_url":"https://github.com/zhang-yu-wei/inbedder/blob/HEAD/lm_encoders_hf/causallm_encoder_hf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90710324cdd36fd8","code_sha256_prefix":"90710324cdd36fd8","mcp_get_code":{"code_sha256":"90710324cdd36fd8"}},{"arxiv_id":"2402.07226","arxiv_id_is_arxiv":true,"paper":"/paper/stitching-sub-trajectories-with-conditional","title":"Stitching Sub-Trajectories with Conditional Diffusion Model for Goal-Conditioned Offline RL","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlatjddbs/SSD","path":"dc/dc.py","file_url":"https://github.com/rlatjddbs/SSD/blob/HEAD/dc/dc.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, rlatjddbs/SSD when it was checked","code_sha256":"61a25fc7fbbca3a7","code_sha256_prefix":"61a25fc7fbbca3a7","mcp_get_code":{"code_sha256":"61a25fc7fbbca3a7"}},{"arxiv_id":"2402.03290","arxiv_id_is_arxiv":true,"paper":"/paper/instancediffusion-instance-level-control-for","title":"InstanceDiffusion: Instance-level Control for Image Generation","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frank-xwang/InstanceDiffusion","path":"dataset/jsondataset.py","file_url":"https://github.com/frank-xwang/InstanceDiffusion/blob/HEAD/dataset/jsondataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a31c83c41f11b71","code_sha256_prefix":"6a31c83c41f11b71","mcp_get_code":{"code_sha256":"6a31c83c41f11b71"}},{"arxiv_id":"2401.00368","arxiv_id_is_arxiv":true,"paper":"/paper/improving-text-embeddings-with-large-language","title":"Improving Text Embeddings with Large Language Models","date":"2023-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcgill-nlp/llm2vec","path":"llm2vec/llm2vec.py","file_url":"https://github.com/mcgill-nlp/llm2vec/blob/HEAD/llm2vec/llm2vec.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74b280cb6a91117e","code_sha256_prefix":"74b280cb6a91117e","mcp_get_code":{"code_sha256":"74b280cb6a91117e"}},{"arxiv_id":"2310.19427","arxiv_id_is_arxiv":true,"paper":"/paper/refining-diffusion-planner-for-reliable-1","title":"Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic Detection of Infeasible Plans","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leekwoon/rgg","path":"scripts/train_gap_predictor.py","file_url":"https://github.com/leekwoon/rgg/blob/HEAD/scripts/train_gap_predictor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf94ba8f107993a3","code_sha256_prefix":"cf94ba8f107993a3","mcp_get_code":{"code_sha256":"cf94ba8f107993a3"}},{"arxiv_id":"2306.13643","arxiv_id_is_arxiv":true,"paper":"/paper/lightglue-local-feature-matching-at-light","title":"LightGlue: Local Feature Matching at Light Speed","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvg/lightglue","path":"lightglue/utils.py","file_url":"https://github.com/cvg/lightglue/blob/HEAD/lightglue/utils.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":"80f11116ef08b1e5","code_sha256_prefix":"80f11116ef08b1e5","mcp_get_code":{"code_sha256":"80f11116ef08b1e5"}},{"arxiv_id":"2212.09741","arxiv_id_is_arxiv":true,"paper":"/paper/one-embedder-any-task-instruction-finetuned","title":"One Embedder, Any Task: Instruction-Finetuned Text Embeddings","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlang-ai/instructor-embedding","path":"InstructorEmbedding/instructor.py","file_url":"https://github.com/xlang-ai/instructor-embedding/blob/HEAD/InstructorEmbedding/instructor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f567def389222696","code_sha256_prefix":"f567def389222696","mcp_get_code":{"code_sha256":"f567def389222696"}},{"arxiv_id":"2209.06293","arxiv_id_is_arxiv":true,"paper":"/paper/do-androids-laugh-at-electric-sheep-humor","title":"Do Androids Laugh at Electric Sheep? Humor \"Understanding\" Benchmarks from The New Yorker Caption Contest","date":"2022-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmhessel/caption_contest_corpus","path":"clip/train_clip.py","file_url":"https://github.com/jmhessel/caption_contest_corpus/blob/HEAD/clip/train_clip.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a727742f777acc6a","code_sha256_prefix":"a727742f777acc6a","mcp_get_code":{"code_sha256":"a727742f777acc6a"}},{"arxiv_id":"2110.05789","arxiv_id_is_arxiv":true,"paper":"/paper/learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingtaozhan/JPQ","path":"jpq/model.py","file_url":"https://github.com/jingtaozhan/JPQ/blob/HEAD/jpq/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"784e8a98f055bde0","code_sha256_prefix":"784e8a98f055bde0","mcp_get_code":{"code_sha256":"784e8a98f055bde0"}},{"arxiv_id":"2005.13837","arxiv_id_is_arxiv":true,"paper":"/paper/generating-diverse-and-consistent-qa-pairs","title":"Generating Diverse and Consistent QA pairs from Contexts with Information-Maximizing Hierarchical Conditional VAEs","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seanie12/Info-HCVAE","path":"vae/utils.py","file_url":"https://github.com/seanie12/Info-HCVAE/blob/HEAD/vae/utils.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":"7cef89edf29127bc","code_sha256_prefix":"7cef89edf29127bc","mcp_get_code":{"code_sha256":"7cef89edf29127bc"}},{"arxiv_id":"1811.12823","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-sets-moses-a-benchmarking-platform","title":"Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Models","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molecularsets/moses","path":"moses/utils.py","file_url":"https://github.com/molecularsets/moses/blob/HEAD/moses/utils.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":"5915368a2b2e451a","code_sha256_prefix":"5915368a2b2e451a","mcp_get_code":{"code_sha256":"5915368a2b2e451a"}}],"record_sha256":"fd1645c2c25eb249e6a1f6adf0c581ed8d6d4a00233964ca5745c8022058297e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}