{"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/mape","entry":"mape","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":10,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":10,"n_places_pointer_only":5,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"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":"2609.01765","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01765","title":"Toward Explainable and Policy-Aware AI for Carbon Credit Price Prediction: A Research Framework for Emerging Carbon Markets","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Kimalice/Toward-Explainable-and-Policy-Aware-AI-for-Carbon-Credit-Price-Prediction","path":"paxcarbonnet/metrics.py","file_url":"https://github.com/Kimalice/Toward-Explainable-and-Policy-Aware-AI-for-Carbon-Credit-Price-Prediction/blob/HEAD/paxcarbonnet/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Kimalice/Toward-Explainable-and-Policy-Aware-AI-for-Carbon-Credit-Price-Prediction (NOASSERTION)","code_sha256":"67b14f55d8ed695d","code_sha256_prefix":"67b14f55d8ed695d","mcp_get_code":{"code_sha256":"67b14f55d8ed695d"}},{"arxiv_id":"2608.18675","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-18675","title":"An Empirical Benchmark of Deep Time-Series Models for Smart Meter Energy Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"behnazkavoosi/Energy-Time-Series-Library","path":"compute_metrics.py","file_url":"https://github.com/behnazkavoosi/Energy-Time-Series-Library/blob/HEAD/compute_metrics.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef459726ef257947","code_sha256_prefix":"ef459726ef257947","mcp_get_code":{"code_sha256":"ef459726ef257947"}},{"arxiv_id":"2601.03683","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03683","title":"Rethinking Recurrent Neural Networks for Time Series Forecasting: A Reinforced Recurrent Encoder with Prediction-Oriented Proximal Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Laixin233/-Reinforced-Encoder","path":"task/metric.py","file_url":"https://github.com/Laixin233/-Reinforced-Encoder/blob/HEAD/task/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Laixin233/-Reinforced-Encoder when it was checked","code_sha256":"885bbfff5614ce61","code_sha256_prefix":"885bbfff5614ce61","mcp_get_code":{"code_sha256":"885bbfff5614ce61"}},{"arxiv_id":"2503.04446","arxiv_id_is_arxiv":true,"paper":"/paper/smtpd-a-new-benchmark-for-temporal-prediction","title":"SMTPD: A New Benchmark for Temporal Prediction of Social Media Popularity","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"zhuwei321/SMTPD","path":"utils.py","file_url":"https://github.com/zhuwei321/SMTPD/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d625b0d73ff5f604","code_sha256_prefix":"d625b0d73ff5f604","mcp_get_code":{"code_sha256":"d625b0d73ff5f604"}},{"arxiv_id":"2009.11848","arxiv_id_is_arxiv":true,"paper":"/paper/how-neural-networks-extrapolate-from","title":"How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinglingli/nn-extrapolate","path":"feedforward/MLPs.py","file_url":"https://github.com/jinglingli/nn-extrapolate/blob/HEAD/feedforward/MLPs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jinglingli/nn-extrapolate when it was checked","code_sha256":"e570468b6f81a89c","code_sha256_prefix":"e570468b6f81a89c","mcp_get_code":{"code_sha256":"e570468b6f81a89c"}},{"arxiv_id":"2007.09601","arxiv_id_is_arxiv":true,"paper":"/paper/hypersolvers-toward-fast-continuous-depth","title":"Hypersolvers: Toward Fast Continuous-Depth Models","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DiffEqML/diffeqml-research","path":"hypersolvers-control/src/utils.py","file_url":"https://github.com/DiffEqML/diffeqml-research/blob/HEAD/hypersolvers-control/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"036472db72b08a56","code_sha256_prefix":"036472db72b08a56","mcp_get_code":{"code_sha256":"036472db72b08a56"}},{"arxiv_id":"2003.11235","arxiv_id_is_arxiv":true,"paper":"/paper/autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucasthim/auto-fuzzy","path":"autoMFIS/changeParameterAutoMFIS.py","file_url":"https://github.com/lucasthim/auto-fuzzy/blob/HEAD/autoMFIS/changeParameterAutoMFIS.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17d533ffea6cedc9","code_sha256_prefix":"17d533ffea6cedc9","mcp_get_code":{"code_sha256":"17d533ffea6cedc9"}},{"arxiv_id":"1709.01907","arxiv_id_is_arxiv":true,"paper":"/paper/deep-and-confident-prediction-for-time-series","title":"Deep and Confident Prediction for Time Series at Uber","date":"2017-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0925b30ca046f87b","code_sha256_prefix":"0925b30ca046f87b","mcp_get_code":{"code_sha256":"0925b30ca046f87b"}},{"arxiv_id":"1502.04681","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-video","title":"Unsupervised Learning of Video Representations using LSTMs","date":"2015-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ManjunathAdi/Seq2Seq_RNN","path":"RNN_Sequence2seq_Feature-extraction.py","file_url":"https://github.com/ManjunathAdi/Seq2Seq_RNN/blob/HEAD/RNN_Sequence2seq_Feature-extraction.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ManjunathAdi/Seq2Seq_RNN when it was checked","code_sha256":"0925b30ca046f87b","code_sha256_prefix":"0925b30ca046f87b","mcp_get_code":{"code_sha256":"0925b30ca046f87b"}},{"arxiv_id":"aaai_33789","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_33789","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dingyanna/LC-GODE","path":"util_tmp.py","file_url":"https://github.com/dingyanna/LC-GODE/blob/HEAD/util_tmp.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":"4e2c1a23a8a747f9","code_sha256_prefix":"4e2c1a23a8a747f9","mcp_get_code":{"code_sha256":"4e2c1a23a8a747f9"}}],"record_sha256":"2135d73881b639eb0304cee1540f6e3dbedaa61f7c6aa25a8a008d718bba405b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}