{"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/get-noise","entry":"get_noise","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":29,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":16,"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":22,"n_samples_ran":19,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":8,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":30,"n_places_pointer_only":18,"n_places_pointer_only_link_open":6,"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":3,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":2,"ran":8,"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":"2606.02241","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02241","title":"BlockGen: Flexible Blockwise Sequence Modeling with Hybrid Samplers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jdeschena/blockgen","path":"noise_schedules.py","file_url":"https://github.com/jdeschena/blockgen/blob/HEAD/noise_schedules.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, jdeschena/blockgen when it was checked","code_sha256":"6214e0180e3a7ed6","code_sha256_prefix":"6214e0180e3a7ed6","mcp_get_code":{"code_sha256":"6214e0180e3a7ed6"}},{"arxiv_id":"2605.30965","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30965","title":"ImmersiveTTS: Environment-Aware Text-to-Speech with Multimodal Diffusion Transformer and Domain-Specific Representation Alignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"black-forest-labs/flux","path":"src/flux/sampling.py","file_url":"https://github.com/black-forest-labs/flux/blob/HEAD/src/flux/sampling.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":"1e742c4d4e7504cf","code_sha256_prefix":"1e742c4d4e7504cf","mcp_get_code":{"code_sha256":"1e742c4d4e7504cf"}},{"arxiv_id":"2601.19232","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19232","title":"Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ChenyuWang-Monica/DRAKES","path":"drakes_dna/noise_schedule.py","file_url":"https://github.com/ChenyuWang-Monica/DRAKES/blob/HEAD/drakes_dna/noise_schedule.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, ChenyuWang-Monica/DRAKES when it was checked","code_sha256":"fe6314378d2def00","code_sha256_prefix":"fe6314378d2def00","mcp_get_code":{"code_sha256":"fe6314378d2def00"}},{"arxiv_id":"2601.12587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12587","title":"A theory of diversity for random matrices with applications to in-context learning of Schrödinger equations","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"LuGroupUMN/Diversity-of-random-matrices","path":"utils/data_utils.py","file_url":"https://github.com/LuGroupUMN/Diversity-of-random-matrices/blob/HEAD/utils/data_utils.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, LuGroupUMN/Diversity-of-random-matrices when it was checked","code_sha256":"380550f0ab9b01ef","code_sha256_prefix":"380550f0ab9b01ef","mcp_get_code":{"code_sha256":"380550f0ab9b01ef"}},{"arxiv_id":"2510.24088","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24088","title":"Information-Theoretic Discrete Diffusion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Dongjae0324/infodis","path":"noise_lib.py","file_url":"https://github.com/Dongjae0324/infodis/blob/HEAD/noise_lib.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, Dongjae0324/infodis when it was checked","code_sha256":"c7a7325b30d3491b","code_sha256_prefix":"c7a7325b30d3491b","mcp_get_code":{"code_sha256":"c7a7325b30d3491b"}},{"arxiv_id":"2510.00502","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-00502","title":"Diffusion Alignment as Variational Expectation-Maximization","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Jaewoopudding/dav","path":"discrete-sequence/noise_schedule.py","file_url":"https://github.com/Jaewoopudding/dav/blob/HEAD/discrete-sequence/noise_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ChenyuWang-Monica/DRAKES, and GitHub detected no licence in that repository when it was checked","code_sha256":"fe6314378d2def00","code_sha256_prefix":"fe6314378d2def00","mcp_get_code":{"code_sha256":"fe6314378d2def00"}},{"arxiv_id":"2507.18192","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.18192","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"AIDC-AI/TeEFusion","path":"utils.py","file_url":"https://github.com/AIDC-AI/TeEFusion/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, AIDC-AI/TeEFusion (NOASSERTION)","code_sha256":"c3ea67e2a4e3471e","code_sha256_prefix":"c3ea67e2a4e3471e","mcp_get_code":{"code_sha256":"c3ea67e2a4e3471e"}},{"arxiv_id":"2505.18883","arxiv_id_is_arxiv":true,"paper":"/paper/partition-generative-modeling-masked-modeling","title":"Partition Generative Modeling: Masked Modeling Without Masks","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/mdlm","path":"noise_schedule.py","file_url":"https://github.com/kuleshov-group/mdlm/blob/HEAD/noise_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ChenyuWang-Monica/DRAKES, and GitHub detected no licence in that repository when it was checked","code_sha256":"fe6314378d2def00","code_sha256_prefix":"fe6314378d2def00","mcp_get_code":{"code_sha256":"fe6314378d2def00"}},{"arxiv_id":"2504.02160","arxiv_id_is_arxiv":true,"paper":"/paper/less-to-more-generalization-unlocking-more","title":"Less-to-More Generalization: Unlocking More Controllability by In-Context Generation","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/UNO","path":"uno/flux/pipeline.py","file_url":"https://github.com/bytedance/UNO/blob/HEAD/uno/flux/pipeline.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":"f6d9d4596b3ebd28","code_sha256_prefix":"f6d9d4596b3ebd28","mcp_get_code":{"code_sha256":"f6d9d4596b3ebd28"}},{"arxiv_id":"2503.09573","arxiv_id_is_arxiv":true,"paper":"/paper/block-diffusion-interpolating-between","title":"Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/bd3lms","path":"noise_schedule.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/noise_schedule.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":"e1fdbc4d0bebba92","code_sha256_prefix":"e1fdbc4d0bebba92","mcp_get_code":{"code_sha256":"e1fdbc4d0bebba92"}},{"arxiv_id":"2503.00307","arxiv_id_is_arxiv":true,"paper":"/paper/remasking-discrete-diffusion-models-with","title":"Remasking Discrete Diffusion Models with Inference-Time Scaling","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/remdm","path":"diffusion.py","file_url":"https://github.com/kuleshov-group/remdm/blob/HEAD/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2174721db8d9cdb6","code_sha256_prefix":"2174721db8d9cdb6","mcp_get_code":{"code_sha256":"2174721db8d9cdb6"}},{"arxiv_id":"2502.12579","arxiv_id_is_arxiv":true,"paper":"/paper/chats-combining-human-aligned-optimization","title":"CHATS: Combining Human-Aligned Optimization and Test-Time Sampling for Text-to-Image Generation","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIDC-AI/CHATS","path":"pipelines/pipeline_sd15.py","file_url":"https://github.com/AIDC-AI/CHATS/blob/HEAD/pipelines/pipeline_sd15.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":"b88196ca26eed2e5","code_sha256_prefix":"b88196ca26eed2e5","mcp_get_code":{"code_sha256":"b88196ca26eed2e5"}},{"arxiv_id":"2502.01384","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-discrete-diffusion-models-with","title":"Fine-Tuning Discrete Diffusion Models with Policy Gradient Methods","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ozekri/SEPO","path":"GRPO_MDLM_DNA/noise_schedule.py","file_url":"https://github.com/ozekri/SEPO/blob/HEAD/GRPO_MDLM_DNA/noise_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ChenyuWang-Monica/DRAKES, and GitHub detected no licence in that repository when it was checked","code_sha256":"fe6314378d2def00","code_sha256_prefix":"fe6314378d2def00","mcp_get_code":{"code_sha256":"fe6314378d2def00"}},{"arxiv_id":"2412.10193","arxiv_id_is_arxiv":true,"paper":"/paper/simple-guidance-mechanisms-for-discrete","title":"Simple Guidance Mechanisms for Discrete Diffusion Models","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/discrete-diffusion-guidance","path":"noise_schedule.py","file_url":"https://github.com/kuleshov-group/discrete-diffusion-guidance/blob/HEAD/noise_schedule.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63ffe982a59e3d2c","code_sha256_prefix":"63ffe982a59e3d2c","mcp_get_code":{"code_sha256":"63ffe982a59e3d2c"}},{"arxiv_id":"2410.13643","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-discrete-diffusion-models-via","title":"Fine-Tuning Discrete Diffusion Models via Reward Optimization with Applications to DNA and Protein Design","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyuwang-monica/drakes","path":"drakes_dna/noise_schedule.py","file_url":"https://github.com/chenyuwang-monica/drakes/blob/HEAD/drakes_dna/noise_schedule.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, chenyuwang-monica/drakes when it was checked","code_sha256":"fe6314378d2def00","code_sha256_prefix":"fe6314378d2def00","mcp_get_code":{"code_sha256":"fe6314378d2def00"}},{"arxiv_id":"2406.03736","arxiv_id_is_arxiv":true,"paper":"/paper/your-absorbing-discrete-diffusion-secretly","title":"Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Data","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-gsai/radd","path":"noise_lib.py","file_url":"https://github.com/ml-gsai/radd/blob/HEAD/noise_lib.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Dongjae0324/infodis, and GitHub detected no licence in that repository when it was checked","code_sha256":"c7a7325b30d3491b","code_sha256_prefix":"c7a7325b30d3491b","mcp_get_code":{"code_sha256":"c7a7325b30d3491b"}},{"arxiv_id":"2405.16749","arxiv_id_is_arxiv":true,"paper":"/paper/dmplug-a-plug-in-method-for-solving-inverse","title":"DMPlug: A Plug-in Method for Solving Inverse Problems with Diffusion Models","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-umn/dmplug","path":"sr_inp_nonlinear.py","file_url":"https://github.com/sun-umn/dmplug/blob/HEAD/sr_inp_nonlinear.py","status":"unverified","verification_level":0,"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, sun-umn/dmplug when it was checked","code_sha256":"6eb7012cf0ec3021","code_sha256_prefix":"6eb7012cf0ec3021","mcp_get_code":{"code_sha256":"6eb7012cf0ec3021"}},{"arxiv_id":"2310.16834","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-diffusion-language-modeling-by","title":"Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Score-Entropy-Discrete-Diffusion","path":"noise_lib.py","file_url":"https://github.com/louaaron/Score-Entropy-Discrete-Diffusion/blob/HEAD/noise_lib.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Dongjae0324/infodis, and GitHub detected no licence in that repository when it was checked","code_sha256":"c7a7325b30d3491b","code_sha256_prefix":"c7a7325b30d3491b","mcp_get_code":{"code_sha256":"c7a7325b30d3491b"}},{"arxiv_id":"2305.20030","arxiv_id_is_arxiv":true,"paper":"/paper/tree-ring-watermarks-fingerprints-for","title":"Tree-Ring Watermarks: Fingerprints for Diffusion Images that are Invisible and Robust","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuxinWenRick/tree-ring-watermark","path":"src/tree_ring_watermark/_get_noise.py","file_url":"https://github.com/YuxinWenRick/tree-ring-watermark/blob/HEAD/src/tree_ring_watermark/_get_noise.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":"648e9cd35d6b74d0","code_sha256_prefix":"648e9cd35d6b74d0","mcp_get_code":{"code_sha256":"648e9cd35d6b74d0"}},{"arxiv_id":"2212.14518","arxiv_id_is_arxiv":true,"paper":"/paper/resgrad-residual-denoising-diffusion","title":"ResGrad: Residual Denoising Diffusion Probabilistic Models for Text to Speech","date":"2022-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"majidAdibian77/ResGrad","path":"resgrad/model/diffusion.py","file_url":"https://github.com/majidAdibian77/ResGrad/blob/HEAD/resgrad/model/diffusion.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":"9211d7c738c4dfe9","code_sha256_prefix":"9211d7c738c4dfe9","mcp_get_code":{"code_sha256":"9211d7c738c4dfe9"}},{"arxiv_id":"2207.10398","arxiv_id_is_arxiv":true,"paper":"/paper/d2-tpred-discontinuous-dependency-for","title":"D2-TPred: Discontinuous Dependency for Trajectory Prediction under Traffic Lights","date":"2022-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"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":"cc7ee43eadf25dac","code_sha256_prefix":"cc7ee43eadf25dac","mcp_get_code":{"code_sha256":"cc7ee43eadf25dac"}},{"arxiv_id":"2111.14820","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-and-adaptive-motion","title":"Towards Robust and Adaptive Motion Forecasting: A Causal Representation Perspective","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/causalmotion","path":"spurious/models.py","file_url":"https://github.com/vita-epfl/causalmotion/blob/HEAD/spurious/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from rohanchandra30/TrackNPred, and GitHub detected no licence in that repository when it was checked","code_sha256":"cc7ee43eadf25dac","code_sha256_prefix":"cc7ee43eadf25dac","mcp_get_code":{"code_sha256":"cc7ee43eadf25dac"}},{"arxiv_id":"2005.08514","arxiv_id_is_arxiv":true,"paper":"/paper/spatio-temporal-graph-transformer-networks","title":"Spatio-Temporal Graph Transformer Networks for Pedestrian Trajectory Prediction","date":"2020-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Majiker/STAR","path":"src/star.py","file_url":"https://github.com/Majiker/STAR/blob/HEAD/src/star.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":"bf98ee08b0615ac8","code_sha256_prefix":"bf98ee08b0615ac8","mcp_get_code":{"code_sha256":"bf98ee08b0615ac8"}},{"arxiv_id":"1906.05478","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-interpretable-blind-image","title":"Robust and interpretable blind image denoising via bias-free convolutional neural networks","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LabForComputationalVision/bias_free_denoising","path":"utils/noise_model.py","file_url":"https://github.com/LabForComputationalVision/bias_free_denoising/blob/HEAD/utils/noise_model.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":"6f7ba2d60b362341","code_sha256_prefix":"6f7ba2d60b362341","mcp_get_code":{"code_sha256":"6f7ba2d60b362341"}},{"arxiv_id":"1906.05423","arxiv_id_is_arxiv":true,"paper":"/paper/copulas-as-high-dimensional-generative-models","title":"Copulas as High-Dimensional Generative Models: Vine Copula Autoencoders","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabiankaechele/samplingfromautoencoders","path":"scripts/AE.py","file_url":"https://github.com/fabiankaechele/samplingfromautoencoders/blob/HEAD/scripts/AE.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30a4d49c13fa25c4","code_sha256_prefix":"30a4d49c13fa25c4","mcp_get_code":{"code_sha256":"30a4d49c13fa25c4"}},{"arxiv_id":"1806.01482","arxiv_id_is_arxiv":true,"paper":"/paper/sophie-an-attentive-gan-for-predicting-paths","title":"SoPhie: An Attentive GAN for Predicting Paths Compliant to Social and Physical Constraints","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coolsunxu/sophie","path":"models.py","file_url":"https://github.com/coolsunxu/sophie/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, coolsunxu/sophie when it was checked","code_sha256":"f408d02b2624ecdf","code_sha256_prefix":"f408d02b2624ecdf","mcp_get_code":{"code_sha256":"f408d02b2624ecdf"}},{"arxiv_id":"1803.10892","arxiv_id_is_arxiv":true,"paper":"/paper/social-gan-socially-acceptable-trajectories","title":"Social GAN: Socially Acceptable Trajectories with Generative Adversarial Networks","date":"2018-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohanchandra30/TrackNPred","path":"model/Prediction/sgan/models.py","file_url":"https://github.com/rohanchandra30/TrackNPred/blob/HEAD/model/Prediction/sgan/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, rohanchandra30/TrackNPred when it was checked","code_sha256":"cc7ee43eadf25dac","code_sha256_prefix":"cc7ee43eadf25dac","mcp_get_code":{"code_sha256":"cc7ee43eadf25dac"}},{"arxiv_id":"1607.03474","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzilly/RecurrentHighwayNetworks","path":"rhn_train.py","file_url":"https://github.com/jzilly/RecurrentHighwayNetworks/blob/HEAD/rhn_train.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"707c42ff0294c173","code_sha256_prefix":"707c42ff0294c173","mcp_get_code":{"code_sha256":"707c42ff0294c173"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huyz1117/GAN-TensorFlow","path":"vanilla_GAN.py","file_url":"https://github.com/huyz1117/GAN-TensorFlow/blob/HEAD/vanilla_GAN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, huyz1117/GAN-TensorFlow when it was checked","code_sha256":"a67d76552a210731","code_sha256_prefix":"a67d76552a210731","mcp_get_code":{"code_sha256":"a67d76552a210731"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bourcierj/rdfia-tme10-gan","path":"train_dcgan_celeba32.py","file_url":"https://github.com/bourcierj/rdfia-tme10-gan/blob/HEAD/train_dcgan_celeba32.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bourcierj/rdfia-tme10-gan when it was checked","code_sha256":"8c28a39ce1ec7f9a","code_sha256_prefix":"8c28a39ce1ec7f9a","mcp_get_code":{"code_sha256":"8c28a39ce1ec7f9a"}}],"record_sha256":"2c0053b579fd841f6ddbf6bcd69f4a1c45ca6ed560de69ba18d3fbda4e881ac0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}