{"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/get-padding-value","entry":"get_padding_value","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":7,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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/conv2d_same.py","file_url":"https://github.com/Wenhao-Chi/UNIEGO/blob/HEAD/timesformer/models/conv2d_same.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":"909f6252536bbcf0","code_sha256_prefix":"909f6252536bbcf0","mcp_get_code":{"code_sha256":"909f6252536bbcf0"}},{"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/conv2d_same.py","file_url":"https://github.com/q1xiangchen/vmps/blob/HEAD/timesformer/models/conv2d_same.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":"909f6252536bbcf0","code_sha256_prefix":"909f6252536bbcf0","mcp_get_code":{"code_sha256":"909f6252536bbcf0"}},{"arxiv_id":"2406.18321","arxiv_id_is_arxiv":true,"paper":"/paper/mathodyssey-benchmarking-mathematical-problem","title":"MathOdyssey: Benchmarking Mathematical Problem-Solving Skills in Large Language Models Using Odyssey Math Data","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pwc-1/Paper-8","path":"bit/modeling_bit.py","file_url":"https://github.com/pwc-1/Paper-8/blob/HEAD/bit/modeling_bit.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":"7f961453aefbb1d8","code_sha256_prefix":"7f961453aefbb1d8","mcp_get_code":{"code_sha256":"7f961453aefbb1d8"}},{"arxiv_id":"2206.00843","arxiv_id_is_arxiv":true,"paper":"/paper/depthshrinker-a-new-compression-paradigm","title":"DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networks","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/depthshrinker","path":"models/efficientnet_blocks.py","file_url":"https://github.com/facebookresearch/depthshrinker/blob/HEAD/models/efficientnet_blocks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, facebookresearch/depthshrinker (NOASSERTION)","code_sha256":"5993ba1d4c4de0b5","code_sha256_prefix":"5993ba1d4c4de0b5","mcp_get_code":{"code_sha256":"5993ba1d4c4de0b5"}},{"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/conv2d_same.py","file_url":"https://github.com/uark-cviu/direcformer/blob/HEAD/slowfast/models/conv2d_same.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":"909f6252536bbcf0","code_sha256_prefix":"909f6252536bbcf0","mcp_get_code":{"code_sha256":"909f6252536bbcf0"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/gen-efficientnet-pytorch","path":"geffnet/gen_efficientnet.py","file_url":"https://github.com/rwightman/gen-efficientnet-pytorch/blob/HEAD/geffnet/gen_efficientnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1596e1e96e6f4e55","code_sha256_prefix":"1596e1e96e6f4e55","mcp_get_code":{"code_sha256":"1596e1e96e6f4e55"}},{"arxiv_id":"1905.02244","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/genmobilenet-pytorch","path":"geffnet/conv2d_layers.py","file_url":"https://github.com/rwightman/genmobilenet-pytorch/blob/HEAD/geffnet/conv2d_layers.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":"a5c3c9ce1a8998c4","code_sha256_prefix":"a5c3c9ce1a8998c4","mcp_get_code":{"code_sha256":"a5c3c9ce1a8998c4"}}],"record_sha256":"debf7634974bda526bb29403448fea37c05f2c9612f18ab5fe4bb303c8d84675","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}