{"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/lr-decay","entry":"lr_decay","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":10,"n_papers_ran":7,"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":8,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":4},"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":"2503.17267","paper":"/paper/physical-plausibility-aware-trajectory","title":"Physical Plausibility-aware Trajectory Prediction via Locomotion Embodiment","date":"2025-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ImIntheMiddle/EmLoco","path":"EqMotion/main_eth_diverse.py","file_url":"https://github.com/ImIntheMiddle/EmLoco/blob/HEAD/EqMotion/main_eth_diverse.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2410.13027","paper":"/paper/geometric-trajectory-diffusion-models","title":"Geometric Trajectory Diffusion Models","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanjq17/geotdm","path":"experiments/eth_train_new.py","file_url":"https://github.com/hanjq17/geotdm/blob/HEAD/experiments/eth_train_new.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2308.08942","paper":"/paper/auxiliary-tasks-benefit-3d-skeleton-based","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/auxformer","path":"main_3dpw.py","file_url":"https://github.com/mediabrain-sjtu/auxformer/blob/HEAD/main_3dpw.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2305.14642","paper":"/paper/2305-14642","title":"Newton-Cotes Graph Neural Networks: On the Time Evolution of Dynamic Systems","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/ncgnn","path":"EqMotion/main_nbody_reasoning.py","file_url":"https://github.com/zjukg/ncgnn/blob/HEAD/EqMotion/main_nbody_reasoning.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2303.16242","paper":"/paper/cunerf-cube-based-neural-radiance-field-for","title":"CuNeRF: Cube-Based Neural Radiance Field for Zero-Shot Medical Image Arbitrary-Scale Super Resolution","date":"2023-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NarcissusEx/CuNeRF","path":"src/utils.py","file_url":"https://github.com/NarcissusEx/CuNeRF/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e7cb5262be26f62","mcp_get_code":{"code_sha256":"7e7cb5262be26f62"}},{"arxiv_id":"1904.01324","paper":"/paper/monocular-3d-human-pose-estimation-by-1","title":"Monocular 3D Human Pose Estimation by Generation and Ordinal Ranking","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssfootball04/generative_pose","path":"src/utils.py","file_url":"https://github.com/ssfootball04/generative_pose/blob/HEAD/src/utils.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":"af9fe6a03f6ad788","mcp_get_code":{"code_sha256":"af9fe6a03f6ad788"}},{"arxiv_id":"1901.10879","paper":"/paper/span-based-open-information-extraction","title":"Span Model for Open Information Extraction on Accurate Corpus","date":"2019-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanjunlang/Span_OIE","path":"main_span.py","file_url":"https://github.com/zhanjunlang/Span_OIE/blob/HEAD/main_span.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"652e6ae7ede80cf4","mcp_get_code":{"code_sha256":"652e6ae7ede80cf4"}},{"arxiv_id":"1901.01660","paper":"/paper/deeper-and-wider-siamese-networks-for-real","title":"Deeper and Wider Siamese Networks for Real-Time Visual Tracking","date":"2019-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"researchmm/SiamDW","path":"siamese_tracking/train_siamfc.py","file_url":"https://github.com/researchmm/SiamDW/blob/HEAD/siamese_tracking/train_siamfc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"05eeb398e5bfdf18","mcp_get_code":{"code_sha256":"05eeb398e5bfdf18"}},{"arxiv_id":"1506.05869","paper":"/paper/a-neural-conversational-model","title":"A Neural Conversational Model","date":"2015-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Paarth3098/chatbot_p","path":"chatbot.py","file_url":"https://github.com/Paarth3098/chatbot_p/blob/HEAD/chatbot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7627df7dd7e8450b","mcp_get_code":{"code_sha256":"7627df7dd7e8450b"}},{"arxiv_id":"1412.6071","paper":"/paper/fractional-max-pooling","title":"Fractional Max-Pooling","date":"2014-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laplacetw/vgg-like-cifar10","path":"fmp_cifar10.py","file_url":"https://github.com/laplacetw/vgg-like-cifar10/blob/HEAD/fmp_cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e906d52e487c7b36","mcp_get_code":{"code_sha256":"e906d52e487c7b36"}},{"arxiv_id":"1412.6071","paper":"/paper/fractional-max-pooling","title":"Fractional Max-Pooling","date":"2014-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laplacetw/vgg-like-cifar10","path":"jason_brownlee_cifar10.py","file_url":"https://github.com/laplacetw/vgg-like-cifar10/blob/HEAD/jason_brownlee_cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"33e29a8cc5c2fe60","mcp_get_code":{"code_sha256":"33e29a8cc5c2fe60"}}]}