{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/residual-2","entry":"residual","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":8,"n_samples_ran":6,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"unverified":2},"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":"2607.26278","paper":"/paper/arxiv-2607-26278","title":"FloDR: An invertible dimensionality reduction method based on a normalising flow","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"daenuprobst/flodr","path":"src/flodr/viz.py","file_url":"https://github.com/daenuprobst/flodr/blob/HEAD/src/flodr/viz.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a259e1f617a3327d","mcp_get_code":{"code_sha256":"a259e1f617a3327d"}},{"arxiv_id":"2606.16138","paper":"/paper/arxiv-2606-16138","title":"Closing the Approximation Gap in Simulation-free Latent SDEs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"coursekevin/arlatentsde","path":"arlatentsde/elbo.py","file_url":"https://github.com/coursekevin/arlatentsde/blob/HEAD/arlatentsde/elbo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"67108bf7a14e3435","mcp_get_code":{"code_sha256":"67108bf7a14e3435"}},{"arxiv_id":"2605.04381","paper":"/paper/arxiv-2605-04381","title":"Causal discovery under mean independence and linearity","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"alvaro-ribot/limiam","path":"direct_limiam.py","file_url":"https://github.com/alvaro-ribot/limiam/blob/HEAD/direct_limiam.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9186b46a589acb05","mcp_get_code":{"code_sha256":"9186b46a589acb05"}},{"arxiv_id":"2405.17311","paper":"/paper/probabilistic-graph-rewiring-via-virtual","title":"Probabilistic Graph Rewiring via Virtual Nodes","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chendiqian/IPR-MPNN","path":"models/nn_utils.py","file_url":"https://github.com/chendiqian/IPR-MPNN/blob/HEAD/models/nn_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fbe819589c89fc7a","mcp_get_code":{"code_sha256":"fbe819589c89fc7a"}},{"arxiv_id":"2310.02156","paper":"/paper/probabilistically-rewired-message-passing","title":"Probabilistically Rewired Message-Passing Neural Networks","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chendiqian/PR-MPNN","path":"models/my_convs.py","file_url":"https://github.com/chendiqian/PR-MPNN/blob/HEAD/models/my_convs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fbe819589c89fc7a","mcp_get_code":{"code_sha256":"fbe819589c89fc7a"}},{"arxiv_id":"2304.02173","paper":"/paper/chartreader-a-unified-framework-for-chart","title":"ChartReader: A Unified Framework for Chart Derendering and Comprehension without Heuristic Rules","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqic/ChartReader","path":"models/py_utils/kp.py","file_url":"https://github.com/zhiqic/ChartReader/blob/HEAD/models/py_utils/kp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c83b00138de50a06","mcp_get_code":{"code_sha256":"c83b00138de50a06"}},{"arxiv_id":"2209.03942","paper":"/paper/data-feedback-loops-model-driven","title":"Data Feedback Loops: Model-driven Amplification of Dataset Biases","date":"2022-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rtaori/data_feedback","path":"image_classification/baidunet.py","file_url":"https://github.com/rtaori/data_feedback/blob/HEAD/image_classification/baidunet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"dc51887b30539963","mcp_get_code":{"code_sha256":"dc51887b30539963"}},{"arxiv_id":"2205.06130","paper":"/paper/multi-task-learning-for-zero-shot-performance","title":"Multi Task Learning For Zero Shot Performance Prediction of Multilingual Models","date":"2022-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hichamjanati/mutar","path":"mutar/utils.py","file_url":"https://github.com/hichamjanati/mutar/blob/HEAD/mutar/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b4a8a1feba8a0ec5","mcp_get_code":{"code_sha256":"b4a8a1feba8a0ec5"}},{"arxiv_id":"1809.08835","paper":"/paper/crowd-robot-interaction-crowd-aware-robot","title":"Crowd-Robot Interaction: Crowd-aware Robot Navigation with Attention-based Deep Reinforcement Learning","date":"2018-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sepsamavi/safe-interactive-crowdnav","path":"sicnav_diffusion/policy/sicnav_acados.py","file_url":"https://github.com/sepsamavi/safe-interactive-crowdnav/blob/HEAD/sicnav_diffusion/policy/sicnav_acados.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d2be47d2185bec0","mcp_get_code":{"code_sha256":"7d2be47d2185bec0"}}]}