{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/train-test-split","entry":"train_test_split","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":23,"n_papers_ran":22,"n_papers_ran_no_instrument_failure":19,"n_papers_ran_instrument_only":3,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":23,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":19,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":24,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":19,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.23468","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23468","title":"RAD: Rule-Augmented Relational Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"noahd15/RAD_RelationalAnomalyDetection","path":"DRL/DataSet/MyDataset.py","file_url":"https://github.com/noahd15/RAD_RelationalAnomalyDetection/blob/HEAD/DRL/DataSet/MyDataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, noahd15/RAD_RelationalAnomalyDetection when it was checked","code_sha256":"15cfee310a8f65c9","code_sha256_prefix":"15cfee310a8f65c9","mcp_get_code":{"code_sha256":"15cfee310a8f65c9"}},{"arxiv_id":"2604.04567","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04567","title":"Generative Modeling under Non-Monotone MAR Missingness via Approximate Wasserstein Gradient Flows","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yujhml/MIRI-Imputation","path":"src/imputer.py","file_url":"https://github.com/yujhml/MIRI-Imputation/blob/HEAD/src/imputer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"515a6390da9f8f4b","code_sha256_prefix":"515a6390da9f8f4b","mcp_get_code":{"code_sha256":"515a6390da9f8f4b"}},{"arxiv_id":"2411.07574","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-tabular-data-towards-better-one","title":"Disentangling Tabular Data Towards Better One-Class Anomaly Detection","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjnanan/disent-ad","path":"data_preprocess/process_tabular.py","file_url":"https://github.com/yjnanan/disent-ad/blob/HEAD/data_preprocess/process_tabular.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"567c482aa2fc94f8","code_sha256_prefix":"567c482aa2fc94f8","mcp_get_code":{"code_sha256":"567c482aa2fc94f8"}},{"arxiv_id":"2411.02138","arxiv_id_is_arxiv":true,"paper":"/paper/specrage-robust-and-generalizable-multi-view","title":"Generalizable and Robust Spectral Method for Multi-view Representation Learning","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaham-lab/specrage","path":"src/_data.py","file_url":"https://github.com/shaham-lab/specrage/blob/HEAD/src/_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shaham-lab/specrage when it was checked","code_sha256":"b357c1e6d35e898e","code_sha256_prefix":"b357c1e6d35e898e","mcp_get_code":{"code_sha256":"b357c1e6d35e898e"}},{"arxiv_id":"2410.18926","arxiv_id_is_arxiv":true,"paper":"/paper/lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejaasaari/lorann-experiments","path":"ann_benchmarks/datasets.py","file_url":"https://github.com/ejaasaari/lorann-experiments/blob/HEAD/ann_benchmarks/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"762ddcae80faee0b","code_sha256_prefix":"762ddcae80faee0b","mcp_get_code":{"code_sha256":"762ddcae80faee0b"}},{"arxiv_id":"2410.02867","arxiv_id_is_arxiv":true,"paper":"/paper/fair-universe-higgsml-uncertainty-challenge","title":"FAIR Universe HiggsML Uncertainty Challenge Competition","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FAIR-Universe/FAIR_Universe_dataset","path":"benchmark_models/simple_one_syst_model/model.py","file_url":"https://github.com/FAIR-Universe/FAIR_Universe_dataset/blob/HEAD/benchmark_models/simple_one_syst_model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FAIR-Universe/FAIR_Universe_dataset when it was checked","code_sha256":"a0dbfba52f1f14b6","code_sha256_prefix":"a0dbfba52f1f14b6","mcp_get_code":{"code_sha256":"a0dbfba52f1f14b6"}},{"arxiv_id":"2410.02867","arxiv_id_is_arxiv":true,"paper":"/paper/fair-universe-higgsml-uncertainty-challenge","title":"FAIR Universe HiggsML Uncertainty Challenge Competition","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FAIR-Universe/FAIR_Universe_dataset","path":"benchmark_models/simple_stat_only_model/model.py","file_url":"https://github.com/FAIR-Universe/FAIR_Universe_dataset/blob/HEAD/benchmark_models/simple_stat_only_model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FAIR-Universe/FAIR_Universe_dataset when it was checked","code_sha256":"4c5d1ca096e768f4","code_sha256_prefix":"4c5d1ca096e768f4","mcp_get_code":{"code_sha256":"4c5d1ca096e768f4"}},{"arxiv_id":"2409.18359","arxiv_id_is_arxiv":true,"paper":"/paper/generative-ai-for-fast-and-accurate","title":"Generative AI for fast and accurate statistical computation of fluids","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camlab-ethz/gencfd","path":"GenCFD/dataloader/dataset.py","file_url":"https://github.com/camlab-ethz/gencfd/blob/HEAD/GenCFD/dataloader/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb519c2de685640f","code_sha256_prefix":"bb519c2de685640f","mcp_get_code":{"code_sha256":"bb519c2de685640f"}},{"arxiv_id":"2407.03059","arxiv_id_is_arxiv":true,"paper":"/paper/fairjob-a-real-world-dataset-for-fairness-in","title":"FairJob: A Real-World Dataset for Fairness in Online Systems","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"criteo-research/FairJob-dataset","path":"functions.py","file_url":"https://github.com/criteo-research/FairJob-dataset/blob/HEAD/functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e88b14269ae5df17","code_sha256_prefix":"e88b14269ae5df17","mcp_get_code":{"code_sha256":"e88b14269ae5df17"}},{"arxiv_id":"2401.17077","arxiv_id_is_arxiv":true,"paper":"/paper/dynamical-survival-analysis-with-controlled","title":"Dynamical Survival Analysis with Controlled Latent States","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusbleistein/signature_survival","path":"src/utils.py","file_url":"https://github.com/linusbleistein/signature_survival/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, linusbleistein/signature_survival when it was checked","code_sha256":"b405eaa827fab72a","code_sha256_prefix":"b405eaa827fab72a","mcp_get_code":{"code_sha256":"b405eaa827fab72a"}},{"arxiv_id":"2401.09499","arxiv_id_is_arxiv":true,"paper":"/paper/functional-autoencoder-for-smoothing-and","title":"Functional Autoencoder for Smoothing and Representation Learning","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cedricbeaulac/fae","path":"Code/Functions.py","file_url":"https://github.com/cedricbeaulac/fae/blob/HEAD/Code/Functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cedricbeaulac/fae when it was checked","code_sha256":"0e4f3106523dc85b","code_sha256_prefix":"0e4f3106523dc85b","mcp_get_code":{"code_sha256":"0e4f3106523dc85b"}},{"arxiv_id":"2310.19470","arxiv_id_is_arxiv":true,"paper":"/paper/grokking-tickets-lottery-tickets-accelerate","title":"Bridging Lottery Ticket and Grokking: Understanding Grokking from Inner Structure of Networks","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gouki510/grokking-tickets","path":"data_module.py","file_url":"https://github.com/gouki510/grokking-tickets/blob/HEAD/data_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gouki510/grokking-tickets when it was checked","code_sha256":"45ce5de51f9cf90d","code_sha256_prefix":"45ce5de51f9cf90d","mcp_get_code":{"code_sha256":"45ce5de51f9cf90d"}},{"arxiv_id":"2305.13829","arxiv_id_is_arxiv":true,"paper":"/paper/learn-from-mistakes-through-cooperative","title":"Learning from Mistakes via Cooperative Study Assistant for Large Language Models","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dqwang122/salam","path":"src/utils/tools.py","file_url":"https://github.com/dqwang122/salam/blob/HEAD/src/utils/tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19f7c8ee0a8ecca1","code_sha256_prefix":"19f7c8ee0a8ecca1","mcp_get_code":{"code_sha256":"19f7c8ee0a8ecca1"}},{"arxiv_id":"2203.16481","arxiv_id_is_arxiv":true,"paper":"/paper/on-uncertainty-tempering-and-data","title":"On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/bayesian-classification","path":"src/data_aug/datasets.py","file_url":"https://github.com/activatedgeek/bayesian-classification/blob/HEAD/src/data_aug/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4dbfc79b7cf9df58","code_sha256_prefix":"4dbfc79b7cf9df58","mcp_get_code":{"code_sha256":"4dbfc79b7cf9df58"}},{"arxiv_id":"2107.05326","arxiv_id_is_arxiv":true,"paper":"/paper/learning-interaction-rules-from-multi-animal","title":"Learning interaction rules from multi-animal trajectories via augmented behavioral models","date":"2021-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tailintalent/causal","path":"util.py","file_url":"https://github.com/tailintalent/causal/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ebbab2a1572f0df","code_sha256_prefix":"2ebbab2a1572f0df","mcp_get_code":{"code_sha256":"2ebbab2a1572f0df"}},{"arxiv_id":"2106.06935","arxiv_id_is_arxiv":true,"paper":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fs302/EasyLink","path":"easylink/common/data_utils.py","file_url":"https://github.com/fs302/EasyLink/blob/HEAD/easylink/common/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6e29676a8cc379b","code_sha256_prefix":"f6e29676a8cc379b","mcp_get_code":{"code_sha256":"f6e29676a8cc379b"}},{"arxiv_id":"1910.01791","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-out-of-sample-generation-for","title":"Conditional out-of-sample generation for unpaired data using trVAE","date":"2019-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theislab/trVAE","path":"trvae/utils.py","file_url":"https://github.com/theislab/trVAE/blob/HEAD/trvae/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cf25700a562f15a","code_sha256_prefix":"5cf25700a562f15a","mcp_get_code":{"code_sha256":"5cf25700a562f15a"}},{"arxiv_id":"1807.05614","arxiv_id_is_arxiv":true,"paper":"/paper/ann-benchmarks-a-benchmarking-tool-for","title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","date":"2018-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erikbern/ann-benchmarks","path":"ann_benchmarks/datasets.py","file_url":"https://github.com/erikbern/ann-benchmarks/blob/HEAD/ann_benchmarks/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"762ddcae80faee0b","code_sha256_prefix":"762ddcae80faee0b","mcp_get_code":{"code_sha256":"762ddcae80faee0b"}},{"arxiv_id":"1806.05622","arxiv_id_is_arxiv":true,"paper":"/paper/voxceleb2-deep-speaker-recognition","title":"VoxCeleb2: Deep Speaker Recognition","date":"2018-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MainRo/deep-speaker","path":"deep_speaker/dataset/split.py","file_url":"https://github.com/MainRo/deep-speaker/blob/HEAD/deep_speaker/dataset/split.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53db4ef1685b7e80","code_sha256_prefix":"53db4ef1685b7e80","mcp_get_code":{"code_sha256":"53db4ef1685b7e80"}},{"arxiv_id":"1703.04691","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-time-series-forecasting-with","title":"Conditional Time Series Forecasting with Convolutional Neural Networks","date":"2017-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litanli/wavenet-time-series-forecasting","path":"wavenet_pytorch.py","file_url":"https://github.com/litanli/wavenet-time-series-forecasting/blob/HEAD/wavenet_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, litanli/wavenet-time-series-forecasting when it was checked","code_sha256":"a4f5229ea6e8f346","code_sha256_prefix":"a4f5229ea6e8f346","mcp_get_code":{"code_sha256":"a4f5229ea6e8f346"}},{"arxiv_id":"1612.09106","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-point-learning-with-neural","title":"Sequence-to-point learning with neural networks for nonintrusive load monitoring","date":"2016-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redefik/ConvNILM","path":"data_preprocessing.py","file_url":"https://github.com/redefik/ConvNILM/blob/HEAD/data_preprocessing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c2734292602ee09","code_sha256_prefix":"4c2734292602ee09","mcp_get_code":{"code_sha256":"4c2734292602ee09"}},{"arxiv_id":"1606.04797","arxiv_id_is_arxiv":true,"paper":"/paper/v-net-fully-convolutional-neural-networks-for","title":"V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YellowLight021/Vnet","path":"luna.py","file_url":"https://github.com/YellowLight021/Vnet/blob/HEAD/luna.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4bee74346152dc3","code_sha256_prefix":"c4bee74346152dc3","mcp_get_code":{"code_sha256":"c4bee74346152dc3"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piyush2896/CNN-Text-Classifier","path":"nn/preprocessor.py","file_url":"https://github.com/piyush2896/CNN-Text-Classifier/blob/HEAD/nn/preprocessor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9239e6af1bbb6e07","code_sha256_prefix":"9239e6af1bbb6e07","mcp_get_code":{"code_sha256":"9239e6af1bbb6e07"}},{"arxiv_id":"aaai_25934","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25934","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"arghosh/DiFA","path":"src/models/data_utils.py","file_url":"https://github.com/arghosh/DiFA/blob/HEAD/src/models/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"256a7b364b25e06a","code_sha256_prefix":"256a7b364b25e06a","mcp_get_code":{"code_sha256":"256a7b364b25e06a"}}],"record_sha256":"fb10db3455c3b0495cea473188128c229986843be7ffa902f1e5bc990b24eac4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}