{"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/min-max-norm","entry":"min_max_norm","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":19,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":15,"n_papers_ran_instrument_only":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":11,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":19,"n_places_pointer_only":11,"n_places_pointer_only_link_open":2,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":7,"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":"2606.02359","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02359","title":"MOC: Multi-Order Communication in LLM-based Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"yao-guan/MOC","path":"src/graph/graph.py","file_url":"https://github.com/yao-guan/MOC/blob/HEAD/src/graph/graph.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yao-guan/MOC when it was checked","code_sha256":"b4a55c20a81f5527","code_sha256_prefix":"b4a55c20a81f5527","mcp_get_code":{"code_sha256":"b4a55c20a81f5527"}},{"arxiv_id":"2605.09907","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09907","title":"RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yanweiyue/GDesigner","path":"GDesigner/graph/graph.py","file_url":"https://github.com/yanweiyue/GDesigner/blob/HEAD/GDesigner/graph/graph.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yanweiyue/GDesigner when it was checked","code_sha256":"b4a55c20a81f5527","code_sha256_prefix":"b4a55c20a81f5527","mcp_get_code":{"code_sha256":"b4a55c20a81f5527"}},{"arxiv_id":"2603.01806","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01806","title":"GCTAM: Global and Contextual Truncated Affinity Combined Maximization Model For Unsupervised Graph Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"kgccc/GCTAM","path":"model.py","file_url":"https://github.com/kgccc/GCTAM/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kgccc/GCTAM when it was checked","code_sha256":"af0b22bd9efac86b","code_sha256_prefix":"af0b22bd9efac86b","mcp_get_code":{"code_sha256":"af0b22bd9efac86b"}},{"arxiv_id":"2402.11887","arxiv_id_is_arxiv":true,"paper":"/paper/generative-semi-supervised-graph-anomaly","title":"Generative Semi-supervised Graph Anomaly Detection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/GGAD","path":"model_tam.py","file_url":"https://github.com/mala-lab/GGAD/blob/HEAD/model_tam.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mala-lab/GGAD when it was checked","code_sha256":"af0b22bd9efac86b","code_sha256_prefix":"af0b22bd9efac86b","mcp_get_code":{"code_sha256":"af0b22bd9efac86b"}},{"arxiv_id":"2312.03585","arxiv_id_is_arxiv":true,"paper":"/paper/foundation-model-assisted-weakly-supervised","title":"Foundation Model Assisted Weakly Supervised Semantic Segmentation","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HAL-42/FMA-WSSS","path":"src/utils/norm.py","file_url":"https://github.com/HAL-42/FMA-WSSS/blob/HEAD/src/utils/norm.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":"aafa36e0625e07ce","code_sha256_prefix":"aafa36e0625e07ce","mcp_get_code":{"code_sha256":"aafa36e0625e07ce"}},{"arxiv_id":"2307.10864","arxiv_id_is_arxiv":true,"paper":"/paper/divide-bind-your-attention-for-improved","title":"Divide & Bind Your Attention for Improved Generative Semantic Nursing","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/Divide-and-Bind","path":"utils/annotation_sd.py","file_url":"https://github.com/boschresearch/Divide-and-Bind/blob/HEAD/utils/annotation_sd.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/Divide-and-Bind, is not in the permissive set Syntology serves inline","code_sha256":"bbce8ae94df69bee","code_sha256_prefix":"bbce8ae94df69bee","mcp_get_code":{"code_sha256":"bbce8ae94df69bee"}},{"arxiv_id":"2306.00006","arxiv_id_is_arxiv":true,"paper":"/paper/truncated-affinity-maximization-one-class-1","title":"Truncated Affinity Maximization: One-class Homophily Modeling for Graph Anomaly Detection","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/TAM-master","path":"model.py","file_url":"https://github.com/mala-lab/TAM-master/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mala-lab/TAM-master when it was checked","code_sha256":"af0b22bd9efac86b","code_sha256_prefix":"af0b22bd9efac86b","mcp_get_code":{"code_sha256":"af0b22bd9efac86b"}},{"arxiv_id":"2207.04655","arxiv_id_is_arxiv":true,"paper":"/paper/personalizing-federated-medical-image","title":"Personalizing Federated Medical Image Segmentation via Local Calibration","date":"2022-07-11","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":"invariant","behaviour_fingerprint":true,"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":"f11714f9833718d2","code_sha256_prefix":"f11714f9833718d2","mcp_get_code":{"code_sha256":"f11714f9833718d2"}},{"arxiv_id":"2205.07179","arxiv_id_is_arxiv":true,"paper":"/paper/promoting-saliency-from-depth-deep-1","title":"Promoting Saliency From Depth: Deep Unsupervised RGB-D Saliency Detection","date":"2022-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwei0921/dsu","path":"DSU_Code/model/HolisticAttention.py","file_url":"https://github.com/jiwei0921/dsu/blob/HEAD/DSU_Code/model/HolisticAttention.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JingZhang617/SalCoopNets, and GitHub detected no licence in that repository when it was checked","code_sha256":"f11714f9833718d2","code_sha256_prefix":"f11714f9833718d2","mcp_get_code":{"code_sha256":"f11714f9833718d2"}},{"arxiv_id":"2106.13389","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-generative-cooperative-saliency","title":"Energy-Based Generative Cooperative Saliency Prediction","date":"2021-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingZhang617/SalCoopNets","path":"model/HolisticAttention.py","file_url":"https://github.com/JingZhang617/SalCoopNets/blob/HEAD/model/HolisticAttention.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JingZhang617/SalCoopNets when it was checked","code_sha256":"f11714f9833718d2","code_sha256_prefix":"f11714f9833718d2","mcp_get_code":{"code_sha256":"f11714f9833718d2"}},{"arxiv_id":"2106.08265","arxiv_id_is_arxiv":true,"paper":"/paper/towards-total-recall-in-industrial-anomaly","title":"Towards Total Recall in Industrial Anomaly Detection","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tbcvContributor/DeepHawkeye","path":"src/utils.py","file_url":"https://github.com/tbcvContributor/DeepHawkeye/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"373674457d45997f","code_sha256_prefix":"373674457d45997f","mcp_get_code":{"code_sha256":"373674457d45997f"}},{"arxiv_id":"2105.01601","arxiv_id_is_arxiv":true,"paper":"/paper/mlp-mixer-an-all-mlp-architecture-for-vision","title":"MLP-Mixer: An all-MLP Architecture for Vision","date":"2021-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/MLP-Mixer-TF2","path":"source/utils.py","file_url":"https://github.com/YeongHyeon/MLP-Mixer-TF2/blob/HEAD/source/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbf4ede63ece446f","code_sha256_prefix":"bbf4ede63ece446f","mcp_get_code":{"code_sha256":"bbf4ede63ece446f"}},{"arxiv_id":"2104.06159","arxiv_id_is_arxiv":true,"paper":"/paper/muesli-combining-improvements-in-policy","title":"Muesli: Combining Improvements in Policy Optimization","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Itomigna2/Muesli-lunarlander","path":"Muesli_lunar_rgb.py","file_url":"https://github.com/Itomigna2/Muesli-lunarlander/blob/HEAD/Muesli_lunar_rgb.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0da0f4c833bc9bdc","code_sha256_prefix":"0da0f4c833bc9bdc","mcp_get_code":{"code_sha256":"0da0f4c833bc9bdc"}},{"arxiv_id":"2104.00298","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danstowell/insect_classifier_GDSC23_insecteffnet","path":"src/custom/utils.py","file_url":"https://github.com/danstowell/insect_classifier_GDSC23_insecteffnet/blob/HEAD/src/custom/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c88df91221a8d8c","code_sha256_prefix":"5c88df91221a8d8c","mcp_get_code":{"code_sha256":"5c88df91221a8d8c"}},{"arxiv_id":"1911.04448","arxiv_id_is_arxiv":true,"paper":"/paper/real-time-reinforcement-learning","title":"Real-Time Reinforcement Learning","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elementai/avenue","path":"avenue/util.py","file_url":"https://github.com/elementai/avenue/blob/HEAD/avenue/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbaf3f539ccf9404","code_sha256_prefix":"bbaf3f539ccf9404","mcp_get_code":{"code_sha256":"bbaf3f539ccf9404"}},{"arxiv_id":"1902.02476","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-bayesian-uncertainty-in","title":"A Simple Baseline for Bayesian Uncertainty in Deep Learning","date":"2019-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/SWA-Gaussian-TF2","path":"source/utils.py","file_url":"https://github.com/YeongHyeon/SWA-Gaussian-TF2/blob/HEAD/source/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbf4ede63ece446f","code_sha256_prefix":"bbf4ede63ece446f","mcp_get_code":{"code_sha256":"bbf4ede63ece446f"}},{"arxiv_id":"1505.05770","arxiv_id_is_arxiv":true,"paper":"/paper/variational-inference-with-normalizing-flows","title":"Variational Inference with Normalizing Flows","date":"2015-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/Normalizing-Flow-TF2","path":"source/utils.py","file_url":"https://github.com/YeongHyeon/Normalizing-Flow-TF2/blob/HEAD/source/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbf4ede63ece446f","code_sha256_prefix":"bbf4ede63ece446f","mcp_get_code":{"code_sha256":"bbf4ede63ece446f"}},{"arxiv_id":"Shin_Anatomical_Consistency_and_Adaptive_Prior-informed_Transformation_for_Multi-contrast_MR_Image_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Shin_Anatomical_Consistency_and_Adaptive_Prior-informed_Transformation_for_Multi-contrast_MR_Image_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yejees/APT","path":"custom.py","file_url":"https://github.com/yejees/APT/blob/HEAD/custom.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yejees/APT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5c685e27f2d5f3c4","code_sha256_prefix":"5c685e27f2d5f3c4","mcp_get_code":{"code_sha256":"5c685e27f2d5f3c4"}},{"arxiv_id":"Ji_Calibrated_RGB-D_Salient_Object_Detection_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ji_Calibrated_RGB-D_Salient_Object_Detection_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiwei0921/DCF","path":"DCF_code/model/HolisticAttention.py","file_url":"https://github.com/jiwei0921/DCF/blob/HEAD/DCF_code/model/HolisticAttention.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JingZhang617/SalCoopNets, and GitHub detected no licence in that repository when it was checked","code_sha256":"f11714f9833718d2","code_sha256_prefix":"f11714f9833718d2","mcp_get_code":{"code_sha256":"f11714f9833718d2"}}],"record_sha256":"9cde493d98b644b2030379c922443ce6ccc3b61b8d6358f87da8958a8689f804","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}