Home › Code › extract_data

extract_data

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.

extract_data appears in the code Syntology harvested for 24 papers, as 18 distinct code bodies found in 26 places (a place is one code body under one paper). Of the 24 papers, 20 with a sample that ran: 16 with a run with no instrument failure, 4 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 extract_data 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 extract_data: 14 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; 4 where Syntology's instrument failed) · 4 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
4ran · our draft was wrong
0ran; the contract check could not run
9ran
4unverified
1fingerprinted

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

24 papers shown of 24, newest first; 26 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; 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
MT-R1-Zero: Advancing LLM-based Machine Translation via R1-Zero-like Reinforcement Learning 14 Apr 2025 fzp0424/mt-r1-zero/data/process_data.py 860391ac5525fe76 ran · our draft was wrong Apache-2.0 (permissive)
ImProver: Agent-Based Automated Proof Optimization 7 Oct 2024 riyazahuja/ImProver/benchmark/tools.py 7adc3bfbf60b8306 unverified no licence file found · pointer only
TAMER: Tree-Aware Transformer for Handwritten Mathematical Expression Recognition 16 Aug 2024 qingzhenduyu/tamer/tamer/datamodule/datamodule.py 6ef73ec3051b3eb0 ran no licence file found · pointer only
PosFormer: Recognizing Complex Handwritten Mathematical Expression with Position Forest Transformer 10 Jul 2024 sjtu-deepvisionlab/posformer/m2e_pkg/datamodule.py 3d952d11c1bd842b ran no licence file found · pointer only
PosFormer: Recognizing Complex Handwritten Mathematical Expression with Position Forest Transformer 10 Jul 2024 sjtu-deepvisionlab/posformer/Pos_Former/datamodule/datamodule.py 1fccc851efffb7be ran no licence file found · pointer only
PatentEval: Understanding Errors in Patent Generation 5 Jun 2024 ZoeYou/coheoka/coheoka/create_training_patents.py 3bf528bb1e7f248a ran · our draft was wrong Apache-2.0 (permissive)
Distinguishing the Knowable from the Unknowable with Language Models 5 Feb 2024 mims-harvard/spectra/SPECTRA_paper/SPECTRA_SD/TAPE_Homology/calculate_similarity.py 019a737a08eeaf7e ran MIT (permissive)
Steering Llama 2 via Contrastive Activation Addition 9 Dec 2023 wusche1/caa_hallucination/paper/lib/hallucination_lib.py c6ea479857c46dbd ran · our draft was wrong no licence file found · pointer only
Vector Quantized Time Series Generation with a Bidirectional Prior Model 8 Mar 2023 danelee2601/supervised-fcn/supervised_FCN/preprocessing/preprocess_uea.py 7509c254e5b132f7 ran MIT (permissive)
Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations 30 Nov 2022 IBM/CROWN-Robustness-Certification/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
Handwritten Mathematical Expression Recognition with Bidirectionally Trained Transformer 6 May 2021 Green-Wood/BTTR/bttr/datamodule/datamodule.py c5115025a3ddb95b ran MIT (permissive)
Concept Bottleneck Models 9 Jul 2020 yewsiang/ConceptBottleneck/CUB/data_processing.py fb9f011b98a5be6f unverified MIT (permissive)
Proper Network Interpretability Helps Adversarial Robustness in Classification 26 Jun 2020 AkhilanB/Proper-Interpretability/funcs.py 86c9fa246614e9a9 ran · honoured contract MIT (permissive)
A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks 27 Nov 2018 uclaml/Frank-Wolfe-AdvML/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
Efficient Neural Network Robustness Certification with General Activation Functions 2 Nov 2018 huanzhang12/CertifiedReLURobustness/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract BSD-2-Clause (permissive)
Quantum Convolutional Neural Networks 2018-10 (from id) Jaybsoni/Quantum-Convolutional-Neural-Networks/qcnns_for_phase_recog/qcnn_classify_phases.py c88ab08bc5a7ee90 ran · our draft was wrong MIT (permissive)
AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks 30 May 2018 IBM/Autozoom-Attack/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
GenAttack: Practical Black-box Attacks with Gradient-Free Optimization 28 May 2018 nesl/adversarial_genattack/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract MIT (permissive)
Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization 25 May 2018 IBM/ZOSVRG-BlackBox-Adv/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
Meta-Learning Probabilistic Inference For Prediction 24 May 2018 Gordonjo/versa/src/omniglot.py 2408a27b9438a36d unverified MIT (permissive)
Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives 21 Feb 2018 IBM/Contrastive-Explanation-Method/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
Identity Mappings in Deep Residual Networks 16 Mar 2016 JoegameZhou/ms-resnetv2/infer/resnetv2_152/dataprocess/preprocess.py 569e04900031b215 unverified Apache-2.0 (permissive)
FaceNet: A Unified Embedding for Face Recognition and Clustering 12 Mar 2015 davidsandberg/facenet/tmp/mnist_center_loss.py f239ee916030025a ran MIT (permissive)
AAAI id aaai_20650 IBM/UAE/Supervised/setup_mnist.py 86c9fa246614e9a9 ran · honoured contract Apache-2.0 (permissive)
AAAI id aaai_20650 IBM/UAE/Unsupversied/setup_fmmnist.py f7f6483f1420d26b ran Apache-2.0 (permissive)
ACL Anthology id 2023.findings-emnlp.142 Banner-Z/G-SPEED/wiki_collector/wiki_util.py 2c0851a1c3793c8d ran fingerprinted 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