{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/objective","entry":"objective","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":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":15,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":15,"n_places_pointer_only":6,"by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":11},"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":"2608.15492","paper":"/paper/arxiv-2608-15492","title":"QSMP: finding representative time series subsequences through Quick Shift+Matrix Profile","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"cniel-ud/qsmp","path":"qsmp/alphacsc/learn_z.py","file_url":"https://github.com/cniel-ud/qsmp/blob/HEAD/qsmp/alphacsc/learn_z.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f31326254466652b","mcp_get_code":{"code_sha256":"f31326254466652b"}},{"arxiv_id":"2604.20744","paper":"/paper/arxiv-2604-20744","title":"AAC: Admissible-by-Architecture Differentiable Landmark Compression for ALT","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"anindex/aac","path":"src/aac/selection.py","file_url":"https://github.com/anindex/aac/blob/HEAD/src/aac/selection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0c8d1fc0f878dbab","mcp_get_code":{"code_sha256":"0c8d1fc0f878dbab"}},{"arxiv_id":"2603.14987","paper":"/paper/arxiv-2603-14987","title":"Beyond Benchmark Islands: Toward Representative Trustworthiness Evaluation for Agentic AI","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"TonyQJH/haaf-pilot","path":"layer4_sampling.py","file_url":"https://github.com/TonyQJH/haaf-pilot/blob/HEAD/layer4_sampling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"18712d2782d02130","mcp_get_code":{"code_sha256":"18712d2782d02130"}},{"arxiv_id":"2504.06919","paper":"/paper/correcting-for-interloper-contamination-in","title":"Correcting for interloper contamination in the power spectrum with neural networks","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":"archive","repo":"mcagliari/nointernet","path":"src/training/NoInterNet_hyper_optimization.py","file_url":"https://github.com/mcagliari/nointernet/blob/HEAD/src/training/NoInterNet_hyper_optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a265dffcebeaf86","mcp_get_code":{"code_sha256":"1a265dffcebeaf86"}},{"arxiv_id":"2504.06919","paper":"/paper/correcting-for-interloper-contamination-in","title":"Correcting for interloper contamination in the power spectrum with neural networks","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":"archive","repo":"mcagliari/nointernet","path":"src/training/NoInterNet_hyper_optimization_PB.py","file_url":"https://github.com/mcagliari/nointernet/blob/HEAD/src/training/NoInterNet_hyper_optimization_PB.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cae86a8911fca0a","mcp_get_code":{"code_sha256":"1cae86a8911fca0a"}},{"arxiv_id":"2405.20082","paper":"/paper/segment-shuffle-and-stitch-a-simple-mechanism","title":"Segment, Shuffle, and Stitch: A Simple Layer for Improving Time-Series Representations","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shivam-grover/s3-timeseries","path":"example/grid_search_template.py","file_url":"https://github.com/shivam-grover/s3-timeseries/blob/HEAD/example/grid_search_template.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5e38e239bde01c7c","mcp_get_code":{"code_sha256":"5e38e239bde01c7c"}},{"arxiv_id":"2311.10580","paper":"/paper/implicit-maximum-a-posteriori-filtering-via","title":"Implicit Maximum a Posteriori Filtering via Adaptive Optimization","date":"2023-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gianlucabencomo/implicitmap","path":"nonlinear/contour.py","file_url":"https://github.com/gianlucabencomo/implicitmap/blob/HEAD/nonlinear/contour.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a280319a695f48dc","mcp_get_code":{"code_sha256":"a280319a695f48dc"}},{"arxiv_id":"2306.08687","paper":"/paper/norm-guided-latent-space-exploration-for-text-1","title":"Norm-guided latent space exploration for text-to-image generation","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvirsamuel/SeedSelect","path":"nao/norm_aware_optimization.py","file_url":"https://github.com/dvirsamuel/SeedSelect/blob/HEAD/nao/norm_aware_optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7415b088d69422e2","mcp_get_code":{"code_sha256":"7415b088d69422e2"}},{"arxiv_id":"2111.14874","paper":"/paper/weighing-the-milky-way-and-andromeda-with","title":"Weighing the Milky Way and Andromeda with Artificial Intelligence","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PabloVD/HaloGraphNet","path":"hyperparams_optimization.py","file_url":"https://github.com/PabloVD/HaloGraphNet/blob/HEAD/hyperparams_optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a411d1f9a4cbd15","mcp_get_code":{"code_sha256":"6a411d1f9a4cbd15"}},{"arxiv_id":"2102.06782","paper":"/paper/q-value-weighted-regression-reinforcement-1","title":"Q-Value Weighted Regression: Reinforcement Learning with Limited Data","date":"2021-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vub-ai-lab/qwr","path":"optuna_tune.py","file_url":"https://github.com/vub-ai-lab/qwr/blob/HEAD/optuna_tune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ec2787f564c2d1c","mcp_get_code":{"code_sha256":"0ec2787f564c2d1c"}},{"arxiv_id":"1911.00218","paper":"/paper/statistical-model-aggregation-via-parameter","title":"Statistical Model Aggregation via Parameter Matching","date":"2019-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/SPAHM","path":"topicmodeling/matching/gaus_marginal_matching.py","file_url":"https://github.com/IBM/SPAHM/blob/HEAD/topicmodeling/matching/gaus_marginal_matching.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f0dbe0dba17ea5c","mcp_get_code":{"code_sha256":"3f0dbe0dba17ea5c"}},{"arxiv_id":"1712.06567","paper":"/paper/deep-neuroevolution-genetic-algorithms-are-a","title":"Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning","date":"2017-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optimization-toolbox/DNE4py","path":"DNE4py/version_v2/new_tutorials/tutorials2/pp_run.py","file_url":"https://github.com/optimization-toolbox/DNE4py/blob/HEAD/DNE4py/version_v2/new_tutorials/tutorials2/pp_run.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"1fc06388f906350c","mcp_get_code":{"code_sha256":"1fc06388f906350c"}},{"arxiv_id":"1604.00772","paper":"/paper/the-cma-evolution-strategy-a-tutorial","title":"The CMA Evolution Strategy: A Tutorial","date":"2016-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohnYKiyo/coco_trial","path":"example.py","file_url":"https://github.com/JohnYKiyo/coco_trial/blob/HEAD/example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d2817c655919766","mcp_get_code":{"code_sha256":"0d2817c655919766"}},{"arxiv_id":"1412.6980","paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rokkian/adam_implementation","path":"adam_implementation.py","file_url":"https://github.com/rokkian/adam_implementation/blob/HEAD/adam_implementation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f6c61d4de559ffe9","mcp_get_code":{"code_sha256":"f6c61d4de559ffe9"}},{"arxiv_id":"1202.1056","paper":"/paper/building-a-framework-for-predictive-science","title":"Building a Framework for Predictive Science","date":null,"month_inferred_from_arxiv_id":"2012-02","title_source":"archive","repo":"uqfoundation/mystic","path":"examples2/constrained_scipy.py","file_url":"https://github.com/uqfoundation/mystic/blob/HEAD/examples2/constrained_scipy.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"621cc5bb1ecdb5d1","mcp_get_code":{"code_sha256":"621cc5bb1ecdb5d1"}}]}