{"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-shapes","entry":"get_shapes","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":6,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":4,"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":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":"2410.04492","arxiv_id_is_arxiv":true,"paper":"/paper/interpret-your-decision-logical-reasoning","title":"Interpret Your Decision: Logical Reasoning Regularization for Generalization in Visual Classification","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaorui-tan/L-Reg_NeurIPS24","path":"mDG_and_mDG+GCD_with_L-Reg/domainbed/algorithms/miro.py","file_url":"https://github.com/zhaorui-tan/L-Reg_NeurIPS24/blob/HEAD/mDG_and_mDG%2BGCD_with_L-Reg/domainbed/algorithms/miro.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, zhaorui-tan/L-Reg_NeurIPS24 when it was checked","code_sha256":"c5919b96db289dbd","code_sha256_prefix":"c5919b96db289dbd","mcp_get_code":{"code_sha256":"c5919b96db289dbd"}},{"arxiv_id":"2407.15085","arxiv_id_is_arxiv":true,"paper":"/paper/learn-to-preserve-and-diversify-parameter","title":"Learn to Preserve and Diversify: Parameter-Efficient Group with Orthogonal Regularization for Domain Generalization","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JudgingH/PEGO","path":"domainbed/algorithms/miro.py","file_url":"https://github.com/JudgingH/PEGO/blob/HEAD/domainbed/algorithms/miro.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 zhaorui-tan/L-Reg_NeurIPS24, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5919b96db289dbd","code_sha256_prefix":"c5919b96db289dbd","mcp_get_code":{"code_sha256":"c5919b96db289dbd"}},{"arxiv_id":"2310.08255","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/VL2V-ADiP","path":"domainbed/algorithms/miro.py","file_url":"https://github.com/val-iisc/VL2V-ADiP/blob/HEAD/domainbed/algorithms/miro.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 zhaorui-tan/L-Reg_NeurIPS24, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5919b96db289dbd","code_sha256_prefix":"c5919b96db289dbd","mcp_get_code":{"code_sha256":"c5919b96db289dbd"}},{"arxiv_id":"2304.01973","arxiv_id_is_arxiv":true,"paper":"/paper/erm-an-improved-baseline-for-domain","title":"ERM++: An Improved Baseline for Domain Generalization","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piotr-teterwak/erm_plusplus","path":"models/miro_nets.py","file_url":"https://github.com/piotr-teterwak/erm_plusplus/blob/HEAD/models/miro_nets.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":"697849eb0b34a6ca","code_sha256_prefix":"697849eb0b34a6ca","mcp_get_code":{"code_sha256":"697849eb0b34a6ca"}},{"arxiv_id":"2302.14685","arxiv_id_is_arxiv":true,"paper":"/paper/dart-diversify-aggregate-repeat-training","title":"DART: Diversify-Aggregate-Repeat Training Improves Generalization of Neural Networks","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/DART","path":"domainbed/algorithms/miro.py","file_url":"https://github.com/val-iisc/DART/blob/HEAD/domainbed/algorithms/miro.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 zhaorui-tan/L-Reg_NeurIPS24, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5919b96db289dbd","code_sha256_prefix":"c5919b96db289dbd","mcp_get_code":{"code_sha256":"c5919b96db289dbd"}},{"arxiv_id":"2203.10789","arxiv_id_is_arxiv":true,"paper":"/paper/domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/miro","path":"domainbed/algorithms/miro.py","file_url":"https://github.com/kakaobrain/miro/blob/HEAD/domainbed/algorithms/miro.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 zhaorui-tan/L-Reg_NeurIPS24, and GitHub detected no licence in that repository when it was checked","code_sha256":"c5919b96db289dbd","code_sha256_prefix":"c5919b96db289dbd","mcp_get_code":{"code_sha256":"c5919b96db289dbd"}},{"arxiv_id":"2003.01995","arxiv_id_is_arxiv":true,"paper":"/paper/a-learning-strategy-for-contrast-agnostic-mri","title":"A Learning Strategy for Contrast-agnostic MRI Segmentation","date":"2020-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BBillot/lab2im","path":"lab2im/lab2im_model.py","file_url":"https://github.com/BBillot/lab2im/blob/HEAD/lab2im/lab2im_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":"f5072ba28ff3b675","code_sha256_prefix":"f5072ba28ff3b675","mcp_get_code":{"code_sha256":"f5072ba28ff3b675"}}],"record_sha256":"cb8a39a21cc579d576b4c877295a49806f28f99171b18a3e85cd1a15e57fa500","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}