{"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/conv2dsame","entry":"Conv2dSame","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":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":1,"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":"2503.13026","arxiv_id_is_arxiv":true,"paper":"/paper/himtok-learning-hierarchical-mask-tokens-for","title":"HiMTok: Learning Hierarchical Mask Tokens for Image Segmentation with Large Multimodal Model","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yayafengzi/LMM-HiMTok","path":"himt/himt.py","file_url":"https://github.com/yayafengzi/LMM-HiMTok/blob/HEAD/himt/himt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10cffbe1e3498007","code_sha256_prefix":"10cffbe1e3498007","mcp_get_code":{"code_sha256":"10cffbe1e3498007"}},{"arxiv_id":"2503.10772","arxiv_id_is_arxiv":true,"paper":"/paper/flowtok-flowing-seamlessly-across-text-and","title":"FlowTok: Flowing Seamlessly Across Text and Image Tokens","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/1d-tokenizer","path":"modeling/titok.py","file_url":"https://github.com/bytedance/1d-tokenizer/blob/HEAD/modeling/titok.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c740c7fb2d9eb1a","code_sha256_prefix":"9c740c7fb2d9eb1a","mcp_get_code":{"code_sha256":"9c740c7fb2d9eb1a"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"5ce1979636036635","code_sha256_prefix":"5ce1979636036635","mcp_get_code":{"code_sha256":"5ce1979636036635"}},{"arxiv_id":"2201.12096","arxiv_id_is_arxiv":true,"paper":"/paper/mask-based-latent-reconstruction-for","title":"Mask-based Latent Reconstruction for Reinforcement Learning","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Playvirtual","path":"Atari/src/models.py","file_url":"https://github.com/microsoft/Playvirtual/blob/HEAD/Atari/src/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a03dfc44c34334","code_sha256_prefix":"f7a03dfc44c34334","mcp_get_code":{"code_sha256":"f7a03dfc44c34334"}},{"arxiv_id":"2006.00414","arxiv_id_is_arxiv":true,"paper":"/paper/dc-unet-rethinking-the-u-net-architecture","title":"DC-UNet: Rethinking the U-Net Architecture with Dual Channel Efficient CNN for Medical Images Segmentation","date":"2020-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AngeLouCN/DC-UNet","path":"dc_unet-pytorch/DC_UNet.py","file_url":"https://github.com/AngeLouCN/DC-UNet/blob/HEAD/dc_unet-pytorch/DC_UNet.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, AngeLouCN/DC-UNet when it was checked","code_sha256":"a1a28bcf37ebfb1e","code_sha256_prefix":"a1a28bcf37ebfb1e","mcp_get_code":{"code_sha256":"a1a28bcf37ebfb1e"}},{"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":"isaachaw/GrabCarRecognition","path":"efficientnet/model.py","file_url":"https://github.com/isaachaw/GrabCarRecognition/blob/HEAD/efficientnet/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, isaachaw/GrabCarRecognition, is not in the permissive set Syntology serves inline","code_sha256":"06323037fec4c414","code_sha256_prefix":"06323037fec4c414","mcp_get_code":{"code_sha256":"06323037fec4c414"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8897f71021f4c878","code_sha256_prefix":"8897f71021f4c878","mcp_get_code":{"code_sha256":"8897f71021f4c878"}},{"arxiv_id":"Sun_EntropyMark_Towards_More_Harmless_Backdoor_Watermark_via_Entropy-based_Constraint_for_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_EntropyMark_Towards_More_Harmless_Backdoor_Watermark_via_Entropy-based_Constraint_for_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AaronSun2000/EntropyMark","path":"SSBW.py","file_url":"https://github.com/AaronSun2000/EntropyMark/blob/HEAD/SSBW.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AaronSun2000/EntropyMark when it was checked","code_sha256":"97b5722f67ccdd28","code_sha256_prefix":"97b5722f67ccdd28","mcp_get_code":{"code_sha256":"97b5722f67ccdd28"}}],"record_sha256":"cc2b674889fce667fccc0620631e9047b1404bcfa034f8b5e0b44354823c2711","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}