{"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/lr-decay","entry":"lr_decay","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":7,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":4,"unverified":0},"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":"2503.17267","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d967154c60f2573c","code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2410.13027","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d967154c60f2573c","code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2308.08942","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mediabrain-sjtu/auxformer when it was checked","code_sha256":"d967154c60f2573c","code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2305.14642","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d967154c60f2573c","code_sha256_prefix":"d967154c60f2573c","mcp_get_code":{"code_sha256":"d967154c60f2573c"}},{"arxiv_id":"2303.16242","arxiv_id_is_arxiv":true,"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":"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":"7e7cb5262be26f62","code_sha256_prefix":"7e7cb5262be26f62","mcp_get_code":{"code_sha256":"7e7cb5262be26f62"}},{"arxiv_id":"1904.01324","arxiv_id_is_arxiv":true,"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":"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":"af9fe6a03f6ad788","code_sha256_prefix":"af9fe6a03f6ad788","mcp_get_code":{"code_sha256":"af9fe6a03f6ad788"}},{"arxiv_id":"1901.10879","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhanjunlang/Span_OIE when it was checked","code_sha256":"652e6ae7ede80cf4","code_sha256_prefix":"652e6ae7ede80cf4","mcp_get_code":{"code_sha256":"652e6ae7ede80cf4"}},{"arxiv_id":"1901.01660","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05eeb398e5bfdf18","code_sha256_prefix":"05eeb398e5bfdf18","mcp_get_code":{"code_sha256":"05eeb398e5bfdf18"}},{"arxiv_id":"1506.05869","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Paarth3098/chatbot_p when it was checked","code_sha256":"7627df7dd7e8450b","code_sha256_prefix":"7627df7dd7e8450b","mcp_get_code":{"code_sha256":"7627df7dd7e8450b"}},{"arxiv_id":"1412.6071","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e906d52e487c7b36","code_sha256_prefix":"e906d52e487c7b36","mcp_get_code":{"code_sha256":"e906d52e487c7b36"}},{"arxiv_id":"1412.6071","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33e29a8cc5c2fe60","code_sha256_prefix":"33e29a8cc5c2fe60","mcp_get_code":{"code_sha256":"33e29a8cc5c2fe60"}}],"record_sha256":"7bf292b804eec2dfb933e1ed3662f2a77eb78dc15867ac549eb658691858ddde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}