Home › Code › calc_coeff

calc_coeff

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.

calc_coeff appears in the code Syntology harvested for 14 papers, as 2 distinct code bodies found in 14 places (a place is one code body under one paper). Of the 14 papers, 0 with a sample that ran: 0 with a run with no instrument failure, 0 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 calc_coeff 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 2 distinct code bodies named calc_coeff: 0 ran · 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
0ran · our draft was wrong
0ran; the contract check could not run
0ran
2unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 13 of the 14 places are pointer only (Syntology does not serve that copy's text); at 7 of those 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 (hover the licence cell for why). 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

14 papers shown of 14, newest first; 14 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; 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
Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective 5 Jun 2024 zhangyl660/LERM/UDA/DA/CDAN-LERM/network.py e352afa5762c5a6b unverified no licence file found · pointer only
PracticalDG: Perturbation Distillation on Vision-Language Models for Hybrid Domain Generalization 13 Apr 2024 znchen666/hdg/network/util.py e352afa5762c5a6b unverified GPL-3.0 (copyleft) · pointer only
On $f$-Divergence Principled Domain Adaptation: An Improved Framework 2 Feb 2024 thuml/CDAN/pytorch/network.py e352afa5762c5a6b unverified no licence file found · pointer only
SPA: A Graph Spectral Alignment Perspective for Domain Adaptation 26 Oct 2023 CrownX/SPA/code/utils.py e352afa5762c5a6b unverified no licence file found · pointer only
Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation 27 Jul 2022 albert0147/sfda_neighbors/network.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
Prior Knowledge Guided Unsupervised Domain Adaptation 18 Jul 2022 tsun/KUDA/SHOT/network.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation 27 Jul 2021 tntek/N2DCX/object/network.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
DINE: Domain Adaptation from Single and Multiple Black-box Predictors 4 Apr 2021 tim-learn/SHOT/object/network.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
Learning from a Complementary-label Source Domain: Theory and Algorithms 4 Aug 2020 Yiyang98/BFUDA/ours/network.py e352afa5762c5a6b unverified no licence file found · pointer only
Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations 27 Mar 2020 cuishuhao/BNM/UODR/train_loader.py dc70b38779cb6f7c unverified MIT (permissive)
A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation 5 Mar 2020 tim-learn/BA3US/network.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
Semi-supervised Domain Adaptation via Minimax Entropy 13 Apr 2019 VisionLearningGroup/SSDA_MME/utils/loss.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only
Domain-Adversarial Training of Neural Networks 28 May 2015 identical code first harvested elsewhere e352afa5762c5a6b unverified licence of this copy not recorded
AAAI id aaai_28994 Alrash/EDM/src/DeepDG/network/util.py e352afa5762c5a6b unverified MIT (permissive) here; the stored copy is pointer only

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