{"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/smooth-curve","entry":"smooth_curve","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":6,"n_papers_ran":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":6,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":3},"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":"2603.00903","paper":"/paper/arxiv-2603-00903","title":"Principled Fast and Meta Knowledge Learners for Continual Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"datake/FAME","path":"Atari/plot_ablation_input_head.py","file_url":"https://github.com/datake/FAME/blob/HEAD/Atari/plot_ablation_input_head.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a8ecade66647f14","mcp_get_code":{"code_sha256":"8a8ecade66647f14"}},{"arxiv_id":"2404.18988","paper":"/paper/markovian-agents-for-truthful-language","title":"Markovian Transformers for Informative Language Modeling","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scottviteri/MarkovianTraining","path":"src/analyze_base_logprobs.py","file_url":"https://github.com/scottviteri/MarkovianTraining/blob/HEAD/src/analyze_base_logprobs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"097f57d1b35cac5c","mcp_get_code":{"code_sha256":"097f57d1b35cac5c"}},{"arxiv_id":"2010.08153","paper":"/paper/on-the-exact-computation-of-linear-frequency","title":"On the exact computation of linear frequency principle dynamics and its generalization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuzhiqin1990/LFP","path":"BasicFunc.py","file_url":"https://github.com/xuzhiqin1990/LFP/blob/HEAD/BasicFunc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d04898a3d2cb80f4","mcp_get_code":{"code_sha256":"d04898a3d2cb80f4"}},{"arxiv_id":"2004.10924","paper":"/paper/polylanenet-lane-estimation-via-deep","title":"PolyLaneNet: Lane Estimation via Deep Polynomial Regression","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucastabelini/PolyLaneNet","path":"utils/plot_log.py","file_url":"https://github.com/lucastabelini/PolyLaneNet/blob/HEAD/utils/plot_log.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e93e343e68c08583","mcp_get_code":{"code_sha256":"e93e343e68c08583"}},{"arxiv_id":"1907.02189","paper":"/paper/on-the-convergence-of-fedavg-on-non-iid-data","title":"On the Convergence of FedAvg on Non-IID Data","date":"2019-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmgxr128/mifa_code","path":"plot.py","file_url":"https://github.com/hmgxr128/mifa_code/blob/HEAD/plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9c55ec78ad29aa46","mcp_get_code":{"code_sha256":"9c55ec78ad29aa46"}},{"arxiv_id":"2024.naacl-long.450","paper":null,"title":"arXiv:2024.naacl-long.450","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/DeepSpeedExamples","path":"training/bf16_master_weight/plot_loss.py","file_url":"https://github.com/microsoft/DeepSpeedExamples/blob/HEAD/training/bf16_master_weight/plot_loss.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":"810a2ba59687b9ea","mcp_get_code":{"code_sha256":"810a2ba59687b9ea"}}]}