{"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-size","entry":"get_size","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":26,"n_papers_ran":23,"n_papers_ran_no_instrument_failure":20,"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":21,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":6,"n_places":26,"n_places_pointer_only":10,"n_places_pointer_only_link_open":1,"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":6,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":9,"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":"2609.15883","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-15883","title":"Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Yonsei-DILLab/OptiFlow","path":"envs/datasets.py","file_url":"https://github.com/Yonsei-DILLab/OptiFlow/blob/HEAD/envs/datasets.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Yonsei-DILLab/OptiFlow when it was checked","code_sha256":"46b2f63534e1bf86","code_sha256_prefix":"46b2f63534e1bf86","mcp_get_code":{"code_sha256":"46b2f63534e1bf86"}},{"arxiv_id":"2605.07950","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07950","title":"Slowly Annealed Langevin Dynamics: Theory and Applications to Training-Free Guided Generation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anitan0925/sald","path":"sald_FM_SD35/rewards.py","file_url":"https://github.com/anitan0925/sald/blob/HEAD/sald_FM_SD35/rewards.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4ae73baea6f9f47","code_sha256_prefix":"b4ae73baea6f9f47","mcp_get_code":{"code_sha256":"b4ae73baea6f9f47"}},{"arxiv_id":"2603.18488","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18488","title":"TexEditor: Structure-Preserving Text-Driven Texture Editing","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"KlingAIResearch/TexEditor","path":"flow_grpo/clip_scorer.py","file_url":"https://github.com/KlingAIResearch/TexEditor/blob/HEAD/flow_grpo/clip_scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4ae73baea6f9f47","code_sha256_prefix":"b4ae73baea6f9f47","mcp_get_code":{"code_sha256":"b4ae73baea6f9f47"}},{"arxiv_id":"2602.22809","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22809","title":"PhotoAgent: Exploratory Visual Aesthetic Planning with Large Vision Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RE-N-Y/imscore","path":"src/imscore/utils.py","file_url":"https://github.com/RE-N-Y/imscore/blob/HEAD/src/imscore/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, RE-N-Y/imscore when it was checked","code_sha256":"b4ae73baea6f9f47","code_sha256_prefix":"b4ae73baea6f9f47","mcp_get_code":{"code_sha256":"b4ae73baea6f9f47"}},{"arxiv_id":"2602.16855","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16855","title":"Mobile-Agent-v3.5: Multi-platform Fundamental GUI Agents","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"X-PLUG/MobileAgent","path":"Mobile-Agent-v1/MobileAgent/controller.py","file_url":"https://github.com/X-PLUG/MobileAgent/blob/HEAD/Mobile-Agent-v1/MobileAgent/controller.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":"f244ecf0b63d34d8","code_sha256_prefix":"f244ecf0b63d34d8","mcp_get_code":{"code_sha256":"f244ecf0b63d34d8"}},{"arxiv_id":"2602.10392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10392","title":"Tensor Methods: A Unified and Interpretable Approach for Material Design","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"shaanpakala/Tensor-Methods-for-Material-Design","path":"tensor_completion_models/NeAT/read.py","file_url":"https://github.com/shaanpakala/Tensor-Methods-for-Material-Design/blob/HEAD/tensor_completion_models/NeAT/read.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, shaanpakala/Tensor-Methods-for-Material-Design when it was checked","code_sha256":"8ae3a03e2a8ee5a0","code_sha256_prefix":"8ae3a03e2a8ee5a0","mcp_get_code":{"code_sha256":"8ae3a03e2a8ee5a0"}},{"arxiv_id":"2510.07474","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07474","title":"Surrogate Modeling for the Design of Optimal Lattice Structures using Tensor Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion","path":"tensor_completion_models/NeAT/read.py","file_url":"https://github.com/shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion/blob/HEAD/tensor_completion_models/NeAT/read.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion when it was checked","code_sha256":"8ae3a03e2a8ee5a0","code_sha256_prefix":"8ae3a03e2a8ee5a0","mcp_get_code":{"code_sha256":"8ae3a03e2a8ee5a0"}},{"arxiv_id":"2505.05470","arxiv_id_is_arxiv":true,"paper":"/paper/flow-grpo-training-flow-matching-models-via","title":"Flow-GRPO: Training Flow Matching Models via Online RL","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan123/flow_grpo","path":"flow_grpo/clip_scorer.py","file_url":"https://github.com/yifan123/flow_grpo/blob/HEAD/flow_grpo/clip_scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4ae73baea6f9f47","code_sha256_prefix":"b4ae73baea6f9f47","mcp_get_code":{"code_sha256":"b4ae73baea6f9f47"}},{"arxiv_id":"2411.04924","arxiv_id_is_arxiv":true,"paper":"/paper/mvsplat360-feed-forward-360-scene-synthesis","title":"MVSplat360: Feed-Forward 360 Scene Synthesis from Sparse Views","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donydchen/mvsplat360","path":"src/scripts/convert_dl3dv.py","file_url":"https://github.com/donydchen/mvsplat360/blob/HEAD/src/scripts/convert_dl3dv.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89c99a8c18402e52","code_sha256_prefix":"89c99a8c18402e52","mcp_get_code":{"code_sha256":"89c99a8c18402e52"}},{"arxiv_id":"2407.02273","arxiv_id_is_arxiv":true,"paper":"/paper/multilingual-trolley-problems-for-language","title":"Language Model Alignment in Multilingual Trolley Problems","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causalNLP/moralmachine","path":"multi_tp/models_ids.py","file_url":"https://github.com/causalNLP/moralmachine/blob/HEAD/multi_tp/models_ids.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf351864d0daa92c","code_sha256_prefix":"bf351864d0daa92c","mcp_get_code":{"code_sha256":"bf351864d0daa92c"}},{"arxiv_id":"2405.19279","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-minimising-outlier-features","title":"Understanding and Minimising Outlier Features in Neural Network Training","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/nanotron","path":"src/nanotron/trainer.py","file_url":"https://github.com/huggingface/nanotron/blob/HEAD/src/nanotron/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89dc6d87894c3644","code_sha256_prefix":"89dc6d87894c3644","mcp_get_code":{"code_sha256":"89dc6d87894c3644"}},{"arxiv_id":"2401.00825","arxiv_id_is_arxiv":true,"paper":"/paper/sharp-nerf-grid-based-fast-deblurring-neural","title":"Sharp-NeRF: Grid-based Fast Deblurring Neural Radiance Fields Using Sharpness Prior","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benhenryl/sharpnerf","path":"models/tensorBase.py","file_url":"https://github.com/benhenryl/sharpnerf/blob/HEAD/models/tensorBase.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":"030ec2dc7de84718","code_sha256_prefix":"030ec2dc7de84718","mcp_get_code":{"code_sha256":"030ec2dc7de84718"}},{"arxiv_id":"2312.03480","arxiv_id_is_arxiv":true,"paper":"/paper/amr-parsing-is-far-from-solved-grapes-the","title":"AMR Parsing is Far from Solved: GrAPES, the Granular AMR Parsing Evaluation Suite","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jgroschwitz/GrAPES","path":"create_vulcan_pickle.py","file_url":"https://github.com/jgroschwitz/GrAPES/blob/HEAD/create_vulcan_pickle.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, jgroschwitz/GrAPES, is not in the permissive set Syntology serves inline","code_sha256":"ef6d1dff7ed85296","code_sha256_prefix":"ef6d1dff7ed85296","mcp_get_code":{"code_sha256":"ef6d1dff7ed85296"}},{"arxiv_id":"2310.14845","arxiv_id_is_arxiv":true,"paper":"/paper/ultra-dp-unifying-graph-pre-training-with","title":"ULTRA-DP: Unifying Graph Pre-training with Multi-task Graph Dual Prompt","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keytoyze/ultra-dp","path":"preprocess_reachability.py","file_url":"https://github.com/keytoyze/ultra-dp/blob/HEAD/preprocess_reachability.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, keytoyze/ultra-dp when it was checked","code_sha256":"4fb2a0dc5eb610b5","code_sha256_prefix":"4fb2a0dc5eb610b5","mcp_get_code":{"code_sha256":"4fb2a0dc5eb610b5"}},{"arxiv_id":"2306.00986","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-self-guidance-for-controllable-1","title":"Diffusion Self-Guidance for Controllable Image Generation","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sainzerjj/Free-Guidance-Diffusion","path":"utils/guidance_functions.py","file_url":"https://github.com/Sainzerjj/Free-Guidance-Diffusion/blob/HEAD/utils/guidance_functions.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":"afd3e9be256ce75a","code_sha256_prefix":"afd3e9be256ce75a","mcp_get_code":{"code_sha256":"afd3e9be256ce75a"}},{"arxiv_id":"2206.09677","arxiv_id_is_arxiv":true,"paper":"/paper/graphframex-towards-systematic-evaluation-of","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphframex/graphframex","path":"code/evaluate/mask_utils.py","file_url":"https://github.com/graphframex/graphframex/blob/HEAD/code/evaluate/mask_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, graphframex/graphframex when it was checked","code_sha256":"219c1b8f1abb611d","code_sha256_prefix":"219c1b8f1abb611d","mcp_get_code":{"code_sha256":"219c1b8f1abb611d"}},{"arxiv_id":"2106.06087","arxiv_id_is_arxiv":true,"paper":"/paper/causal-analysis-of-syntactic-agreement","title":"Causal Analysis of Syntactic Agreement Mechanisms in Neural Language Models","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattf1n/lm-intervention","path":"analysis.py","file_url":"https://github.com/mattf1n/lm-intervention/blob/HEAD/analysis.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":"8b8f35543c6041ec","code_sha256_prefix":"8b8f35543c6041ec","mcp_get_code":{"code_sha256":"8b8f35543c6041ec"}},{"arxiv_id":"2105.05008","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-explanations-for-neural","title":"Counterfactual Explanations for Neural Recommenders","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hieptk/accent","path":"compare.py","file_url":"https://github.com/hieptk/accent/blob/HEAD/compare.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, hieptk/accent, is not in the permissive set Syntology serves inline","code_sha256":"e718f5c5a25ad390","code_sha256_prefix":"e718f5c5a25ad390","mcp_get_code":{"code_sha256":"e718f5c5a25ad390"}},{"arxiv_id":"2011.00359","arxiv_id_is_arxiv":true,"paper":"/paper/tartanvo-a-generalizable-learning-based-vo","title":"TartanVO: A Generalizable Learning-based VO","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castacks/tartanair_tools","path":"download_training.py","file_url":"https://github.com/castacks/tartanair_tools/blob/HEAD/download_training.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2bafbea784f3d986","code_sha256_prefix":"2bafbea784f3d986","mcp_get_code":{"code_sha256":"2bafbea784f3d986"}},{"arxiv_id":"2006.10103","arxiv_id_is_arxiv":true,"paper":"/paper/is-network-the-bottleneck-of-distributed","title":"Is Network the Bottleneck of Distributed Training?","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"netx-repo/training-bottleneck","path":"simulation/layerwise_bk_done.py","file_url":"https://github.com/netx-repo/training-bottleneck/blob/HEAD/simulation/layerwise_bk_done.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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, netx-repo/training-bottleneck, 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":"341565ac593fbce6","code_sha256_prefix":"341565ac593fbce6","mcp_get_code":{"code_sha256":"341565ac593fbce6"}},{"arxiv_id":"2004.08996","arxiv_id_is_arxiv":true,"paper":"/paper/local-search-is-a-remarkably-strong-baseline","title":"Local Search is a Remarkably Strong Baseline for Neural Architecture Search","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdenottelander/MacroNAS","path":"NAS_largescale/cifar.py","file_url":"https://github.com/tdenottelander/MacroNAS/blob/HEAD/NAS_largescale/cifar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac84cd47cff2eb86","code_sha256_prefix":"ac84cd47cff2eb86","mcp_get_code":{"code_sha256":"ac84cd47cff2eb86"}},{"arxiv_id":"2004.01571","arxiv_id_is_arxiv":true,"paper":"/paper/tramp-compositional-inference-with-tree","title":"Tree-AMP: Compositional Inference with Tree Approximate Message Passing","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sphinxteam/tramp","path":"tramp/algos/message_passing.py","file_url":"https://github.com/sphinxteam/tramp/blob/HEAD/tramp/algos/message_passing.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":"0ba6c9834d12997b","code_sha256_prefix":"0ba6c9834d12997b","mcp_get_code":{"code_sha256":"0ba6c9834d12997b"}},{"arxiv_id":"2002.03497","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-domain-adaptation-by-causal","title":"Few-shot Domain Adaptation by Causal Mechanism Transfer","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"takeshi-teshima/few-shot-domain-adaptation-by-causal-mechanism-transfer","path":"causal_da/algorithm/api.py","file_url":"https://github.com/takeshi-teshima/few-shot-domain-adaptation-by-causal-mechanism-transfer/blob/HEAD/causal_da/algorithm/api.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58a976f1c22cd06e","code_sha256_prefix":"58a976f1c22cd06e","mcp_get_code":{"code_sha256":"58a976f1c22cd06e"}},{"arxiv_id":"1803.00933","arxiv_id_is_arxiv":true,"paper":"/paper/distributed-prioritized-experience-replay","title":"Distributed Prioritized Experience Replay","date":"2018-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haje01/distper","path":"common.py","file_url":"https://github.com/haje01/distper/blob/HEAD/common.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":"8d1439744144727d","code_sha256_prefix":"8d1439744144727d","mcp_get_code":{"code_sha256":"8d1439744144727d"}},{"arxiv_id":"1603.07285","arxiv_id_is_arxiv":true,"paper":"/paper/a-guide-to-convolution-arithmetic-for-deep","title":"A guide to convolution arithmetic for deep learning","date":"2016-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marbleton/FPGA_MNIST","path":"webapp/py/fpga.py","file_url":"https://github.com/marbleton/FPGA_MNIST/blob/HEAD/webapp/py/fpga.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":"6a43ca5b793f1fd7","code_sha256_prefix":"6a43ca5b793f1fd7","mcp_get_code":{"code_sha256":"6a43ca5b793f1fd7"}},{"arxiv_id":"openreview_RdkOaK4q6p","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_RdkOaK4q6p","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"2012060/DFQL","path":"utils/datasets.py","file_url":"https://github.com/2012060/DFQL/blob/HEAD/utils/datasets.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 Yonsei-DILLab/OptiFlow, and GitHub detected no licence in that repository when it was checked","code_sha256":"46b2f63534e1bf86","code_sha256_prefix":"46b2f63534e1bf86","mcp_get_code":{"code_sha256":"46b2f63534e1bf86"}}],"record_sha256":"470b4ecd36c2c1b19c090c914ffa858424abb793d7199fd9a5c6881881d1ceb7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}