Home › Code › get_scores

get_scores

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.

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

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

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

22 papers shown of 22, 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 3 papers added by Syntology; 1 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
Laplace Approximation for Bayesian Tensor Network Kernel Machines added by Syntology 2026-04 (from id) AlbMLpy/laplace-tnkm/source/models/LaplaceCPR.py bbbbd8c608bbaa0e unverified MIT (permissive)
Temporal Conflicts in LLMs: Reproducibility Insights from Unifying DYNAMICQA and MULAN added by Syntology 2026-03 (from id) terrierteam/temporal_conflicts/fact_mutability/bkp_inference.py 2a6131b16a998443 unverified no licence file found · pointer only
Mitigating the Safety Alignment Tax with Null-Space Constrained Policy Optimization added by Syntology 2025-12 (from id) ivanniu/NSPO/script/safe_reward.py 6d129731f3e8f3a7 ran · honoured contract no licence file found · pointer only
FactCG: Enhancing Fact Checkers with Graph-Based Multi-Hop Data 28 Jan 2025 derenlei/FactCG/benchmark.py c1798c50ae7165bb ran MIT (permissive)
FactCG: Enhancing Fact Checkers with Graph-Based Multi-Hop Data 28 Jan 2025 derenlei/FactCG/wice_connected_reasoning.py bec4d78405f6ec00 unverified MIT (permissive)
Learning Structured Representations with Hyperbolic Embeddings 2 Dec 2024 uiuctml/HypStructure/utils.py cf06b847b490e55a ran MIT (permissive)
M-RewardBench: Evaluating Reward Models in Multilingual Settings 20 Oct 2024 for-ai/m-rewardbench/analysis/plot_utils.py 91d627e4e585fc2c ran · our draft was wrong MIT (permissive)
Universal Novelty Detection Through Adaptive Contrastive Learning 20 Aug 2024 mojtaba-nafez/unode/evals/evaluation.py 03e22dcc6d7e01c6 ran MIT (permissive)
Verifiably Robust Conformal Prediction 29 May 2024 ddv-lab/Verifiably_Robust_CP/VRCP_Classification/VRCP/experiment.py f780342ea9e8fa2e ran; the contract check could not run (RAISES) · metamorphic tier: invariant no licence file found · pointer only
RigorLLM: Resilient Guardrails for Large Language Models against Undesired Content 19 Mar 2024 eurekayuan/rigorllm/moderation.py a42c00a4f305dd22 ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted no licence file found · pointer only
REAR: A Relevance-Aware Retrieval-Augmented Framework for Open-Domain Question Answering 27 Feb 2024 RUCAIBox/REAR/rear/src/inf.py 73a6d0a707d6cc37 unverified no licence file found · pointer only
On Measuring Context Utilization in Document-Level MT Systems 2 Feb 2024 ZurichNLP/ContraPro/evaluate.py 8b884fdc3e1f18c8 ran · honoured contract MIT (permissive)
Optimizing Retrieval-augmented Reader Models via Token Elimination 20 Oct 2023 mosheber/token_elimination/src/model.py f350bef02278b760 ran · our draft was wrong licence not identified · pointer only
SGOOD: Substructure-enhanced Graph-Level Out-of-Distribution Detection 16 Oct 2023 tommydzh/sgood/utils.py 34664e472317e283 ran no licence file found · pointer only
Masked Autoencoders for Unsupervised Anomaly Detection in Medical Images 14 Jul 2023 lilygeorgescu/mae-medical-anomaly-detection/evaluate_sup.py 139e763b4bd191ec ran; the contract check could not run (RAISES) licence not identified · pointer only
Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach 7 Feb 2023 lanxiang1017/dynamicbadpairmining_iclr24/models/dbpm_model.py c18b03944ec98848 ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only
Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answering 20 Sep 2022 lupantech/ScienceQA/tools/evaluate_acc.py ab3717114ec507c3 unverified MIT (permissive)
WinoGAViL: Gamified Association Benchmark to Challenge Vision-and-Language Models 25 Jul 2022 WinoGAViL/WinoGAViL-experiments/run_zero_shot.py fb34eee819c2938e ran · our draft was wrong MIT (permissive)
Quantifying Health Inequalities Induced by Data and AI Models 24 Apr 2022 knowlab/DAindex-Framework/daindex/ml.py 1fd27fd4b01f06c1 ran MIT (permissive)
A Field Guide to Federated Optimization 14 Jul 2021 AParayil/AParayil-Distribued-Learning-via-Bayesian-Inferencing/mnist_dist_sgld_svhn_plot_pred_scores.py a5fafd0528bc7da8 ran MIT (permissive)
Utterance-level Dialogue Understanding: An Empirical Study 29 Sep 2020 declare-lab/dialogue-understanding/glove-end-to-end/train_shuffled_context.py 53d8a07aaa1a0e6b ran MIT (permissive)
Neural Non-Stationary Spectral Kernel 27 Nov 2018 sremes/nssm-gp/experiments/get_best_results.py 9b9c51089aa7b439 ran MIT (permissive)
ACL Anthology id 2023.findings-acl.765 qtli/EIB/code/Prompting-Filter/csqa_demo.py 335d193e8f3c624e 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 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