{"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/move-to-device","entry":"move_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":26,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":10,"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":24,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":12,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":27,"n_places_pointer_only":11,"n_places_pointer_only_link_open":2,"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":12,"ran_fixture":0,"ran":9,"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":"2609.13778","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13778","title":"GEAR: From Dynamic Encoding to Dynamic Activation in Social Trajectory Prediction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"11isnotavailable/GEAR","path":"Re_cp/qpid/utils.py","file_url":"https://github.com/11isnotavailable/GEAR/blob/HEAD/Re_cp/qpid/utils.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, 11isnotavailable/GEAR when it was checked","code_sha256":"6600eec470f09ce3","code_sha256_prefix":"6600eec470f09ce3","mcp_get_code":{"code_sha256":"6600eec470f09ce3"}},{"arxiv_id":"2608.19662","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-19662","title":"ReCache: Efficient KV Cache Reuse and Compression for Tool-Augmented LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"EIT-NLP/ReCache","path":"capsule/src/modeling_utils.py","file_url":"https://github.com/EIT-NLP/ReCache/blob/HEAD/capsule/src/modeling_utils.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, EIT-NLP/ReCache when it was checked","code_sha256":"b8a81a4b39c05cff","code_sha256_prefix":"b8a81a4b39c05cff","mcp_get_code":{"code_sha256":"b8a81a4b39c05cff"}},{"arxiv_id":"2608.05673","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05673","title":"A Unified Framework for Trajectory Prediction with Explicit Planning and Reaction Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"11isnotavailable/INTraJ","path":"qpid/utils.py","file_url":"https://github.com/11isnotavailable/INTraJ/blob/HEAD/qpid/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, 11isnotavailable/INTraJ, is not in the permissive set Syntology serves inline","code_sha256":"6600eec470f09ce3","code_sha256_prefix":"6600eec470f09ce3","mcp_get_code":{"code_sha256":"6600eec470f09ce3"}},{"arxiv_id":"2605.09570","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09570","title":"End-to-End Keyword Spotting on FPGA Using Graph Neural Networks with a Neuromorphic Auditory Sensor","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vision-agh/NAS-GNN-KWS","path":"SW/train_kws.py","file_url":"https://github.com/vision-agh/NAS-GNN-KWS/blob/HEAD/SW/train_kws.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":"9d92d45c0b4752f5","code_sha256_prefix":"9d92d45c0b4752f5","mcp_get_code":{"code_sha256":"9d92d45c0b4752f5"}},{"arxiv_id":"2605.09570","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09570","title":"End-to-End Keyword Spotting on FPGA Using Graph Neural Networks with a Neuromorphic Auditory Sensor","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vision-agh/NAS-GNN-KWS","path":"SW/train_rec.py","file_url":"https://github.com/vision-agh/NAS-GNN-KWS/blob/HEAD/SW/train_rec.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":"f2d5d6f602a2b8eb","code_sha256_prefix":"f2d5d6f602a2b8eb","mcp_get_code":{"code_sha256":"f2d5d6f602a2b8eb"}},{"arxiv_id":"2604.27833","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27833","title":"Taming Noise-Induced Prototype Degradation for Privacy-Preserving Personalized Federated Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yuCoryx/ProtoPFL_VPDR","path":"utils/tools.py","file_url":"https://github.com/yuCoryx/ProtoPFL_VPDR/blob/HEAD/utils/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, yuCoryx/ProtoPFL_VPDR when it was checked","code_sha256":"ee12522f22589e28","code_sha256_prefix":"ee12522f22589e28","mcp_get_code":{"code_sha256":"ee12522f22589e28"}},{"arxiv_id":"2602.11543","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11543","title":"Pretraining A Large Language Model using Distributed GPUs: A Memory-Efficient Decentralized Paradigm","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"zjr2000/SPES","path":"spes/torch_util.py","file_url":"https://github.com/zjr2000/SPES/blob/HEAD/spes/torch_util.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":"cf6326784961806a","code_sha256_prefix":"cf6326784961806a","mcp_get_code":{"code_sha256":"cf6326784961806a"}},{"arxiv_id":"2512.01199","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-01199","title":"Know Thyself by Knowing Others: Learning Neuron Identity from Population Context","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"nerdslab/nuclr","path":"src/utils.py","file_url":"https://github.com/nerdslab/nuclr/blob/HEAD/src/utils.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":"d3e06e6b95245c02","code_sha256_prefix":"d3e06e6b95245c02","mcp_get_code":{"code_sha256":"d3e06e6b95245c02"}},{"arxiv_id":"2501.00656","arxiv_id_is_arxiv":true,"paper":"/paper/2-olmo-2-furious","title":"2 OLMo 2 Furious","date":"2024-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/OLMo-core","path":"src/olmo_core/utils.py","file_url":"https://github.com/allenai/OLMo-core/blob/HEAD/src/olmo_core/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":"efa5007ea3ca9d06","code_sha256_prefix":"efa5007ea3ca9d06","mcp_get_code":{"code_sha256":"efa5007ea3ca9d06"}},{"arxiv_id":"2412.19417","arxiv_id_is_arxiv":true,"paper":"/paper/kalahash-knowledge-anchored-low-resource","title":"KALAHash: Knowledge-Anchored Low-Resource Adaptation for Deep Hashing","date":"2024-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tree-Shu-Zhao/KALAHash.pytorch","path":"src/engine/trainer.py","file_url":"https://github.com/Tree-Shu-Zhao/KALAHash.pytorch/blob/HEAD/src/engine/trainer.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":"02675a73c17af331","code_sha256_prefix":"02675a73c17af331","mcp_get_code":{"code_sha256":"02675a73c17af331"}},{"arxiv_id":"2412.12974","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-eraser-unleashing-diffusion-model-s","title":"Attentive Eraser: Unleashing Diffusion Model's Object Removal Potential via Self-Attention Redirection Guidance","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonym0u3/attentiveeraser","path":"evaluation/lpips_score.py","file_url":"https://github.com/anonym0u3/attentiveeraser/blob/HEAD/evaluation/lpips_score.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":"b30cecbde78e6922","code_sha256_prefix":"b30cecbde78e6922","mcp_get_code":{"code_sha256":"b30cecbde78e6922"}},{"arxiv_id":"2411.10293","arxiv_id_is_arxiv":true,"paper":"/paper/retr-multi-view-radar-detection-transformer","title":"RETR: Multi-View Radar Detection Transformer for Indoor Perception","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"merlresearch/radar-detection-transformer","path":"src/utils/common.py","file_url":"https://github.com/merlresearch/radar-detection-transformer/blob/HEAD/src/utils/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, merlresearch/radar-detection-transformer, is not in the permissive set Syntology serves inline","code_sha256":"e8c43965d954203e","code_sha256_prefix":"e8c43965d954203e","mcp_get_code":{"code_sha256":"e8c43965d954203e"}},{"arxiv_id":"2411.06390","arxiv_id_is_arxiv":true,"paper":"/paper/splatformer-point-transformer-for-robust-3d","title":"SplatFormer: Point Transformer for Robust 3D Gaussian Splatting","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenYutongTHU/SplatFormer","path":"utils/gpu_utils.py","file_url":"https://github.com/ChenYutongTHU/SplatFormer/blob/HEAD/utils/gpu_utils.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, ChenYutongTHU/SplatFormer when it was checked","code_sha256":"597b0fba263e2c4c","code_sha256_prefix":"597b0fba263e2c4c","mcp_get_code":{"code_sha256":"597b0fba263e2c4c"}},{"arxiv_id":"2410.20779","arxiv_id_is_arxiv":true,"paper":"/paper/decoding-reading-goals-from-eye-movements","title":"Decoding Reading Goals from Eye Movements","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lacclab/Goal-Decoding-from-Eye-Movements","path":"src/external_features_extractor.py","file_url":"https://github.com/lacclab/Goal-Decoding-from-Eye-Movements/blob/HEAD/src/external_features_extractor.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":"8a0aa5974a9b40a1","code_sha256_prefix":"8a0aa5974a9b40a1","mcp_get_code":{"code_sha256":"8a0aa5974a9b40a1"}},{"arxiv_id":"2409.05591","arxiv_id_is_arxiv":true,"paper":"/paper/memorag-moving-towards-next-gen-rag-via","title":"MemoRAG: Moving towards Next-Gen RAG Via Memory-Inspired Knowledge Discovery","date":"2024-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhjqhj00/memorag","path":"train/src/modeling_utils.py","file_url":"https://github.com/qhjqhj00/memorag/blob/HEAD/train/src/modeling_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from EIT-NLP/ReCache, and GitHub detected no licence in that repository when it was checked","code_sha256":"b8a81a4b39c05cff","code_sha256_prefix":"b8a81a4b39c05cff","mcp_get_code":{"code_sha256":"b8a81a4b39c05cff"}},{"arxiv_id":"2408.12578","arxiv_id_is_arxiv":true,"paper":"/paper/a-percolation-model-of-emergence-analyzing","title":"A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekdeepslubana/conceptpercolation","path":"utils/optimizer.py","file_url":"https://github.com/ekdeepslubana/conceptpercolation/blob/HEAD/utils/optimizer.py","status":"ran_draft_wrong","verification_level":1,"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, ekdeepslubana/conceptpercolation when it was checked","code_sha256":"24269a87e2a91c2b","code_sha256_prefix":"24269a87e2a91c2b","mcp_get_code":{"code_sha256":"24269a87e2a91c2b"}},{"arxiv_id":"2404.03118","arxiv_id_is_arxiv":true,"paper":"/paper/lvlm-intrepret-an-interpretability-tool-for","title":"LVLM-Interpret: An Interpretability Tool for Large Vision-Language Models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IntelLabs/lvlm-interpret","path":"utils_attn.py","file_url":"https://github.com/IntelLabs/lvlm-interpret/blob/HEAD/utils_attn.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":"309bc258636e0fd3","code_sha256_prefix":"309bc258636e0fd3","mcp_get_code":{"code_sha256":"309bc258636e0fd3"}},{"arxiv_id":"2403.17601","arxiv_id_is_arxiv":true,"paper":"/paper/lasil-learner-aware-supervised-imitation","title":"LASIL: Learner-Aware Supervised Imitation Learning For Long-term Microscopic Traffic Simulation","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kguo-cs/lsail","path":"evaluate/Pneuma_simulator.py","file_url":"https://github.com/kguo-cs/lsail/blob/HEAD/evaluate/Pneuma_simulator.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, kguo-cs/lsail when it was checked","code_sha256":"26656a8d60413006","code_sha256_prefix":"26656a8d60413006","mcp_get_code":{"code_sha256":"26656a8d60413006"}},{"arxiv_id":"2403.03516","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-multilingual-dense-retrieval-via","title":"Unsupervised Multilingual Dense Retrieval via Generative Pseudo Labeling","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MiuLab/UMR","path":"dpr/utils/model_utils.py","file_url":"https://github.com/MiuLab/UMR/blob/HEAD/dpr/utils/model_utils.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, MiuLab/UMR when it was checked","code_sha256":"5ef6dc01ca2773cb","code_sha256_prefix":"5ef6dc01ca2773cb","mcp_get_code":{"code_sha256":"5ef6dc01ca2773cb"}},{"arxiv_id":"2310.18685","arxiv_id_is_arxiv":true,"paper":"/paper/when-reviewers-lock-horn-finding-disagreement","title":"When Reviewers Lock Horn: Finding Disagreement in Scientific Peer Reviews","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sandeep82945/contradiction-in-peer-review","path":"src/flint/data_utils/batchbuilder.py","file_url":"https://github.com/sandeep82945/contradiction-in-peer-review/blob/HEAD/src/flint/data_utils/batchbuilder.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":"7ebeb1ae8084fb58","code_sha256_prefix":"7ebeb1ae8084fb58","mcp_get_code":{"code_sha256":"7ebeb1ae8084fb58"}},{"arxiv_id":"2310.07707","arxiv_id_is_arxiv":true,"paper":"/paper/matformer-nested-transformer-for-elastic","title":"MatFormer: Nested Transformer for Elastic Inference","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RAIVNLab/MatFormer-OLMo","path":"olmo/util.py","file_url":"https://github.com/RAIVNLab/MatFormer-OLMo/blob/HEAD/olmo/util.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":"ff37eb2ce67445b2","code_sha256_prefix":"ff37eb2ce67445b2","mcp_get_code":{"code_sha256":"ff37eb2ce67445b2"}},{"arxiv_id":"2205.09843","arxiv_id_is_arxiv":true,"paper":"/paper/table-retrieval-may-not-necessitate-table","title":"Table Retrieval May Not Necessitate Table-specific Model Design","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zorazrw/nqt-retrieval","path":"dpr/utils/model_utils.py","file_url":"https://github.com/zorazrw/nqt-retrieval/blob/HEAD/dpr/utils/model_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from MiuLab/UMR, and GitHub detected no licence in that repository when it was checked","code_sha256":"5ef6dc01ca2773cb","code_sha256_prefix":"5ef6dc01ca2773cb","mcp_get_code":{"code_sha256":"5ef6dc01ca2773cb"}},{"arxiv_id":"2204.11205","arxiv_id_is_arxiv":true,"paper":"/paper/epida-an-easy-plug-in-data-augmentation","title":"EPiDA: An Easy Plug-in Data Augmentation Framework for High Performance Text Classification","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaominyiz/EPiDA","path":"train_irony_epida_eda.py","file_url":"https://github.com/zhaominyiz/EPiDA/blob/HEAD/train_irony_epida_eda.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":"8df75b97b2ebb4b3","code_sha256_prefix":"8df75b97b2ebb4b3","mcp_get_code":{"code_sha256":"8df75b97b2ebb4b3"}},{"arxiv_id":"2004.05572","arxiv_id_is_arxiv":true,"paper":"/paper/amr-parsing-via-graph-sequence-iterative","title":"AMR Parsing via Graph-Sequence Iterative Inference","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjascob/amrlib","path":"amrlib/models/parse_gsii/modules/parser.py","file_url":"https://github.com/bjascob/amrlib/blob/HEAD/amrlib/models/parse_gsii/modules/parser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d1d752263773f70","code_sha256_prefix":"9d1d752263773f70","mcp_get_code":{"code_sha256":"9d1d752263773f70"}},{"arxiv_id":"2001.04385","arxiv_id_is_arxiv":true,"paper":"/paper/universal-differential-equations-for","title":"Universal Differential Equations for Scientific Machine Learning","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"titu1994/tfdiffeq","path":"tfdiffeq/misc.py","file_url":"https://github.com/titu1994/tfdiffeq/blob/HEAD/tfdiffeq/misc.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":"1a2ad061fa86d387","code_sha256_prefix":"1a2ad061fa86d387","mcp_get_code":{"code_sha256":"1a2ad061fa86d387"}},{"arxiv_id":"1911.04070","arxiv_id_is_arxiv":true,"paper":"/paper/bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzh119/BPT","path":"modules/beam.py","file_url":"https://github.com/yzh119/BPT/blob/HEAD/modules/beam.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":"6f00f4844df2c25b","code_sha256_prefix":"6f00f4844df2c25b","mcp_get_code":{"code_sha256":"6f00f4844df2c25b"}},{"arxiv_id":"2024.findings-acl.933","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.933","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AutoGPTQ/AutoGPTQ","path":"auto_gptq/modeling/_utils.py","file_url":"https://github.com/AutoGPTQ/AutoGPTQ/blob/HEAD/auto_gptq/modeling/_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":"42b4043dab27302d","code_sha256_prefix":"42b4043dab27302d","mcp_get_code":{"code_sha256":"42b4043dab27302d"}}],"record_sha256":"8a5f30b9950680c6d5a864ed552d683432e4fe5a6be81f66c89c05dd0962a79f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}