{"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/resume-checkpoint","entry":"resume_checkpoint","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":13,"n_papers_ran":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":7,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":7},"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.20559","paper":"/paper/arxiv-2606-20559","title":"UNIEGO: Proxies as Mediators for Unified Egocentric Video Representation Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Wenhao-Chi/UNIEGO","path":"timesformer/models/helpers.py","file_url":"https://github.com/Wenhao-Chi/UNIEGO/blob/HEAD/timesformer/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2407.04616","paper":"/paper/isomorphic-pruning-for-vision-models","title":"Isomorphic Pruning for Vision Models","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VainF/Isomorphic-Pruning","path":"convnext_train.py","file_url":"https://github.com/VainF/Isomorphic-Pruning/blob/HEAD/convnext_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9ff9b233192c1093","mcp_get_code":{"code_sha256":"9ff9b233192c1093"}},{"arxiv_id":"2407.03179","paper":"/paper/motion-meets-attention-video-motion-prompts","title":"Motion meets Attention: Video Motion Prompts","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"q1xiangchen/vmps","path":"timesformer/models/helpers.py","file_url":"https://github.com/q1xiangchen/vmps/blob/HEAD/timesformer/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2405.14106","paper":"/paper/nearly-tight-black-box-auditing-of","title":"Nearly Tight Black-Box Auditing of Differentially Private Machine Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spalabucr/bb-audit-dpsgd","path":"audit_model.py","file_url":"https://github.com/spalabucr/bb-audit-dpsgd/blob/HEAD/audit_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee3921b078050fcc","mcp_get_code":{"code_sha256":"ee3921b078050fcc"}},{"arxiv_id":"2311.04442","paper":"/paper/ss-mae-spatial-spectral-masked-auto-encoder","title":"SS-MAE: Spatial-Spectral Masked Auto-Encoder for Multi-Source Remote Sensing Image Classification","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"summitgao/ss-mae","path":"net/VIT/layers/helpers.py","file_url":"https://github.com/summitgao/ss-mae/blob/HEAD/net/VIT/layers/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2210.04135","paper":"/paper/volta-vision-language-transformer-with-weakly","title":"VoLTA: Vision-Language Transformer with Weakly-Supervised Local-Feature Alignment","date":"2022-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShramanPramanick/VoLTA","path":"Pre-training/swin_helpers.py","file_url":"https://github.com/ShramanPramanick/VoLTA/blob/HEAD/Pre-training/swin_helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2209.01788","paper":"/paper/lkd-net-large-kernel-convolution-network-for","title":"LKD-Net: Large Kernel Convolution Network for Single Image Dehazing","date":"2022-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swu-cs-medialab/lkd-net","path":"utils/utils.py","file_url":"https://github.com/swu-cs-medialab/lkd-net/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"013fc1af284ab106","mcp_get_code":{"code_sha256":"013fc1af284ab106"}},{"arxiv_id":"2206.03452","paper":"/paper/can-cnns-be-more-robust-than-transformers","title":"Can CNNs Be More Robust Than Transformers?","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-vlaa/robustcnn","path":"timm/models/helpers.py","file_url":"https://github.com/ucsc-vlaa/robustcnn/blob/HEAD/timm/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2203.14509","paper":"/paper/automated-progressive-learning-for-efficient","title":"Automated Progressive Learning for Efficient Training of Vision Transformers","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changlin31/autoprog","path":"prog/helpers.py","file_url":"https://github.com/changlin31/autoprog/blob/HEAD/prog/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fbde52072d8c3118","mcp_get_code":{"code_sha256":"fbde52072d8c3118"}},{"arxiv_id":"2203.10233","paper":"/paper/direcformer-a-directed-attention-in","title":"DirecFormer: A Directed Attention in Transformer Approach to Robust Action Recognition","date":"2022-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uark-cviu/direcformer","path":"slowfast/models/helpers.py","file_url":"https://github.com/uark-cviu/direcformer/blob/HEAD/slowfast/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2110.07641","paper":"/paper/non-deep-networks-1","title":"Non-deep Networks","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imankgoyal/NonDeepNetworks","path":"imagenet/timm/models/helpers.py","file_url":"https://github.com/imankgoyal/NonDeepNetworks/blob/HEAD/imagenet/timm/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2007.02924","paper":"/paper/int-an-inequality-benchmark-for-evaluating","title":"INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertqjiang/INT","path":"int_environment/algos/rl.py","file_url":"https://github.com/albertqjiang/INT/blob/HEAD/int_environment/algos/rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"720f82c493f038b5","mcp_get_code":{"code_sha256":"720f82c493f038b5"}},{"arxiv_id":"2004.09576","paper":"/paper/lsq-improving-low-bit-quantization-through","title":"LSQ+: Improving low-bit quantization through learnable offsets and better initialization","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yashbhalgat/QualcommAI-MicroNet-submission-MixNet","path":"lsq_quantizer/helpers.py","file_url":"https://github.com/yashbhalgat/QualcommAI-MicroNet-submission-MixNet/blob/HEAD/lsq_quantizer/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"e52c4d73ce21cdfa","mcp_get_code":{"code_sha256":"e52c4d73ce21cdfa"}}]}