{"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/to-tuple","entry":"to_tuple","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":6,"n_papers_ran":4,"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":7,"n_samples_ran":5,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":2,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2505.17761","paper":"/paper/structured-linear-cdes-maximally-expressive","title":"Structured Linear CDEs: Maximally Expressive and Parallel-in-Time Sequence Models","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benjamin-walker/log-neural-cdes","path":"models/LinearNeuralCDEs.py","file_url":"https://github.com/benjamin-walker/log-neural-cdes/blob/HEAD/models/LinearNeuralCDEs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44c918b1c6d022f5","mcp_get_code":{"code_sha256":"44c918b1c6d022f5"}},{"arxiv_id":"2411.07279","paper":"/paper/the-surprising-effectiveness-of-test-time","title":"The Surprising Effectiveness of Test-Time Training for Few-Shot Learning","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekinakyurek/marc","path":"arclib/arc.py","file_url":"https://github.com/ekinakyurek/marc/blob/HEAD/arclib/arc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f33bc5b258bb01","mcp_get_code":{"code_sha256":"77f33bc5b258bb01"}},{"arxiv_id":"2401.00588","paper":"/paper/fairness-in-serving-large-language-models","title":"Fairness in Serving Large Language Models","date":"2023-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-lora/s-lora","path":"benchmarks/exp_suite.py","file_url":"https://github.com/s-lora/s-lora/blob/HEAD/benchmarks/exp_suite.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1fb624c4bbfa4098","mcp_get_code":{"code_sha256":"1fb624c4bbfa4098"}},{"arxiv_id":"2401.00588","paper":"/paper/fairness-in-serving-large-language-models","title":"Fairness in Serving Large Language Models","date":"2023-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ying1123/vtc-artifact","path":"fair_bench/exp_suite.py","file_url":"https://github.com/ying1123/vtc-artifact/blob/HEAD/fair_bench/exp_suite.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"98027d2de0638849","mcp_get_code":{"code_sha256":"98027d2de0638849"}},{"arxiv_id":"2202.12180","paper":"/paper/quantum-deep-reinforcement-learning-for-robot","title":"Quantum Deep Reinforcement Learning for Robot Navigation Tasks","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dfki-ric-quantum/qdrl-turtlebot-eval","path":"qeval/quantum_circuit.py","file_url":"https://github.com/dfki-ric-quantum/qdrl-turtlebot-eval/blob/HEAD/qeval/quantum_circuit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"5819d9fdcbfeb812","mcp_get_code":{"code_sha256":"5819d9fdcbfeb812"}},{"arxiv_id":"1905.02244","paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/efficientnet-jax","path":"jeffnet/linen/blocks_linen.py","file_url":"https://github.com/rwightman/efficientnet-jax/blob/HEAD/jeffnet/linen/blocks_linen.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bc3a3914c7eee220","mcp_get_code":{"code_sha256":"bc3a3914c7eee220"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rizalmaulanaa/robustness_of_prob_u_net","path":"Models/builders/UNet.py","file_url":"https://github.com/rizalmaulanaa/robustness_of_prob_u_net/blob/HEAD/Models/builders/UNet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c79bb309da3c181","mcp_get_code":{"code_sha256":"4c79bb309da3c181"}}]}