{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/preprocess-batch","entry":"preprocess_batch","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2410.20286","paper":"/paper/quam-adaptive-retrieval-through-query","title":"Quam: Adaptive Retrieval through Query Affinity Modelling","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mandeep-Rathee/quam","path":"laff.py","file_url":"https://github.com/Mandeep-Rathee/quam/blob/HEAD/laff.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0e0005ea58d48f70","mcp_get_code":{"code_sha256":"0e0005ea58d48f70"}},{"arxiv_id":"2408.06993","paper":"/paper/llms-can-schedule","title":"LLMs can Schedule","date":"2024-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"starjob42/datasetjsp","path":"utils/data_preprocessing.py","file_url":"https://github.com/starjob42/datasetjsp/blob/HEAD/utils/data_preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65a6a91fb732b1b9","mcp_get_code":{"code_sha256":"65a6a91fb732b1b9"}},{"arxiv_id":"2403.09605","paper":"/paper/counterfactual-contrastive-learning-robust","title":"Counterfactual contrastive learning: robust representations via causal image synthesis","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/counterfactual-contrastive","path":"causal_models/trainer.py","file_url":"https://github.com/biomedia-mira/counterfactual-contrastive/blob/HEAD/causal_models/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad5fda5f07b480d3","mcp_get_code":{"code_sha256":"ad5fda5f07b480d3"}},{"arxiv_id":"2111.05986","paper":"/paper/symetric-measuring-the-quality-of-learnt","title":"SyMetric: Measuring the Quality of Learnt Hamiltonian Dynamics Inferred from Vision","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/dm_hamiltonian_dynamics_suite","path":"dm_hamiltonian_dynamics_suite/load_datasets.py","file_url":"https://github.com/deepmind/dm_hamiltonian_dynamics_suite/blob/HEAD/dm_hamiltonian_dynamics_suite/load_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7673211f515f6a00","mcp_get_code":{"code_sha256":"7673211f515f6a00"}},{"arxiv_id":"2003.11618","paper":"/paper/violin-a-large-scale-dataset-for-video-and","title":"VIOLIN: A Large-Scale Dataset for Video-and-Language Inference","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmy646/violin","path":"violin_dataset.py","file_url":"https://github.com/jimmy646/violin/blob/HEAD/violin_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef63a3f42a6e6f4f","mcp_get_code":{"code_sha256":"ef63a3f42a6e6f4f"}},{"arxiv_id":"1308.0850","paper":"/paper/generating-sequences-with-recurrent-neural","title":"Generating Sequences With Recurrent Neural Networks","date":"2013-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vrushank264/Handwriting-Generation-using-LSTM","path":"data.py","file_url":"https://github.com/Vrushank264/Handwriting-Generation-using-LSTM/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c794567624eca063","mcp_get_code":{"code_sha256":"c794567624eca063"}}]}