Home › Code › metric

metric

Syntologyentry name in harvested coderead from the graph 2026-09-24

metric appears in the code Syntology harvested for 14 papers, as 18 distinct code bodies found in 20 places (a place is one code body under one paper). At least one of them ran in 3 of the papers; 1 of the code bodies carries 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 metric 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 3 of the 18 distinct code bodies named metric; 15 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
1ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
2ran
15unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 3 of the 20 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 “fixture could not drive it” 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.

Papers

14 papers shown of 14, newest first; 20 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 2 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Hardware-Aware FP4 FlashAttention-4 added by Syntology 2026-09 (from id) MrHuff/fp4-fa4/results/fp4_fa4_unified_20260801/build_summary.py e5b3157e0edbda66 unverified Apache-2.0 (permissive)
Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Concepts added by Syntology 2026-05 (from id) goodfire-ai/arithmetic-wild/src/utils.py a66b49b30c54c8d3 ran no licence file found · pointer only
Graceful Forgetting in Generative Language Models 26 May 2025 rubickkcibur/LWF/dataset_processor/gsm8k.py 613767452ccfb987 unverified MIT (permissive)
Graceful Forgetting in Generative Language Models 26 May 2025 rubickkcibur/LWF/dataset_processor/gsm8k_es.py 0229ae5a5851afa2 unverified MIT (permissive)
Graceful Forgetting in Generative Language Models 26 May 2025 rubickkcibur/LWF/dataset_processor/gsm8k_it.py 30c7c57bcdd3cbfd unverified MIT (permissive)
Graceful Forgetting in Generative Language Models 26 May 2025 rubickkcibur/LWF/dataset_processor/gsm8k_tr.py a4dfc117d1bf8efc unverified MIT (permissive)
Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Compute 1 Apr 2025 jianhaochen-nju/modelswitch/src/Model_switch.py 1810436c16248ab1 unverified no licence file found · pointer only
Efficient Large-Scale Traffic Forecasting with Transformers: A Spatial Data Management Perspective 13 Dec 2024 lmissher/patchstg/lib/utils.py 5b230abb2d7a66c3 ran · violated contract fingerprinted MIT (permissive)
Efficient Large-Scale Traffic Forecasting with Transformers: A Spatial Data Management Perspective 13 Dec 2024 lmissher/stgnn/utils.py 1ba47a23adf07065 unverified MIT (permissive)
Accelerating Relative Entropy Coding with Space Partitioning 20 May 2024 cambridge-mlg/RECOMBINER/utils.py 9dfabc490a555cab ran MIT (permissive)
On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation 15 Jun 2023 tmlr-group/MC-GRA/MC-GRA/gaussian_parameterized.py ffdd100106716576 unverified MIT (permissive)
INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging 6 Feb 2023 Aminsheykh98/INCREASE-pytorch/utils.py 34ed646e464cadd0 unverified Unlicense (permissive)
INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging 6 Feb 2023 zhengchuanpan/increase/Beijing/INCREASE/utils.py 48ccda09903c4168 unverified Apache-2.0 (permissive)
INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging 6 Feb 2023 zhengchuanpan/increase/METR-LA/INCREASE/utils.py 6c6008cb92b19595 unverified Apache-2.0 (permissive)
Unsupervised Out-of-Domain Detection via Pre-trained Transformers 2 Jun 2021 rivercold/BERT-unsupervised-OOD/calculate_log.py 511013ffe412491c unverified MIT (permissive)
Enhanced Isotropy Maximization Loss: Seamless and High-Performance Out-of-Distribution Detection Simply Replacing the SoftMax Loss 30 May 2021 dlmacedo/entropic-out-of-distribution-detection/calculate_log.py b84ce30ecbbc77e4 unverified Apache-2.0 (permissive)
Detecting Out-of-Distribution Examples with In-distribution Examples and Gram Matrices 28 Dec 2019 VectorInstitute/gram-ood-detection/calculate_log.py 511013ffe412491c unverified no licence file found · pointer only
GMAN: A Graph Multi-Attention Network for Traffic Prediction 11 Nov 2019 zhengchuanpan/GMAN/METR/utils.py 1ba47a23adf07065 unverified Apache-2.0 (permissive)
Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling 4 Apr 2019 kingofspace0wzz/wae-rnf-lm/stochastic/flow.py ca442985ac3b7e16 unverified MIT (permissive)
arXiv:Tan_Neighbor_Relations_Matter_in_Video_Scene_Detection_CVPR_2024_paper ExMorgan-Alter/NeighborNet/metric.py d4023529d9e8bd06 unverified Apache-2.0 (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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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