{"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/resnetblock-2","entry":"ResNetBlock","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":9,"n_samples_constructed":8,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":6,"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":0,"ran_fixture":0,"ran":9,"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":"2509.24868","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24868","title":"DRIFT-Net: A Spectral-Coupled Neural Operator for PDEs Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"camlab-ethz/poseidon","path":"scOT/model.py","file_url":"https://github.com/camlab-ethz/poseidon/blob/HEAD/scOT/model.py","status":"ran","verification_level":1,"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, camlab-ethz/poseidon when it was checked","code_sha256":"8628adef554d5f6c","code_sha256_prefix":"8628adef554d5f6c","mcp_get_code":{"code_sha256":"8628adef554d5f6c"}},{"arxiv_id":"2506.08902","arxiv_id_is_arxiv":true,"paper":"/paper/intention-conditioned-flow-occupancy-models","title":"Intention-Conditioned Flow Occupancy Models","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chongyi-zheng/infom","path":"agents/infom.py","file_url":"https://github.com/chongyi-zheng/infom/blob/HEAD/agents/infom.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":"e8d3d57d274492b3","code_sha256_prefix":"e8d3d57d274492b3","mcp_get_code":{"code_sha256":"e8d3d57d274492b3"}},{"arxiv_id":"2505.19618","arxiv_id_is_arxiv":true,"paper":"/paper/rotation-equivariant-self-supervised-method","title":"Rotation-Equivariant Self-Supervised Method in Image Denoising","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuhanze623/AdaReNet","path":"AdaReNet.py","file_url":"https://github.com/liuhanze623/AdaReNet/blob/HEAD/AdaReNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liuhanze623/AdaReNet when it was checked","code_sha256":"6d1052b7aa239206","code_sha256_prefix":"6d1052b7aa239206","mcp_get_code":{"code_sha256":"6d1052b7aa239206"}},{"arxiv_id":"2301.12962","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-imitation-learning-with-vector","title":"Hierarchical Imitation Learning with Vector Quantized Models","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kallekku/hips","path":"models/networks.py","file_url":"https://github.com/kallekku/hips/blob/HEAD/models/networks.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":"a141c32d4476cc7d","code_sha256_prefix":"a141c32d4476cc7d","mcp_get_code":{"code_sha256":"a141c32d4476cc7d"}},{"arxiv_id":"2209.02686","arxiv_id_is_arxiv":true,"paper":"/paper/unpaired-image-translation-via-vector","title":"Unpaired Image Translation via Vector Symbolic Architectures","date":"2022-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/vsait","path":"models/iit.py","file_url":"https://github.com/facebookresearch/vsait/blob/HEAD/models/iit.py","status":"ran","verification_level":1,"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, facebookresearch/vsait (NOASSERTION)","code_sha256":"422149eb93a361ad","code_sha256_prefix":"422149eb93a361ad","mcp_get_code":{"code_sha256":"422149eb93a361ad"}},{"arxiv_id":"2106.04927","arxiv_id_is_arxiv":true,"paper":"/paper/a-bi-level-framework-for-learning-to-solve","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinklab-sjtu/ppo-bihyb","path":"src/dag_ppo_bihyb_model.py","file_url":"https://github.com/thinklab-sjtu/ppo-bihyb/blob/HEAD/src/dag_ppo_bihyb_model.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, thinklab-sjtu/ppo-bihyb when it was checked","code_sha256":"5f86e9c08e9c8212","code_sha256_prefix":"5f86e9c08e9c8212","mcp_get_code":{"code_sha256":"5f86e9c08e9c8212"}},{"arxiv_id":"1606.06650","arxiv_id_is_arxiv":true,"paper":"/paper/3d-u-net-learning-dense-volumetric","title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","date":"2016-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wolny/pytorch-3dunet","path":"pytorch3dunet/unet3d/model.py","file_url":"https://github.com/wolny/pytorch-3dunet/blob/HEAD/pytorch3dunet/unet3d/model.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":"e2c1fc74b0aa7fc6","code_sha256_prefix":"e2c1fc74b0aa7fc6","mcp_get_code":{"code_sha256":"e2c1fc74b0aa7fc6"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstantinos-p/image_classification_SOTA","path":"testing/models/resnet_he.py","file_url":"https://github.com/konstantinos-p/image_classification_SOTA/blob/HEAD/testing/models/resnet_he.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, konstantinos-p/image_classification_SOTA when it was checked","code_sha256":"d768e6cf27d00182","code_sha256_prefix":"d768e6cf27d00182","mcp_get_code":{"code_sha256":"d768e6cf27d00182"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangHa0411/CIFAR100","path":"model.py","file_url":"https://github.com/sangHa0411/CIFAR100/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sangHa0411/CIFAR100 when it was checked","code_sha256":"e8a7f80725df93e0","code_sha256_prefix":"e8a7f80725df93e0","mcp_get_code":{"code_sha256":"e8a7f80725df93e0"}}],"record_sha256":"4242be9d2ab724988d0e41335585586d7621db17451ae11b47a95841b1464da3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}