{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/vgg","entry":"VGG","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":16,"n_papers_ran":13,"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":16,"n_samples_ran":13,"n_samples_fingerprinted":3,"n_places":16,"n_places_pointer_only":9,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":13,"unverified":3},"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":"2605.25616","paper":"/paper/arxiv-2605-25616","title":"Courtroom Analogy: New Perspective on Uncertainty-Aware Classification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TaeseongYoon/MoDEX","path":"models.py","file_url":"https://github.com/TaeseongYoon/MoDEX/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be8aeb203dda4f40","mcp_get_code":{"code_sha256":"be8aeb203dda4f40"}},{"arxiv_id":"2510.18322","paper":"/paper/arxiv-2510-18322","title":"Uncertainty Estimation by Flexible Evidential Deep Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"TaeseongYoon/F-EDL","path":"models.py","file_url":"https://github.com/TaeseongYoon/F-EDL/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"07c98d7749f70403","mcp_get_code":{"code_sha256":"07c98d7749f70403"}},{"arxiv_id":"2506.11436","paper":"/paper/tavis-text-bridged-audio-visual-segmentation","title":"TAViS: Text-bridged Audio-Visual Segmentation with Foundation Models","date":"2025-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sssssuperior/TAViS","path":"models/sam_avs.py","file_url":"https://github.com/Sssssuperior/TAViS/blob/HEAD/models/sam_avs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eabd6c2f33339219","mcp_get_code":{"code_sha256":"eabd6c2f33339219"}},{"arxiv_id":"2406.18561","paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"974aaf074ac83fb5","mcp_get_code":{"code_sha256":"974aaf074ac83fb5"}},{"arxiv_id":"2402.18192","paper":"/paper/misalignment-robust-frequency-distribution","title":"Misalignment-Robust Frequency Distribution Loss for Image Transformation","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eezkni/fdl","path":"FDL_pytorch/FDL.py","file_url":"https://github.com/eezkni/fdl/blob/HEAD/FDL_pytorch/FDL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eb7d7254bc5ad5c8","mcp_get_code":{"code_sha256":"eb7d7254bc5ad5c8"}},{"arxiv_id":"2402.17726","paper":"/paper/vrp-sam-sam-with-visual-reference-prompt","title":"VRP-SAM: SAM with Visual Reference Prompt","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syp2ysy/VRP-SAM","path":"model/VRP_encoder.py","file_url":"https://github.com/syp2ysy/VRP-SAM/blob/HEAD/model/VRP_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"125a7d0d81f132b1","mcp_get_code":{"code_sha256":"125a7d0d81f132b1"}},{"arxiv_id":"2310.00093","paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab31aadcda7a9603","mcp_get_code":{"code_sha256":"ab31aadcda7a9603"}},{"arxiv_id":"2304.01230","paper":"/paper/seenn-towards-temporal-spiking-early-exit","title":"SEENN: Towards Temporal Spiking Early-Exit Neural Networks","date":"2023-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/seenn","path":"models/spike_vgg.py","file_url":"https://github.com/intelligent-computing-lab-yale/seenn/blob/HEAD/models/spike_vgg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee72452d2473193e","mcp_get_code":{"code_sha256":"ee72452d2473193e"}},{"arxiv_id":"2303.15166","paper":"/paper/towards-artistic-image-aesthetics-assessment","title":"Towards Artistic Image Aesthetics Assessment: a Large-scale Dataset and a New Method","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreemurr-t/baid","path":"models/model.py","file_url":"https://github.com/dreemurr-t/baid/blob/HEAD/models/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c5b590d94abe8a6","mcp_get_code":{"code_sha256":"0c5b590d94abe8a6"}},{"arxiv_id":"2206.12680","paper":"/paper/topology-aware-generalization-of","title":"Topology-aware Generalization of Decentralized SGD","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/generalization-of-dsgd","path":"gpu_work.py","file_url":"https://github.com/raiden-zhu/generalization-of-dsgd/blob/HEAD/gpu_work.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"215fe918cf02296c","mcp_get_code":{"code_sha256":"215fe918cf02296c"}},{"arxiv_id":"2205.11506","paper":"/paper/orchestra-unsupervised-federated-learning-via","title":"Orchestra: Unsupervised Federated Learning via Globally Consistent Clustering","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilmathurs/orchestra","path":"models.py","file_url":"https://github.com/akhilmathurs/orchestra/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"47ebea3263c682f2","mcp_get_code":{"code_sha256":"47ebea3263c682f2"}},{"arxiv_id":"2204.09903","paper":"/paper/beyond-the-prototype-divide-and-conquer","title":"Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chunbolang/DCP","path":"model/DCP.py","file_url":"https://github.com/chunbolang/DCP/blob/HEAD/model/DCP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7aefeb45456c2c53","mcp_get_code":{"code_sha256":"7aefeb45456c2c53"}},{"arxiv_id":"2203.01531","paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bd08e0189b116b5","mcp_get_code":{"code_sha256":"1bd08e0189b116b5"}},{"arxiv_id":"2106.06916","paper":"/paper/non-transferable-learning-a-new-approach-for","title":"Non-Transferable Learning: A New Approach for Model Ownership Verification and Applicability Authorization","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conditionWang/NTL","path":"src/ntl/ntl_cifar_stl.py","file_url":"https://github.com/conditionWang/NTL/blob/HEAD/src/ntl/ntl_cifar_stl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb0795675cba05a5","mcp_get_code":{"code_sha256":"bb0795675cba05a5"}},{"arxiv_id":"2103.17185","paper":"/paper/rethinking-style-transfer-from-pixels-to","title":"Rethinking Style Transfer: From Pixels to Parameterized Brushstrokes","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompVis/brushstroke-parameterized-style-transfer","path":"model.py","file_url":"https://github.com/CompVis/brushstroke-parameterized-style-transfer/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f0ac111ae4ae336","mcp_get_code":{"code_sha256":"6f0ac111ae4ae336"}},{"arxiv_id":"2006.00719","paper":"/paper/adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","date":"2020-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirgholami/adahessian","path":"adahessian_tf/Models/VGGs.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/VGGs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dedf33bd0adc1f56","mcp_get_code":{"code_sha256":"dedf33bd0adc1f56"}}]}