{"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/create-batch","entry":"create_batch","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":12,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":11,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":12,"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":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":4,"unverified":5},"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":"2412.06134","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-and-mitigating-social-bias-for","title":"Evaluating and Mitigating Social Bias for Large Language Models in Open-ended Settings","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaoliu0914/LLM-Bias-Benchmark","path":"OpenAI_API.py","file_url":"https://github.com/zhaoliu0914/LLM-Bias-Benchmark/blob/HEAD/OpenAI_API.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, zhaoliu0914/LLM-Bias-Benchmark when it was checked","code_sha256":"99eb6c1b26fcc9ae","code_sha256_prefix":"99eb6c1b26fcc9ae","mcp_get_code":{"code_sha256":"99eb6c1b26fcc9ae"}},{"arxiv_id":"2410.09437","arxiv_id_is_arxiv":true,"paper":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pumpkin-co/mtl-lora","path":"mlora_evaluate.py","file_url":"https://github.com/pumpkin-co/mtl-lora/blob/HEAD/mlora_evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcba3394053b84cd","code_sha256_prefix":"dcba3394053b84cd","mcp_get_code":{"code_sha256":"dcba3394053b84cd"}},{"arxiv_id":"2407.14459","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification_large_graph/training_batch.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification_large_graph/training_batch.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, air029/polyformer when it was checked","code_sha256":"c92a4ce1dc31074e","code_sha256_prefix":"c92a4ce1dc31074e","mcp_get_code":{"code_sha256":"c92a4ce1dc31074e"}},{"arxiv_id":"2210.04001","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-waste-data-transfer-learning-to","title":"Don't Waste Data: Transfer Learning to Leverage All Data for Machine-Learnt Climate Model Emulation","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raghul-parthipan/dont_waste_data","path":"KS/helper.py","file_url":"https://github.com/raghul-parthipan/dont_waste_data/blob/HEAD/KS/helper.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":"1d1a44a5a1e1e848","code_sha256_prefix":"1d1a44a5a1e1e848","mcp_get_code":{"code_sha256":"1d1a44a5a1e1e848"}},{"arxiv_id":"2203.14814","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-parameterizations-better-modelling","title":"Using Probabilistic Machine Learning to Better Model Temporal Patterns in Parameterizations: a case study with the Lorenz 96 model","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raghul-parthipan/l96_rnn","path":"saved_models/rnn/models_for_full_dataset/helper.py","file_url":"https://github.com/raghul-parthipan/l96_rnn/blob/HEAD/saved_models/rnn/models_for_full_dataset/helper.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":"1d1a44a5a1e1e848","code_sha256_prefix":"1d1a44a5a1e1e848","mcp_get_code":{"code_sha256":"1d1a44a5a1e1e848"}},{"arxiv_id":"2111.03628","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-a-zoo-of-checkpoints-for-unseen","title":"Exploiting a Zoo of Checkpoints for Unseen Tasks","date":"2021-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baidu-research/task_space","path":"LMs/data.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/LMs/data.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":"de1977f4d2b883e3","code_sha256_prefix":"de1977f4d2b883e3","mcp_get_code":{"code_sha256":"de1977f4d2b883e3"}},{"arxiv_id":"1907.00481","arxiv_id_is_arxiv":true,"paper":"/paper/mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","path":"Graph_Classification.py","file_url":"https://github.com/FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling/blob/HEAD/Graph_Classification.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":"0de9bc2db1425653","code_sha256_prefix":"0de9bc2db1425653","mcp_get_code":{"code_sha256":"0de9bc2db1425653"}},{"arxiv_id":"1905.09591","arxiv_id_is_arxiv":true,"paper":"/paper/a-direct-approach-to-robust-deep-learning-1","title":"A Direct Approach to Robust Deep Learning Using Adversarial Networks","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whxbergkamp/RobustDL_GAN","path":"cifar10/adversarial_networks/inputs.py","file_url":"https://github.com/whxbergkamp/RobustDL_GAN/blob/HEAD/cifar10/adversarial_networks/inputs.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":"aba11452314b3900","code_sha256_prefix":"aba11452314b3900","mcp_get_code":{"code_sha256":"aba11452314b3900"}},{"arxiv_id":"1807.11176","arxiv_id_is_arxiv":true,"paper":"/paper/human-motion-analysis-with-deep-metric","title":"Human Motion Analysis with Deep Metric Learning","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhesenkamp/attentive-lstm","path":"util.py","file_url":"https://github.com/dhesenkamp/attentive-lstm/blob/HEAD/util.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":"dbe995781db97e28","code_sha256_prefix":"dbe995781db97e28","mcp_get_code":{"code_sha256":"dbe995781db97e28"}},{"arxiv_id":"1806.04330","arxiv_id_is_arxiv":true,"paper":"/paper/neural-network-models-for-paraphrase","title":"Neural Network Models for Paraphrase Identification, Semantic Textual Similarity, Natural Language Inference, and Question Answering","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanwuwei/SPM_toolkit","path":"DecAtt/main_mnli.py","file_url":"https://github.com/lanwuwei/SPM_toolkit/blob/HEAD/DecAtt/main_mnli.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, lanwuwei/SPM_toolkit when it was checked","code_sha256":"2468a208d1b1a074","code_sha256_prefix":"2468a208d1b1a074","mcp_get_code":{"code_sha256":"2468a208d1b1a074"}},{"arxiv_id":"1805.09313","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-speech-driven-facial-animation","title":"End-to-End Speech-Driven Facial Animation with Temporal GANs","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrashanthaTP/wav2mov","path":"wav2mov/inference/generate.py","file_url":"https://github.com/PrashanthaTP/wav2mov/blob/HEAD/wav2mov/inference/generate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PrashanthaTP/wav2mov when it was checked","code_sha256":"c1cc5ac84d39c69f","code_sha256_prefix":"c1cc5ac84d39c69f","mcp_get_code":{"code_sha256":"c1cc5ac84d39c69f"}},{"arxiv_id":"1411.4555","arxiv_id_is_arxiv":true,"paper":"/paper/show-and-tell-a-neural-image-caption","title":"Show and Tell: A Neural Image Caption Generator","date":"2014-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guptakhil12/show-tell","path":"utils.py","file_url":"https://github.com/guptakhil12/show-tell/blob/HEAD/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":"ed75cf97c296beab","code_sha256_prefix":"ed75cf97c296beab","mcp_get_code":{"code_sha256":"ed75cf97c296beab"}}],"record_sha256":"8da075d7c107e0cb320c080f9188b3409fc50e556c851b146f29e242aa5b21e1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}