{"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-shape","entry":"get_shape","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":27,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":24,"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":25,"n_samples_ran":23,"n_samples_constructed":0,"n_samples_ran_checked":21,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":28,"n_places_pointer_only":9,"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":6,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":15,"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.11214","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11214","title":"HiEdit: Lifelong Model Editing with Hierarchical Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yangfanww/hiedit","path":"util.py","file_url":"https://github.com/yangfanww/hiedit/blob/HEAD/util.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, yangfanww/hiedit when it was checked","code_sha256":"b4e4936f917f7dda","code_sha256_prefix":"b4e4936f917f7dda","mcp_get_code":{"code_sha256":"b4e4936f917f7dda"}},{"arxiv_id":"2601.11441","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11441","title":"Hierarchical Orthogonal Residual Spread for Precise Massive Editing in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"XiaojieGu/HORSE","path":"editor/horse.py","file_url":"https://github.com/XiaojieGu/HORSE/blob/HEAD/editor/horse.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, XiaojieGu/HORSE when it was checked","code_sha256":"1f6059792bd3a490","code_sha256_prefix":"1f6059792bd3a490","mcp_get_code":{"code_sha256":"1f6059792bd3a490"}},{"arxiv_id":"2406.05027","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-automatic-differentiation-with","title":"Optimizing Automatic Differentiation with Deep Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamielohoff/alphagrad","path":"src/alphagrad/vertexgame/core.py","file_url":"https://github.com/jamielohoff/alphagrad/blob/HEAD/src/alphagrad/vertexgame/core.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27157b30c8cb1b83","code_sha256_prefix":"27157b30c8cb1b83","mcp_get_code":{"code_sha256":"27157b30c8cb1b83"}},{"arxiv_id":"2406.05027","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-automatic-differentiation-with","title":"Optimizing Automatic Differentiation with Deep Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamielohoff/graphax","path":"src/graphax/primitives/base.py","file_url":"https://github.com/jamielohoff/graphax/blob/HEAD/src/graphax/primitives/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cd542d5c5d2721c","code_sha256_prefix":"7cd542d5c5d2721c","mcp_get_code":{"code_sha256":"7cd542d5c5d2721c"}},{"arxiv_id":"2402.06559","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-es-gradient-free-planning-with","title":"Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous Driving and Zero-Shot Instruction Following","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhyang/diffusion-es","path":"nuplan-devkit/nuplan/database/maps_db/layer_dataset_ops.py","file_url":"https://github.com/bhyang/diffusion-es/blob/HEAD/nuplan-devkit/nuplan/database/maps_db/layer_dataset_ops.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, bhyang/diffusion-es when it was checked","code_sha256":"ba204edcf64da86e","code_sha256_prefix":"ba204edcf64da86e","mcp_get_code":{"code_sha256":"ba204edcf64da86e"}},{"arxiv_id":"2311.04661","arxiv_id_is_arxiv":true,"paper":"/paper/massive-editing-for-large-language-models-via","title":"Massive Editing for Large Language Models via Meta Learning","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenmientan/malmen","path":"util.py","file_url":"https://github.com/chenmientan/malmen/blob/HEAD/util.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, chenmientan/malmen when it was checked","code_sha256":"b4e4936f917f7dda","code_sha256_prefix":"b4e4936f917f7dda","mcp_get_code":{"code_sha256":"b4e4936f917f7dda"}},{"arxiv_id":"2311.12816","arxiv_id_is_arxiv":true,"paper":"/paper/evolution-of-convolutional-neural-network-cnn","title":"Evolution of Convolutional Neural Network (CNN): Compute vs Memory bandwidth for Edge AI","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyndwith/ONNX-CNN-compute-and-memory-bandwidth-for-EdgeAI","path":"onnx-mac/onnx-mac/onnx-compute.py","file_url":"https://github.com/cyndwith/ONNX-CNN-compute-and-memory-bandwidth-for-EdgeAI/blob/HEAD/onnx-mac/onnx-mac/onnx-compute.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, cyndwith/ONNX-CNN-compute-and-memory-bandwidth-for-EdgeAI when it was checked","code_sha256":"91fb668d0697b35b","code_sha256_prefix":"91fb668d0697b35b","mcp_get_code":{"code_sha256":"91fb668d0697b35b"}},{"arxiv_id":"2306.00986","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-self-guidance-for-controllable-1","title":"Diffusion Self-Guidance for Controllable Image Generation","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sainzerjj/Free-Guidance-Diffusion","path":"utils/guidance_functions.py","file_url":"https://github.com/Sainzerjj/Free-Guidance-Diffusion/blob/HEAD/utils/guidance_functions.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":"f5883886f2babf56","code_sha256_prefix":"f5883886f2babf56","mcp_get_code":{"code_sha256":"f5883886f2babf56"}},{"arxiv_id":"2301.13156","arxiv_id_is_arxiv":true,"paper":"/paper/seaformer-squeeze-enhanced-axial-transformer","title":"SeaFormer++: Squeeze-enhanced Axial Transformer for Mobile Visual Recognition","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-zvg/SeaFormer","path":"seaformer-cls/seaformer.py","file_url":"https://github.com/fudan-zvg/SeaFormer/blob/HEAD/seaformer-cls/seaformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, fudan-zvg/SeaFormer when it was checked","code_sha256":"ea3c9c759e695068","code_sha256_prefix":"ea3c9c759e695068","mcp_get_code":{"code_sha256":"ea3c9c759e695068"}},{"arxiv_id":"2211.13189","arxiv_id_is_arxiv":true,"paper":"/paper/asit-audio-spectrogram-vision-transformer-for","title":"ASiT: Local-Global Audio Spectrogram vIsion Transformer for Event Classification","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sara-ahmed/asit","path":"main_ASiT.py","file_url":"https://github.com/sara-ahmed/asit/blob/HEAD/main_ASiT.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, sara-ahmed/asit when it was checked","code_sha256":"d4bb4a1d0195095d","code_sha256_prefix":"d4bb4a1d0195095d","mcp_get_code":{"code_sha256":"d4bb4a1d0195095d"}},{"arxiv_id":"2208.02971","arxiv_id_is_arxiv":true,"paper":"/paper/croloss-towards-a-customizable-loss-for","title":"CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems","date":"2022-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WDdeBWT/CROLoss","path":"src/model.py","file_url":"https://github.com/WDdeBWT/CROLoss/blob/HEAD/src/model.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":"9b423c840f087475","code_sha256_prefix":"9b423c840f087475","mcp_get_code":{"code_sha256":"9b423c840f087475"}},{"arxiv_id":"2207.10988","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-object-counting-and-detection","title":"Few-shot Object Counting and Detection","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/Counting-DETR","path":"src/CountDETR_147_1st_stage/compute_flops_and_speeds.py","file_url":"https://github.com/VinAIResearch/Counting-DETR/blob/HEAD/src/CountDETR_147_1st_stage/compute_flops_and_speeds.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c68885935dfa85d","code_sha256_prefix":"4c68885935dfa85d","mcp_get_code":{"code_sha256":"4c68885935dfa85d"}},{"arxiv_id":"2205.01286","arxiv_id_is_arxiv":true,"paper":"/paper/when-multi-level-meets-multi-interest-a-multi","title":"When Multi-Level Meets Multi-Interest: A Multi-Grained Neural Model for Sequential Recommendation","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whuir/mgnm","path":"code/model.py","file_url":"https://github.com/whuir/mgnm/blob/HEAD/code/model.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":"9b423c840f087475","code_sha256_prefix":"9b423c840f087475","mcp_get_code":{"code_sha256":"9b423c840f087475"}},{"arxiv_id":"2108.01684","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformer-with-progressive-sampling","title":"Vision Transformer with Progressive Sampling","date":"2021-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuexy/PS-ViT","path":"utils/flop_count/jit_handles.py","file_url":"https://github.com/yuexy/PS-ViT/blob/HEAD/utils/flop_count/jit_handles.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":"653ac611901cfc1c","code_sha256_prefix":"653ac611901cfc1c","mcp_get_code":{"code_sha256":"653ac611901cfc1c"}},{"arxiv_id":"2103.12731","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-local-self-attention-for-parameter","title":"Scaling Local Self-Attention for Parameter Efficient Visual Backbones","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin-ssy/ViP","path":"utils/flop_count/jit_handles.py","file_url":"https://github.com/kevin-ssy/ViP/blob/HEAD/utils/flop_count/jit_handles.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":"653ac611901cfc1c","code_sha256_prefix":"653ac611901cfc1c","mcp_get_code":{"code_sha256":"653ac611901cfc1c"}},{"arxiv_id":"2010.02014","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-variational-auto-encoders-1","title":"Self-Supervised Variational Auto-Encoders","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ioangatop/srVAE","path":"src/utils/utils.py","file_url":"https://github.com/ioangatop/srVAE/blob/HEAD/src/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d3c9fe8bebf73b5","code_sha256_prefix":"9d3c9fe8bebf73b5","mcp_get_code":{"code_sha256":"9d3c9fe8bebf73b5"}},{"arxiv_id":"2007.10323","arxiv_id_is_arxiv":true,"paper":"/paper/pillar-based-object-detection-for-autonomous","title":"Pillar-based Object Detection for Autonomous Driving","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangYueFt/pillar-od","path":"tf_util.py","file_url":"https://github.com/WangYueFt/pillar-od/blob/HEAD/tf_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":"73717934286fbf5a","code_sha256_prefix":"73717934286fbf5a","mcp_get_code":{"code_sha256":"73717934286fbf5a"}},{"arxiv_id":"2006.06574","arxiv_id_is_arxiv":true,"paper":"/paper/dynamically-stable-infinite-width-limits-of","title":"Dynamically Stable Infinite-Width Limits of Neural Classifiers","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmipt/research","path":"Infinite_Width_Limits_of_Neural_Classifiers/utils/data_loaders.py","file_url":"https://github.com/deepmipt/research/blob/HEAD/Infinite_Width_Limits_of_Neural_Classifiers/utils/data_loaders.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":"ad72d8173724b09a","code_sha256_prefix":"ad72d8173724b09a","mcp_get_code":{"code_sha256":"ad72d8173724b09a"}},{"arxiv_id":"1905.10520","arxiv_id_is_arxiv":true,"paper":"/paper/6-dof-graspnet-variational-grasp-generation","title":"6-DOF GraspNet: Variational Grasp Generation for Object Manipulation","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/6dof-graspnet","path":"tf_utils.py","file_url":"https://github.com/NVlabs/6dof-graspnet/blob/HEAD/tf_utils.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, NVlabs/6dof-graspnet, 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":"e80d6f591a8400a8","code_sha256_prefix":"e80d6f591a8400a8","mcp_get_code":{"code_sha256":"e80d6f591a8400a8"}},{"arxiv_id":"1905.09432","arxiv_id_is_arxiv":true,"paper":"/paper/learning-discrete-and-continuous-factors-of","title":"Learning Discrete and Continuous Factors of Data via Alternating Disentanglement","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/DisentanglementICML19","path":"tfops/info_op.py","file_url":"https://github.com/snu-mllab/DisentanglementICML19/blob/HEAD/tfops/info_op.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":"e68c6f7c91f3ecc7","code_sha256_prefix":"e68c6f7c91f3ecc7","mcp_get_code":{"code_sha256":"e68c6f7c91f3ecc7"}},{"arxiv_id":"1904.05811","arxiv_id_is_arxiv":true,"paper":"/paper/relational-graph-attention-networks-1","title":"Relational Graph Attention Networks","date":"2019-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/rgat","path":"rgat/ops/math_ops.py","file_url":"https://github.com/Babylonpartners/rgat/blob/HEAD/rgat/ops/math_ops.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":"c4517c4403af4f37","code_sha256_prefix":"c4517c4403af4f37","mcp_get_code":{"code_sha256":"c4517c4403af4f37"}},{"arxiv_id":"1902.09145","arxiv_id_is_arxiv":true,"paper":"/paper/ddflow-learning-optical-flow-with-unlabeled","title":"DDFlow: Learning Optical Flow with Unlabeled Data Distillation","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ppliuboy/DDFlow","path":"network.py","file_url":"https://github.com/ppliuboy/DDFlow/blob/HEAD/network.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":"d60739445ab624e4","code_sha256_prefix":"d60739445ab624e4","mcp_get_code":{"code_sha256":"d60739445ab624e4"}},{"arxiv_id":"1901.01189","arxiv_id_is_arxiv":true,"paper":"/paper/learning-sound-event-classifiers-from-web","title":"Learning Sound Event Classifiers from Web Audio with Noisy Labels","date":"2019-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edufonseca/icassp19","path":"utils.py","file_url":"https://github.com/edufonseca/icassp19/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":"59f34ca772f3187c","code_sha256_prefix":"59f34ca772f3187c","mcp_get_code":{"code_sha256":"59f34ca772f3187c"}},{"arxiv_id":"1808.09560","arxiv_id_is_arxiv":true,"paper":"/paper/on-learning-3d-face-morphable-model-from-in","title":"On Learning 3D Face Morphable Model from In-the-wild Images","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tranluan/Nonlinear_Face_3DMM","path":"ops.py","file_url":"https://github.com/tranluan/Nonlinear_Face_3DMM/blob/HEAD/ops.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":"0bac2024ebaad067","code_sha256_prefix":"0bac2024ebaad067","mcp_get_code":{"code_sha256":"0bac2024ebaad067"}},{"arxiv_id":"1711.03058","arxiv_id_is_arxiv":true,"paper":"/paper/matrix-normal-models-for-fmri-analysis","title":"Matrix-normal models for fMRI analysis","date":"2017-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brainiak/brainiak","path":"src/brainiak/funcalign/fastsrm.py","file_url":"https://github.com/brainiak/brainiak/blob/HEAD/src/brainiak/funcalign/fastsrm.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":"3221b6c442f0d561","code_sha256_prefix":"3221b6c442f0d561","mcp_get_code":{"code_sha256":"3221b6c442f0d561"}},{"arxiv_id":"1612.01744","arxiv_id_is_arxiv":true,"paper":"/paper/listen-and-translate-a-proof-of-concept-for","title":"Listen and Translate: A Proof of Concept for End-to-End Speech-to-Text Translation","date":"2016-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eske/seq2seq","path":"translate/beam_search.py","file_url":"https://github.com/eske/seq2seq/blob/HEAD/translate/beam_search.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":"350b8500eef3645a","code_sha256_prefix":"350b8500eef3645a","mcp_get_code":{"code_sha256":"350b8500eef3645a"}},{"arxiv_id":"1604.06174","arxiv_id_is_arxiv":true,"paper":"/paper/training-deep-nets-with-sublinear-memory-cost","title":"Training Deep Nets with Sublinear Memory Cost","date":"2016-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AD1024/torch-checkpointing","path":"utils/checkpointing.py","file_url":"https://github.com/AD1024/torch-checkpointing/blob/HEAD/utils/checkpointing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AD1024/torch-checkpointing when it was checked","code_sha256":"f79b25e8e9f6d799","code_sha256_prefix":"f79b25e8e9f6d799","mcp_get_code":{"code_sha256":"f79b25e8e9f6d799"}},{"arxiv_id":"2024.findings-naacl.46","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-naacl.46","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"knalin55/LEEETs-Dial","path":"utils.py","file_url":"https://github.com/knalin55/LEEETs-Dial/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":"fc1235925bcd4653","code_sha256_prefix":"fc1235925bcd4653","mcp_get_code":{"code_sha256":"fc1235925bcd4653"}}],"record_sha256":"bee70a42b3bbbe894f4d5b545ab95b014a39ff61b4168e9fb9cc2ac0f98e952b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}