{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/parse-data","entry":"parse_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":16,"n_papers_ran":5,"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":15,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":16,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":10},"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":"2601.17136","paper":"/paper/arxiv-2601-17136","title":"Communication-Avoiding Linear Algebraic Kernel K-Means on GPUs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"CornellHPC/Vivaldi","path":"experiments/plot_scaling.py","file_url":"https://github.com/CornellHPC/Vivaldi/blob/HEAD/experiments/plot_scaling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"08ab190716ca5738","mcp_get_code":{"code_sha256":"08ab190716ca5738"}},{"arxiv_id":"2402.13213","paper":"/paper/softmax-probabilities-mostly-predict-large","title":"Probabilities of Chat LLMs Are Miscalibrated but Still Predict Correctness on Multiple-Choice Q&A","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bplaut/softmax-probs-predict-llm-correctness","path":"utils.py","file_url":"https://github.com/bplaut/softmax-probs-predict-llm-correctness/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed723c89b7e88189","mcp_get_code":{"code_sha256":"ed723c89b7e88189"}},{"arxiv_id":"2402.10052","paper":"/paper/unmemorization-in-large-language-models-via","title":"UNDIAL: Self-Distillation with Adjusted Logits for Robust Unlearning in Large Language Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dong-river/llm_unlearning","path":"parse_logs.py","file_url":"https://github.com/dong-river/llm_unlearning/blob/HEAD/parse_logs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"884483b6e5ec4e2c","mcp_get_code":{"code_sha256":"884483b6e5ec4e2c"}},{"arxiv_id":"2312.16341","paper":"/paper/harnessing-the-power-of-federated-learning-in","title":"Harnessing the Power of Federated Learning in Federated Contextual Bandits","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenGroup/FedIGW","path":"src/FNB/utils.py","file_url":"https://github.com/ShenGroup/FedIGW/blob/HEAD/src/FNB/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d9e010453850c082","mcp_get_code":{"code_sha256":"d9e010453850c082"}},{"arxiv_id":"2305.16283","paper":"/paper/commonscenes-generating-commonsense-3d-indoor","title":"CommonScenes: Generating Commonsense 3D Indoor Scenes with Scene Graph Diffusion","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymxlzgy/commonscenes","path":"scripts/train_3dfront.py","file_url":"https://github.com/ymxlzgy/commonscenes/blob/HEAD/scripts/train_3dfront.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"97aa4e594bf780bb","mcp_get_code":{"code_sha256":"97aa4e594bf780bb"}},{"arxiv_id":"2211.10797","paper":"/paper/an-empirical-study-on-contrastive-search-and","title":"An Empirical Study On Contrastive Search And Contrastive Decoding For Open-ended Text Generation","date":"2022-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yxuansu/contrastive_search_versus_contrastive_decoding","path":"compute_CD_coherence.py","file_url":"https://github.com/yxuansu/contrastive_search_versus_contrastive_decoding/blob/HEAD/compute_CD_coherence.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0714e04d4711a1fe","mcp_get_code":{"code_sha256":"0714e04d4711a1fe"}},{"arxiv_id":"2204.01227","paper":"/paper/diverse-text-generation-via-variational","title":"Diverse Text Generation via Variational Encoder-Decoder Models with Gaussian Process Priors","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyu-du/gp-vae","path":"models/t5/utils.py","file_url":"https://github.com/wyu-du/gp-vae/blob/HEAD/models/t5/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5a0e39bae457be59","mcp_get_code":{"code_sha256":"5a0e39bae457be59"}},{"arxiv_id":"2202.08516","paper":"/paper/saits-self-attention-based-imputation-for","title":"SAITS: Self-Attention-based Imputation for Time Series","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorgen2020/LSSDM_imputation","path":"dataset_physio.py","file_url":"https://github.com/gorgen2020/LSSDM_imputation/blob/HEAD/dataset_physio.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d166bfcd5d4c397e","mcp_get_code":{"code_sha256":"d166bfcd5d4c397e"}},{"arxiv_id":"2107.03502","paper":"/paper/csdi-conditional-score-based-diffusion-models","title":"CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputation","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/CSDI","path":"dataset_physio.py","file_url":"https://github.com/ermongroup/CSDI/blob/HEAD/dataset_physio.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d166bfcd5d4c397e","mcp_get_code":{"code_sha256":"d166bfcd5d4c397e"}},{"arxiv_id":"1908.10396","paper":"/paper/new-loss-functions-for-fast-maximum-inner","title":"Accelerating Large-Scale Inference with Anisotropic Vector Quantization","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datastax/jvector","path":"plot_output.py","file_url":"https://github.com/datastax/jvector/blob/HEAD/plot_output.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c0ae8333dcd0e9f8","mcp_get_code":{"code_sha256":"c0ae8333dcd0e9f8"}},{"arxiv_id":"1905.06292","paper":"/paper/3d-point-cloud-generative-adversarial-network","title":"3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prajwalsingh/TreeGCN-ED","path":"infer_testresult.py","file_url":"https://github.com/prajwalsingh/TreeGCN-ED/blob/HEAD/infer_testresult.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc9e78141623c787","mcp_get_code":{"code_sha256":"fc9e78141623c787"}},{"arxiv_id":"1902.04103","paper":"/paper/bag-of-freebies-for-training-object-detection","title":"Bag of Freebies for Training Object Detection Neural Networks","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wizyoung/YOLOv3_TensorFlow","path":"utils/data_utils.py","file_url":"https://github.com/wizyoung/YOLOv3_TensorFlow/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6da8f222212852c","mcp_get_code":{"code_sha256":"c6da8f222212852c"}},{"arxiv_id":"1811.04383","paper":"/paper/adapting-multi-armed-bandits-policies-to","title":"Adapting multi-armed bandits policies to contextual bandits scenarios","date":"2018-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renan-cunha/Bandits","path":"src/contextual_bandits/Bibtex/parse_data.py","file_url":"https://github.com/renan-cunha/Bandits/blob/HEAD/src/contextual_bandits/Bibtex/parse_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a4d58feb5b351cf","mcp_get_code":{"code_sha256":"6a4d58feb5b351cf"}},{"arxiv_id":"1805.10572","paper":"/paper/brits-bidirectional-recurrent-imputation-for","title":"BRITS: Bidirectional Recurrent Imputation for Time Series","date":"2018-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caow13/BRITS","path":"input_process.py","file_url":"https://github.com/caow13/BRITS/blob/HEAD/input_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f69d0fb9551471c","mcp_get_code":{"code_sha256":"1f69d0fb9551471c"}},{"arxiv_id":"1503.00075","paper":"/paper/improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EmilReinert/DeepLearningPipelines","path":"workspace/pipelines/defect_prediction.py","file_url":"https://github.com/EmilReinert/DeepLearningPipelines/blob/HEAD/workspace/pipelines/defect_prediction.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"55a0de7b0b6428f0","mcp_get_code":{"code_sha256":"55a0de7b0b6428f0"}},{"arxiv_id":"1406.7758","paper":"/paper/theoretical-analysis-of-bayesian-optimisation","title":"Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameters","date":"2014-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weepingwillowben/hyperparam-opt","path":"next_point.py","file_url":"https://github.com/weepingwillowben/hyperparam-opt/blob/HEAD/next_point.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f36d9a43a155f5d","mcp_get_code":{"code_sha256":"0f36d9a43a155f5d"}}]}