{"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","entry":"resume","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":9,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"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":"2608.12086","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12086","title":"Look What the Probes Dragged In! Real-World Chest X-ray Shortcuts in MedCLIP","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"nikodice4/MedCLIP_shortcuts","path":"src/models/checkpointing.py","file_url":"https://github.com/nikodice4/MedCLIP_shortcuts/blob/HEAD/src/models/checkpointing.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed88e3afe0a0eb37","code_sha256_prefix":"ed88e3afe0a0eb37","mcp_get_code":{"code_sha256":"ed88e3afe0a0eb37"}},{"arxiv_id":"2308.10603","arxiv_id_is_arxiv":true,"paper":"/paper/a-step-towards-understanding-why","title":"A step towards understanding why classification helps regression","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silvialaurapintea/reg-cls","path":"1d/train_eval.py","file_url":"https://github.com/silvialaurapintea/reg-cls/blob/HEAD/1d/train_eval.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, silvialaurapintea/reg-cls when it was checked","code_sha256":"9d857dee26c989e2","code_sha256_prefix":"9d857dee26c989e2","mcp_get_code":{"code_sha256":"9d857dee26c989e2"}},{"arxiv_id":"2308.05095","arxiv_id_is_arxiv":true,"paper":"/paper/layoutllm-t2i-eliciting-layout-guidance-from","title":"LayoutLLM-T2I: Eliciting Layout Guidance from LLM for Text-to-Image Generation","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layoutllm-t2i/layoutllm-t2i","path":"train_rl.py","file_url":"https://github.com/layoutllm-t2i/layoutllm-t2i/blob/HEAD/train_rl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, layoutllm-t2i/layoutllm-t2i when it was checked","code_sha256":"6ffddab9b4a35318","code_sha256_prefix":"6ffddab9b4a35318","mcp_get_code":{"code_sha256":"6ffddab9b4a35318"}},{"arxiv_id":"2308.02097","arxiv_id_is_arxiv":true,"paper":"/paper/multi-interactive-feature-learning-and-a-full","title":"Multi-interactive Feature Learning and a Full-time Multi-modality Benchmark for Image Fusion and Segmentation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runjia0124/coconet","path":"utils/checkpoint.py","file_url":"https://github.com/runjia0124/coconet/blob/HEAD/utils/checkpoint.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":"a3db2d0cc62c57ce","code_sha256_prefix":"a3db2d0cc62c57ce","mcp_get_code":{"code_sha256":"a3db2d0cc62c57ce"}},{"arxiv_id":"2304.03420","arxiv_id_is_arxiv":true,"paper":"/paper/toward-unsupervised-3d-point-cloud-anomaly","title":"Toward Unsupervised 3D Point Cloud Anomaly Detection using Variational Autoencoder","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llien30/point_cloud_anomaly_detection","path":"libs/checkpoint.py","file_url":"https://github.com/llien30/point_cloud_anomaly_detection/blob/HEAD/libs/checkpoint.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":"9c220e3432a84bfa","code_sha256_prefix":"9c220e3432a84bfa","mcp_get_code":{"code_sha256":"9c220e3432a84bfa"}},{"arxiv_id":"2203.15867","arxiv_id_is_arxiv":true,"paper":"/paper/image-retrieval-from-contextual-descriptions-1","title":"Image Retrieval from Contextual Descriptions","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcgill-nlp/imagecode","path":"baselines/crossencoders/volta/train_utils.py","file_url":"https://github.com/mcgill-nlp/imagecode/blob/HEAD/baselines/crossencoders/volta/train_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"64fe66e56c74b1f6","code_sha256_prefix":"64fe66e56c74b1f6","mcp_get_code":{"code_sha256":"64fe66e56c74b1f6"}},{"arxiv_id":"2201.11732","arxiv_id_is_arxiv":true,"paper":"/paper/iglue-a-benchmark-for-transfer-learning","title":"IGLUE: A Benchmark for Transfer Learning across Modalities, Tasks, and Languages","date":"2022-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"e-bug/volta","path":"volta/train_utils.py","file_url":"https://github.com/e-bug/volta/blob/HEAD/volta/train_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"64fe66e56c74b1f6","code_sha256_prefix":"64fe66e56c74b1f6","mcp_get_code":{"code_sha256":"64fe66e56c74b1f6"}},{"arxiv_id":"2103.05152","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-evolution-in-neural-networks","title":"Knowledge Evolution in Neural Networks","date":"2021-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmdtaha/knowledge_evolution","path":"KE_model.py","file_url":"https://github.com/ahmdtaha/knowledge_evolution/blob/HEAD/KE_model.py","status":"unverified","verification_level":0,"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":"a2c2a12b95bad563","code_sha256_prefix":"a2c2a12b95bad563","mcp_get_code":{"code_sha256":"a2c2a12b95bad563"}},{"arxiv_id":"2007.06866","arxiv_id_is_arxiv":true,"paper":"/paper/alleviating-over-segmentation-errors-by","title":"Alleviating Over-segmentation Errors by Detecting Action Boundaries","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiskw713/asrf","path":"libs/checkpoint.py","file_url":"https://github.com/yiskw713/asrf/blob/HEAD/libs/checkpoint.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":"f2001c39f931d663","code_sha256_prefix":"f2001c39f931d663","mcp_get_code":{"code_sha256":"f2001c39f931d663"}}],"record_sha256":"4f547190aec2d1e16b43681cbfdf4a79dfc8c6509e5c90171829b24c26b1f81d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}