{"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/data-generator","entry":"data_generator","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":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":15,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":9,"unverified":4},"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":"2512.11784","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-11784","title":"Softmax as Linear Attention in the Large-Prompt Regime: a Measure-based Perspective","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"eboursier/softmax_as_linear","path":"utils/funcs.py","file_url":"https://github.com/eboursier/softmax_as_linear/blob/HEAD/utils/funcs.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, eboursier/softmax_as_linear when it was checked","code_sha256":"77e156a5d0ccd851","code_sha256_prefix":"77e156a5d0ccd851","mcp_get_code":{"code_sha256":"77e156a5d0ccd851"}},{"arxiv_id":"2410.23862","arxiv_id_is_arxiv":true,"paper":"/paper/ps-dag-projected-stochastic-approximation","title":"$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kz29/-psiDAG","path":"data_generator.py","file_url":"https://github.com/kz29/-psiDAG/blob/HEAD/data_generator.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":"3d07194747a6ad8e","code_sha256_prefix":"3d07194747a6ad8e","mcp_get_code":{"code_sha256":"3d07194747a6ad8e"}},{"arxiv_id":"2307.07542","arxiv_id_is_arxiv":true,"paper":"/paper/source-free-domain-adaptation-with-temporal","title":"Source-Free Domain Adaptation with Temporal Imputation for Time Series Data","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohamedr002/mapu_sfda_ts","path":"dataloader/dataloader.py","file_url":"https://github.com/mohamedr002/mapu_sfda_ts/blob/HEAD/dataloader/dataloader.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":"ddb315160fe5428e","code_sha256_prefix":"ddb315160fe5428e","mcp_get_code":{"code_sha256":"ddb315160fe5428e"}},{"arxiv_id":"2302.03133","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-time-series-under","title":"Domain Adaptation for Time Series Under Feature and Label Shifts","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/Raincoat","path":"dataloader/dataloader.py","file_url":"https://github.com/mims-harvard/Raincoat/blob/HEAD/dataloader/dataloader.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":"452e418f86055a6e","code_sha256_prefix":"452e418f86055a6e","mcp_get_code":{"code_sha256":"452e418f86055a6e"}},{"arxiv_id":"1911.06393","arxiv_id_is_arxiv":true,"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"f90/Seq-U-Net","path":"copy_memory/utils.py","file_url":"https://github.com/f90/Seq-U-Net/blob/HEAD/copy_memory/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":"76d3f31a0af1e2ee","code_sha256_prefix":"76d3f31a0af1e2ee","mcp_get_code":{"code_sha256":"76d3f31a0af1e2ee"}},{"arxiv_id":"1911.06393","arxiv_id_is_arxiv":true,"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"f90/Seq-U-Net","path":"poly_music/utils.py","file_url":"https://github.com/f90/Seq-U-Net/blob/HEAD/poly_music/utils.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":"aa5bc0c27cde7849","code_sha256_prefix":"aa5bc0c27cde7849","mcp_get_code":{"code_sha256":"aa5bc0c27cde7849"}},{"arxiv_id":"1902.09362","arxiv_id_is_arxiv":true,"paper":"/paper/session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepGraphLearning/RecommenderSystems","path":"sequentialRec/markovChains/utils.py","file_url":"https://github.com/DeepGraphLearning/RecommenderSystems/blob/HEAD/sequentialRec/markovChains/utils.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":"f98462bd27134f1b","code_sha256_prefix":"f98462bd27134f1b","mcp_get_code":{"code_sha256":"f98462bd27134f1b"}},{"arxiv_id":"1810.06682","arxiv_id_is_arxiv":true,"paper":"/paper/trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/trellisnet","path":"TrellisNet/seq_MNIST_CIFAR/utils.py","file_url":"https://github.com/locuslab/trellisnet/blob/HEAD/TrellisNet/seq_MNIST_CIFAR/utils.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":"512e27f728a83a6b","code_sha256_prefix":"512e27f728a83a6b","mcp_get_code":{"code_sha256":"512e27f728a83a6b"}},{"arxiv_id":"1804.08254","arxiv_id_is_arxiv":true,"paper":"/paper/memory-attention-networks-for-skeleton-based","title":"Memory Attention Networks for Skeleton-based Action Recognition","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"memory-attention-networks/MANs","path":"train_MANs.py","file_url":"https://github.com/memory-attention-networks/MANs/blob/HEAD/train_MANs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, memory-attention-networks/MANs when it was checked","code_sha256":"23feefdb6bb6fb19","code_sha256_prefix":"23feefdb6bb6fb19","mcp_get_code":{"code_sha256":"23feefdb6bb6fb19"}},{"arxiv_id":"1803.01271","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Baichenjia/Tensorflow-TCN","path":"adding_problem/utils.py","file_url":"https://github.com/Baichenjia/Tensorflow-TCN/blob/HEAD/adding_problem/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":"2cab4bb603684fd3","code_sha256_prefix":"2cab4bb603684fd3","mcp_get_code":{"code_sha256":"2cab4bb603684fd3"}},{"arxiv_id":"1803.01271","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Baichenjia/Tensorflow-TCN","path":"copy_memory/utils.py","file_url":"https://github.com/Baichenjia/Tensorflow-TCN/blob/HEAD/copy_memory/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":"fa54fea0a3902f0b","code_sha256_prefix":"fa54fea0a3902f0b","mcp_get_code":{"code_sha256":"fa54fea0a3902f0b"}},{"arxiv_id":"1803.01271","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkchengrex/TCN","path":"TCN/adding_problem/utils.py","file_url":"https://github.com/hkchengrex/TCN/blob/HEAD/TCN/adding_problem/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":"2da0e1d81c17f827","code_sha256_prefix":"2da0e1d81c17f827","mcp_get_code":{"code_sha256":"2da0e1d81c17f827"}},{"arxiv_id":"1803.01271","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linxi159/TCN","path":"TCN/copy_memory/utils.py","file_url":"https://github.com/linxi159/TCN/blob/HEAD/TCN/copy_memory/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":"f9eab345dc306e54","code_sha256_prefix":"f9eab345dc306e54","mcp_get_code":{"code_sha256":"f9eab345dc306e54"}},{"arxiv_id":"1803.01271","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linxi159/TCN","path":"TCN/lambada_language/utils.py","file_url":"https://github.com/linxi159/TCN/blob/HEAD/TCN/lambada_language/utils.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":"5193be20bfe553e7","code_sha256_prefix":"5193be20bfe553e7","mcp_get_code":{"code_sha256":"5193be20bfe553e7"}},{"arxiv_id":"1710.02224","arxiv_id_is_arxiv":true,"paper":"/paper/dilated-recurrent-neural-networks","title":"Dilated Recurrent Neural Networks","date":"2017-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zalandoresearch/pytorch-dilated-rnn","path":"copy_memory/utils.py","file_url":"https://github.com/zalandoresearch/pytorch-dilated-rnn/blob/HEAD/copy_memory/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":"f9eab345dc306e54","code_sha256_prefix":"f9eab345dc306e54","mcp_get_code":{"code_sha256":"f9eab345dc306e54"}}],"record_sha256":"3d1635f6f614d37e4d34425978eab9e8be104589d98e075ad700dfe24e7de633","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}