{"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/get-run-name","entry":"get_run_name","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":4,"unverified":1},"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":"2607.15751","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15751","title":"Trainable Spline Representations for Physics-Informed Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"GiovanniCanali/PI-Splines","path":"src/utils/tools.py","file_url":"https://github.com/GiovanniCanali/PI-Splines/blob/HEAD/src/utils/tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09562491e96dc86f","code_sha256_prefix":"09562491e96dc86f","mcp_get_code":{"code_sha256":"09562491e96dc86f"}},{"arxiv_id":"2602.03645","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03645","title":"Reinforcement Fine-Tuning for History-Aware Dense Retriever in RAG","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"zyc140345/HARR","path":"main_grpo.py","file_url":"https://github.com/zyc140345/HARR/blob/HEAD/main_grpo.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":"e2d305b139e08312","code_sha256_prefix":"e2d305b139e08312","mcp_get_code":{"code_sha256":"e2d305b139e08312"}},{"arxiv_id":"2510.03200","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03200","title":"MonSTeR : a Unified Model for Motion, Scene, Text Retrieval","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"colloroneluca/MonSTeR","path":"src/logging.py","file_url":"https://github.com/colloroneluca/MonSTeR/blob/HEAD/src/logging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, colloroneluca/MonSTeR when it was checked","code_sha256":"568cbcd2833af975","code_sha256_prefix":"568cbcd2833af975","mcp_get_code":{"code_sha256":"568cbcd2833af975"}},{"arxiv_id":"2405.15593","arxiv_id_is_arxiv":true,"paper":"/paper/microadam-accurate-adaptive-optimization-with","title":"MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/microadam","path":"llm-foundry/llmfoundry/callbacks/async_eval_callback.py","file_url":"https://github.com/ist-daslab/microadam/blob/HEAD/llm-foundry/llmfoundry/callbacks/async_eval_callback.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37b437ca0eb633ca","code_sha256_prefix":"37b437ca0eb633ca","mcp_get_code":{"code_sha256":"37b437ca0eb633ca"}},{"arxiv_id":"2404.12766","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-on-a-diet-learning-from","title":"Continual Learning on a Diet: Learning from Sparsely Labeled Streams Under Constrained Computation","date":"2024-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wx-zhang/continual-learning-on-a-diet","path":"utils.py","file_url":"https://github.com/wx-zhang/continual-learning-on-a-diet/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, wx-zhang/continual-learning-on-a-diet when it was checked","code_sha256":"88a7aed4cd817a75","code_sha256_prefix":"88a7aed4cd817a75","mcp_get_code":{"code_sha256":"88a7aed4cd817a75"}},{"arxiv_id":"2403.06963","arxiv_id_is_arxiv":true,"paper":"/paper/the-pitfalls-of-next-token-prediction","title":"The pitfalls of next-token prediction","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregorbachmann/next-token-failures","path":"utils/training_utils.py","file_url":"https://github.com/gregorbachmann/next-token-failures/blob/HEAD/utils/training_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, gregorbachmann/next-token-failures when it was checked","code_sha256":"e64b971fffaa3f52","code_sha256_prefix":"e64b971fffaa3f52","mcp_get_code":{"code_sha256":"e64b971fffaa3f52"}},{"arxiv_id":"2306.12330","arxiv_id_is_arxiv":true,"paper":"/paper/protogate-prototype-based-neural-networks","title":"ProtoGate: Prototype-based Neural Networks with Global-to-local Feature Selection for Tabular Biomedical Data","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SilenceX12138/ProtoGate","path":"src/run_experiment.py","file_url":"https://github.com/SilenceX12138/ProtoGate/blob/HEAD/src/run_experiment.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":"c4e423c29d9e9d75","code_sha256_prefix":"c4e423c29d9e9d75","mcp_get_code":{"code_sha256":"c4e423c29d9e9d75"}},{"arxiv_id":"2305.08018","arxiv_id_is_arxiv":true,"paper":"/paper/drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bengutteridge/drew","path":"lrgb/graphgps/drew_utils.py","file_url":"https://github.com/bengutteridge/drew/blob/HEAD/lrgb/graphgps/drew_utils.py","status":"unverified","verification_level":0,"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":"8d75472ca0c91c64","code_sha256_prefix":"8d75472ca0c91c64","mcp_get_code":{"code_sha256":"8d75472ca0c91c64"}},{"arxiv_id":"2303.11525","arxiv_id_is_arxiv":true,"paper":"/paper/sift-sparse-iso-flop-transformations-for","title":"Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiency","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cerebrasresearch/sift","path":"ComputerVision/launch_utils/prepare_job_commands.py","file_url":"https://github.com/cerebrasresearch/sift/blob/HEAD/ComputerVision/launch_utils/prepare_job_commands.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":"0415b1caa3cae4d4","code_sha256_prefix":"0415b1caa3cae4d4","mcp_get_code":{"code_sha256":"0415b1caa3cae4d4"}},{"arxiv_id":"2005.07503","arxiv_id_is_arxiv":true,"paper":"/paper/covid-twitter-bert-a-natural-language","title":"COVID-Twitter-BERT: A Natural Language Processing Model to Analyse COVID-19 Content on Twitter","date":"2020-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"digitalepidemiologylab/covid-twitter-bert","path":"preprocess/create_finetune_data.py","file_url":"https://github.com/digitalepidemiologylab/covid-twitter-bert/blob/HEAD/preprocess/create_finetune_data.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":"ae3d0ae784a6cf90","code_sha256_prefix":"ae3d0ae784a6cf90","mcp_get_code":{"code_sha256":"ae3d0ae784a6cf90"}},{"arxiv_id":"2024.findings-emnlp.134","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.134","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mosaicml/llm-foundry","path":"llmfoundry/callbacks/async_eval_callback.py","file_url":"https://github.com/mosaicml/llm-foundry/blob/HEAD/llmfoundry/callbacks/async_eval_callback.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37b437ca0eb633ca","code_sha256_prefix":"37b437ca0eb633ca","mcp_get_code":{"code_sha256":"37b437ca0eb633ca"}}],"record_sha256":"fceb9e7b3bf7ba2f834e0883ee0862cc473d7243b7d5f0e5ba14177eb180d28d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}