{"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/convert-state-dict","entry":"convert_state_dict","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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"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":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":0,"n_places":13,"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":2,"ran_fixture":0,"ran":5,"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":"2605.11974","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11974","title":"Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hyalinesky/DGAO","path":"trl/models/sd_utils.py","file_url":"https://github.com/Hyalinesky/DGAO/blob/HEAD/trl/models/sd_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f1ce89b816a0734","code_sha256_prefix":"8f1ce89b816a0734","mcp_get_code":{"code_sha256":"8f1ce89b816a0734"}},{"arxiv_id":"2509.12521","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12521","title":"Phi: Preference Hijacking in Multi-modal Large Language Models at Inference Time","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Yifan-Lan/Phi","path":"trl/models/sd_utils.py","file_url":"https://github.com/Yifan-Lan/Phi/blob/HEAD/trl/models/sd_utils.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":"8f1ce89b816a0734","code_sha256_prefix":"8f1ce89b816a0734","mcp_get_code":{"code_sha256":"8f1ce89b816a0734"}},{"arxiv_id":"2406.11384","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-multi-granularity-for-open","title":"Understanding Multi-Granularity for Open-Vocabulary Part Segmentation","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-cvml-lab/part-clipseg","path":"transformers/models/clipseg/convert_clipseg_original_pytorch_to_hf.py","file_url":"https://github.com/kaist-cvml-lab/part-clipseg/blob/HEAD/transformers/models/clipseg/convert_clipseg_original_pytorch_to_hf.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":"7f278ee4020690d8","code_sha256_prefix":"7f278ee4020690d8","mcp_get_code":{"code_sha256":"7f278ee4020690d8"}},{"arxiv_id":"2305.18290","arxiv_id_is_arxiv":true,"paper":"/paper/direct-preference-optimization-your-language","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"padlex/trl","path":"trl/models/sd_utils.py","file_url":"https://github.com/padlex/trl/blob/HEAD/trl/models/sd_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f1ce89b816a0734","code_sha256_prefix":"8f1ce89b816a0734","mcp_get_code":{"code_sha256":"8f1ce89b816a0734"}},{"arxiv_id":"2211.01335","arxiv_id_is_arxiv":true,"paper":"/paper/chinese-clip-contrastive-vision-language","title":"Chinese CLIP: Contrastive Vision-Language Pretraining in Chinese","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofa-sys/chinese-clip","path":"cn_clip/clip/model.py","file_url":"https://github.com/ofa-sys/chinese-clip/blob/HEAD/cn_clip/clip/model.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":"650bf97faab74187","code_sha256_prefix":"650bf97faab74187","mcp_get_code":{"code_sha256":"650bf97faab74187"}},{"arxiv_id":"2210.09545","arxiv_id_is_arxiv":true,"paper":"/paper/fine-mixing-mitigating-backdoors-in-fine","title":"Fine-mixing: Mitigating Backdoors in Fine-tuned Language Models","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/pytorch-transformers","path":"src/transformers/models/audio_spectrogram_transformer/convert_audio_spectrogram_transformer_original_to_pytorch.py","file_url":"https://github.com/huggingface/pytorch-transformers/blob/HEAD/src/transformers/models/audio_spectrogram_transformer/convert_audio_spectrogram_transformer_original_to_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, huggingface/pytorch-transformers, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4855bdca41688f99","code_sha256_prefix":"4855bdca41688f99","mcp_get_code":{"code_sha256":"4855bdca41688f99"}},{"arxiv_id":"2206.06289","arxiv_id_is_arxiv":true,"paper":"/paper/silver-bullet-3d-at-maniskill-2021-learning","title":"Silver-Bullet-3D at ManiSkill 2021: Learning-from-Demonstrations and Heuristic Rule-based Methods for Object Manipulation","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sapientinc/HRM-Text","path":"conversion/convert_to_hf.py","file_url":"https://github.com/sapientinc/HRM-Text/blob/HEAD/conversion/convert_to_hf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff745cab86d0a58b","code_sha256_prefix":"ff745cab86d0a58b","mcp_get_code":{"code_sha256":"ff745cab86d0a58b"}},{"arxiv_id":"2106.14917","arxiv_id_is_arxiv":true,"paper":"/paper/striking-the-right-balance-recall-loss-for","title":"Striking the Right Balance: Recall Loss for Semantic Segmentation","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PotatoTian/recall-semseg","path":"ptsemseg/utils.py","file_url":"https://github.com/PotatoTian/recall-semseg/blob/HEAD/ptsemseg/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":"ec475f26f39c14b0","code_sha256_prefix":"ec475f26f39c14b0","mcp_get_code":{"code_sha256":"ec475f26f39c14b0"}},{"arxiv_id":"2006.00176","arxiv_id_is_arxiv":true,"paper":"/paper/when2com-multi-agent-perception-via","title":"When2com: Multi-Agent Perception via Communication Graph Grouping","date":"2020-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/MultiAgentPerception","path":"ptsemseg/utils.py","file_url":"https://github.com/GT-RIPL/MultiAgentPerception/blob/HEAD/ptsemseg/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":"e71ba6dcf9b2c854","code_sha256_prefix":"e71ba6dcf9b2c854","mcp_get_code":{"code_sha256":"e71ba6dcf9b2c854"}},{"arxiv_id":"2002.01685","arxiv_id_is_arxiv":true,"paper":"/paper/parsing-as-pretraining","title":"Parsing as Pretraining","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/pytorch-pretrained-BERT","path":"src/transformers/models/audio_spectrogram_transformer/convert_audio_spectrogram_transformer_original_to_pytorch.py","file_url":"https://github.com/huggingface/pytorch-pretrained-BERT/blob/HEAD/src/transformers/models/audio_spectrogram_transformer/convert_audio_spectrogram_transformer_original_to_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, huggingface/pytorch-pretrained-BERT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4855bdca41688f99","code_sha256_prefix":"4855bdca41688f99","mcp_get_code":{"code_sha256":"4855bdca41688f99"}},{"arxiv_id":"2001.06807","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-video-object-segmentation-via-1","title":"Zero-Shot Video Object Segmentation via Attentive Graph Neural Networks","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carrierlxk/AGNN","path":"test_iteration_conf_gnn.py","file_url":"https://github.com/carrierlxk/AGNN/blob/HEAD/test_iteration_conf_gnn.py","status":"unverified","verification_level":0,"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, carrierlxk/AGNN when it was checked","code_sha256":"a59151b1ac7750bb","code_sha256_prefix":"a59151b1ac7750bb","mcp_get_code":{"code_sha256":"a59151b1ac7750bb"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvyufeng/bert4ms","path":"cybertron/utils.py","file_url":"https://github.com/lvyufeng/bert4ms/blob/HEAD/cybertron/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":"8afaa985063f723e","code_sha256_prefix":"8afaa985063f723e","mcp_get_code":{"code_sha256":"8afaa985063f723e"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvyufeng/Cybertron","path":"cybertron/utils.py","file_url":"https://github.com/lvyufeng/Cybertron/blob/HEAD/cybertron/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":"8afaa985063f723e","code_sha256_prefix":"8afaa985063f723e","mcp_get_code":{"code_sha256":"8afaa985063f723e"}}],"record_sha256":"b12f5a6d2a0893790b291ef81a80b8dbec043609744f4f8e960042cedb8df31d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}