Home › Code › running_mean

running_mean

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

running_mean appears in the code Syntology harvested for 13 papers, as 11 distinct code bodies found in 14 places (a place is one code body under one paper). Of the 13 papers, 13 with a sample that ran: 9 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument. 9 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named running_mean do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 11 distinct code bodies named running_mean: 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
4ran · our draft was wrong
0ran; the contract check could not run
7ran
0unverified
9fingerprinted

Licence is a property of each copy, so it is counted per place: 3 of the 14 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

13 papers shown of 13, newest first; 14 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity 2 Dec 2024 futureeeeee/mba/MAB/train_mab_mo_multiple.py 4c94fc4279f6ba53 ran · our draft was wrong fingerprinted Apache-2.0 (permissive)
Improving Generalization in Reinforcement Learning Training Regimes for Social Robot Navigation 29 Aug 2023 RAISE-Lab/soc-nav-training/CrowdNav/crowd_nav/utils/plot.py 36abda460d4a8430 ran fingerprinted MIT (permissive)
Discovering Object-Centric Generalized Value Functions From Pixels 27 Apr 2023 Somjit77/oc_gvfs/plot_curves.py 85a38e4dd9181aaf ran fingerprinted MIT (permissive)
Combining Physics and Deep Learning to learn Continuous-Time Dynamics Models 5 Oct 2021 milutter/deep_lagrangian_networks/figure_forward_model.py e213a81b3bb98d9d ran fingerprinted MIT (permissive)
Synthesizing Diverse and Physically Stable Grasps with Arbitrary Hand Structures using Differentiable Force Closure Estimator 2021-04 (from id) tengyu-liu/diverse-and-stable-grasp/thirdparty/DeepSDF/plot_log.py cb106f7ec939c277 ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only
IOS: Inter-Operator Scheduler for CNN Acceleration 2 Nov 2020 mit-han-lab/inter-operator-scheduler/experiments/utilization/draw_curve.py 2723d9fba66f72b5 ran fingerprinted MIT (permissive)
Counting Out Time: Class Agnostic Video Repetition Counting in the Wild 27 Jun 2020 confifu/RepNet-Pytorch/trainLoop.py cb106f7ec939c277 ran · our draft was wrong fingerprinted no licence file found · pointer only
Learning Molecular Dynamics with Simple Language Model built upon Long Short-Term Memory Neural Network 2020-04 (from id) Lina492375qW1188/LSTM-predict-MD/LSTM_LM_4s.py 9bafcd81eed9f77f ran · our draft was wrong fingerprinted no licence file found · pointer only
Learning Molecular Dynamics with Simple Language Model built upon Long Short-Term Memory Neural Network 2020-04 (from id) tiwarylab/LSTM-predict-MD/LSTM_LM_4s.py 6c3ab7e234b0f603 ran · our draft was wrong fingerprinted MIT (permissive)
Multi-Path Region Mining For Weakly Supervised 3D Semantic Segmentation on Point Clouds 29 Mar 2020 plusmultiply/mprm/plot_convergence_mprm.py 2e38027f9a1a89e6 ran fingerprinted MIT (permissive)
MinCall - MinION end2end convolutional deep learning basecaller 22 Apr 2019 nmiculinic/minion-basecaller/mincall/ops.py 463016aa90518207 ran MIT (permissive)
KPConv: Flexible and Deformable Convolution for Point Clouds 18 Apr 2019 HuguesTHOMAS/KPConv/plot_convergence.py 2e38027f9a1a89e6 ran fingerprinted MIT (permissive)
Crowd-Robot Interaction: Crowd-aware Robot Navigation with Attention-based Deep Reinforcement Learning 24 Sep 2018 vita-epfl/CrowdNav/crowd_nav/utils/plot.py 36abda460d4a8430 ran fingerprinted MIT (permissive)
Computation of optimal transport and related hedging problems via penalization and neural networks 23 Feb 2018 stephaneckstein/transport-and-related/FrechetHoeffding/Figure1.py 71fc580ec2a0a968 ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections