{"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/inverse","entry":"inverse","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":15,"n_papers_ran":4,"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":18,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":18,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":1,"unverified":14},"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.13445","paper":"/paper/arxiv-2609-13445","title":"CAUSAL ANALYSIS AND MITIGATION OF SPURIOUS ONSETS IN FULL-DUPLEX SPEECH LLMS","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"KentoNishi/icassp27-spurious-onsets","path":"summarize.py","file_url":"https://github.com/KentoNishi/icassp27-spurious-onsets/blob/HEAD/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e853efbb3e116405","mcp_get_code":{"code_sha256":"e853efbb3e116405"}},{"arxiv_id":"2404.07626","paper":"/paper/homography-guided-temporal-fusion-for-road-1","title":"Homography Guided Temporal Fusion for Road Line and Marking Segmentation","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShanWang-Shan/HomoFusion","path":"homo_transformer/model/homo_guide_encoder.py","file_url":"https://github.com/ShanWang-Shan/HomoFusion/blob/HEAD/homo_transformer/model/homo_guide_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"eb6230e7464909be","mcp_get_code":{"code_sha256":"eb6230e7464909be"}},{"arxiv_id":"2306.13960","paper":"/paper/regular-se-3-group-convolutions-for","title":"Regular SE(3) Group Convolutions for Volumetric Medical Image Analysis","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thijskuipers1995/gconv","path":"gconv/geometry/groups/o2.py","file_url":"https://github.com/thijskuipers1995/gconv/blob/HEAD/gconv/geometry/groups/o2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f11b5ef1265c535e","mcp_get_code":{"code_sha256":"f11b5ef1265c535e"}},{"arxiv_id":"2103.14910","paper":"/paper/nemi-unifying-neural-radiance-fields-with","title":"MINE: Towards Continuous Depth MPI with NeRF for Novel View Synthesis","date":"2021-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincentfung13/MINE","path":"operations/mpi_rendering.py","file_url":"https://github.com/vincentfung13/MINE/blob/HEAD/operations/mpi_rendering.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c56cc2b3ae0cce5","mcp_get_code":{"code_sha256":"3c56cc2b3ae0cce5"}},{"arxiv_id":"2102.05379","paper":"/paper/argmax-flows-and-multinomial-diffusion","title":"Argmax Flows and Multinomial Diffusion: Learning Categorical Distributions","date":"2021-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"didriknielsen/argmax_flows","path":"model/CategoricalNF/flows/mixture_cdf_layer.py","file_url":"https://github.com/didriknielsen/argmax_flows/blob/HEAD/model/CategoricalNF/flows/mixture_cdf_layer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e630357d1081630","mcp_get_code":{"code_sha256":"7e630357d1081630"}},{"arxiv_id":"2010.07003","paper":"/paper/length-adaptive-transformer-train-once-with-1","title":"Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Search","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/length-adaptive-transformer","path":"length_adaptive_transformer/evolution.py","file_url":"https://github.com/clovaai/length-adaptive-transformer/blob/HEAD/length_adaptive_transformer/evolution.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":"6b03101e9b8362e6","mcp_get_code":{"code_sha256":"6b03101e9b8362e6"}},{"arxiv_id":"2007.04154","paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"applications/markov/bdd_fun.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/applications/markov/bdd_fun.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"15d922543dcd027d","mcp_get_code":{"code_sha256":"15d922543dcd027d"}},{"arxiv_id":"2006.12101","paper":"/paper/p3gm-private-high-dimensional-data-release","title":"P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsubasat/P3GM","path":"src/my_util.py","file_url":"https://github.com/tsubasat/P3GM/blob/HEAD/src/my_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"505df0647cdc4844","mcp_get_code":{"code_sha256":"505df0647cdc4844"}},{"arxiv_id":"2004.13242","paper":"/paper/finding-macro-actions-with-disentangled","title":"Efficient Black-Box Planning Using Macro-Actions with Focused Effects","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camall3n/skills-for-planning","path":"domains/cube/formula.py","file_url":"https://github.com/camall3n/skills-for-planning/blob/HEAD/domains/cube/formula.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":"0ce89e754ee8249a","mcp_get_code":{"code_sha256":"0ce89e754ee8249a"}},{"arxiv_id":"2003.13479","paper":"/paper/2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzijian/RPMNet","path":"src/common/math/se3.py","file_url":"https://github.com/yewzijian/RPMNet/blob/HEAD/src/common/math/se3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"caea4df4266011b9","mcp_get_code":{"code_sha256":"caea4df4266011b9"}},{"arxiv_id":"2003.13479","paper":"/paper/2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzijian/RPMNet","path":"src/common/math_torch/se3.py","file_url":"https://github.com/yewzijian/RPMNet/blob/HEAD/src/common/math_torch/se3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3f07450b8d24c41","mcp_get_code":{"code_sha256":"c3f07450b8d24c41"}},{"arxiv_id":"2002.03113","paper":"/paper/projective-preferential-bayesian-optimization","title":"Projective Preferential Bayesian Optimization","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P-Mikkola/PPBO","path":"src/misc.py","file_url":"https://github.com/P-Mikkola/PPBO/blob/HEAD/src/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31352f1d9134ca1b","mcp_get_code":{"code_sha256":"31352f1d9134ca1b"}},{"arxiv_id":"1910.12037","paper":"/paper/region-mutual-information-loss-for-semantic","title":"Region Mutual Information Loss for Semantic Segmentation","date":"2019-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RElbers/region-mutual-information-pytorch","path":"rmi/rmi.py","file_url":"https://github.com/RElbers/region-mutual-information-pytorch/blob/HEAD/rmi/rmi.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c188738b3a4fca95","mcp_get_code":{"code_sha256":"c188738b3a4fca95"}},{"arxiv_id":"1901.09458","paper":"/paper/learning-transformation-synchronization","title":"Learning Transformation Synchronization","date":"2019-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangruhuang/Learning2Sync","path":"util.py","file_url":"https://github.com/xiangruhuang/Learning2Sync/blob/HEAD/util.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":"7c9a48ce306b63e4","mcp_get_code":{"code_sha256":"7c9a48ce306b63e4"}},{"arxiv_id":"1901.09458","paper":"/paper/learning-transformation-synchronization","title":"Learning Transformation Synchronization","date":"2019-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangruhuang/Learning2Sync","path":"src/training_classifier/dataset.py","file_url":"https://github.com/xiangruhuang/Learning2Sync/blob/HEAD/src/training_classifier/dataset.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":"09878d4d50212776","mcp_get_code":{"code_sha256":"09878d4d50212776"}},{"arxiv_id":"1803.01837","paper":"/paper/st-gan-spatial-transformer-generative","title":"ST-GAN: Spatial Transformer Generative Adversarial Networks for Image Compositing","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/spatial-transformer-GAN","path":"glasses/warp.py","file_url":"https://github.com/chenhsuanlin/spatial-transformer-GAN/blob/HEAD/glasses/warp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2db836dae92016c","mcp_get_code":{"code_sha256":"e2db836dae92016c"}},{"arxiv_id":"1612.03897","paper":"/paper/inverse-compositional-spatial-transformer","title":"Inverse Compositional Spatial Transformer Networks","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/inverse-compositional-STN","path":"MNIST-pytorch/warp.py","file_url":"https://github.com/chenhsuanlin/inverse-compositional-STN/blob/HEAD/MNIST-pytorch/warp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84120307d6fea550","mcp_get_code":{"code_sha256":"84120307d6fea550"}},{"arxiv_id":"1612.03897","paper":"/paper/inverse-compositional-spatial-transformer","title":"Inverse Compositional Spatial Transformer Networks","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/inverse-compositional-STN","path":"MNIST-tensorflow/warp.py","file_url":"https://github.com/chenhsuanlin/inverse-compositional-STN/blob/HEAD/MNIST-tensorflow/warp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3f178e78c6f4924","mcp_get_code":{"code_sha256":"f3f178e78c6f4924"}}]}