Home › Code › get_idx

get_idx

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.

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

1ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran; the contract check could not run
9ran
2unverified
1fingerprinted

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

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, and the graph's for 1 papers added by Syntology; 2 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
LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation added by Syntology 2026-07 (from id) iamjingli/LFM/train_target.py 780faf558bba6b54 unverified MIT (permissive)
Understanding the Robustness of Randomized Feature Defense Against Query-Based Adversarial Attacks 1 Oct 2023 mail-research/randomized_defenses/attack/nes.py 3cb33b36db4150ca ran GPL-3.0 (copyleft) · pointer only
UUKG: Unified Urban Knowledge Graph Dataset for Urban Spatiotemporal Prediction 20 Jun 2023 usail-hkust/UUKG/UrbanKG_Embedding_Model/datasets/process.py e236aeb29b50d533 ran MIT (permissive)
Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data 31 May 2023 openmatch/openmatch/src/openmatch/dataset/inference_dataset.py 90f77daf63ac2f1f ran MIT (permissive)
Augmentation-Adapted Retriever Improves Generalization of Language Models as Generic Plug-In 27 May 2023 OpenMatch/Augmentation-Adapted-Retriever/src/Retriever/dataset/inference_dataset.py 5648464c24fcb9de ran MIT (permissive)
xCodeEval: A Large Scale Multilingual Multitask Benchmark for Code Understanding, Generation, Translation and Retrieval 6 Mar 2023 ntunlp/xCodeEval/evaluation/apr/eval_apr.py 0e1583e6dd5914dd ran MIT (permissive)
Fast Sampling of Diffusion Models via Operator Learning 24 Nov 2022 devzhk/dsno-pytorch/generate_imagenet.py a57d49ef17dbed05 ran MIT (permissive)
Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning 23 Nov 2021 zhenhuan-yang/simple-pairwise/alg/auc_olp_1_hinge.py 7f75b419fa227545 ran · honoured contract no licence file found · pointer only
Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices 26 Oct 2021 fedelopez77/gyrospd/preprocess.py 626b615eb7fb469f ran MIT (permissive)
Geometric Unsupervised Domain Adaptation for Semantic Segmentation 30 Mar 2021 tri-ml/packnet-sfm/packnet_sfm/datasets/image_dataset.py 6d3ca8f94497d761 ran fingerprinted MIT (permissive)
Semantically-Guided Representation Learning for Self-Supervised Monocular Depth 27 Feb 2020 TRI-ML/packnet-sfm/packnet_sfm/datasets/image_dataset.py 6d3ca8f94497d761 ran fingerprinted MIT (permissive)
The Zwicky Transient Facility: System Overview, Performance, and First Results 2019-02 (from id) cherry0116/RB-C1000/cls_code/load_bestckpt.py 7655e7b7a2e7b792 ran MIT (permissive)
AAAI id aaai_30169 jacobwang925/path-integral-PINN/src/autoencoder/utils.py 491a46325b8b6d0a unverified MIT (permissive)
ACL Anthology id 2023.findings-acl.734 OpenMatch/OpenMatch/src/openmatch/dataset/inference_dataset.py 90f77daf63ac2f1f 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