{"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/cost","entry":"cost","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":9,"n_papers_ran":7,"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":6,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":6,"by_status":{"ran_honours":2,"ran_violates":2,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":3},"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":"2603.27884","paper":"/paper/arxiv-2603-27884","title":"Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"kihyun-yu/pd-powers","path":"cmdp_primal_dual_power.py","file_url":"https://github.com/kihyun-yu/pd-powers/blob/HEAD/cmdp_primal_dual_power.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"562feeb61f8e7728","mcp_get_code":{"code_sha256":"562feeb61f8e7728"}},{"arxiv_id":"2505.21825","paper":"/paper/let-me-think-a-long-chain-of-thought-can-be","title":"Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seyedparsa/let-me-think","path":"analysis/plot_prefix_accuracy.py","file_url":"https://github.com/seyedparsa/let-me-think/blob/HEAD/analysis/plot_prefix_accuracy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f01e3b8c1bc27406","mcp_get_code":{"code_sha256":"f01e3b8c1bc27406"}},{"arxiv_id":"2501.05906","paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"mol_adaptation.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/mol_adaptation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"128ac60541bfa75b","mcp_get_code":{"code_sha256":"128ac60541bfa75b"}},{"arxiv_id":"2411.16829","paper":"/paper/decision-making-under-the-exponential-family","title":"Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatrickOHara/mis-dro-code","path":"bayesian_dro/Bayesian_DRO_continuous.py","file_url":"https://github.com/PatrickOHara/mis-dro-code/blob/HEAD/bayesian_dro/Bayesian_DRO_continuous.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca68ae5ecea0cd2e","mcp_get_code":{"code_sha256":"ca68ae5ecea0cd2e"}},{"arxiv_id":"2410.16449","paper":"/paper/robust-feature-learning-for-multi-index","title":"Robust Feature Learning for Multi-Index Models in High Dimensions","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mousavih/robust-feature-learning","path":"robust_fl.py","file_url":"https://github.com/mousavih/robust-feature-learning/blob/HEAD/robust_fl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"75062a76fe17cdb7","mcp_get_code":{"code_sha256":"75062a76fe17cdb7"}},{"arxiv_id":"2309.16384","paper":"/paper/multi-swap-k-means","title":"Multi-Swap $k$-Means++","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorenzo2beretta/multi-swap-k-means-pp","path":"multi_swap_kmpp.py","file_url":"https://github.com/lorenzo2beretta/multi-swap-k-means-pp/blob/HEAD/multi_swap_kmpp.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f06b863959ac69ae","mcp_get_code":{"code_sha256":"f06b863959ac69ae"}},{"arxiv_id":"2309.16384","paper":"/paper/multi-swap-k-means","title":"Multi-Swap $k$-Means++","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorenzo2beretta/multi-swap-k-means-pp","path":"multi_swap_kmpp.py","file_url":"https://github.com/lorenzo2beretta/multi-swap-k-means-pp/blob/HEAD/multi_swap_kmpp.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d6367f496de28e14","mcp_get_code":{"code_sha256":"d6367f496de28e14"}},{"arxiv_id":"2203.00199","paper":"/paper/equivariant-and-stable-positional-encoding-1","title":"Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks","date":"2022-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/peg","path":"Graph_embedding/models/struc2vec.py","file_url":"https://github.com/graph-com/peg/blob/HEAD/Graph_embedding/models/struc2vec.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":"a6eedf26f48f5c81","mcp_get_code":{"code_sha256":"a6eedf26f48f5c81"}},{"arxiv_id":"2010.11632","paper":"/paper/the-primal-dual-method-for-learning-augmented","title":"The Primal-Dual method for Learning Augmented Algorithms","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etienne4/PDLA","path":"Algorithms.py","file_url":"https://github.com/etienne4/PDLA/blob/HEAD/Algorithms.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d3c48a562a62b5ac","mcp_get_code":{"code_sha256":"d3c48a562a62b5ac"}},{"arxiv_id":"1704.03165","paper":"/paper/struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenweichen/GraphEmbedding","path":"ge/models/struc2vec.py","file_url":"https://github.com/shenweichen/GraphEmbedding/blob/HEAD/ge/models/struc2vec.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":"a6eedf26f48f5c81","mcp_get_code":{"code_sha256":"a6eedf26f48f5c81"}}]}