{"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/create-scheduler","entry":"create_scheduler","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":10,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":0,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":4,"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":0,"ran_fixture":0,"ran":5,"unverified":6},"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":"2602.10021","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10021","title":"Decoupled Reasoning with Implicit Fact Tokens (DRIFT): A Dual-Model Framework for Efficient Long-Context Inference","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Lancelot-Xie/DRIFT","path":"src/drift/training/trainer.py","file_url":"https://github.com/Lancelot-Xie/DRIFT/blob/HEAD/src/drift/training/trainer.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, Lancelot-Xie/DRIFT when it was checked","code_sha256":"ff105ae48c2c98a2","code_sha256_prefix":"ff105ae48c2c98a2","mcp_get_code":{"code_sha256":"ff105ae48c2c98a2"}},{"arxiv_id":"2509.19885","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19885","title":"Towards Self-Supervised Foundation Models for Critical Care Time Series","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"rvandewater/YAIB","path":"icu_benchmarks/models/utils.py","file_url":"https://github.com/rvandewater/YAIB/blob/HEAD/icu_benchmarks/models/utils.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":"270211d5760b3ffc","code_sha256_prefix":"270211d5760b3ffc","mcp_get_code":{"code_sha256":"270211d5760b3ffc"}},{"arxiv_id":"2501.09620","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-reward-hacking-causal-rewards-for","title":"Beyond Reward Hacking: Causal Rewards for Large Language Model Alignment","date":"2025-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tatsu-lab/alpaca_farm","path":"src/alpaca_farm/trainer_utils.py","file_url":"https://github.com/tatsu-lab/alpaca_farm/blob/HEAD/src/alpaca_farm/trainer_utils.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":"42596ac916e883a5","code_sha256_prefix":"42596ac916e883a5","mcp_get_code":{"code_sha256":"42596ac916e883a5"}},{"arxiv_id":"2410.19213","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-hash-encoding-for-on-the-fly","title":"Prototypical Hash Encoding for On-the-Fly Fine-Grained Category Discovery","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaiyangZheng/PHE","path":"utils/create_scheduler.py","file_url":"https://github.com/HaiyangZheng/PHE/blob/HEAD/utils/create_scheduler.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, HaiyangZheng/PHE when it was checked","code_sha256":"0bf982f15505a3f0","code_sha256_prefix":"0bf982f15505a3f0","mcp_get_code":{"code_sha256":"0bf982f15505a3f0"}},{"arxiv_id":"2407.08083","arxiv_id_is_arxiv":true,"paper":"/paper/mambavision-a-hybrid-mamba-transformer-vision","title":"MambaVision: A Hybrid Mamba-Transformer Vision Backbone","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/mambavision","path":"mambavision/scheduler/scheduler_factory.py","file_url":"https://github.com/nvlabs/mambavision/blob/HEAD/mambavision/scheduler/scheduler_factory.py","status":"unverified","verification_level":0,"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, nvlabs/mambavision (NOASSERTION)","code_sha256":"849e053052794bfb","code_sha256_prefix":"849e053052794bfb","mcp_get_code":{"code_sha256":"849e053052794bfb"}},{"arxiv_id":"2406.12030","arxiv_id_is_arxiv":true,"paper":"/paper/spa-vl-a-comprehensive-safety-preference","title":"SPA-VL: A Comprehensive Safety Preference Alignment Dataset for Vision Language Model","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"echosechen/spa-vl-rlhf","path":"all_utils/trainer_utils.py","file_url":"https://github.com/echosechen/spa-vl-rlhf/blob/HEAD/all_utils/trainer_utils.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":"42596ac916e883a5","code_sha256_prefix":"42596ac916e883a5","mcp_get_code":{"code_sha256":"42596ac916e883a5"}},{"arxiv_id":"2406.11280","arxiv_id_is_arxiv":true,"paper":"/paper/i-srt-aligning-large-multimodal-models-for","title":"ISR-DPO: Aligning Large Multimodal Models for Videos by Iterative Self-Retrospective DPO","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yonseivnl/vlm-rlaif","path":"RLAIF/models/trainer_utils.py","file_url":"https://github.com/yonseivnl/vlm-rlaif/blob/HEAD/RLAIF/models/trainer_utils.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":"42596ac916e883a5","code_sha256_prefix":"42596ac916e883a5","mcp_get_code":{"code_sha256":"42596ac916e883a5"}},{"arxiv_id":"2310.05910","arxiv_id_is_arxiv":true,"paper":"/paper/salmon-self-alignment-with-principle","title":"SALMON: Self-Alignment with Instructable Reward Models","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/salmon","path":"training/models/trainer_utils.py","file_url":"https://github.com/ibm/salmon/blob/HEAD/training/models/trainer_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ibm/salmon, is not in the permissive set Syntology serves inline","code_sha256":"42596ac916e883a5","code_sha256_prefix":"42596ac916e883a5","mcp_get_code":{"code_sha256":"42596ac916e883a5"}},{"arxiv_id":"2309.09055","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-impact-of-low-rank-adaptation","title":"Exploring the impact of low-rank adaptation on the performance, efficiency, and regularization of RLHF","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simengsun/alpaca_farm_lora","path":"alpaca_farm/src/alpaca_farm/trainer_utils.py","file_url":"https://github.com/simengsun/alpaca_farm_lora/blob/HEAD/alpaca_farm/src/alpaca_farm/trainer_utils.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":"42596ac916e883a5","code_sha256_prefix":"42596ac916e883a5","mcp_get_code":{"code_sha256":"42596ac916e883a5"}},{"arxiv_id":"2306.17100","arxiv_id_is_arxiv":true,"paper":"/paper/rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4co/rl4co","path":"rl4co/utils/optim_helpers.py","file_url":"https://github.com/ai4co/rl4co/blob/HEAD/rl4co/utils/optim_helpers.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":"e57fec3fed7f7ac3","code_sha256_prefix":"e57fec3fed7f7ac3","mcp_get_code":{"code_sha256":"e57fec3fed7f7ac3"}},{"arxiv_id":"2306.05109","arxiv_id_is_arxiv":true,"paper":"/paper/yet-another-icu-benchmark-a-flexible-multi","title":"Yet Another ICU Benchmark: A Flexible Multi-Center Framework for Clinical ML","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rvandewater/yaib","path":"icu_benchmarks/models/utils.py","file_url":"https://github.com/rvandewater/yaib/blob/HEAD/icu_benchmarks/models/utils.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":"270211d5760b3ffc","code_sha256_prefix":"270211d5760b3ffc","mcp_get_code":{"code_sha256":"270211d5760b3ffc"}},{"arxiv_id":"2306.02898","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unified-text-based-person-retrieval-a","title":"Towards Unified Text-based Person Retrieval: A Large-scale Multi-Attribute and Language Search Benchmark","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shuyu-XJTU/APTM","path":"scheduler.py","file_url":"https://github.com/Shuyu-XJTU/APTM/blob/HEAD/scheduler.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":"37c7bac7616d388a","code_sha256_prefix":"37c7bac7616d388a","mcp_get_code":{"code_sha256":"37c7bac7616d388a"}},{"arxiv_id":"2210.07805","arxiv_id_is_arxiv":true,"paper":"/paper/meta-query-net-resolving-purity","title":"Meta-Query-Net: Resolving Purity-Informativeness Dilemma in Open-set Active Learning","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsba-lab/openal","path":"query_strategies/mqnet.py","file_url":"https://github.com/dsba-lab/openal/blob/HEAD/query_strategies/mqnet.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":"0a3075a2962b3ed1","code_sha256_prefix":"0a3075a2962b3ed1","mcp_get_code":{"code_sha256":"0a3075a2962b3ed1"}},{"arxiv_id":"2111.11802","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-self-attentions-into-convolutional","title":"Pruning Self-attentions into Convolutional Layers in Single Path","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuang-group/spvit","path":"SPViT_DeiT/utils.py","file_url":"https://github.com/zhuang-group/spvit/blob/HEAD/SPViT_DeiT/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":"d17e06164cf90aa8","code_sha256_prefix":"d17e06164cf90aa8","mcp_get_code":{"code_sha256":"d17e06164cf90aa8"}},{"arxiv_id":"1901.10906","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-of-appearance-based-methods-and","title":"Evaluation of Appearance-Based Methods and Implications for Gaze-Based Applications","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"hysts/pytorch_mpiigaze","path":"gaze_estimation/scheduler.py","file_url":"https://github.com/hysts/pytorch_mpiigaze/blob/HEAD/gaze_estimation/scheduler.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":"49ebf3e14f6f3510","code_sha256_prefix":"49ebf3e14f6f3510","mcp_get_code":{"code_sha256":"49ebf3e14f6f3510"}},{"arxiv_id":"1901.10137","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-context-aggregation-network","title":"Attention-based Context Aggregation Network for Monocular Depth Estimation","date":"2019-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miraiaroha/ACAN","path":"code/creator/scheduler.py","file_url":"https://github.com/miraiaroha/ACAN/blob/HEAD/code/creator/scheduler.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":"c60cc48bb993e02b","code_sha256_prefix":"c60cc48bb993e02b","mcp_get_code":{"code_sha256":"c60cc48bb993e02b"}},{"arxiv_id":"Yang_Beyond_Walking_A_Large-Scale_Image-Text_Benchmark_for_Text-based_Person_Anomaly_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yang_Beyond_Walking_A_Large-Scale_Image-Text_Benchmark_for_Text-based_Person_Anomaly_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Shuyu-XJTU/CMP","path":"scheduler.py","file_url":"https://github.com/Shuyu-XJTU/CMP/blob/HEAD/scheduler.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":"37c7bac7616d388a","code_sha256_prefix":"37c7bac7616d388a","mcp_get_code":{"code_sha256":"37c7bac7616d388a"}}],"record_sha256":"4291cfedf6df1ef3798b57db3c38700977c012b74f2b20ad1c4b97e35680d35c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}