{"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/roll","entry":"roll","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":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":3,"unverified":1},"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":"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":"layers/DWT_Decomposition.py","file_url":"https://github.com/behnazkavoosi/Energy-Time-Series-Library/blob/HEAD/layers/DWT_Decomposition.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":"d80521898a085cf9","code_sha256_prefix":"d80521898a085cf9","mcp_get_code":{"code_sha256":"d80521898a085cf9"}},{"arxiv_id":"2510.20273","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20273","title":"SynTSBench: Rethinking Temporal Pattern Learning in Deep Learning Models for Time Series","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"TanQitai/SynTSBench","path":"layers/DWT_Decomposition.py","file_url":"https://github.com/TanQitai/SynTSBench/blob/HEAD/layers/DWT_Decomposition.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TanQitai/SynTSBench when it was checked","code_sha256":"d80521898a085cf9","code_sha256_prefix":"d80521898a085cf9","mcp_get_code":{"code_sha256":"d80521898a085cf9"}},{"arxiv_id":"2506.10412","arxiv_id_is_arxiv":true,"paper":"/paper/time-imm-a-dataset-and-benchmark-for","title":"Time-IMM: A Dataset and Benchmark for Irregular Multimodal Multivariate Time Series","date":"2025-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blacksnail789521/IMM-TSF","path":"layers/DWT_Decomposition.py","file_url":"https://github.com/blacksnail789521/IMM-TSF/blob/HEAD/layers/DWT_Decomposition.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":"d80521898a085cf9","code_sha256_prefix":"d80521898a085cf9","mcp_get_code":{"code_sha256":"d80521898a085cf9"}},{"arxiv_id":"2409.19433","arxiv_id_is_arxiv":true,"paper":"/paper/rmlr-extending-multinomial-logistic","title":"RMLR: Extending Multinomial Logistic Regression into General Geometries","date":"2024-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gitzh-chen/spdmlr","path":"spdnets/cplx/functional.py","file_url":"https://github.com/gitzh-chen/spdmlr/blob/HEAD/spdnets/cplx/functional.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gitzh-chen/spdmlr when it was checked","code_sha256":"bddd9f00eeb35219","code_sha256_prefix":"bddd9f00eeb35219","mcp_get_code":{"code_sha256":"bddd9f00eeb35219"}},{"arxiv_id":"2403.11261","arxiv_id_is_arxiv":true,"paper":"/paper/a-lie-group-approach-to-riemannian-batch","title":"A Lie Group Approach to Riemannian Batch Normalization","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gitzh-chen/liebn","path":"LieBN_SPDNet/cplx/functional.py","file_url":"https://github.com/gitzh-chen/liebn/blob/HEAD/LieBN_SPDNet/cplx/functional.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gitzh-chen/liebn when it was checked","code_sha256":"bddd9f00eeb35219","code_sha256_prefix":"bddd9f00eeb35219","mcp_get_code":{"code_sha256":"bddd9f00eeb35219"}},{"arxiv_id":"2401.05064","arxiv_id_is_arxiv":true,"paper":"/paper/singer-identity-representation-learning-using-1","title":"Singer Identity Representation Learning using Self-Supervised Techniques","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SonyCSLParis/ssl-singer-identity","path":"singer_identity/utils/core.py","file_url":"https://github.com/SonyCSLParis/ssl-singer-identity/blob/HEAD/singer_identity/utils/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"865df4f8fa0dee96","code_sha256_prefix":"865df4f8fa0dee96","mcp_get_code":{"code_sha256":"865df4f8fa0dee96"}},{"arxiv_id":"2303.05754","arxiv_id_is_arxiv":true,"paper":"/paper/fast-diffusion-sampler-for-inverse-problems","title":"Decomposed Diffusion Sampler for Accelerating Large-Scale Inverse Problems","date":"2023-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hj-harry/dds","path":"solver_2d.py","file_url":"https://github.com/hj-harry/dds/blob/HEAD/solver_2d.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hj-harry/dds when it was checked","code_sha256":"96ca075a8ebe94a7","code_sha256_prefix":"96ca075a8ebe94a7","mcp_get_code":{"code_sha256":"96ca075a8ebe94a7"}},{"arxiv_id":"2010.04730","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-and-unsupervised-phase","title":"Interpretable and unsupervised phase classification","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"arnoldjulian/Interpretable-and-unsupervised-phase-classification","path":"prediction_based_method/DNNs/utils.py","file_url":"https://github.com/arnoldjulian/Interpretable-and-unsupervised-phase-classification/blob/HEAD/prediction_based_method/DNNs/utils.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":"0f6137a6bce3dd5f","code_sha256_prefix":"0f6137a6bce3dd5f","mcp_get_code":{"code_sha256":"0f6137a6bce3dd5f"}},{"arxiv_id":"2004.05477","arxiv_id_is_arxiv":true,"paper":"/paper/learned-discretizations-for-passive-scalar","title":"Learned discretizations for passive scalar advection in a 2-D turbulent flow","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"google-research/data-driven-pdes","path":"datadrivenpdes/core/tensor_ops.py","file_url":"https://github.com/google-research/data-driven-pdes/blob/HEAD/datadrivenpdes/core/tensor_ops.py","status":"unverified","verification_level":0,"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":"e3ddf75454d7f056","code_sha256_prefix":"e3ddf75454d7f056","mcp_get_code":{"code_sha256":"e3ddf75454d7f056"}},{"arxiv_id":"1806.06498","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-affordance-learning-for-driving","title":"Conditional Affordance Learning for Driving in Urban Environments","date":"2018-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl-sr/CAL","path":"training/dataloader.py","file_url":"https://github.com/xl-sr/CAL/blob/HEAD/training/dataloader.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":"f5b8b09a8822c2de","code_sha256_prefix":"f5b8b09a8822c2de","mcp_get_code":{"code_sha256":"f5b8b09a8822c2de"}}],"record_sha256":"e0aebfa459d0d946f51cd51761cae5eae94e6f45697223978fc8ddc811d99b5e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}