{"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/get-latest-checkpoint","entry":"get_latest_checkpoint","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":13,"n_papers_ran":9,"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":11,"n_samples_ran":7,"n_samples_fingerprinted":4,"n_places":13,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"unverified":4},"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.11650","paper":"/paper/arxiv-2608-11650","title":"Confucius4-TTS: Transcript-Free Cross-Lingual Zero-Shot TTS with a Learnable Speaker Encoder","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"netease-youdao/Confucius4-TTS","path":"confuciustts/cli/train_s2a.py","file_url":"https://github.com/netease-youdao/Confucius4-TTS/blob/HEAD/confuciustts/cli/train_s2a.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"e12f9f6e46ab02c7","mcp_get_code":{"code_sha256":"e12f9f6e46ab02c7"}},{"arxiv_id":"2603.00618","paper":"/paper/arxiv-2603-00618","title":"Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"RiemannGraph/GraphGlue","path":"utils/checkpoints.py","file_url":"https://github.com/RiemannGraph/GraphGlue/blob/HEAD/utils/checkpoints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b28fab669a843f6a","mcp_get_code":{"code_sha256":"b28fab669a843f6a"}},{"arxiv_id":"2502.20122","paper":"/paper/self-training-elicits-concise-reasoning-in","title":"Self-Training Elicits Concise Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tergelmunkhbat/concise-reasoning","path":"src/model.py","file_url":"https://github.com/tergelmunkhbat/concise-reasoning/blob/HEAD/src/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed87ec15885fe0aa","mcp_get_code":{"code_sha256":"ed87ec15885fe0aa"}},{"arxiv_id":"2411.16775","paper":"/paper/parameter-efficient-instruction-tuning-an","title":"Parameter Efficient Instruction Tuning: An Empirical Study","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdaBit-AI/parameter_efficient_instruction_tuning","path":"utils.py","file_url":"https://github.com/AdaBit-AI/parameter_efficient_instruction_tuning/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6e175302feec91b5","mcp_get_code":{"code_sha256":"6e175302feec91b5"}},{"arxiv_id":"2410.10034","paper":"/paper/tulip-token-length-upgraded-clip","title":"TULIP: Token-length Upgraded CLIP","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivonajdenkoska/tulip","path":"eval_tulip.py","file_url":"https://github.com/ivonajdenkoska/tulip/blob/HEAD/eval_tulip.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"93448c613c050973","mcp_get_code":{"code_sha256":"93448c613c050973"}},{"arxiv_id":"2407.11867","paper":"/paper/single-layer-single-gradient-unlearning","title":"Unlearning Targeted Information via Single Layer Unlearning Gradient","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csiplab/slug","path":"src/clip/unlearn_slug.py","file_url":"https://github.com/csiplab/slug/blob/HEAD/src/clip/unlearn_slug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d9eed7fba4443db1","mcp_get_code":{"code_sha256":"d9eed7fba4443db1"}},{"arxiv_id":"2406.12031","paper":"/paper/large-scale-transfer-learning-for-tabular","title":"Large Scale Transfer Learning for Tabular Data via Language Modeling","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlfoundations/rtfm","path":"rtfm/utils.py","file_url":"https://github.com/mlfoundations/rtfm/blob/HEAD/rtfm/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ba26941c52b7f85a","mcp_get_code":{"code_sha256":"ba26941c52b7f85a"}},{"arxiv_id":"2402.07871","paper":"/paper/scaling-laws-for-fine-grained-mixture-of","title":"Scaling Laws for Fine-Grained Mixture of Experts","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-random/llm-random","path":"lizrd/train/load_and_save_model.py","file_url":"https://github.com/llm-random/llm-random/blob/HEAD/lizrd/train/load_and_save_model.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":"4a3ee9eeb13ba96e","mcp_get_code":{"code_sha256":"4a3ee9eeb13ba96e"}},{"arxiv_id":"2308.06911","paper":"/paper/git-mol-a-multi-modal-large-language-model","title":"GIT-Mol: A Multi-modal Large Language Model for Molecular Science with Graph, Image, and Text","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-hpc-research-team/git-mol","path":"train/pretrain.py","file_url":"https://github.com/ai-hpc-research-team/git-mol/blob/HEAD/train/pretrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"138b87fa967c256f","mcp_get_code":{"code_sha256":"138b87fa967c256f"}},{"arxiv_id":"2306.09200","paper":"/paper/chessgpt-bridging-policy-learning-and-1","title":"ChessGPT: Bridging Policy Learning and Language Modeling","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waterhorse1/chessgpt","path":"chessclip/src/training/main_chess.py","file_url":"https://github.com/waterhorse1/chessgpt/blob/HEAD/chessclip/src/training/main_chess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"93448c613c050973","mcp_get_code":{"code_sha256":"93448c613c050973"}},{"arxiv_id":"2305.19744","paper":"/paper/neural-markov-jump-processes","title":"Neural Markov Jump Processes","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pseifner/neuralmjp","path":"scripts/train_model.py","file_url":"https://github.com/pseifner/neuralmjp/blob/HEAD/scripts/train_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a2b1da8774401fe","mcp_get_code":{"code_sha256":"7a2b1da8774401fe"}},{"arxiv_id":"2209.05481","paper":"/paper/a-molecular-multimodal-foundation-model","title":"A Molecular Multimodal Foundation Model Associating Molecule Graphs with Natural Language","date":"2022-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"138b87fa967c256f","mcp_get_code":{"code_sha256":"138b87fa967c256f"}},{"arxiv_id":"2003.04218","paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"necrashter/deepltl-pytorch","path":"deepltl/train/common.py","file_url":"https://github.com/necrashter/deepltl-pytorch/blob/HEAD/deepltl/train/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"981652cdff73c2e9","mcp_get_code":{"code_sha256":"981652cdff73c2e9"}}]}