{"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/mindssc","entry":"MINDSSC","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":5,"unverified":0},"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":"2601.17529","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17529","title":"FMIR, A Foundation Model-Based Image Registration Framework for Robust Image Registration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Monday0328/FMIR","path":"models/unigradicon_wrapper_convexAdam_iter3.py","file_url":"https://github.com/Monday0328/FMIR/blob/HEAD/models/unigradicon_wrapper_convexAdam_iter3.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, Monday0328/FMIR when it was checked","code_sha256":"ac94353aeec7da98","code_sha256_prefix":"ac94353aeec7da98","mcp_get_code":{"code_sha256":"ac94353aeec7da98"}},{"arxiv_id":"2311.14986","arxiv_id_is_arxiv":true,"paper":"/paper/same-a-self-supervised-anatomical-embeddings","title":"SAME++: A Self-supervised Anatomical eMbeddings Enhanced medical image registration framework using stable sampling and regularized transformation","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-damo-academy/same","path":"SAMReg/cores/losses.py","file_url":"https://github.com/alibaba-damo-academy/same/blob/HEAD/SAMReg/cores/losses.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":"2f1eec51a8f0d081","code_sha256_prefix":"2f1eec51a8f0d081","mcp_get_code":{"code_sha256":"2f1eec51a8f0d081"}},{"arxiv_id":"2112.03053","arxiv_id_is_arxiv":true,"paper":"/paper/fast-3d-registration-with-accurate","title":"Fast 3D registration with accurate optimisation and little learning for Learn2Reg 2021","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/convexadam","path":"l2r_2020_convexAdam_CuRIOUS.py","file_url":"https://github.com/multimodallearning/convexadam/blob/HEAD/l2r_2020_convexAdam_CuRIOUS.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":"ccc9566aa49ed5d7","code_sha256_prefix":"ccc9566aa49ed5d7","mcp_get_code":{"code_sha256":"ccc9566aa49ed5d7"}},{"arxiv_id":"2112.03053","arxiv_id_is_arxiv":true,"paper":"/paper/fast-3d-registration-with-accurate","title":"Fast 3D registration with accurate optimisation and little learning for Learn2Reg 2021","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/convexadam","path":"src/convexAdam/convex_adam_utils.py","file_url":"https://github.com/multimodallearning/convexadam/blob/HEAD/src/convexAdam/convex_adam_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":"4838aced847d3cea","code_sha256_prefix":"4838aced847d3cea","mcp_get_code":{"code_sha256":"4838aced847d3cea"}},{"arxiv_id":"2004.14557","arxiv_id_is_arxiv":true,"paper":"/paper/a-multi-scale-optimization-learning-framework","title":"Learning Deformable Image Registration from Optimization: Perspective, Modules, Bilevel Training and Beyond","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alison-brie/MultiPropReg","path":"MIND.py","file_url":"https://github.com/Alison-brie/MultiPropReg/blob/HEAD/MIND.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":"1fd1a81503e31013","code_sha256_prefix":"1fd1a81503e31013","mcp_get_code":{"code_sha256":"1fd1a81503e31013"}},{"arxiv_id":"1911.12408","arxiv_id_is_arxiv":true,"paper":"/paper/pointpwc-net-a-coarse-to-fine-network-for","title":"PointPWC-Net: A Coarse-to-Fine Network for Supervised and Self-Supervised Scene Flow Estimation on 3D Point Clouds","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/Lung250M-4B","path":"registration_models/vxmplusplus_utils.py","file_url":"https://github.com/multimodallearning/Lung250M-4B/blob/HEAD/registration_models/vxmplusplus_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":"ccc9566aa49ed5d7","code_sha256_prefix":"ccc9566aa49ed5d7","mcp_get_code":{"code_sha256":"ccc9566aa49ed5d7"}}],"record_sha256":"4c4f40a97463c26b8a46d6a62b3ad34dce9942097032c536a5571cc506113750","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}