{"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-head","entry":"get_head","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":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":2,"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":"2403.06227","arxiv_id_is_arxiv":true,"paper":"/paper/pepsi-pathology-enhanced-pulse-sequence","title":"PEPSI: Pathology-Enhanced Pulse-Sequence-Invariant Representations for Brain MRI","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peirong26/PEPSI","path":"PEPSI/models/head.py","file_url":"https://github.com/peirong26/PEPSI/blob/HEAD/PEPSI/models/head.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":"136b636aa89c201c","code_sha256_prefix":"136b636aa89c201c","mcp_get_code":{"code_sha256":"136b636aa89c201c"}},{"arxiv_id":"2311.16914","arxiv_id_is_arxiv":true,"paper":"/paper/brain-id-learning-robust-feature","title":"Brain-ID: Learning Contrast-agnostic Anatomical Representations for Brain Imaging","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peirong26/Brain-ID","path":"BrainID/models/head.py","file_url":"https://github.com/peirong26/Brain-ID/blob/HEAD/BrainID/models/head.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":"5b564986ff77b9e5","code_sha256_prefix":"5b564986ff77b9e5","mcp_get_code":{"code_sha256":"5b564986ff77b9e5"}},{"arxiv_id":"2303.09079","arxiv_id_is_arxiv":true,"paper":"/paper/ssl-cleanse-trojan-detection-and-mitigation","title":"SSL-Cleanse: Trojan Detection and Mitigation in Self-Supervised Learning","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucf-ml-research/ssl-cleanse","path":"detector/core/model.py","file_url":"https://github.com/ucf-ml-research/ssl-cleanse/blob/HEAD/detector/core/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 htdt/self-supervised, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d19f4f3143c2ccf","code_sha256_prefix":"2d19f4f3143c2ccf","mcp_get_code":{"code_sha256":"2d19f4f3143c2ccf"}},{"arxiv_id":"2204.11258","arxiv_id_is_arxiv":true,"paper":"/paper/rmgn-a-regional-mask-guided-network-for","title":"RMGN: A Regional Mask Guided Network for Parser-free Virtual Try-on","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jokerlc/RMGN-VITON","path":"models/rmgn_generator.py","file_url":"https://github.com/jokerlc/RMGN-VITON/blob/HEAD/models/rmgn_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jokerlc/RMGN-VITON when it was checked","code_sha256":"fba352cbdc0f36f0","code_sha256_prefix":"fba352cbdc0f36f0","mcp_get_code":{"code_sha256":"fba352cbdc0f36f0"}},{"arxiv_id":"2105.10123","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-on-self-supervised-learning","title":"Backdoor Attacks on Self-Supervised Learning","date":"2021-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UMBCvision/SSL-Backdoor","path":"byol/model.py","file_url":"https://github.com/UMBCvision/SSL-Backdoor/blob/HEAD/byol/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 htdt/self-supervised, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d19f4f3143c2ccf","code_sha256_prefix":"2d19f4f3143c2ccf","mcp_get_code":{"code_sha256":"2d19f4f3143c2ccf"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"htdt/self-supervised","path":"methods/byol.py","file_url":"https://github.com/htdt/self-supervised/blob/HEAD/methods/byol.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, htdt/self-supervised when it was checked","code_sha256":"2d19f4f3143c2ccf","code_sha256_prefix":"2d19f4f3143c2ccf","mcp_get_code":{"code_sha256":"2d19f4f3143c2ccf"}},{"arxiv_id":"aaai_26259","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26259","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"stxupengyu/LSFA","path":"transfer/collector.py","file_url":"https://github.com/stxupengyu/LSFA/blob/HEAD/transfer/collector.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":"879283f00eb9090a","code_sha256_prefix":"879283f00eb9090a","mcp_get_code":{"code_sha256":"879283f00eb9090a"}}],"record_sha256":"4c4b84ceec3175d7750c278fb3cb9e7381282066147ccb22f0969c6fc29acc8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}