Home › Code › projection

projection

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.

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

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

18 papers shown of 18, newest first; 19 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
DataShield: Safety-degrading Data Filtering for LLM Benign Instruction Fine-Tuning added by Syntology 2026-06 (from id) ZJunBo/DataShield/datashield/compute_projections.py 4ca5ec3965dafbde ran · our draft was wrong fingerprinted no licence file found · pointer only
REALISTA: Realistic Latent Adversarial Attacks that Elicit LLM Hallucinations added by Syntology 2026-05 (from id) Buyun-Liang/REALISTA/src/realista.py 90c470e61ee1a1fd ran · our draft was wrong fingerprinted MIT (permissive)
Test-Time Adaptation by Causal Trimming added by Syntology 2025-10 (from id) NancyQuris/TACT/methods/tact.py ef39939a469e52e9 ran · our draft was wrong fingerprinted MIT (permissive)
SAFE: Finding Sparse and Flat Minima to Improve Pruning 7 Jun 2025 log-postech/safe-jax/sparsify/safe.py 5ce6dac896cdfdbd ran · our draft was wrong Apache-2.0 (permissive)
SAFE: Finding Sparse and Flat Minima to Improve Pruning 7 Jun 2025 LOG-postech/safe-torch/language/lib/prune.py f2be2a9f4b2b8076 ran · our draft was wrong MIT (permissive)
Interpreting and Editing Vision-Language Representations to Mitigate Hallucinations 3 Oct 2024 nickjiang2378/vl-interp/methods/algorithms.py f04ac0937ce8c5b5 ran; the contract check could not run (RAISES) fingerprinted CC0-1.0 (permissive)
LaRa: Efficient Large-Baseline Radiance Fields 5 Jul 2024 autonomousvision/lara/lightning/network.py 6c0f59b4d8f741f3 ran MIT (permissive)
Offline Meta Reinforcement Learning with In-Distribution Online Adaptation 31 May 2023 nagisazj/idaq_public/generate_plot.py ed1753e7074e4847 ran MIT recorded; this copy not marked cleared · pointer only
Equivariant Graph Mechanics Networks with Constraints 12 Mar 2022 hanjq17/gmn/spatial_graph/n_body_system/dataset/physical_objects.py 0f4545be8210f37b ran fingerprinted MIT (permissive)
Are We Ready For Learned Cardinality Estimation? 12 Dec 2020 sfu-db/AreCELearnedYet/lecarb/estimator/deepdb/aqp_spn/aqp_spn.py f48b43978866b103 ran; the contract check could not run (RAISES) · metamorphic tier: well formed MIT (permissive)
FOCAL: Efficient Fully-Offline Meta-Reinforcement Learning via Distance Metric Learning and Behavior Regularization 2 Oct 2020 FOCAL-ICLR/FOCAL-ICLR/generate_plot.py ed1753e7074e4847 ran MIT recorded; this copy not marked cleared · pointer only
AdamP: Slowing Down the Slowdown for Momentum Optimizers on Scale-invariant Weights 15 Jun 2020 rwightman/pytorch-image-models/timm/optim/adamp.py de5acc29c73a2126 ran · our draft was wrong fingerprinted Apache-2.0 (permissive)
Towards Better Generalization: Joint Depth-Pose Learning without PoseNet 3 Apr 2020 B1ueber2y/TrianFlow/infer_vo.py 722c49a1e9f7a775 ran · our draft was wrong fingerprinted MIT (permissive)
Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization 3 Nov 2019 yjwu17/ADMM-Compression-for-SNNs/torch_prune_utility.py a88bdd389d8a7d0b ran fingerprinted MIT (permissive)
Modelling Bounded Rationality in Multi-Agent Interactions by Generalized Recursive Reasoning 26 Jan 2019 ying-wen/gr2/code/maci/utils.py a292492441660b58 ran fingerprinted MIT (permissive)
End-to-End Neural Entity Linking 23 Aug 2018 dalab/end2end_neural_el/code/model/util.py cc4b9136dc71723e unverified Apache-2.0 (permissive)
Discovering physical concepts with neural networks 26 Jul 2018 eth-nn-physics/nn_physical_concepts/scinet/ed_quantum.py 487e6d621bcc2fa7 ran Apache-2.0 (permissive)
PeerNets: Exploiting Peer Wisdom Against Adversarial Attacks 31 May 2018 tantara/PeerNets-pytorch/src/utee/universal_perturbation.py 2ec345a880b3d439 ran fingerprinted MIT (permissive)
AAAI id aaai_28994 Alrash/EDM/mix.py 2b8ab603a6727f76 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