{"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/running-mean","entry":"running_mean","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":13,"n_papers_ran":6,"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":5,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":1,"unverified":6},"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.01572","paper":"/paper/mba-rag-a-bandit-approach-for-adaptive","title":"MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futureeeeee/mba","path":"MAB/train_mab_mo_multiple.py","file_url":"https://github.com/futureeeeee/mba/blob/HEAD/MAB/train_mab_mo_multiple.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4c94fc4279f6ba53","mcp_get_code":{"code_sha256":"4c94fc4279f6ba53"}},{"arxiv_id":"2308.14947","paper":"/paper/improving-reinforcement-learning-training","title":"Improving Generalization in Reinforcement Learning Training Regimes for Social Robot Navigation","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RAISE-Lab/soc-nav-training","path":"CrowdNav/crowd_nav/utils/plot.py","file_url":"https://github.com/RAISE-Lab/soc-nav-training/blob/HEAD/CrowdNav/crowd_nav/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36abda460d4a8430","mcp_get_code":{"code_sha256":"36abda460d4a8430"}},{"arxiv_id":"2304.13892","paper":"/paper/discovering-object-centric-generalized-value","title":"Discovering Object-Centric Generalized Value Functions From Pixels","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Somjit77/oc_gvfs","path":"plot_curves.py","file_url":"https://github.com/Somjit77/oc_gvfs/blob/HEAD/plot_curves.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"85a38e4dd9181aaf","mcp_get_code":{"code_sha256":"85a38e4dd9181aaf"}},{"arxiv_id":"2110.01894","paper":"/paper/combining-physics-and-deep-learning-to-learn","title":"Combining Physics and Deep Learning to learn Continuous-Time Dynamics Models","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milutter/deep_lagrangian_networks","path":"figure_forward_model.py","file_url":"https://github.com/milutter/deep_lagrangian_networks/blob/HEAD/figure_forward_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e213a81b3bb98d9d","mcp_get_code":{"code_sha256":"e213a81b3bb98d9d"}},{"arxiv_id":"2104.09194","paper":"/paper/synthesizing-diverse-and-physically-stable","title":"Synthesizing Diverse and Physically Stable Grasps with Arbitrary Hand Structures using Differentiable Force Closure Estimator","date":null,"month_inferred_from_arxiv_id":"2021-04","title_source":"archive","repo":"tengyu-liu/diverse-and-stable-grasp","path":"thirdparty/DeepSDF/plot_log.py","file_url":"https://github.com/tengyu-liu/diverse-and-stable-grasp/blob/HEAD/thirdparty/DeepSDF/plot_log.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb106f7ec939c277","mcp_get_code":{"code_sha256":"cb106f7ec939c277"}},{"arxiv_id":"2011.01302","paper":"/paper/ios-inter-operator-scheduler-for-cnn","title":"IOS: Inter-Operator Scheduler for CNN Acceleration","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/inter-operator-scheduler","path":"experiments/utilization/draw_curve.py","file_url":"https://github.com/mit-han-lab/inter-operator-scheduler/blob/HEAD/experiments/utilization/draw_curve.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2723d9fba66f72b5","mcp_get_code":{"code_sha256":"2723d9fba66f72b5"}},{"arxiv_id":"2006.15418","paper":"/paper/counting-out-time-class-agnostic-video-1","title":"Counting Out Time: Class Agnostic Video Repetition Counting in the Wild","date":"2020-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"confifu/RepNet-Pytorch","path":"trainLoop.py","file_url":"https://github.com/confifu/RepNet-Pytorch/blob/HEAD/trainLoop.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cb106f7ec939c277","mcp_get_code":{"code_sha256":"cb106f7ec939c277"}},{"arxiv_id":"2004.12360","paper":"/paper/learning-molecular-dynamics-with-simple","title":"Learning Molecular Dynamics with Simple Language Model built upon Long Short-Term Memory Neural Network","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"Lina492375qW1188/LSTM-predict-MD","path":"LSTM_LM_4s.py","file_url":"https://github.com/Lina492375qW1188/LSTM-predict-MD/blob/HEAD/LSTM_LM_4s.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9bafcd81eed9f77f","mcp_get_code":{"code_sha256":"9bafcd81eed9f77f"}},{"arxiv_id":"2004.12360","paper":"/paper/learning-molecular-dynamics-with-simple","title":"Learning Molecular Dynamics with Simple Language Model built upon Long Short-Term Memory Neural Network","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"tiwarylab/LSTM-predict-MD","path":"LSTM_LM_4s.py","file_url":"https://github.com/tiwarylab/LSTM-predict-MD/blob/HEAD/LSTM_LM_4s.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c3ab7e234b0f603","mcp_get_code":{"code_sha256":"6c3ab7e234b0f603"}},{"arxiv_id":"2003.13035","paper":"/paper/multi-path-region-mining-for-weakly","title":"Multi-Path Region Mining For Weakly Supervised 3D Semantic Segmentation on Point Clouds","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plusmultiply/mprm","path":"plot_convergence_mprm.py","file_url":"https://github.com/plusmultiply/mprm/blob/HEAD/plot_convergence_mprm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e38027f9a1a89e6","mcp_get_code":{"code_sha256":"2e38027f9a1a89e6"}},{"arxiv_id":"1904.10337","paper":"/paper/mincall-minion-end2end-convolutional-deep","title":"MinCall - MinION end2end convolutional deep learning basecaller","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmiculinic/minion-basecaller","path":"mincall/ops.py","file_url":"https://github.com/nmiculinic/minion-basecaller/blob/HEAD/mincall/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"463016aa90518207","mcp_get_code":{"code_sha256":"463016aa90518207"}},{"arxiv_id":"1904.08889","paper":"/paper/kpconv-flexible-and-deformable-convolution","title":"KPConv: Flexible and Deformable Convolution for Point Clouds","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HuguesTHOMAS/KPConv","path":"plot_convergence.py","file_url":"https://github.com/HuguesTHOMAS/KPConv/blob/HEAD/plot_convergence.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e38027f9a1a89e6","mcp_get_code":{"code_sha256":"2e38027f9a1a89e6"}},{"arxiv_id":"1809.08835","paper":"/paper/crowd-robot-interaction-crowd-aware-robot","title":"Crowd-Robot Interaction: Crowd-aware Robot Navigation with Attention-based Deep Reinforcement Learning","date":"2018-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/CrowdNav","path":"crowd_nav/utils/plot.py","file_url":"https://github.com/vita-epfl/CrowdNav/blob/HEAD/crowd_nav/utils/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36abda460d4a8430","mcp_get_code":{"code_sha256":"36abda460d4a8430"}},{"arxiv_id":"1802.08539","paper":"/paper/computation-of-optimal-transport-and-related","title":"Computation of optimal transport and related hedging problems via penalization and neural networks","date":"2018-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephaneckstein/transport-and-related","path":"FrechetHoeffding/Figure1.py","file_url":"https://github.com/stephaneckstein/transport-and-related/blob/HEAD/FrechetHoeffding/Figure1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71fc580ec2a0a968","mcp_get_code":{"code_sha256":"71fc580ec2a0a968"}}]}