{"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/unnormalize","entry":"unnormalize","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":21,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":9,"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":16,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":8,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":21,"n_places_pointer_only":9,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":2,"ran":7,"unverified":2},"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":"2603.28572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28572","title":"Unrestrained Simplex Denoising for Discrete Data A Non-Markovian Approach Applied to Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cvignac/DiGress","path":"src/utils.py","file_url":"https://github.com/cvignac/DiGress/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1710d35360c8aadf","code_sha256_prefix":"1710d35360c8aadf","mcp_get_code":{"code_sha256":"1710d35360c8aadf"}},{"arxiv_id":"2603.13109","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-13109","title":"BoSS: A Best-of-Strategies Selector as an Oracle for Deep Active Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"dhuseljic/dal-toolbox","path":"dal_toolbox/utils.py","file_url":"https://github.com/dhuseljic/dal-toolbox/blob/HEAD/dal_toolbox/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32740d526d3118a3","code_sha256_prefix":"32740d526d3118a3","mcp_get_code":{"code_sha256":"32740d526d3118a3"}},{"arxiv_id":"2509.20295","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-20295","title":"FAST: Foreground-aware Diffusion with Accelerated Sampling Trajectory for Segmentation-oriented Anomaly Synthesis","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Chhro123/fast-foreground-aware-anomaly-synthesis","path":"global_GLASS.py","file_url":"https://github.com/Chhro123/fast-foreground-aware-anomaly-synthesis/blob/HEAD/global_GLASS.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, Chhro123/fast-foreground-aware-anomaly-synthesis when it was checked","code_sha256":"c405f4afe08413a5","code_sha256_prefix":"c405f4afe08413a5","mcp_get_code":{"code_sha256":"c405f4afe08413a5"}},{"arxiv_id":"2411.15633","arxiv_id_is_arxiv":true,"paper":"/paper/effort-efficient-orthogonal-modeling-for","title":"Orthogonal Subspace Decomposition for Generalizable AI-Generated Image Detection","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzy-stack/effort-aigi-detection","path":"UniversalFakeDetect_Benchmark/util.py","file_url":"https://github.com/yzy-stack/effort-aigi-detection/blob/HEAD/UniversalFakeDetect_Benchmark/util.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, yzy-stack/effort-aigi-detection when it was checked","code_sha256":"7742460f647f9ca2","code_sha256_prefix":"7742460f647f9ca2","mcp_get_code":{"code_sha256":"7742460f647f9ca2"}},{"arxiv_id":"2410.04263","arxiv_id_is_arxiv":true,"paper":"/paper/defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelmlmadeira/DeFoG","path":"src/utils.py","file_url":"https://github.com/manuelmlmadeira/DeFoG/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1739cf39d80953b0","code_sha256_prefix":"1739cf39d80953b0","mcp_get_code":{"code_sha256":"1739cf39d80953b0"}},{"arxiv_id":"2409.11355","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-image-conditional-diffusion","title":"Fine-Tuning Image-Conditional Diffusion Models is Easier than You Think","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisualComputingInstitute/diffusion-e2e-ft","path":"DSINE/utils/visualize.py","file_url":"https://github.com/VisualComputingInstitute/diffusion-e2e-ft/blob/HEAD/DSINE/utils/visualize.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, VisualComputingInstitute/diffusion-e2e-ft when it was checked","code_sha256":"61cf14e229883558","code_sha256_prefix":"61cf14e229883558","mcp_get_code":{"code_sha256":"61cf14e229883558"}},{"arxiv_id":"2408.09647","arxiv_id_is_arxiv":true,"paper":"/paper/c2p-clip-injecting-category-common-prompt-in","title":"C2P-CLIP: Injecting Category Common Prompt in CLIP to Enhance Generalization in Deepfake Detection","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuangchuangtan/c2p-clip-deepfakedetection","path":"utils/util.py","file_url":"https://github.com/chuangchuangtan/c2p-clip-deepfakedetection/blob/HEAD/utils/util.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, chuangchuangtan/c2p-clip-deepfakedetection when it was checked","code_sha256":"7742460f647f9ca2","code_sha256_prefix":"7742460f647f9ca2","mcp_get_code":{"code_sha256":"7742460f647f9ca2"}},{"arxiv_id":"2407.12427","arxiv_id_is_arxiv":true,"paper":"/paper/generalad-anomaly-detection-across-domains-by","title":"GeneralAD: Anomaly Detection Across Domains by Attending to Distorted Features","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LucStrater/GeneralAD","path":"src/run_viz.py","file_url":"https://github.com/LucStrater/GeneralAD/blob/HEAD/src/run_viz.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":"d4638a9a079ae91e","code_sha256_prefix":"d4638a9a079ae91e","mcp_get_code":{"code_sha256":"d4638a9a079ae91e"}},{"arxiv_id":"2405.11416","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-state-continuous-time-diffusion-for","title":"Discrete-state Continuous-time Diffusion for Graph Generation","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pricexu/disco","path":"digress_utils.py","file_url":"https://github.com/pricexu/disco/blob/HEAD/digress_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, pricexu/disco when it was checked","code_sha256":"1710d35360c8aadf","code_sha256_prefix":"1710d35360c8aadf","mcp_get_code":{"code_sha256":"1710d35360c8aadf"}},{"arxiv_id":"2401.13858","arxiv_id_is_arxiv":true,"paper":"/paper/inverse-molecular-design-with-multi","title":"Graph Diffusion Transformers for Multi-Conditional Molecular Generation","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liugangcode/MCD","path":"graph_dit/utils.py","file_url":"https://github.com/liugangcode/MCD/blob/HEAD/graph_dit/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, liugangcode/MCD when it was checked","code_sha256":"bb865ea3fa367417","code_sha256_prefix":"bb865ea3fa367417","mcp_get_code":{"code_sha256":"bb865ea3fa367417"}},{"arxiv_id":"2312.17397","arxiv_id_is_arxiv":true,"paper":"/paper/classifier-free-graph-diffusion-for-molecular","title":"Classifier-free graph diffusion for molecular property targeting","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asduffo/freegress","path":"src/utils.py","file_url":"https://github.com/asduffo/freegress/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4656e7ee2a2bec2f","code_sha256_prefix":"4656e7ee2a2bec2f","mcp_get_code":{"code_sha256":"4656e7ee2a2bec2f"}},{"arxiv_id":"2311.06423","arxiv_id_is_arxiv":true,"paper":"/paper/flatness-aware-adversarial-attack","title":"Transferability Bound Theory: Exploring Relationship between Adversarial Transferability and Flatness","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmy266/tpa","path":"FAA/acc_validate.py","file_url":"https://github.com/fmy266/tpa/blob/HEAD/FAA/acc_validate.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, fmy266/tpa when it was checked","code_sha256":"90b8bf86c8334fb7","code_sha256_prefix":"90b8bf86c8334fb7","mcp_get_code":{"code_sha256":"90b8bf86c8334fb7"}},{"arxiv_id":"2310.20708","arxiv_id_is_arxiv":true,"paper":"/paper/unexpected-improvements-to-expected","title":"Unexpected Improvements to Expected Improvement for Bayesian Optimization","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerronen/scales","path":"les/opt/bo.py","file_url":"https://github.com/omerronen/scales/blob/HEAD/les/opt/bo.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":"b1ad8495ae416cec","code_sha256_prefix":"b1ad8495ae416cec","mcp_get_code":{"code_sha256":"b1ad8495ae416cec"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/StyleNAT","path":"dataset/dataset.py","file_url":"https://github.com/SHI-Labs/StyleNAT/blob/HEAD/dataset/dataset.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":"43108d105300b7f5","code_sha256_prefix":"43108d105300b7f5","mcp_get_code":{"code_sha256":"43108d105300b7f5"}},{"arxiv_id":"2302.07253","arxiv_id_is_arxiv":true,"paper":"/paper/energy-transformer","title":"Energy Transformer","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lemon-cmd/energy-transformer-torch","path":"image_et/utils.py","file_url":"https://github.com/Lemon-cmd/energy-transformer-torch/blob/HEAD/image_et/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":"d62e6f8bc4ddac46","code_sha256_prefix":"d62e6f8bc4ddac46","mcp_get_code":{"code_sha256":"d62e6f8bc4ddac46"}},{"arxiv_id":"2203.11018","arxiv_id_is_arxiv":true,"paper":"/paper/stereo-neural-vernier-caliper","title":"Stereo Neural Vernier Caliper","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nicholasli1995/SNVC","path":"snvc/models/vernier.py","file_url":"https://github.com/Nicholasli1995/SNVC/blob/HEAD/snvc/models/vernier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27710015939338e1","code_sha256_prefix":"27710015939338e1","mcp_get_code":{"code_sha256":"27710015939338e1"}},{"arxiv_id":"2110.14759","arxiv_id_is_arxiv":true,"paper":"/paper/regularized-frank-wolfe-for-dense-crfs","title":"Regularized Frank-Wolfe for Dense CRFs: Generalizing Mean Field and Beyond","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"netw0rkf10w/crf","path":"src/CRF/CRF.py","file_url":"https://github.com/netw0rkf10w/crf/blob/HEAD/src/CRF/CRF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"635254ae1186a96b","code_sha256_prefix":"635254ae1186a96b","mcp_get_code":{"code_sha256":"635254ae1186a96b"}},{"arxiv_id":"2109.07070","arxiv_id_is_arxiv":true,"paper":"/paper/inpainting-hydrodynamical-maps-with-deep","title":"Inpainting hydrodynamical maps with deep learning","date":null,"month_inferred_from_arxiv_id":"2021-09","title_source":"archive","repo":"fgmohammad/inpainting","path":"image_utils.py","file_url":"https://github.com/fgmohammad/inpainting/blob/HEAD/image_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c55b4fc41b0d513e","code_sha256_prefix":"c55b4fc41b0d513e","mcp_get_code":{"code_sha256":"c55b4fc41b0d513e"}},{"arxiv_id":"1908.03369","arxiv_id_is_arxiv":true,"paper":"/paper/februus-input-purification-defense-against","title":"Februus: Input Purification Defense Against Trojan Attacks on Deep Neural Network Systems","date":null,"month_inferred_from_arxiv_id":"2019-08","title_source":"archive","repo":"AdelaideAuto-IDLab/Februus","path":"scene/Februus.py","file_url":"https://github.com/AdelaideAuto-IDLab/Februus/blob/HEAD/scene/Februus.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, AdelaideAuto-IDLab/Februus when it was checked","code_sha256":"1bbb71888e20120c","code_sha256_prefix":"1bbb71888e20120c","mcp_get_code":{"code_sha256":"1bbb71888e20120c"}},{"arxiv_id":"1906.05856","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-photoshopped-faces-by-scripting","title":"Detecting Photoshopped Faces by Scripting Photoshop","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterWang512/FALdetector","path":"utils/visualize.py","file_url":"https://github.com/PeterWang512/FALdetector/blob/HEAD/utils/visualize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from yzy-stack/effort-aigi-detection, and GitHub detected no licence in that repository when it was checked","code_sha256":"7742460f647f9ca2","code_sha256_prefix":"7742460f647f9ca2","mcp_get_code":{"code_sha256":"7742460f647f9ca2"}},{"arxiv_id":"1904.06487","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-domain-adaptation-via-minimax","title":"Semi-supervised Domain Adaptation via Minimax Entropy","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrasannaPulakurthi/SPM","path":"usefull_files/visualize_augmentations.py","file_url":"https://github.com/PrasannaPulakurthi/SPM/blob/HEAD/usefull_files/visualize_augmentations.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":"a3bebec7cc18aaa8","code_sha256_prefix":"a3bebec7cc18aaa8","mcp_get_code":{"code_sha256":"a3bebec7cc18aaa8"}}],"record_sha256":"9f7e1f3b461b6004c78fc546088e5a65d8baaf98393a3128438cfccf88522bd6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}