{"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/dct1","entry":"dct1","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":12,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":6,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":0,"unverified":6},"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.04791","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04791","title":"Measurement-Consistent Langevin Corrector for Stabilizing Latent Diffusion Inverse Problem Solvers","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"FlowDPS-Inverse/FlowDPS","path":"functions/jpeg.py","file_url":"https://github.com/FlowDPS-Inverse/FlowDPS/blob/HEAD/functions/jpeg.py","status":"unverified","verification_level":0,"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, FlowDPS-Inverse/FlowDPS when it was checked","code_sha256":"9e1d374e9bf8e1fa","code_sha256_prefix":"9e1d374e9bf8e1fa","mcp_get_code":{"code_sha256":"9e1d374e9bf8e1fa"}},{"arxiv_id":"2412.07277","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-against-no-reference-image","title":"Backdoor Attacks against No-Reference Image Quality Assessment Models via a Scalable Trigger","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyi-sd/baiqa","path":"network.py","file_url":"https://github.com/yuyi-sd/baiqa/blob/HEAD/network.py","status":"unverified","verification_level":0,"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, yuyi-sd/baiqa when it was checked","code_sha256":"c3f2ecb9e39faba4","code_sha256_prefix":"c3f2ecb9e39faba4","mcp_get_code":{"code_sha256":"c3f2ecb9e39faba4"}},{"arxiv_id":"2406.12814","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenWu98/agent-attack","path":"agent_attack/attacks/clip_attack.py","file_url":"https://github.com/ChenWu98/agent-attack/blob/HEAD/agent_attack/attacks/clip_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 gq-max/advdiffvlm, and GitHub detected no licence in that repository when it was checked","code_sha256":"997a65deb3a03f4b","code_sha256_prefix":"997a65deb3a03f4b","mcp_get_code":{"code_sha256":"997a65deb3a03f4b"}},{"arxiv_id":"2406.05531","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-adversarial-transferability-via","title":"Enhancing Adversarial Transferability via Information Bottleneck Constraints","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints","path":"dct.py","file_url":"https://github.com/biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints/blob/HEAD/dct.py","status":"unverified","verification_level":0,"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, biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints when it was checked","code_sha256":"997a65deb3a03f4b","code_sha256_prefix":"997a65deb3a03f4b","mcp_get_code":{"code_sha256":"997a65deb3a03f4b"}},{"arxiv_id":"2405.13888","arxiv_id_is_arxiv":true,"paper":"/paper/marrying-causal-representation-learning-with","title":"Marrying Causal Representation Learning with Dynamical Systems for Science","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CausalLearningAI/crl-dynamical-systems","path":"marrying/src/utils/dct.py","file_url":"https://github.com/CausalLearningAI/crl-dynamical-systems/blob/HEAD/marrying/src/utils/dct.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":"3b453ed72ac4623c","code_sha256_prefix":"3b453ed72ac4623c","mcp_get_code":{"code_sha256":"3b453ed72ac4623c"}},{"arxiv_id":"2404.10335","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-adversarial-examples-generation","title":"Efficient Generation of Targeted and Transferable Adversarial Examples for Vision-Language Models Via Diffusion Models","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gq-max/advdiffvlm","path":"ldm/models/diffusion/ddim_main.py","file_url":"https://github.com/gq-max/advdiffvlm/blob/HEAD/ldm/models/diffusion/ddim_main.py","status":"unverified","verification_level":0,"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, gq-max/advdiffvlm when it was checked","code_sha256":"997a65deb3a03f4b","code_sha256_prefix":"997a65deb3a03f4b","mcp_get_code":{"code_sha256":"997a65deb3a03f4b"}},{"arxiv_id":"2404.08255","arxiv_id_is_arxiv":true,"paper":"/paper/practical-region-level-attack-against-segment","title":"Practical Region-level Attack against Segment Anything Models","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenYifanS/S-RA_T-RA","path":"SSAscripts/ssa.py","file_url":"https://github.com/ShenYifanS/S-RA_T-RA/blob/HEAD/SSAscripts/ssa.py","status":"unverified","verification_level":0,"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, ShenYifanS/S-RA_T-RA when it was checked","code_sha256":"997a65deb3a03f4b","code_sha256_prefix":"997a65deb3a03f4b","mcp_get_code":{"code_sha256":"997a65deb3a03f4b"}},{"arxiv_id":"2308.08463","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-distill-global-representation-for","title":"Learning to Distill Global Representation for Sparse-View CT","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longzilicart/GloReDi","path":"src/Basic_Freq_Module/torch_dct.py","file_url":"https://github.com/longzilicart/GloReDi/blob/HEAD/src/Basic_Freq_Module/torch_dct.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 yuyi-sd/baiqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"c3f2ecb9e39faba4","code_sha256_prefix":"c3f2ecb9e39faba4","mcp_get_code":{"code_sha256":"c3f2ecb9e39faba4"}},{"arxiv_id":"2306.12685","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-backward-propagation-for-1","title":"Rethinking the Backward Propagation for Adversarial Transferability","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Trustworthy-AI-Group/RPA","path":"dct.py","file_url":"https://github.com/Trustworthy-AI-Group/RPA/blob/HEAD/dct.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":"aeed5d1d9b114dfb","code_sha256_prefix":"aeed5d1d9b114dfb","mcp_get_code":{"code_sha256":"aeed5d1d9b114dfb"}},{"arxiv_id":"2209.11888","arxiv_id_is_arxiv":true,"paper":"/paper/jpeg-artifact-correction-using-denoising","title":"JPEG Artifact Correction using Denoising Diffusion Restoration Models","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bahjat-kawar/ddrm-jpeg","path":"functions/denoising.py","file_url":"https://github.com/bahjat-kawar/ddrm-jpeg/blob/HEAD/functions/denoising.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":"9e1d374e9bf8e1fa","code_sha256_prefix":"9e1d374e9bf8e1fa","mcp_get_code":{"code_sha256":"9e1d374e9bf8e1fa"}},{"arxiv_id":"2105.08997","arxiv_id_is_arxiv":true,"paper":"/paper/when-deep-classifiers-agree-analyzing","title":"When Deep Classifiers Agree: Analyzing Correlations between Learning Order and Image Statistics","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ccc-frankfurt/intrinsic_ordering_nn_training","path":"lib/helpers/dct.py","file_url":"https://github.com/ccc-frankfurt/intrinsic_ordering_nn_training/blob/HEAD/lib/helpers/dct.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 yuyi-sd/baiqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"c3f2ecb9e39faba4","code_sha256_prefix":"c3f2ecb9e39faba4","mcp_get_code":{"code_sha256":"c3f2ecb9e39faba4"}},{"arxiv_id":"2011.04823","arxiv_id_is_arxiv":true,"paper":"/paper/language-through-a-prism-a-spectral-approach","title":"Language Through a Prism: A Spectral Approach for Multiscale Language Representations","date":"2020-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zh217/torch-dct","path":"torch_dct/_dct.py","file_url":"https://github.com/zh217/torch-dct/blob/HEAD/torch_dct/_dct.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":"f3f999af44b26296","code_sha256_prefix":"f3f999af44b26296","mcp_get_code":{"code_sha256":"f3f999af44b26296"}}],"record_sha256":"4a27883b00dcc4da5d407329a100dcc1594144c72a6a416b027fdd0ca9d26261","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}