{"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-conv","entry":"get_conv","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":21,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":7,"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":17,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":8,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":10,"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":"2608.07713","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-07713","title":"Tokenizer-Generator Coupling in Medical Image Generation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"liamchalcroft/medtokenizers","path":"src/medtokenizers/modules/layers.py","file_url":"https://github.com/liamchalcroft/medtokenizers/blob/HEAD/src/medtokenizers/modules/layers.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":"eaa2e30c02052d7b","code_sha256_prefix":"eaa2e30c02052d7b","mcp_get_code":{"code_sha256":"eaa2e30c02052d7b"}},{"arxiv_id":"2601.18938","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18938","title":"FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ssjcode/FSD-CAP","path":"models.py","file_url":"https://github.com/ssjcode/FSD-CAP/blob/HEAD/models.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, ssjcode/FSD-CAP when it was checked","code_sha256":"0cc5f5182936b878","code_sha256_prefix":"0cc5f5182936b878","mcp_get_code":{"code_sha256":"0cc5f5182936b878"}},{"arxiv_id":"2509.22307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-22307","title":"Johnson-Lindenstrauss Lemma Guided Network for Efficient 3D Medical Segmentation","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"JinPLu/VeloxSeg","path":"model/VeloxSeg.py","file_url":"https://github.com/JinPLu/VeloxSeg/blob/HEAD/model/VeloxSeg.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, JinPLu/VeloxSeg when it was checked","code_sha256":"35d5f0737cb91bcf","code_sha256_prefix":"35d5f0737cb91bcf","mcp_get_code":{"code_sha256":"35d5f0737cb91bcf"}},{"arxiv_id":"2503.13444","arxiv_id_is_arxiv":true,"paper":"/paper/videomind-a-chain-of-lora-agent-for-long","title":"VideoMind: A Chain-of-LoRA Agent for Long Video Reasoning","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeliudev/VideoMind","path":"videomind/conversation.py","file_url":"https://github.com/yeliudev/VideoMind/blob/HEAD/videomind/conversation.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":"73dd9aaccf9919a2","code_sha256_prefix":"73dd9aaccf9919a2","mcp_get_code":{"code_sha256":"73dd9aaccf9919a2"}},{"arxiv_id":"2311.18341","arxiv_id_is_arxiv":true,"paper":"/paper/learning-robust-precipitation-forecaster-by","title":"Learning Robust Precipitation Forecaster by Temporal Frame Interpolation","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"secilia-cxy/unettfi","path":"models/baseline_UNET3D.py","file_url":"https://github.com/secilia-cxy/unettfi/blob/HEAD/models/baseline_UNET3D.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, secilia-cxy/unettfi when it was checked","code_sha256":"d473e9bce385040b","code_sha256_prefix":"d473e9bce385040b","mcp_get_code":{"code_sha256":"d473e9bce385040b"}},{"arxiv_id":"2306.13643","arxiv_id_is_arxiv":true,"paper":"/paper/lightglue-local-feature-matching-at-light","title":"LightGlue: Local Feature Matching at Light Speed","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvg/lightglue","path":"lightglue/aliked.py","file_url":"https://github.com/cvg/lightglue/blob/HEAD/lightglue/aliked.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":"c862b64639150d6c","code_sha256_prefix":"c862b64639150d6c","mcp_get_code":{"code_sha256":"c862b64639150d6c"}},{"arxiv_id":"2305.16618","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daehoum1/pcfi","path":"models.py","file_url":"https://github.com/daehoum1/pcfi/blob/HEAD/models.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":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ssjcode/FSD-CAP, and GitHub detected no licence in that repository when it was checked","code_sha256":"0cc5f5182936b878","code_sha256_prefix":"0cc5f5182936b878","mcp_get_code":{"code_sha256":"0cc5f5182936b878"}},{"arxiv_id":"2304.12217","arxiv_id_is_arxiv":true,"paper":"/paper/impact-oriented-contextual-scholar-profiling","title":"Impact-Oriented Contextual Scholar Profiling using Self-Citation Graphs","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visdata/geneticflow","path":"Award_Inference_Task/Award_Inference_Experiment/GeneticFlow_Signatures/GNN_NLP/model_stack.py","file_url":"https://github.com/visdata/geneticflow/blob/HEAD/Award_Inference_Task/Award_Inference_Experiment/GeneticFlow_Signatures/GNN_NLP/model_stack.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":"f773c43207aad8b7","code_sha256_prefix":"f773c43207aad8b7","mcp_get_code":{"code_sha256":"f773c43207aad8b7"}},{"arxiv_id":"2303.18242","arxiv_id_is_arxiv":true,"paper":"/paper/infty-diff-infinite-resolution-diffusion-with","title":"$\\infty$-Diff: Infinite Resolution Diffusion with Subsampled Mollified States","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samb-t/infty-diff","path":"models/conv_uno.py","file_url":"https://github.com/samb-t/infty-diff/blob/HEAD/models/conv_uno.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":"d13a5d7c586e1290","code_sha256_prefix":"d13a5d7c586e1290","mcp_get_code":{"code_sha256":"d13a5d7c586e1290"}},{"arxiv_id":"2212.02998","arxiv_id_is_arxiv":true,"paper":"/paper/super-resolution-probabilistic-rain","title":"Super-resolution Probabilistic Rain Prediction from Satellite Data Using 3D U-Nets and EarthFormers","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bugsuse/weather4cast-2022-stage2","path":"models/baseline_UNET3D.py","file_url":"https://github.com/bugsuse/weather4cast-2022-stage2/blob/HEAD/models/baseline_UNET3D.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d473e9bce385040b","code_sha256_prefix":"d473e9bce385040b","mcp_get_code":{"code_sha256":"d473e9bce385040b"}},{"arxiv_id":"2212.02952","arxiv_id_is_arxiv":true,"paper":"/paper/simple-baseline-for-weather-forecasting-using","title":"Simple Baseline for Weather Forecasting Using Spatiotemporal Context Aggregation Network","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seominseok0429/w4c22-simple-baseline-for-weather-forecasting-using-spatiotemporal-context-aggregation-network","path":"models/SIANet.py","file_url":"https://github.com/seominseok0429/w4c22-simple-baseline-for-weather-forecasting-using-spatiotemporal-context-aggregation-network/blob/HEAD/models/SIANet.py","status":"unverified","verification_level":0,"contract_check":"RAISES","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, seominseok0429/w4c22-simple-baseline-for-weather-forecasting-using-spatiotemporal-context-aggregation-network (NOASSERTION)","code_sha256":"5d4086ba3f9b8bb8","code_sha256_prefix":"5d4086ba3f9b8bb8","mcp_get_code":{"code_sha256":"5d4086ba3f9b8bb8"}},{"arxiv_id":"2212.02059","arxiv_id_is_arxiv":true,"paper":"/paper/region-conditioned-orthogonal-3d-u-net-for","title":"Region-Conditioned Orthogonal 3D U-Net for Weather4Cast Competition","date":"2022-12-05","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":"deterministic","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":"d473e9bce385040b","code_sha256_prefix":"d473e9bce385040b","mcp_get_code":{"code_sha256":"d473e9bce385040b"}},{"arxiv_id":"2210.13148","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/DAGformer","path":"self-citation/models.py","file_url":"https://github.com/LUOyk1999/DAGformer/blob/HEAD/self-citation/models.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":"19afc55973cf4ff3","code_sha256_prefix":"19afc55973cf4ff3","mcp_get_code":{"code_sha256":"19afc55973cf4ff3"}},{"arxiv_id":"2111.12128","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-unreasonable-effectiveness-of-feature-1","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twitter-research/feature-propagation","path":"src/models.py","file_url":"https://github.com/twitter-research/feature-propagation/blob/HEAD/src/models.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":"338d87d585e0b11d","code_sha256_prefix":"338d87d585e0b11d","mcp_get_code":{"code_sha256":"338d87d585e0b11d"}},{"arxiv_id":"2106.01798","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-mle-backpropagating-through-discrete","title":"Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SerChirag/rs-imle","path":"helpers/imle_helpers.py","file_url":"https://github.com/SerChirag/rs-imle/blob/HEAD/helpers/imle_helpers.py","status":"unverified","verification_level":0,"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, SerChirag/rs-imle when it was checked","code_sha256":"52eba97aab7c3b34","code_sha256_prefix":"52eba97aab7c3b34","mcp_get_code":{"code_sha256":"52eba97aab7c3b34"}},{"arxiv_id":"2106.00920","arxiv_id_is_arxiv":true,"paper":"/paper/dialograph-incorporating-interpretable-1","title":"DialoGraph: Incorporating Interpretable Strategy-Graph Networks into Negotiation Dialogues","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishabhjoshi/DialoGraph_ICLR21","path":"src/utils.py","file_url":"https://github.com/rishabhjoshi/DialoGraph_ICLR21/blob/HEAD/src/utils.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":"11dc2e1c87bdd148","code_sha256_prefix":"11dc2e1c87bdd148","mcp_get_code":{"code_sha256":"11dc2e1c87bdd148"}},{"arxiv_id":"2010.01051","arxiv_id_is_arxiv":true,"paper":"/paper/neural-bootstrapper","title":"Neural Bootstrapper","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungbinlim/GBS","path":"models/nbsnet.py","file_url":"https://github.com/sungbinlim/GBS/blob/HEAD/models/nbsnet.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":"c349f899084e33d1","code_sha256_prefix":"c349f899084e33d1","mcp_get_code":{"code_sha256":"c349f899084e33d1"}},{"arxiv_id":"1704.04861","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenets-efficient-convolutional-neural","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","date":"2017-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/dnw","path":"models/graphs/mobilenetv1like.py","file_url":"https://github.com/allenai/dnw/blob/HEAD/models/graphs/mobilenetv1like.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, allenai/dnw (NOASSERTION)","code_sha256":"104c50ff520e011e","code_sha256_prefix":"104c50ff520e011e","mcp_get_code":{"code_sha256":"104c50ff520e011e"}},{"arxiv_id":"1606.06650","arxiv_id_is_arxiv":true,"paper":"/paper/3d-u-net-learning-dense-volumetric","title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","date":"2016-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elektronn/elektronn3","path":"elektronn3/models/unet.py","file_url":"https://github.com/elektronn/elektronn3/blob/HEAD/elektronn3/models/unet.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":"d473e9bce385040b","code_sha256_prefix":"d473e9bce385040b","mcp_get_code":{"code_sha256":"d473e9bce385040b"}},{"arxiv_id":"1312.6114","arxiv_id_is_arxiv":true,"paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kpandey008/DiffuseVAE","path":"main/models/vae.py","file_url":"https://github.com/kpandey008/DiffuseVAE/blob/HEAD/main/models/vae.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":"529c90aeec41a0eb","code_sha256_prefix":"529c90aeec41a0eb","mcp_get_code":{"code_sha256":"529c90aeec41a0eb"}},{"arxiv_id":"2025.acl-long.663","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.663","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BlueZeros/ReflecTool","path":"reflectool/models/conversations.py","file_url":"https://github.com/BlueZeros/ReflecTool/blob/HEAD/reflectool/models/conversations.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":"7cccc3f51b2d011f","code_sha256_prefix":"7cccc3f51b2d011f","mcp_get_code":{"code_sha256":"7cccc3f51b2d011f"}}],"record_sha256":"f417ce97564a106cfc14a0dc24f5de8c9de4502a43cd09a9f0a80c92167e8ebe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}