{"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-dataset","entry":"parse_dataset","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":8,"n_papers_ran":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":9,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":6},"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":"2502.11741","paper":"/paper/sql-o1-a-self-reward-heuristic-dynamic-search","title":"SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuailyu0110/sql-o1","path":"preprocess_data.py","file_url":"https://github.com/shuailyu0110/sql-o1/blob/HEAD/preprocess_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"35a57ff57484f876","mcp_get_code":{"code_sha256":"35a57ff57484f876"}},{"arxiv_id":"2412.10138","paper":"/paper/route-robust-multitask-tuning-and","title":"ROUTE: Robust Multitask Tuning and Collaboration for Text-to-SQL","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/route","path":"route.py","file_url":"https://github.com/alibaba/route/blob/HEAD/route.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b7f901ce36540b8","mcp_get_code":{"code_sha256":"1b7f901ce36540b8"}},{"arxiv_id":"2311.14455","paper":"/paper/universal-jailbreak-backdoors-from-poisoned","title":"Universal Jailbreak Backdoors from Poisoned Human Feedback","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-spylab/rlhf-poisoning","path":"safe-rlhf/datasets/base.py","file_url":"https://github.com/ethz-spylab/rlhf-poisoning/blob/HEAD/safe-rlhf/datasets/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c9bcb3150b8f8448","mcp_get_code":{"code_sha256":"c9bcb3150b8f8448"}},{"arxiv_id":"2010.02519","paper":"/paper/improved-analysis-of-clipping-algorithms-for","title":"Improved Analysis of Clipping Algorithms for Non-convex Optimization","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbh2047/clipping-algorithms","path":"main_mnist_cifar.py","file_url":"https://github.com/zbh2047/clipping-algorithms/blob/HEAD/main_mnist_cifar.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a01e88267842be7f","mcp_get_code":{"code_sha256":"a01e88267842be7f"}},{"arxiv_id":"2004.10934","paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhk7734/tensorflow-yolov4","path":"py_src/yolov4/common/parser.py","file_url":"https://github.com/hhk7734/tensorflow-yolov4/blob/HEAD/py_src/yolov4/common/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea33cbca47cad278","mcp_get_code":{"code_sha256":"ea33cbca47cad278"}},{"arxiv_id":"1511.05493","paper":"/paper/gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JamesChuanggg/ggnn.pytorch","path":"babi_data/symbolic_preprocess.py","file_url":"https://github.com/JamesChuanggg/ggnn.pytorch/blob/HEAD/babi_data/symbolic_preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78c2c425c01a3a0b","mcp_get_code":{"code_sha256":"78c2c425c01a3a0b"}},{"arxiv_id":"1511.05493","paper":"/paper/gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JamesChuanggg/ggnn.pytorch","path":"babi_data/extra_seq_tasks/preprocess.py","file_url":"https://github.com/JamesChuanggg/ggnn.pytorch/blob/HEAD/babi_data/extra_seq_tasks/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e8807cf099640ba","mcp_get_code":{"code_sha256":"0e8807cf099640ba"}},{"arxiv_id":"1511.02680","paper":"/paper/bayesian-segnet-model-uncertainty-in-deep","title":"Bayesian SegNet: Model Uncertainty in Deep Convolutional Encoder-Decoder Architectures for Scene Understanding","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hosshonarvar/Image-Segmentation","path":"my_code/Src/input.py","file_url":"https://github.com/hosshonarvar/Image-Segmentation/blob/HEAD/my_code/Src/input.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"465a1df98fcaa53d","mcp_get_code":{"code_sha256":"465a1df98fcaa53d"}},{"arxiv_id":"1409.1556","paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhero12/Slic","path":"dataset.py","file_url":"https://github.com/rhero12/Slic/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74267a939a3cea3f","mcp_get_code":{"code_sha256":"74267a939a3cea3f"}}]}