Home › Code › process_input

process_input

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

process_input appears in the code Syntology harvested for 8 papers, as 8 distinct code bodies found in 10 places (a place is one code body under one paper). Of the 8 papers, 8 with a sample that ran: 4 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument. 3 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 process_input 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 8 distinct code bodies named process_input: 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 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:

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

Licence is a property of each copy, so it is counted per place: 2 of the 10 places are pointer only (Syntology does not serve that copy's text). 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

8 papers shown of 8, newest first; 10 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; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). 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
Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems 12 Dec 2024 RUCAIBox/Slow_Thinking_with_LLMs/STILL-3-TOOL/data_synthesis/coding_by_thinking.py 8a715d0671890763 ran · our draft was wrong no licence file found · pointer only
Can LLMs be Good Graph Judge for Knowledge Graph Construction? 26 Nov 2024 hhy-huang/graphjudge/graph_judger/bert_classifier_infer.py d47506b71865ea46 ran · our draft was wrong fingerprinted MIT (permissive)
Meaningful Learning: Enhancing Abstract Reasoning in Large Language Models via Generic Fact Guidance 14 Mar 2024 Waste-Wood/MeanLearn/reason_ppl.py 8461d5c9186434c7 ran · honoured contract no licence file found · pointer only
KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache 5 Feb 2024 jy-yuan/kivi/models/utils_quant.py d54a29178ce3203f ran fingerprinted MIT (permissive)
Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs 18 Jul 2022 jiaor17/3d-emgp/script/finetune_qm9.py 255d015f7e8d573c ran · our draft was wrong MIT (permissive)
Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs 18 Jul 2022 jiaor17/3d-emgp/script/finetune_md17.py 654a4b9e4afe14f4 ran · our draft was wrong MIT (permissive)
Residual Feature Distillation Network for Lightweight Image Super-Resolution 24 Sep 2020 tuvovan/RFDNet-ImageSuperResolution/utils.py e8527b9fdd187d26 ran fingerprinted MIT (permissive)
AAAI id aaai_25978 jiaor17/3D-EMGP/script/finetune_qm9.py 255d015f7e8d573c ran · our draft was wrong MIT (permissive)
AAAI id aaai_25978 jiaor17/3D-EMGP/script/finetune_md17.py 654a4b9e4afe14f4 ran · our draft was wrong MIT (permissive)
CVF open access id Li_MBQ_Modality-Balanced_Quantization_for_Large_Vision-Language_Models_CVPR_2025_paper thu-nics/MBQ/qmllm/methods/mbq/quantize/pre_quant.py 72644f3889bd62df 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