{"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-coef","entry":"get_coef","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"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":"2506.21866","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.21866","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"CSYSI/DPU-Former","path":"DPU-Former_25_IJCAI/utils/utils.py","file_url":"https://github.com/CSYSI/DPU-Former/blob/HEAD/DPU-Former_25_IJCAI/utils/utils.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, CSYSI/DPU-Former when it was checked","code_sha256":"1ed4fe7e2e6020fa","code_sha256_prefix":"1ed4fe7e2e6020fa","mcp_get_code":{"code_sha256":"1ed4fe7e2e6020fa"}},{"arxiv_id":"2212.02691","arxiv_id_is_arxiv":true,"paper":"/paper/luna-language-understanding-with-number","title":"LUNA: Language Understanding with Number Augmentations on Transformers via Number Plugins and Pre-training","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmy/luna","path":"phases/numerical_field/Pretrain.py","file_url":"https://github.com/zmy/luna/blob/HEAD/phases/numerical_field/Pretrain.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":"5d3a76dcc66fcb8e","code_sha256_prefix":"5d3a76dcc66fcb8e","mcp_get_code":{"code_sha256":"5d3a76dcc66fcb8e"}},{"arxiv_id":"2203.02688","arxiv_id_is_arxiv":true,"paper":"/paper/zoom-in-and-out-a-mixed-scale-triplet-network","title":"Zoom In and Out: A Mixed-scale Triplet Network for Camouflaged Object Detection","date":"2022-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lartpang/ZoomNet","path":"methods/zoomnet/zoomnet.py","file_url":"https://github.com/lartpang/ZoomNet/blob/HEAD/methods/zoomnet/zoomnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ed4fe7e2e6020fa","code_sha256_prefix":"1ed4fe7e2e6020fa","mcp_get_code":{"code_sha256":"1ed4fe7e2e6020fa"}},{"arxiv_id":"2012.08950","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinklab-sjtu/rgm","path":"dqn_model_r.py","file_url":"https://github.com/thinklab-sjtu/rgm/blob/HEAD/dqn_model_r.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thinklab-sjtu/rgm when it was checked","code_sha256":"86e9271dadbdbd1c","code_sha256_prefix":"86e9271dadbdbd1c","mcp_get_code":{"code_sha256":"86e9271dadbdbd1c"}},{"arxiv_id":"2007.10408","arxiv_id_is_arxiv":true,"paper":"/paper/pdo-econvs-partial-differential-operator","title":"PDO-eConvs: Partial Differential Operator Based Equivariant Convolutions","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenzy08/PDO-eConvs","path":"cifar.py","file_url":"https://github.com/shenzy08/PDO-eConvs/blob/HEAD/cifar.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":"3153f50b8445e277","code_sha256_prefix":"3153f50b8445e277","mcp_get_code":{"code_sha256":"3153f50b8445e277"}},{"arxiv_id":"2007.10408","arxiv_id_is_arxiv":true,"paper":"/paper/pdo-econvs-partial-differential-operator","title":"PDO-eConvs: Partial Differential Operator Based Equivariant Convolutions","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Roderickzzc/Pdo-econv-pytorch","path":"mwpdo_layers.py","file_url":"https://github.com/Roderickzzc/Pdo-econv-pytorch/blob/HEAD/mwpdo_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":"06968f8c3bffb773","code_sha256_prefix":"06968f8c3bffb773","mcp_get_code":{"code_sha256":"06968f8c3bffb773"}},{"arxiv_id":"1909.11966","arxiv_id_is_arxiv":true,"paper":"/paper/dual-stream-pyramid-registration-network","title":"Dual-Stream Pyramid Registration Network","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olddriverjinx/reimplemention-of-dual-prnet","path":"network/transform.py","file_url":"https://github.com/olddriverjinx/reimplemention-of-dual-prnet/blob/HEAD/network/transform.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":"d0de6300264407c3","code_sha256_prefix":"d0de6300264407c3","mcp_get_code":{"code_sha256":"d0de6300264407c3"}},{"arxiv_id":"1907.12353","arxiv_id_is_arxiv":true,"paper":"/paper/recursive-cascaded-networks-for-unsupervised","title":"Recursive Cascaded Networks for Unsupervised Medical Image Registration","date":"2019-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Recursive-Cascaded-Networks","path":"network/transform.py","file_url":"https://github.com/microsoft/Recursive-Cascaded-Networks/blob/HEAD/network/transform.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":"d0de6300264407c3","code_sha256_prefix":"d0de6300264407c3","mcp_get_code":{"code_sha256":"d0de6300264407c3"}},{"arxiv_id":"aaai_25276","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25276","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JinxLv/One-shot-segmentation-via-IST","path":"network/transform.py","file_url":"https://github.com/JinxLv/One-shot-segmentation-via-IST/blob/HEAD/network/transform.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":"d0de6300264407c3","code_sha256_prefix":"d0de6300264407c3","mcp_get_code":{"code_sha256":"d0de6300264407c3"}}],"record_sha256":"dd2eba55074898cb2157d51d0398857a36614bf0cf33b386835340f608a9fc32","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}