{"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","entry":"create","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":5,"n_papers_ran_no_instrument_failure":5,"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":17,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":2,"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":12},"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.13941","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13941","title":"EVOLVEMEM: Self-Evolving Memory Architecture via AutoResearch for LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"aiming-lab/SimpleMem","path":"simplemem_router.py","file_url":"https://github.com/aiming-lab/SimpleMem/blob/HEAD/simplemem_router.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":"195aac435fbd2487","code_sha256_prefix":"195aac435fbd2487","mcp_get_code":{"code_sha256":"195aac435fbd2487"}},{"arxiv_id":"2605.02675","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-02675","title":"Online Generalised Predictive Coding","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MLDawn/ODEM","path":"functions/create_multivariate_gaussian.py","file_url":"https://github.com/MLDawn/ODEM/blob/HEAD/functions/create_multivariate_gaussian.py","status":"ran","verification_level":1,"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, MLDawn/ODEM, is not in the permissive set Syntology serves inline","code_sha256":"e02588d85e3fd46b","code_sha256_prefix":"e02588d85e3fd46b","mcp_get_code":{"code_sha256":"e02588d85e3fd46b"}},{"arxiv_id":"2410.13842","arxiv_id_is_arxiv":true,"paper":"/paper/d-fine-redefine-regression-task-in-detrs-as","title":"D-FINE: Redefine Regression Task in DETRs as Fine-grained Distribution Refinement","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Peterande/D-FINE","path":"src/core/workspace.py","file_url":"https://github.com/Peterande/D-FINE/blob/HEAD/src/core/workspace.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":"eb5e01d60557539c","code_sha256_prefix":"eb5e01d60557539c","mcp_get_code":{"code_sha256":"eb5e01d60557539c"}},{"arxiv_id":"2409.18591","arxiv_id_is_arxiv":true,"paper":"/paper/off-to-new-shores-a-dataset-benchmark-for","title":"Off to new Shores: A Dataset & Benchmark for (near-)coastal Flood Inundation Forecasting","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multihuntr/gff","path":"gff/models/creation.py","file_url":"https://github.com/multihuntr/gff/blob/HEAD/gff/models/creation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7912da165baa8d8","code_sha256_prefix":"a7912da165baa8d8","mcp_get_code":{"code_sha256":"a7912da165baa8d8"}},{"arxiv_id":"2408.12246","arxiv_id_is_arxiv":true,"paper":"/paper/ova-detr-open-vocabulary-aerial-object","title":"OVA-DETR: Open Vocabulary Aerial Object Detection Using Image-Text Alignment and Fusion","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-Wei/RT-OVAD","path":"src/core/yaml_utils.py","file_url":"https://github.com/GT-Wei/RT-OVAD/blob/HEAD/src/core/yaml_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":"da548fcd02ec18bd","code_sha256_prefix":"da548fcd02ec18bd","mcp_get_code":{"code_sha256":"da548fcd02ec18bd"}},{"arxiv_id":"2401.15335","arxiv_id_is_arxiv":true,"paper":"/paper/l-autoda-leveraging-large-language-models-for","title":"L-AutoDA: Leveraging Large Language Models for Automated Decision-based Adversarial Attacks","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FeiLiu36/LLM4MOEA","path":"MOEAD-LLM/pymoo/algorithms/hyperparameters.py","file_url":"https://github.com/FeiLiu36/LLM4MOEA/blob/HEAD/MOEAD-LLM/pymoo/algorithms/hyperparameters.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":"a7040e3e99b92e1b","code_sha256_prefix":"a7040e3e99b92e1b","mcp_get_code":{"code_sha256":"a7040e3e99b92e1b"}},{"arxiv_id":"2310.08491","arxiv_id_is_arxiv":true,"paper":"/paper/prometheus-inducing-fine-grained-evaluation","title":"Prometheus: Inducing Fine-grained Evaluation Capability in Language Models","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaistAI/Prometheus","path":"evaluation/benchmark/run_absolute_scoring.py","file_url":"https://github.com/kaistAI/Prometheus/blob/HEAD/evaluation/benchmark/run_absolute_scoring.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":"5743b6ea08e5b7b3","code_sha256_prefix":"5743b6ea08e5b7b3","mcp_get_code":{"code_sha256":"5743b6ea08e5b7b3"}},{"arxiv_id":"2310.08491","arxiv_id_is_arxiv":true,"paper":"/paper/prometheus-inducing-fine-grained-evaluation","title":"Prometheus: Inducing Fine-grained Evaluation Capability in Language Models","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaistAI/Prometheus","path":"evaluation/benchmark/run_relative_scoring.py","file_url":"https://github.com/kaistAI/Prometheus/blob/HEAD/evaluation/benchmark/run_relative_scoring.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":"b953d7f234bcb588","code_sha256_prefix":"b953d7f234bcb588","mcp_get_code":{"code_sha256":"b953d7f234bcb588"}},{"arxiv_id":"2309.16609","arxiv_id_is_arxiv":true,"paper":"/paper/qwen-technical-report","title":"Qwen Technical Report","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QwenLM/Qwen-7B","path":"dcu-support/package/fastllm_pytools/hf_model.py","file_url":"https://github.com/QwenLM/Qwen-7B/blob/HEAD/dcu-support/package/fastllm_pytools/hf_model.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":"a5028c61c94869d8","code_sha256_prefix":"a5028c61c94869d8","mcp_get_code":{"code_sha256":"a5028c61c94869d8"}},{"arxiv_id":"2106.12997","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-with-high-dimensional","title":"Bayesian Optimization with High-Dimensional Outputs","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msu-coinlab/pymoo","path":"pymoo/algorithms/hyperparameters.py","file_url":"https://github.com/msu-coinlab/pymoo/blob/HEAD/pymoo/algorithms/hyperparameters.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":"a7040e3e99b92e1b","code_sha256_prefix":"a7040e3e99b92e1b","mcp_get_code":{"code_sha256":"a7040e3e99b92e1b"}},{"arxiv_id":"2105.14432","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-deep-image-matching-for","title":"TransMatcher: Deep Image Matching Through Transformers for Generalizable Person Re-identification","date":"2021-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShengcaiLiao/QAConv","path":"reid/models/resmap.py","file_url":"https://github.com/ShengcaiLiao/QAConv/blob/HEAD/reid/models/resmap.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":"6a5b9f52cf3678a2","code_sha256_prefix":"6a5b9f52cf3678a2","mcp_get_code":{"code_sha256":"6a5b9f52cf3678a2"}},{"arxiv_id":"2105.14432","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-deep-image-matching-for","title":"TransMatcher: Deep Image Matching Through Transformers for Generalizable Person Re-identification","date":"2021-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShengcaiLiao/QAConv","path":"projects/transmatcher/restranmap.py","file_url":"https://github.com/ShengcaiLiao/QAConv/blob/HEAD/projects/transmatcher/restranmap.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":"10c6466fe43af640","code_sha256_prefix":"10c6466fe43af640","mcp_get_code":{"code_sha256":"10c6466fe43af640"}},{"arxiv_id":"2006.12774","arxiv_id_is_arxiv":true,"paper":"/paper/surpassing-real-world-source-training-data","title":"Surpassing Real-World Source Training Data: Random 3D Characters for Generalizable Person Re-Identification","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VideoObjectSearch/RandPerson","path":"trainCode/Source/ablation/resgap.py","file_url":"https://github.com/VideoObjectSearch/RandPerson/blob/HEAD/trainCode/Source/ablation/resgap.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":"0017f2853f599c52","code_sha256_prefix":"0017f2853f599c52","mcp_get_code":{"code_sha256":"0017f2853f599c52"}},{"arxiv_id":"1904.12043","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-mini-batch-sgd-for-elastic","title":"Dynamic Mini-batch SGD for Elastic Distributed Training: Learning in the Limbo of Resources","date":"2019-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/dynamic-training-with-apache-mxnet-on-aws","path":"python/mxnet/kvstore.py","file_url":"https://github.com/awslabs/dynamic-training-with-apache-mxnet-on-aws/blob/HEAD/python/mxnet/kvstore.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, awslabs/dynamic-training-with-apache-mxnet-on-aws, 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":"9ff2673d6a779a1a","code_sha256_prefix":"9ff2673d6a779a1a","mcp_get_code":{"code_sha256":"9ff2673d6a779a1a"}},{"arxiv_id":"1802.08773","arxiv_id_is_arxiv":true,"paper":"/paper/graphrnn-generating-realistic-graphs-with","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/GraphRNN","path":"create_graphs.py","file_url":"https://github.com/snap-stanford/GraphRNN/blob/HEAD/create_graphs.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":"72a0035803c73117","code_sha256_prefix":"72a0035803c73117","mcp_get_code":{"code_sha256":"72a0035803c73117"}},{"arxiv_id":"1703.04044","arxiv_id_is_arxiv":true,"paper":"/paper/colorization-as-a-proxy-task-for-visual","title":"Colorization as a Proxy Task for Visual Understanding","date":"2017-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gustavla/self-supervision","path":"selfsup/info.py","file_url":"https://github.com/gustavla/self-supervision/blob/HEAD/selfsup/info.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8359957dc18b9b75","code_sha256_prefix":"8359957dc18b9b75","mcp_get_code":{"code_sha256":"8359957dc18b9b75"}},{"arxiv_id":"1312.4400","arxiv_id_is_arxiv":true,"paper":"/paper/network-in-network","title":"Network In Network","date":"2013-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PowerOfDream/digitx","path":"digitx_model.py","file_url":"https://github.com/PowerOfDream/digitx/blob/HEAD/digitx_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":"ef29cbad4c412a95","code_sha256_prefix":"ef29cbad4c412a95","mcp_get_code":{"code_sha256":"ef29cbad4c412a95"}},{"arxiv_id":"openreview_8jViL8YrB1","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_8jViL8YrB1","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CyberAgentAILab/cenreg","path":"src/cenreg/model/copula_np.py","file_url":"https://github.com/CyberAgentAILab/cenreg/blob/HEAD/src/cenreg/model/copula_np.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":"5d67dc83b8b95a51","code_sha256_prefix":"5d67dc83b8b95a51","mcp_get_code":{"code_sha256":"5d67dc83b8b95a51"}},{"arxiv_id":"Wang_Object_Detection_using_Event_Camera_A_MoE_Heat_Conduction_based_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Object_Detection_using_Event_Camera_A_MoE_Heat_Conduction_based_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Event-AHU/OpenEvDET","path":"CvHeat-DET/src/core/yaml_utils.py","file_url":"https://github.com/Event-AHU/OpenEvDET/blob/HEAD/CvHeat-DET/src/core/yaml_utils.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":"da548fcd02ec18bd","code_sha256_prefix":"da548fcd02ec18bd","mcp_get_code":{"code_sha256":"da548fcd02ec18bd"}}],"record_sha256":"e3a06015833276eadf015344f1fec353b79f9cc25d30ef768faf4750ea1aec9f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}