{"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/to-float","entry":"to_float","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":17,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":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":15,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":17,"n_places_pointer_only":11,"n_places_pointer_only_link_open":1,"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":6,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"unverified":0},"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":"2608.27066","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27066","title":"Beyond Classification: Task-Dependent Learnability under Privacy-Motivated Image Transformations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LeonRanke/Task-Dependent-Learnability","path":"src/transformations/transformations_utils.py","file_url":"https://github.com/LeonRanke/Task-Dependent-Learnability/blob/HEAD/src/transformations/transformations_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa8f342698098cb0","code_sha256_prefix":"aa8f342698098cb0","mcp_get_code":{"code_sha256":"aa8f342698098cb0"}},{"arxiv_id":"2606.10321","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10321","title":"Baseline-Free Policy Optimization for Neural Combinatorial Optimization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"carsepmo/grpo-nco","path":"fixed_eval.py","file_url":"https://github.com/carsepmo/grpo-nco/blob/HEAD/fixed_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, carsepmo/grpo-nco (NOASSERTION)","code_sha256":"e599f25ba7261f0c","code_sha256_prefix":"e599f25ba7261f0c","mcp_get_code":{"code_sha256":"e599f25ba7261f0c"}},{"arxiv_id":"2604.03479","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-03479","title":"Contextual Control without Memory Growth in a Context-Switching Task","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"songju1/Contextual-Control","path":"code/format_infoI_main_table.py","file_url":"https://github.com/songju1/Contextual-Control/blob/HEAD/code/format_infoI_main_table.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, songju1/Contextual-Control when it was checked","code_sha256":"822bf969722beacd","code_sha256_prefix":"822bf969722beacd","mcp_get_code":{"code_sha256":"822bf969722beacd"}},{"arxiv_id":"2601.07348","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-07348","title":"Controlled Self-Evolution for Algorithmic Code Optimization","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"QuantaAlpha/EvoControl","path":"utils/analyze_iterations.py","file_url":"https://github.com/QuantaAlpha/EvoControl/blob/HEAD/utils/analyze_iterations.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ade148fe4f871622","code_sha256_prefix":"ade148fe4f871622","mcp_get_code":{"code_sha256":"ade148fe4f871622"}},{"arxiv_id":"2510.13212","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-13212","title":"Towards Understanding Valuable Preference Data for Large Language Model Alignment","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"tmlr-group/TIF_LossDiff-IRM","path":"analysis/data_select_by2_mid_k.py","file_url":"https://github.com/tmlr-group/TIF_LossDiff-IRM/blob/HEAD/analysis/data_select_by2_mid_k.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, tmlr-group/TIF_LossDiff-IRM when it was checked","code_sha256":"57554c79159f92df","code_sha256_prefix":"57554c79159f92df","mcp_get_code":{"code_sha256":"57554c79159f92df"}},{"arxiv_id":"2509.23413","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-23413","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CIAM-Group/URS","path":"utils/utils.py","file_url":"https://github.com/CIAM-Group/URS/blob/HEAD/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, CIAM-Group/URS, is not in the permissive set Syntology serves inline","code_sha256":"ebd1968d12425df2","code_sha256_prefix":"ebd1968d12425df2","mcp_get_code":{"code_sha256":"ebd1968d12425df2"}},{"arxiv_id":"2410.06617","arxiv_id_is_arxiv":true,"paper":"/paper/learning-evolving-tools-for-large-language","title":"Learning Evolving Tools for Large Language Models","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chen-GX/ToolEVO","path":"MCTS/src/evaluation.py","file_url":"https://github.com/Chen-GX/ToolEVO/blob/HEAD/MCTS/src/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Chen-GX/ToolEVO when it was checked","code_sha256":"cbd711da673c1a30","code_sha256_prefix":"cbd711da673c1a30","mcp_get_code":{"code_sha256":"cbd711da673c1a30"}},{"arxiv_id":"2402.02625","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-transformer-rnns-with-multiple","title":"Enhancing Transformer RNNs with Multiple Temporal Perspectives","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RazvanDu/TemporalRNNs","path":"MultiplePerspectives/src/utils.py","file_url":"https://github.com/RazvanDu/TemporalRNNs/blob/HEAD/MultiplePerspectives/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, RazvanDu/TemporalRNNs when it was checked","code_sha256":"c1934c6bad591733","code_sha256_prefix":"c1934c6bad591733","mcp_get_code":{"code_sha256":"c1934c6bad591733"}},{"arxiv_id":"2312.04095","arxiv_id_is_arxiv":true,"paper":"/paper/learn-to-unlearn-for-deep-neural-networks","title":"Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projection","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hnanhtuan/projected_gradient_unlearning","path":"utils/general_utils.py","file_url":"https://github.com/hnanhtuan/projected_gradient_unlearning/blob/HEAD/utils/general_utils.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, hnanhtuan/projected_gradient_unlearning when it was checked","code_sha256":"e93611cdc6dca38f","code_sha256_prefix":"e93611cdc6dca38f","mcp_get_code":{"code_sha256":"e93611cdc6dca38f"}},{"arxiv_id":"2310.18512","arxiv_id_is_arxiv":true,"paper":"/paper/preventing-language-models-from-hiding-their","title":"Preventing Language Models From Hiding Their Reasoning","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redwoodresearch/text-steganography-benchmark","path":"textsteg/utils.py","file_url":"https://github.com/redwoodresearch/text-steganography-benchmark/blob/HEAD/textsteg/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, redwoodresearch/text-steganography-benchmark when it was checked","code_sha256":"391296d1e53c0d42","code_sha256_prefix":"391296d1e53c0d42","mcp_get_code":{"code_sha256":"391296d1e53c0d42"}},{"arxiv_id":"2307.10713","arxiv_id_is_arxiv":true,"paper":"/paper/kick-back-relax-learning-to-reconstruct-the","title":"Kick Back & Relax: Learning to Reconstruct the World by Watching SlowTV","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jspenmar/slowtv_monodepth","path":"src/core/metrics.py","file_url":"https://github.com/jspenmar/slowtv_monodepth/blob/HEAD/src/core/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, jspenmar/slowtv_monodepth (NOASSERTION)","code_sha256":"29a37d1ee25774c5","code_sha256_prefix":"29a37d1ee25774c5","mcp_get_code":{"code_sha256":"29a37d1ee25774c5"}},{"arxiv_id":"2302.13939","arxiv_id_is_arxiv":true,"paper":"/paper/spikegpt-generative-pre-trained-language","title":"SpikeGPT: Generative Pre-trained Language Model with Spiking Neural Networks","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ridgerchu/spikegpt","path":"src/utils.py","file_url":"https://github.com/ridgerchu/spikegpt/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-2-Clause), but get_code serves the stored copy, first harvested from RazvanDu/TemporalRNNs, and GitHub detected no licence in that repository when it was checked","code_sha256":"c1934c6bad591733","code_sha256_prefix":"c1934c6bad591733","mcp_get_code":{"code_sha256":"c1934c6bad591733"}},{"arxiv_id":"2106.12997","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-with-high-dimensional","title":"Bayesian Optimization with High-Dimensional Outputs","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msu-coinlab/pymoo","path":"pymoo/core/duplicate.py","file_url":"https://github.com/msu-coinlab/pymoo/blob/HEAD/pymoo/core/duplicate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6485142c167f898b","code_sha256_prefix":"6485142c167f898b","mcp_get_code":{"code_sha256":"6485142c167f898b"}},{"arxiv_id":"2012.01089","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-hyperbolic-representations-an","title":"Aligning Hyperbolic Representations: an Optimal Transport-based approach","date":"2020-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahoyosid/hyperbolic_alignment","path":"hyperbolic_domain_adaptation.py","file_url":"https://github.com/ahoyosid/hyperbolic_alignment/blob/HEAD/hyperbolic_domain_adaptation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ahoyosid/hyperbolic_alignment when it was checked","code_sha256":"47029fec9dccdf55","code_sha256_prefix":"47029fec9dccdf55","mcp_get_code":{"code_sha256":"47029fec9dccdf55"}},{"arxiv_id":"1901.06151","arxiv_id_is_arxiv":true,"paper":"/paper/robust-watermarking-of-neural-network-with","title":"Robust Watermarking of Neural Network with Exponential Weighting","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"dunky11/exponential-weighting-watermarking","path":"example.py","file_url":"https://github.com/dunky11/exponential-weighting-watermarking/blob/HEAD/example.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":"ab68f2ab08634049","code_sha256_prefix":"ab68f2ab08634049","mcp_get_code":{"code_sha256":"ab68f2ab08634049"}},{"arxiv_id":"1812.01483","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-imitation-learning-explaining","title":"CompILE: Compositional Imitation Learning and Execution","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/gym-gridworld","path":"utils.py","file_url":"https://github.com/tkipf/gym-gridworld/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"085bcb8ae6152b94","code_sha256_prefix":"085bcb8ae6152b94","mcp_get_code":{"code_sha256":"085bcb8ae6152b94"}},{"arxiv_id":"1711.01894","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-frontier-stitching-for-remote","title":"Adversarial Frontier Stitching for Remote Neural Network Watermarking","date":null,"month_inferred_from_arxiv_id":"2017-11","title_source":"archive","repo":"dunky11/adversarial-frontier-stitching","path":"example.py","file_url":"https://github.com/dunky11/adversarial-frontier-stitching/blob/HEAD/example.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":"ab68f2ab08634049","code_sha256_prefix":"ab68f2ab08634049","mcp_get_code":{"code_sha256":"ab68f2ab08634049"}}],"record_sha256":"947627e90af90cf938aaf4493edfbb34b9375b709218b9aedc66ae1d02fc3f49","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}