{"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-model-info","entry":"get_model_info","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":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":3,"ran_fixture":0,"ran":1,"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":"2604.27833","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27833","title":"Taming Noise-Induced Prototype Degradation for Privacy-Preserving Personalized Federated Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yuCoryx/ProtoPFL_VPDR","path":"utils/tools.py","file_url":"https://github.com/yuCoryx/ProtoPFL_VPDR/blob/HEAD/utils/tools.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, yuCoryx/ProtoPFL_VPDR when it was checked","code_sha256":"2cf7c74a1232cea7","code_sha256_prefix":"2cf7c74a1232cea7","mcp_get_code":{"code_sha256":"2cf7c74a1232cea7"}},{"arxiv_id":"2408.04810","arxiv_id_is_arxiv":true,"paper":"/paper/unibench-visual-reasoning-requires-rethinking","title":"UniBench: Visual Reasoning Requires Rethinking Vision-Language Beyond Scaling","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/unibench","path":"unibench/models_zoo/registry.py","file_url":"https://github.com/facebookresearch/unibench/blob/HEAD/unibench/models_zoo/registry.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, facebookresearch/unibench (NOASSERTION)","code_sha256":"ce4164ce34ef669f","code_sha256_prefix":"ce4164ce34ef669f","mcp_get_code":{"code_sha256":"ce4164ce34ef669f"}},{"arxiv_id":"2407.09100","arxiv_id_is_arxiv":true,"paper":"/paper/retrospective-for-the-dynamic-sensorium","title":"Retrospective for the Dynamic Sensorium Competition for predicting large-scale mouse primary visual cortex activity from videos","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bryanlimy/ViV1T","path":"src/viv1t/model/model.py","file_url":"https://github.com/bryanlimy/ViV1T/blob/HEAD/src/viv1t/model/model.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":"9448aaf59e5342b1","code_sha256_prefix":"9448aaf59e5342b1","mcp_get_code":{"code_sha256":"9448aaf59e5342b1"}},{"arxiv_id":"2407.02283","arxiv_id_is_arxiv":true,"paper":"/paper/a-refreshed-similarity-based-upsampler-for","title":"A Refreshed Similarity-based Upsampler for Direct High-Ratio Feature Upsampling","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmhhmz/resfu","path":"mmsegmentation/.dev_scripts/update_model_index.py","file_url":"https://github.com/zmhhmz/resfu/blob/HEAD/mmsegmentation/.dev_scripts/update_model_index.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, zmhhmz/resfu when it was checked","code_sha256":"75819240e9ae42d0","code_sha256_prefix":"75819240e9ae42d0","mcp_get_code":{"code_sha256":"75819240e9ae42d0"}},{"arxiv_id":"2407.02109","arxiv_id_is_arxiv":true,"paper":"/paper/hrsam-efficiently-segment-anything-in-high","title":"HRSAM: Efficient Interactive Segmentation in High-Resolution Images","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youhuang67/high-resolution-segment-anything","path":"mmsegmentation/.dev_scripts/update_model_index.py","file_url":"https://github.com/youhuang67/high-resolution-segment-anything/blob/HEAD/mmsegmentation/.dev_scripts/update_model_index.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, youhuang67/high-resolution-segment-anything when it was checked","code_sha256":"75819240e9ae42d0","code_sha256_prefix":"75819240e9ae42d0","mcp_get_code":{"code_sha256":"75819240e9ae42d0"}},{"arxiv_id":"2404.01705","arxiv_id_is_arxiv":true,"paper":"/paper/samba-semantic-segmentation-of-remotely","title":"Samba: Semantic Segmentation of Remotely Sensed Images with State Space Model","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuqinfeng1999/samba","path":".dev_scripts/update_model_index.py","file_url":"https://github.com/zhuqinfeng1999/samba/blob/HEAD/.dev_scripts/update_model_index.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":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zmhhmz/resfu, and GitHub detected no licence in that repository when it was checked","code_sha256":"75819240e9ae42d0","code_sha256_prefix":"75819240e9ae42d0","mcp_get_code":{"code_sha256":"75819240e9ae42d0"}},{"arxiv_id":"2403.00813","arxiv_id_is_arxiv":true,"paper":"/paper/urbangpt-spatio-temporal-large-language","title":"UrbanGPT: Spatio-Temporal Large Language Models","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/urbangpt","path":"urbangpt/model/model_registry.py","file_url":"https://github.com/hkuds/urbangpt/blob/HEAD/urbangpt/model/model_registry.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":"52162c648b35e17b","code_sha256_prefix":"52162c648b35e17b","mcp_get_code":{"code_sha256":"52162c648b35e17b"}},{"arxiv_id":"2402.01830","arxiv_id_is_arxiv":true,"paper":"/paper/peer-review-in-llms-automatic-evaluation","title":"PiCO: Peer Review in LLMs based on the Consistency Optimization","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-YuanGroup/Peer-review-in-LLMs","path":"llm_judge/config/model_registry.py","file_url":"https://github.com/PKU-YuanGroup/Peer-review-in-LLMs/blob/HEAD/llm_judge/config/model_registry.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, PKU-YuanGroup/Peer-review-in-LLMs when it was checked","code_sha256":"2d40f5866c066fb9","code_sha256_prefix":"2d40f5866c066fb9","mcp_get_code":{"code_sha256":"2d40f5866c066fb9"}},{"arxiv_id":"2310.05590","arxiv_id_is_arxiv":true,"paper":"/paper/perceptual-artifacts-localization-for-image-1","title":"Perceptual Artifacts Localization for Image Synthesis Tasks","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-mmlab/mmsegmentation","path":".dev_scripts/update_model_index.py","file_url":"https://github.com/open-mmlab/mmsegmentation/blob/HEAD/.dev_scripts/update_model_index.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":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zmhhmz/resfu, and GitHub detected no licence in that repository when it was checked","code_sha256":"75819240e9ae42d0","code_sha256_prefix":"75819240e9ae42d0","mcp_get_code":{"code_sha256":"75819240e9ae42d0"}},{"arxiv_id":"2309.14303","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-diffusion-diffusion-based-synthetic","title":"Dataset Diffusion: Diffusion-based Synthetic Dataset Generation for Pixel-Level Semantic Segmentation","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/Dataset-Diffusion","path":"mmsegmentation/.dev/update_model_index.py","file_url":"https://github.com/VinAIResearch/Dataset-Diffusion/blob/HEAD/mmsegmentation/.dev/update_model_index.py","status":"unverified","verification_level":0,"contract_check":null,"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, VinAIResearch/Dataset-Diffusion, is not in the permissive set Syntology serves inline","code_sha256":"f6d863d51f58002a","code_sha256_prefix":"f6d863d51f58002a","mcp_get_code":{"code_sha256":"f6d863d51f58002a"}},{"arxiv_id":"2303.15389","arxiv_id_is_arxiv":true,"paper":"/paper/eva-clip-improved-training-techniques-for","title":"EVA-CLIP: Improved Training Techniques for CLIP at Scale","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/PaddleMIX","path":"paddlemix/MULLM_WebUI/common.py","file_url":"https://github.com/PaddlePaddle/PaddleMIX/blob/HEAD/paddlemix/MULLM_WebUI/common.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":"f523f7dc0633013b","code_sha256_prefix":"f523f7dc0633013b","mcp_get_code":{"code_sha256":"f523f7dc0633013b"}},{"arxiv_id":"2107.08430","arxiv_id_is_arxiv":true,"paper":"/paper/yolox-exceeding-yolo-series-in-2021","title":"YOLOX: Exceeding YOLO Series in 2021","date":"2021-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apolloauto/apollo-model-yolox","path":"yolox/utils/model_utils.py","file_url":"https://github.com/apolloauto/apollo-model-yolox/blob/HEAD/yolox/utils/model_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":"624c83e485703cd7","code_sha256_prefix":"624c83e485703cd7","mcp_get_code":{"code_sha256":"624c83e485703cd7"}},{"arxiv_id":"1411.1784","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-generative-adversarial-nets","title":"Conditional Generative Adversarial Nets","date":"2014-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/CGAN-PyTorch","path":"conditional_gan/utils/torch_utils.py","file_url":"https://github.com/Lornatang/CGAN-PyTorch/blob/HEAD/conditional_gan/utils/torch_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":"9effa0ec6ac5e3cb","code_sha256_prefix":"9effa0ec6ac5e3cb","mcp_get_code":{"code_sha256":"9effa0ec6ac5e3cb"}}],"record_sha256":"58baf967b456084f4edc3a3fcb5e6e3f1461138e33ae338a10f0916c424ba151","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}