{"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/resnet-18","entry":"resnet_18","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":5,"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":1,"unverified":3},"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.21387","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-21387","title":"Do Sparse Subnetworks Exhibit Cognitively Aligned Attention? Effects of Pruning on Saliency Map Fidelity, Sparsity, and Concept Coherence","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"sanishsuwal7/Neurips-CogInterp","path":"code/resnet/resnet_18.py","file_url":"https://github.com/sanishsuwal7/Neurips-CogInterp/blob/HEAD/code/resnet/resnet_18.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, sanishsuwal7/Neurips-CogInterp when it was checked","code_sha256":"7b2e0837a82d2a45","code_sha256_prefix":"7b2e0837a82d2a45","mcp_get_code":{"code_sha256":"7b2e0837a82d2a45"}},{"arxiv_id":"2405.19654","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-the-power-of-spatial-and-temporal","title":"Unlocking the Power of Spatial and Temporal Information in Medical Multimodal Pre-training","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"svt-yang/medst","path":"medst/models/backbones/cnn_backbones.py","file_url":"https://github.com/svt-yang/medst/blob/HEAD/medst/models/backbones/cnn_backbones.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, svt-yang/medst when it was checked","code_sha256":"4fe94741be065e60","code_sha256_prefix":"4fe94741be065e60","mcp_get_code":{"code_sha256":"4fe94741be065e60"}},{"arxiv_id":"2312.10251","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-surgical-vqa-with-scene-graph","title":"Advancing Surgical VQA with Scene Graph Knowledge","date":"2023-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camma-public/ssg-qa","path":"models/resnets.py","file_url":"https://github.com/camma-public/ssg-qa/blob/HEAD/models/resnets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, camma-public/ssg-qa (NOASSERTION)","code_sha256":"9ac87a0b75aa2d0d","code_sha256_prefix":"9ac87a0b75aa2d0d","mcp_get_code":{"code_sha256":"9ac87a0b75aa2d0d"}},{"arxiv_id":"2312.01522","arxiv_id_is_arxiv":true,"paper":"/paper/g2d-from-global-to-dense-radiography","title":"G2D: From Global to Dense Radiography Representation Learning via Vision-Language Pre-training","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cheliu-computation/g2d-neurips24","path":"PRETRAIN/models/cnn_encoder.py","file_url":"https://github.com/cheliu-computation/g2d-neurips24/blob/HEAD/PRETRAIN/models/cnn_encoder.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, cheliu-computation/g2d-neurips24 when it was checked","code_sha256":"04b63bf6654c37bf","code_sha256_prefix":"04b63bf6654c37bf","mcp_get_code":{"code_sha256":"04b63bf6654c37bf"}},{"arxiv_id":"1910.08525","arxiv_id_is_arxiv":true,"paper":"/paper/scheduling-the-learning-rate-via-1","title":"MARTHE: Scheduling the Learning Rate Via Online Hypergradients","date":"2019-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/adatune","path":"adatune/network.py","file_url":"https://github.com/awslabs/adatune/blob/HEAD/adatune/network.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":"6edde11b8ad65d09","code_sha256_prefix":"6edde11b8ad65d09","mcp_get_code":{"code_sha256":"6edde11b8ad65d09"}}],"record_sha256":"f7f64ddf45d9d1bfe957633c595c34af82f4c8273137b9ce29cb4c69a849c574","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}