Home › Code › sha256_file

sha256_file

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.

sha256_file appears in the code Syntology harvested for 21 papers, as 20 distinct code bodies found in 23 places (a place is one code body under one paper). Of the 21 papers, 20 with a sample that ran: 2 with a run with no instrument failure, 18 where every run was a failure of Syntology's instrument. 0 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 sha256_file 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 20 distinct code bodies named sha256_file: 18 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 16 where Syntology's instrument failed) · 2 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
16ran · our draft was wrong
0ran; the contract check could not run
2ran
2unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 7 of the 23 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

21 papers shown of 21, newest first; 23 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, and the graph's for 17 papers added by Syntology. 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
The MODA General Attribute Suite: A Four-Track Evaluation Benchmark for Fashion Attribute Extraction added by Syntology 2026-09 (from id) hopit-ai/Moda_ner/suite/catalog/score.py cb1f4090fbd1ecb5 ran · our draft was wrong MIT (permissive)
The MODA General Attribute Suite: A Four-Track Evaluation Benchmark for Fashion Attribute Extraction added by Syntology 2026-09 (from id) hopit-ai/Moda_ner/suite/_model/package.py c7c7dd1b82c44d4f ran · our draft was wrong MIT (permissive)
Hardware-Aware FP4 FlashAttention-4 added by Syntology 2026-09 (from id) MrHuff/fp4-fa4/results/fp4_fa4_technical_report_v2_20260819/export_llama8b_b4_snapshot.py cb1f4090fbd1ecb5 ran · our draft was wrong Apache-2.0 (permissive)
Learn from Whoever Is Right: Answer-Verified Multi-Teacher Distillation for Multi-Domain LLMs added by Syntology 2026-09 (from id) hexixiang/MT-SDPO/evaluation/evaluate.py 5ab684253f906180 ran · our draft was wrong Apache-2.0 (permissive)
When Does Information Sharing Improve Decentralized Discovery? Aggregation, Independent Rescue, and Equilibrium Selection added by Syntology 2026-09 (from id) yoheinakajima/distributed-discovery/src/distributed_discovery/agent_ops/core.py e87e452c60fef107 ran · our draft was wrong MIT (permissive)
LoopArena: Benchmarking Models as Runtime Controllers for Loop Engineering added by Syntology 2026-08 (from id) AMAP-ML/LoopArena/src/looparena/benchmarks/type3.py a8c21f6c4ada713e unverified Apache-2.0 (permissive)
Reconstructing the Right Episode: Evaluating Interleaved Conversational Memory Beyond Long Context added by Syntology 2026-08 (from id) LordTARN1SHED/SCALE-QA/supplementary/noise_assets/noise_io.py f103025411f50529 ran · our draft was wrong licence not identified · pointer only
A Feature-Major Codebook for Memory-Efficient Sparse-Binary Self-Organizing Maps: Scaling a MEDLINE Atlas to 1.05 Million Neurons on a Single Consumer GPU added by Syntology 2026-08 (from id) mongrolwarrior/sparsesom-paper1/pipeline/fetch_data.py 7b16c59a7518bdd5 ran · our draft was wrong MIT (permissive)
EviReform: Evidence-Guided Query Reformulation for Multi-Hop Graph Retrieval added by Syntology 2026-08 (from id) XrazyMee/EviReform/src/evireform/embeddings.py cb1f4090fbd1ecb5 ran · our draft was wrong Apache-2.0 (permissive)
Self-Normalized Inference for Constant-Stepsize Temporal-Difference Learning under Markovian Sampling added by Syntology 2026-08 (from id) MinZenggit/SN-TD/code/Experiments/garnet_policy_evaluation/io_utils.py 3b4b4b882b5a55cd ran · our draft was wrong no licence file found · pointer only
Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference added by Syntology 2026-08 (from id) burcgokden/PLDR-LLM-Math-Foundations/audit/audit_online_lib.py cd09bc0035d76c74 ran · our draft was wrong Apache-2.0 (permissive)
OpenPM: Auditable Point-in-Time Evaluation for LLM Portfolio-Management Agents added by Syntology 2026-08 (from id) aslcai/OpenPM-Bench/collectors/freeze.py 8862dc4ae1fa2b0f ran · our draft was wrong Apache-2.0 (permissive)
RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement added by Syntology 2026-07 (from id) evolvent-ai/RSIBench-Data/runner/lib/audit_agent_tamper.py cb1f4090fbd1ecb5 ran · our draft was wrong no licence file found · pointer only
q0: Primitives for Hyper-Epoch Pretraining added by Syntology 2026-06 (from id) qlabs-eng/slowrun/prepare_data.py 5569e16cd0139606 ran · our draft was wrong MIT (permissive)
Sandboxed Coding Agents are Competitive Omni-modal Task Solvers added by Syntology 2026-06 (from id) Dongping-Chen/OmniCoding/src/omnicoding/benchmarks/subsets.py 5789280e1f024de4 ran · our draft was wrong licence not identified · pointer only
Benchmarking Recursive-Collapse Warning Claims Under Matched False-Positive Control added by Syntology 2026-06 (from id) davidmullett/loopzero-paper-public/src/loopzero_paper/benchmarks/recommender/bridge_check.py d8fa2b5dd561cd7b ran · our draft was wrong Apache-2.0 (permissive)
MER-Bench: A Comprehensive Benchmark for Multimodal Meme Reappraisal added by Syntology 2026-03 (from id) one-seven17/MER-Bench/judge.py 653b01dee433dd03 ran · our draft was wrong no licence file found · pointer only
TML-bench: Benchmark for Data Science Agents on Tabular ML Tasks added by Syntology 2026-03 (from id) MykolaPinchuk/TML-bench/orchestrator/provenance.py 8d12fe7f3b8fd20d ran · our draft was wrong MIT (permissive)
TML-bench: Benchmark for Data Science Agents on Tabular ML Tasks added by Syntology 2026-03 (from id) MykolaPinchuk/TML-bench/orchestrator/hash_utils.py d106646067c3cd11 unverified MIT (permissive)
MathArena: Evaluating LLMs on Uncontaminated Math Competitions 29 May 2025 eth-sri/matharena/src/matharena/arxivmath_source.py 66fa4b8fdf3fcdfb ran MIT (permissive)
Minstrel: Structural Prompt Generation with Multi-Agents Coordination for Non-AI Experts 20 Sep 2024 sci-m-wang/minstrel/src/sideprofile/bundle.py 1933ce222ae6a0b8 ran · our draft was wrong no licence file found · pointer only
Robust Physics-based Deep MRI Reconstruction Via Diffusion Purification 11 Sep 2023 sjames40/adversarial-purification-for-mri/rodio_purify.py 3abeaeb495c8f003 ran · our draft was wrong no licence file found · pointer only
PointNeXt: Revisiting PointNet++ with Improved Training and Scaling Strategies 9 Jun 2022 guochengqian/pointnext/pointnext_official/checkpoints.py 7f2983739479f50d 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