{"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/reconstruct","entry":"reconstruct","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":2,"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":1,"ran_fixture":1,"ran":3,"unverified":3},"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":"2605.23215","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23215","title":"FASTKERNELS: Benchmarking GPU Kernel Generation in Production","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Snowflake-AI-Research/fastkernels","path":"fastkernels/capture.py","file_url":"https://github.com/Snowflake-AI-Research/fastkernels/blob/HEAD/fastkernels/capture.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fdcbceee466289a7","code_sha256_prefix":"fdcbceee466289a7","mcp_get_code":{"code_sha256":"fdcbceee466289a7"}},{"arxiv_id":"2502.13685","arxiv_id_is_arxiv":true,"paper":"/paper/mom-linear-sequence-modeling-with-mixture-of","title":"MoM: Linear Sequence Modeling with Mixture-of-Memories","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opensparsellms/mom","path":"mom/layers/mom.py","file_url":"https://github.com/opensparsellms/mom/blob/HEAD/mom/layers/mom.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"82b0548f337befe9","code_sha256_prefix":"82b0548f337befe9","mcp_get_code":{"code_sha256":"82b0548f337befe9"}},{"arxiv_id":"2502.13685","arxiv_id_is_arxiv":true,"paper":"/paper/mom-linear-sequence-modeling-with-mixture-of","title":"MoM: Linear Sequence Modeling with Mixture-of-Memories","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opensparsellms/linear-moe","path":"linear_moe/sequence_modeling/mom_linear_attention.py","file_url":"https://github.com/opensparsellms/linear-moe/blob/HEAD/linear_moe/sequence_modeling/mom_linear_attention.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":"841c385fbbc37664","code_sha256_prefix":"841c385fbbc37664","mcp_get_code":{"code_sha256":"841c385fbbc37664"}},{"arxiv_id":"2303.02984","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multi-scale-local-conditional","title":"Learning multi-scale local conditional probability models of images","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labforcomputationalvision/local-probability-models-of-images","path":"code/wavelet_func.py","file_url":"https://github.com/labforcomputationalvision/local-probability-models-of-images/blob/HEAD/code/wavelet_func.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":"24f5f171a4fc9e72","code_sha256_prefix":"24f5f171a4fc9e72","mcp_get_code":{"code_sha256":"24f5f171a4fc9e72"}},{"arxiv_id":"2301.10956","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-can-recover-the-hidden","title":"Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joisino/gnnrecover","path":"util.py","file_url":"https://github.com/joisino/gnnrecover/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"998ee0ac56102a76","code_sha256_prefix":"998ee0ac56102a76","mcp_get_code":{"code_sha256":"998ee0ac56102a76"}},{"arxiv_id":"2206.05712","arxiv_id_is_arxiv":true,"paper":"/paper/graph-based-spatial-transformer-with-memory-1","title":"Graph-based Spatial Transformer with Memory Replay for Multi-future Pedestrian Trajectory Prediction","date":"2022-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jacobieee/ST-MR","path":"code/pred_models.py","file_url":"https://github.com/Jacobieee/ST-MR/blob/HEAD/code/pred_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Jacobieee/ST-MR when it was checked","code_sha256":"fcf20886f0b38d3e","code_sha256_prefix":"fcf20886f0b38d3e","mcp_get_code":{"code_sha256":"fcf20886f0b38d3e"}},{"arxiv_id":"2007.02007","arxiv_id_is_arxiv":true,"paper":"/paper/nested-subspace-arrangement-for","title":"Nested Subspace Arrangement for Representation of Relational Data","date":"2020-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KyushuUniversityMathematics/DANCAR","path":"graphUtil.py","file_url":"https://github.com/KyushuUniversityMathematics/DANCAR/blob/HEAD/graphUtil.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":"266ff16dae773595","code_sha256_prefix":"266ff16dae773595","mcp_get_code":{"code_sha256":"266ff16dae773595"}},{"arxiv_id":"1902.03748","arxiv_id_is_arxiv":true,"paper":"/paper/peeking-into-the-future-predicting-future","title":"Peeking into the Future: Predicting Future Person Activities and Locations in Videos","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunweiLiang/social-distancing-prediction","path":"code/pred_models.py","file_url":"https://github.com/JunweiLiang/social-distancing-prediction/blob/HEAD/code/pred_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, JunweiLiang/social-distancing-prediction, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"fcf20886f0b38d3e","code_sha256_prefix":"fcf20886f0b38d3e","mcp_get_code":{"code_sha256":"fcf20886f0b38d3e"}},{"arxiv_id":"1711.00614","arxiv_id_is_arxiv":true,"paper":"/paper/a-multimodal-anomaly-detector-for-robot","title":"A Multimodal Anomaly Detector for Robot-Assisted Feeding Using an LSTM-based Variational Autoencoder","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chickenbestlover/RNN-Time-series-Anomaly-Detection","path":"preprocess_data.py","file_url":"https://github.com/chickenbestlover/RNN-Time-series-Anomaly-Detection/blob/HEAD/preprocess_data.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":"4b937bb49e947c19","code_sha256_prefix":"4b937bb49e947c19","mcp_get_code":{"code_sha256":"4b937bb49e947c19"}},{"arxiv_id":"1612.01840","arxiv_id_is_arxiv":true,"paper":"/paper/fma-a-dataset-for-music-analysis","title":"FMA: A Dataset For Music Analysis","date":"2016-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StatisticDean/Crystal_Clear","path":"crystal_clear/misc.py","file_url":"https://github.com/StatisticDean/Crystal_Clear/blob/HEAD/crystal_clear/misc.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":"a33053bfb337d4fd","code_sha256_prefix":"a33053bfb337d4fd","mcp_get_code":{"code_sha256":"a33053bfb337d4fd"}}],"record_sha256":"34aa01cc9911ebc9855bf017764b8e7219149779fcc6d1a5613b020008922e3b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}