{"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/get-input","entry":"get_input","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":20,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":7,"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":18,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":10,"unverified":2},"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":"2604.20161","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20161","title":"SMART: A Spectral Transfer Approach to Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"boxinz17/smart","path":"simulation/run_SMART.py","file_url":"https://github.com/boxinz17/smart/blob/HEAD/simulation/run_SMART.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":"c011ef8168be1e6a","code_sha256_prefix":"c011ef8168be1e6a","mcp_get_code":{"code_sha256":"c011ef8168be1e6a"}},{"arxiv_id":"2604.15573","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15573","title":"Collaborative Filtering Through Weighted Similarities of User and Item Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"UFSCar-LaSID/weighted-sims-recommender","path":"src/parameters_handle.py","file_url":"https://github.com/UFSCar-LaSID/weighted-sims-recommender/blob/HEAD/src/parameters_handle.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":"3734594e31457cbb","code_sha256_prefix":"3734594e31457cbb","mcp_get_code":{"code_sha256":"3734594e31457cbb"}},{"arxiv_id":"2504.12939","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-polysemantic-channels-in","title":"Disentangling Polysemantic Channels in Convolutional Neural Networks","date":"2025-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/disentangle-channels","path":"disentangle_channel.py","file_url":"https://github.com/visinf/disentangle-channels/blob/HEAD/disentangle_channel.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, visinf/disentangle-channels when it was checked","code_sha256":"fb3704097288afa1","code_sha256_prefix":"fb3704097288afa1","mcp_get_code":{"code_sha256":"fb3704097288afa1"}},{"arxiv_id":"2410.21638","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-diffusion-models-for-improved-prompt","title":"Adapting Diffusion Models for Improved Prompt Compliance and Controllable Image Synthesis","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepakSridhar/fgdm","path":"controlnet/seg2image_inference.py","file_url":"https://github.com/DeepakSridhar/fgdm/blob/HEAD/controlnet/seg2image_inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, DeepakSridhar/fgdm (NOASSERTION)","code_sha256":"6d9f74466755a154","code_sha256_prefix":"6d9f74466755a154","mcp_get_code":{"code_sha256":"6d9f74466755a154"}},{"arxiv_id":"2406.07230","arxiv_id_is_arxiv":true,"paper":"/paper/needle-in-a-multimodal-haystack","title":"Needle In A Multimodal Haystack","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/mm-niah","path":"utils/tools.py","file_url":"https://github.com/opengvlab/mm-niah/blob/HEAD/utils/tools.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, opengvlab/mm-niah when it was checked","code_sha256":"d95b50a3f56470ad","code_sha256_prefix":"d95b50a3f56470ad","mcp_get_code":{"code_sha256":"d95b50a3f56470ad"}},{"arxiv_id":"2403.14312","arxiv_id_is_arxiv":true,"paper":"/paper/chainlm-empowering-large-language-models-with","title":"ChainLM: Empowering Large Language Models with Improved Chain-of-Thought Prompting","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/chainlm","path":"debate/debate4cot.py","file_url":"https://github.com/rucaibox/chainlm/blob/HEAD/debate/debate4cot.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, rucaibox/chainlm when it was checked","code_sha256":"9fecbd5be33d8972","code_sha256_prefix":"9fecbd5be33d8972","mcp_get_code":{"code_sha256":"9fecbd5be33d8972"}},{"arxiv_id":"2402.09963","arxiv_id_is_arxiv":true,"paper":"/paper/why-are-sensitive-functions-hard-for","title":"Why are Sensitive Functions Hard for Transformers?","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lacoco-lab/sensitivity-hardness","path":"src/measurements.py","file_url":"https://github.com/lacoco-lab/sensitivity-hardness/blob/HEAD/src/measurements.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":"adbaebf298f00696","code_sha256_prefix":"adbaebf298f00696","mcp_get_code":{"code_sha256":"adbaebf298f00696"}},{"arxiv_id":"2308.03349","arxiv_id_is_arxiv":true,"paper":"/paper/scigraphqa-a-large-scale-synthetic-multi-turn","title":"SciGraphQA: A Large-Scale Synthetic Multi-Turn Question-Answering Dataset for Scientific Graphs","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"findalexli/SciGraphQA","path":"data_parsing/convert_llavav2.py","file_url":"https://github.com/findalexli/SciGraphQA/blob/HEAD/data_parsing/convert_llavav2.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":"eaed632f8d6ec72b","code_sha256_prefix":"eaed632f8d6ec72b","mcp_get_code":{"code_sha256":"eaed632f8d6ec72b"}},{"arxiv_id":"2306.02371","arxiv_id_is_arxiv":true,"paper":"/paper/i-3-retriever-incorporating-implicit","title":"I^3 Retriever: Incorporating Implicit Interaction in Pre-trained Language Models for Passage Retrieval","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kylrth/procedure-generation","path":"dataset/champ.py","file_url":"https://github.com/kylrth/procedure-generation/blob/HEAD/dataset/champ.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":"ecbed2ce7f3a5dbe","code_sha256_prefix":"ecbed2ce7f3a5dbe","mcp_get_code":{"code_sha256":"ecbed2ce7f3a5dbe"}},{"arxiv_id":"2208.12306","arxiv_id_is_arxiv":true,"paper":"/paper/multimedia-generative-script-learning-for","title":"Multimedia Generative Script Learning for Task Planning","date":"2022-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EagleW/Multimedia-Generative-Script-Learning-for-Task-Planning","path":"wikihow_contrastive_data.py","file_url":"https://github.com/EagleW/Multimedia-Generative-Script-Learning-for-Task-Planning/blob/HEAD/wikihow_contrastive_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":"b739bbac3e47c758","code_sha256_prefix":"b739bbac3e47c758","mcp_get_code":{"code_sha256":"b739bbac3e47c758"}},{"arxiv_id":"2205.05131","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opennlg/openba-v2","path":"evaluation/ARC/template.py","file_url":"https://github.com/opennlg/openba-v2/blob/HEAD/evaluation/ARC/template.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":"5fd8991277f9c276","code_sha256_prefix":"5fd8991277f9c276","mcp_get_code":{"code_sha256":"5fd8991277f9c276"}},{"arxiv_id":"2204.02075","arxiv_id_is_arxiv":true,"paper":"/paper/complex-valued-autoencoders-for-object","title":"Complex-Valued Autoencoders for Object Discovery","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loewex/complexautoencoder","path":"codebase/utils/data_utils.py","file_url":"https://github.com/loewex/complexautoencoder/blob/HEAD/codebase/utils/data_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":"f588aa91f2172e0d","code_sha256_prefix":"f588aa91f2172e0d","mcp_get_code":{"code_sha256":"f588aa91f2172e0d"}},{"arxiv_id":"2111.04131","arxiv_id_is_arxiv":true,"paper":"/paper/plumber-diagnosing-and-removing-performance","title":"Plumber: Diagnosing and Removing Performance Bottlenecks in Machine Learning Data Pipelines","date":"2021-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkuchnik/plumbertensorflow","path":"configure.py","file_url":"https://github.com/mkuchnik/plumbertensorflow/blob/HEAD/configure.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":"e07e303581bd4892","code_sha256_prefix":"e07e303581bd4892","mcp_get_code":{"code_sha256":"e07e303581bd4892"}},{"arxiv_id":"2110.02442","arxiv_id_is_arxiv":true,"paper":"/paper/ponet-pooling-network-for-efficient-token","title":"PoNet: Pooling Network for Efficient Token Mixing in Long Sequences","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erksch/fnet-pytorch","path":"verify_conversion.py","file_url":"https://github.com/erksch/fnet-pytorch/blob/HEAD/verify_conversion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, erksch/fnet-pytorch, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5eccccd396511ac2","code_sha256_prefix":"5eccccd396511ac2","mcp_get_code":{"code_sha256":"5eccccd396511ac2"}},{"arxiv_id":"1902.00465","arxiv_id_is_arxiv":true,"paper":"/paper/tf-replicator-distributed-machine-learning","title":"TF-Replicator: Distributed Machine Learning for Researchers","date":"2019-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/community","path":"rfcs/20200624-pluggable-device-for-tensorflow/sample/configure.py","file_url":"https://github.com/tensorflow/community/blob/HEAD/rfcs/20200624-pluggable-device-for-tensorflow/sample/configure.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":"e07e303581bd4892","code_sha256_prefix":"e07e303581bd4892","mcp_get_code":{"code_sha256":"e07e303581bd4892"}},{"arxiv_id":"1809.03672","arxiv_id_is_arxiv":true,"paper":"/paper/deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kupuSs/DIEN-pipline","path":"data_process/feature_process_parallel.py","file_url":"https://github.com/kupuSs/DIEN-pipline/blob/HEAD/data_process/feature_process_parallel.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":"92cd6e35ce4dd619","code_sha256_prefix":"92cd6e35ce4dd619","mcp_get_code":{"code_sha256":"92cd6e35ce4dd619"}},{"arxiv_id":"1802.10062","arxiv_id_is_arxiv":true,"paper":"/paper/csrnet-dilated-convolutional-neural-networks","title":"CSRNet: Dilated Convolutional Neural Networks for Understanding the Highly Congested Scenes","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DiaoXY/CSRnet","path":"Model.py","file_url":"https://github.com/DiaoXY/CSRnet/blob/HEAD/Model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DiaoXY/CSRnet when it was checked","code_sha256":"70f82265ce8e8a4e","code_sha256_prefix":"70f82265ce8e8a4e","mcp_get_code":{"code_sha256":"70f82265ce8e8a4e"}},{"arxiv_id":"1605.08695","arxiv_id_is_arxiv":true,"paper":"/paper/tensorflow-a-system-for-large-scale-machine","title":"TensorFlow: A system for large-scale machine learning","date":"2016-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/tensorflow","path":"configure.py","file_url":"https://github.com/tensorflow/tensorflow/blob/HEAD/configure.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":"e07e303581bd4892","code_sha256_prefix":"e07e303581bd4892","mcp_get_code":{"code_sha256":"e07e303581bd4892"}},{"arxiv_id":"2022.acl-long.159","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.acl-long.159","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/CrossET","path":"src/source/function.py","file_url":"https://github.com/thunlp/CrossET/blob/HEAD/src/source/function.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":"6421077ceebf9a9d","code_sha256_prefix":"6421077ceebf9a9d","mcp_get_code":{"code_sha256":"6421077ceebf9a9d"}},{"arxiv_id":"136960462","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136960462 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"levymsn/CQA-CRCT","path":"Detector/extract_features.py","file_url":"https://github.com/levymsn/CQA-CRCT/blob/HEAD/Detector/extract_features.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":"4c2fad57f5285a05","code_sha256_prefix":"4c2fad57f5285a05","mcp_get_code":{"code_sha256":"4c2fad57f5285a05"}}],"record_sha256":"6bb38a63c332c702dfea7f1403ffb5406aa05c9d592b6170c275616116e1a2b6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}