{"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/resume-checkpoint","entry":"resume_checkpoint","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":13,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":10,"n_places_pointer_only_link_open":4,"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":3,"unverified":4},"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":"2606.20559","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Wenhao-Chi/UNIEGO (NOASSERTION)","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2407.04616","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VainF/Isomorphic-Pruning when it was checked","code_sha256":"9ff9b233192c1093","code_sha256_prefix":"9ff9b233192c1093","mcp_get_code":{"code_sha256":"9ff9b233192c1093"}},{"arxiv_id":"2407.03179","arxiv_id_is_arxiv":true,"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":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 Wenhao-Chi/UNIEGO, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2405.14106","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, spalabucr/bb-audit-dpsgd when it was checked","code_sha256":"ee3921b078050fcc","code_sha256_prefix":"ee3921b078050fcc","mcp_get_code":{"code_sha256":"ee3921b078050fcc"}},{"arxiv_id":"2311.04442","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, summitgao/ss-mae when it was checked","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2210.04135","arxiv_id_is_arxiv":true,"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":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 Wenhao-Chi/UNIEGO, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2209.01788","arxiv_id_is_arxiv":true,"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":"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":"013fc1af284ab106","code_sha256_prefix":"013fc1af284ab106","mcp_get_code":{"code_sha256":"013fc1af284ab106"}},{"arxiv_id":"2206.03452","arxiv_id_is_arxiv":true,"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":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 Wenhao-Chi/UNIEGO, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2203.14509","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbde52072d8c3118","code_sha256_prefix":"fbde52072d8c3118","mcp_get_code":{"code_sha256":"fbde52072d8c3118"}},{"arxiv_id":"2203.10233","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, uark-cviu/direcformer, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2110.07641","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from Wenhao-Chi/UNIEGO, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"102b75f3481035d1","code_sha256_prefix":"102b75f3481035d1","mcp_get_code":{"code_sha256":"102b75f3481035d1"}},{"arxiv_id":"2007.02924","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720f82c493f038b5","code_sha256_prefix":"720f82c493f038b5","mcp_get_code":{"code_sha256":"720f82c493f038b5"}},{"arxiv_id":"2004.09576","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yashbhalgat/QualcommAI-MicroNet-submission-MixNet, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e52c4d73ce21cdfa","code_sha256_prefix":"e52c4d73ce21cdfa","mcp_get_code":{"code_sha256":"e52c4d73ce21cdfa"}}],"record_sha256":"ba120331a11d6af7a1881922e677b2503ada5a2def9553aea3f63865fc8a0aa2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}