{"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-optim","entry":"get_optim","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":10,"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":13,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":5,"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":3,"ran_fixture":0,"ran":8,"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":"2412.08128","arxiv_id_is_arxiv":true,"paper":"/paper/why-does-dropping-edges-usually-outperform","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyzhang98/epagcl","path":"Utils.py","file_url":"https://github.com/hyzhang98/epagcl/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, hyzhang98/epagcl when it was checked","code_sha256":"7e94915c3b426976","code_sha256_prefix":"7e94915c3b426976","mcp_get_code":{"code_sha256":"7e94915c3b426976"}},{"arxiv_id":"2410.06262","arxiv_id_is_arxiv":true,"paper":"/paper/symdiff-equivariant-diffusion-via-stochastic","title":"SymDiff: Equivariant Diffusion via Stochastic Symmetrisation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leozhangML/SymDiff","path":"qm9/models.py","file_url":"https://github.com/leozhangML/SymDiff/blob/HEAD/qm9/models.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":"85c8c5cc8774ca97","code_sha256_prefix":"85c8c5cc8774ca97","mcp_get_code":{"code_sha256":"85c8c5cc8774ca97"}},{"arxiv_id":"2407.16193","arxiv_id_is_arxiv":true,"paper":"/paper/cloudfixer-test-time-adaptation-for-3d-point","title":"CloudFixer: Test-Time Adaptation for 3D Point Clouds via Diffusion-Guided Geometric Transformation","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shimazing/CloudFixer","path":"diffusion/build_model.py","file_url":"https://github.com/shimazing/CloudFixer/blob/HEAD/diffusion/build_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":"f00fffed990205f4","code_sha256_prefix":"f00fffed990205f4","mcp_get_code":{"code_sha256":"f00fffed990205f4"}},{"arxiv_id":"2401.10227","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-latent-diffusion-approach-for","title":"A Simple Latent Diffusion Approach for Panoptic Segmentation and Mask Inpainting","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"segments-ai/latent-diffusion-segmentation","path":"ldmseg/trainers/optim.py","file_url":"https://github.com/segments-ai/latent-diffusion-segmentation/blob/HEAD/ldmseg/trainers/optim.py","status":"ran","verification_level":1,"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, segments-ai/latent-diffusion-segmentation (NOASSERTION)","code_sha256":"285d6b71a60bea8d","code_sha256_prefix":"285d6b71a60bea8d","mcp_get_code":{"code_sha256":"285d6b71a60bea8d"}},{"arxiv_id":"2311.18495","arxiv_id_is_arxiv":true,"paper":"/paper/improving-adversarial-transferability-via-2","title":"Improving Adversarial Transferability via Model Alignment","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"averyma/model-alignment","path":"src/utils_general.py","file_url":"https://github.com/averyma/model-alignment/blob/HEAD/src/utils_general.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, averyma/model-alignment when it was checked","code_sha256":"246863313c06da67","code_sha256_prefix":"246863313c06da67","mcp_get_code":{"code_sha256":"246863313c06da67"}},{"arxiv_id":"2308.06703","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-robustness-difference","title":"Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"averyma/opt-robust","path":"src/utils_general.py","file_url":"https://github.com/averyma/opt-robust/blob/HEAD/src/utils_general.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, averyma/opt-robust when it was checked","code_sha256":"634dbd17789eb3c5","code_sha256_prefix":"634dbd17789eb3c5","mcp_get_code":{"code_sha256":"634dbd17789eb3c5"}},{"arxiv_id":"2305.14836","arxiv_id_is_arxiv":true,"paper":"/paper/nuscenes-qa-a-multi-modal-visual-question","title":"NuScenes-QA: A Multi-modal Visual Question Answering Benchmark for Autonomous Driving Scenario","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiantianwen/nuscenes-qa","path":"src/utils/optim.py","file_url":"https://github.com/qiantianwen/nuscenes-qa/blob/HEAD/src/utils/optim.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":"9e822b9d34a49db0","code_sha256_prefix":"9e822b9d34a49db0","mcp_get_code":{"code_sha256":"9e822b9d34a49db0"}},{"arxiv_id":"2303.01903","arxiv_id_is_arxiv":true,"paper":"/paper/prompting-large-language-models-with-answer","title":"Prophet: Prompting Large Language Models with Complementary Answer Heuristics for Knowledge-based Visual Question Answering","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milvlg/prophet","path":"prophet/stage1/utils/optim.py","file_url":"https://github.com/milvlg/prophet/blob/HEAD/prophet/stage1/utils/optim.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":"4120d55fb48dd6b0","code_sha256_prefix":"4120d55fb48dd6b0","mcp_get_code":{"code_sha256":"4120d55fb48dd6b0"}},{"arxiv_id":"2202.05008","arxiv_id_is_arxiv":true,"paper":"/paper/evojax-hardware-accelerated-neuroevolution","title":"EvoJAX: Hardware-Accelerated Neuroevolution","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/evojax","path":"evojax/algo/ars_native.py","file_url":"https://github.com/google/evojax/blob/HEAD/evojax/algo/ars_native.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":"d3bae217f149bd47","code_sha256_prefix":"d3bae217f149bd47","mcp_get_code":{"code_sha256":"d3bae217f149bd47"}},{"arxiv_id":"2107.09106","arxiv_id_is_arxiv":true,"paper":"/paper/separating-skills-and-concepts-for-novel-1","title":"Separating Skills and Concepts for Novel Visual Question Answering","date":"2021-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpencerWhitehead/novelvqa","path":"core/model/optim.py","file_url":"https://github.com/SpencerWhitehead/novelvqa/blob/HEAD/core/model/optim.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":"b6bf5a95f3801883","code_sha256_prefix":"b6bf5a95f3801883","mcp_get_code":{"code_sha256":"b6bf5a95f3801883"}},{"arxiv_id":"2002.07971","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-boosting-neural-networks-grownet","title":"Gradient Boosting Neural Networks: GrowNet","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sbadirli/GrowNet","path":"Classification/main_cls_cv.py","file_url":"https://github.com/sbadirli/GrowNet/blob/HEAD/Classification/main_cls_cv.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, sbadirli/GrowNet when it was checked","code_sha256":"dcaab65615b91b2d","code_sha256_prefix":"dcaab65615b91b2d","mcp_get_code":{"code_sha256":"dcaab65615b91b2d"}},{"arxiv_id":"1906.10770","arxiv_id_is_arxiv":true,"paper":"/paper/deep-modular-co-attention-networks-for-visual-1","title":"Deep Modular Co-Attention Networks for Visual Question Answering","date":"2019-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MILVLG/mcan-vqa","path":"core/model/optim.py","file_url":"https://github.com/MILVLG/mcan-vqa/blob/HEAD/core/model/optim.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":"b6bf5a95f3801883","code_sha256_prefix":"b6bf5a95f3801883","mcp_get_code":{"code_sha256":"b6bf5a95f3801883"}},{"arxiv_id":"aaai_28607","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28607","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"GuangmingZhu/SketchESC","path":"inversion/main_inversion.py","file_url":"https://github.com/GuangmingZhu/SketchESC/blob/HEAD/inversion/main_inversion.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":"89169ce9effdd614","code_sha256_prefix":"89169ce9effdd614","mcp_get_code":{"code_sha256":"89169ce9effdd614"}},{"arxiv_id":"aaai_28253","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28253","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"qiantianwen/NuScenes-QA","path":"src/utils/optim.py","file_url":"https://github.com/qiantianwen/NuScenes-QA/blob/HEAD/src/utils/optim.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":"9e822b9d34a49db0","code_sha256_prefix":"9e822b9d34a49db0","mcp_get_code":{"code_sha256":"9e822b9d34a49db0"}},{"arxiv_id":"2023.findings-acl.810","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.810","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yoyo-yun/DG_RRR","path":"models/get_optim.py","file_url":"https://github.com/yoyo-yun/DG_RRR/blob/HEAD/models/get_optim.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":"a034475a3896a941","code_sha256_prefix":"a034475a3896a941","mcp_get_code":{"code_sha256":"a034475a3896a941"}}],"record_sha256":"67791549851e9bfa2cfbdf9667c4559a586383e918f3523f956c43a2de76a4f9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}