{"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/read-list","entry":"read_list","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":10,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":14,"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":3,"ran_fixture":0,"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":"2411.01327","arxiv_id_is_arxiv":true,"paper":"/paper/visual-fourier-prompt-tuning","title":"Visual Fourier Prompt Tuning","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtsang/VFPT","path":"ls_h5_util.py","file_url":"https://github.com/runtsang/VFPT/blob/HEAD/ls_h5_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, runtsang/VFPT (NOASSERTION)","code_sha256":"0d11ac9cea6805a3","code_sha256_prefix":"0d11ac9cea6805a3","mcp_get_code":{"code_sha256":"0d11ac9cea6805a3"}},{"arxiv_id":"2411.00331","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-utility-evaluating-llm-as-recommender","title":"Beyond Utility: Evaluating LLM as Recommender","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangdeccc/evallmasrecommender","path":"eva/codes/llm_metrics.py","file_url":"https://github.com/jiangdeccc/evallmasrecommender/blob/HEAD/eva/codes/llm_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, jiangdeccc/evallmasrecommender when it was checked","code_sha256":"737e2e099da00419","code_sha256_prefix":"737e2e099da00419","mcp_get_code":{"code_sha256":"737e2e099da00419"}},{"arxiv_id":"2407.07805","arxiv_id_is_arxiv":true,"paper":"/paper/sumix-mixup-with-semantic-and-uncertain","title":"SUMix: Mixup with Semantic and Uncertain Information","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinxins/sumix","path":"openmixup/utils/loss_landscape_utils.py","file_url":"https://github.com/jinxins/sumix/blob/HEAD/openmixup/utils/loss_landscape_utils.py","status":"ran","verification_level":1,"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 runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0d11ac9cea6805a3","code_sha256_prefix":"0d11ac9cea6805a3","mcp_get_code":{"code_sha256":"0d11ac9cea6805a3"}},{"arxiv_id":"2403.19211","arxiv_id_is_arxiv":true,"paper":"/paper/dual-personalizing-adapter-for-federated","title":"Dual-Personalizing Adapter for Federated Foundation Models","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lydia-yang/FedDPA","path":"code/metric.py","file_url":"https://github.com/Lydia-yang/FedDPA/blob/HEAD/code/metric.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, Lydia-yang/FedDPA when it was checked","code_sha256":"764c287671e2023f","code_sha256_prefix":"764c287671e2023f","mcp_get_code":{"code_sha256":"764c287671e2023f"}},{"arxiv_id":"2308.05734","arxiv_id_is_arxiv":true,"paper":"/paper/audioldm-2-learning-holistic-audio-generation","title":"AudioLDM 2: Learning Holistic Audio Generation with Self-supervised Pretraining","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoheliu/AudioLDM2","path":"audioldm2/utils.py","file_url":"https://github.com/haoheliu/AudioLDM2/blob/HEAD/audioldm2/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, haoheliu/AudioLDM2 (NOASSERTION)","code_sha256":"b18f6b953126d4e6","code_sha256_prefix":"b18f6b953126d4e6","mcp_get_code":{"code_sha256":"b18f6b953126d4e6"}},{"arxiv_id":"2206.05050","arxiv_id_is_arxiv":true,"paper":"/paper/improved-approximation-for-fair-correlation","title":"Improved Approximation for Fair Correlation Clustering","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moonin12/improved_fair_correlation_clustering","path":"utils/configutil.py","file_url":"https://github.com/moonin12/improved_fair_correlation_clustering/blob/HEAD/utils/configutil.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":"838cefd5b43af5fa","code_sha256_prefix":"838cefd5b43af5fa","mcp_get_code":{"code_sha256":"838cefd5b43af5fa"}},{"arxiv_id":"2203.09283","arxiv_id_is_arxiv":true,"paper":"/paper/panoformer-panorama-transformer-for-indoor","title":"PanoFormer: Panorama Transformer for Indoor 360 Depth Estimation","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhijieshen-bjtu/panoformer","path":"PanoFormer/matterport3d.py","file_url":"https://github.com/zhijieshen-bjtu/panoformer/blob/HEAD/PanoFormer/matterport3d.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":"e94322673236e329","code_sha256_prefix":"e94322673236e329","mcp_get_code":{"code_sha256":"e94322673236e329"}},{"arxiv_id":"2202.02796","arxiv_id_is_arxiv":true,"paper":"/paper/glpanodepth-global-to-local-panoramic-depth","title":"GLPanoDepth: Global-to-Local Panoramic Depth Estimation","date":"2022-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeoDarcy/GLPanoDepth","path":"datasets/matterport3d.py","file_url":"https://github.com/LeoDarcy/GLPanoDepth/blob/HEAD/datasets/matterport3d.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":"e94322673236e329","code_sha256_prefix":"e94322673236e329","mcp_get_code":{"code_sha256":"e94322673236e329"}},{"arxiv_id":"2111.02585","arxiv_id_is_arxiv":true,"paper":"/paper/inqss-a-speech-intelligibility-assessment","title":"InQSS: a speech intelligibility and quality assessment model using a multi-task learning network","date":"2021-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuwchen/inqss","path":"InQSS-MOSNet/utils.py","file_url":"https://github.com/yuwchen/inqss/blob/HEAD/InQSS-MOSNet/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 rhoposit/MOS_Estimation2, and GitHub detected no licence in that repository when it was checked","code_sha256":"168ce4cafc9ca332","code_sha256_prefix":"168ce4cafc9ca332","mcp_get_code":{"code_sha256":"168ce4cafc9ca332"}},{"arxiv_id":"2009.10588","arxiv_id_is_arxiv":true,"paper":"/paper/anomalous-diffusion-dynamics-of-learning-in","title":"Anomalous diffusion dynamics of learning in deep neural networks","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifgovh/Anomalous-diffusion-dynamics-of-SGD","path":"get_gradient_weight/h5_util.py","file_url":"https://github.com/ifgovh/Anomalous-diffusion-dynamics-of-SGD/blob/HEAD/get_gradient_weight/h5_util.py","status":"ran","verification_level":1,"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 runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0d11ac9cea6805a3","code_sha256_prefix":"0d11ac9cea6805a3","mcp_get_code":{"code_sha256":"0d11ac9cea6805a3"}},{"arxiv_id":"1904.08352","arxiv_id_is_arxiv":true,"paper":"/paper/mosnet-deep-learning-based-objective","title":"MOSNet: Deep Learning based Objective Assessment for Voice Conversion","date":"2019-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhoposit/MOS_Estimation2","path":"utils.py","file_url":"https://github.com/rhoposit/MOS_Estimation2/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rhoposit/MOS_Estimation2 when it was checked","code_sha256":"168ce4cafc9ca332","code_sha256_prefix":"168ce4cafc9ca332","mcp_get_code":{"code_sha256":"168ce4cafc9ca332"}},{"arxiv_id":"1810.11580","arxiv_id_is_arxiv":true,"paper":"/paper/attacks-meet-interpretability-attribute","title":"Attacks Meet Interpretability: Attribute-steered Detection of Adversarial Samples","date":"2018-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AmIAttribute/AmI","path":"src/utils.py","file_url":"https://github.com/AmIAttribute/AmI/blob/HEAD/src/utils.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":"2f2e5dd17df89181","code_sha256_prefix":"2f2e5dd17df89181","mcp_get_code":{"code_sha256":"2f2e5dd17df89181"}},{"arxiv_id":"1511.02683","arxiv_id_is_arxiv":true,"paper":"/paper/a-light-cnn-for-deep-face-representation-with","title":"A Light CNN for Deep Face Representation with Noisy Labels","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlfredXiangWu/LightCNN","path":"extract_features.py","file_url":"https://github.com/AlfredXiangWu/LightCNN/blob/HEAD/extract_features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a6362e1eee5a452","code_sha256_prefix":"4a6362e1eee5a452","mcp_get_code":{"code_sha256":"4a6362e1eee5a452"}},{"arxiv_id":"ijcai2024_0527","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0527","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Ouzaixin/ResDM","path":"dataset.py","file_url":"https://github.com/Ouzaixin/ResDM/blob/HEAD/dataset.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":"362b0d89f74f0768","code_sha256_prefix":"362b0d89f74f0768","mcp_get_code":{"code_sha256":"362b0d89f74f0768"}}],"record_sha256":"5a72094f32969ad7e57254284f7cd1796a00889f1ac1e8843e775226fe117cc4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}