{"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/cost","entry":"cost","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":6,"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":2,"ran_violates":2,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":2},"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":"2603.27884","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kihyun-yu/pd-powers when it was checked","code_sha256":"562feeb61f8e7728","code_sha256_prefix":"562feeb61f8e7728","mcp_get_code":{"code_sha256":"562feeb61f8e7728"}},{"arxiv_id":"2505.21825","arxiv_id_is_arxiv":true,"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":"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":"f01e3b8c1bc27406","code_sha256_prefix":"f01e3b8c1bc27406","mcp_get_code":{"code_sha256":"f01e3b8c1bc27406"}},{"arxiv_id":"2501.05906","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"128ac60541bfa75b","code_sha256_prefix":"128ac60541bfa75b","mcp_get_code":{"code_sha256":"128ac60541bfa75b"}},{"arxiv_id":"2411.16829","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PatrickOHara/mis-dro-code when it was checked","code_sha256":"ca68ae5ecea0cd2e","code_sha256_prefix":"ca68ae5ecea0cd2e","mcp_get_code":{"code_sha256":"ca68ae5ecea0cd2e"}},{"arxiv_id":"2410.16449","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mousavih/robust-feature-learning when it was checked","code_sha256":"75062a76fe17cdb7","code_sha256_prefix":"75062a76fe17cdb7","mcp_get_code":{"code_sha256":"75062a76fe17cdb7"}},{"arxiv_id":"2309.16384","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lorenzo2beretta/multi-swap-k-means-pp when it was checked","code_sha256":"f06b863959ac69ae","code_sha256_prefix":"f06b863959ac69ae","mcp_get_code":{"code_sha256":"f06b863959ac69ae"}},{"arxiv_id":"2309.16384","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lorenzo2beretta/multi-swap-k-means-pp when it was checked","code_sha256":"d6367f496de28e14","code_sha256_prefix":"d6367f496de28e14","mcp_get_code":{"code_sha256":"d6367f496de28e14"}},{"arxiv_id":"2203.00199","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6eedf26f48f5c81","code_sha256_prefix":"a6eedf26f48f5c81","mcp_get_code":{"code_sha256":"a6eedf26f48f5c81"}},{"arxiv_id":"2010.11632","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, etienne4/PDLA when it was checked","code_sha256":"d3c48a562a62b5ac","code_sha256_prefix":"d3c48a562a62b5ac","mcp_get_code":{"code_sha256":"d3c48a562a62b5ac"}},{"arxiv_id":"1704.03165","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6eedf26f48f5c81","code_sha256_prefix":"a6eedf26f48f5c81","mcp_get_code":{"code_sha256":"a6eedf26f48f5c81"}}],"record_sha256":"34d573cc22c37fd6e38963f7af723fb3501d469fd4da5dfe8e7f7d8c7337b3fc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}