{"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/crop-and-resize","entry":"crop_and_resize","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":11,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":11,"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":0,"ran_fixture":0,"ran":4,"unverified":2},"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":"2604.04518","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04518","title":"Reproducibility study on how to find Spurious Correlations, Shortcut Learning, Clever Hans or Group-Distributional nonrobustness and how to fix them","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kohpangwei/group_DRO","path":"dataset_scripts/dataset_utils.py","file_url":"https://github.com/kohpangwei/group_DRO/blob/HEAD/dataset_scripts/dataset_utils.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":"e2f8b1a98dec9723","code_sha256_prefix":"e2f8b1a98dec9723","mcp_get_code":{"code_sha256":"e2f8b1a98dec9723"}},{"arxiv_id":"2510.02818","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02818","title":"Mitigating Spurious Correlation via Distributionally Robust Learning with Hierarchical Ambiguity Sets","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Sung-Ho-Jo/hierarchical-dro","path":"dataset_scripts/dataset_utils.py","file_url":"https://github.com/Sung-Ho-Jo/hierarchical-dro/blob/HEAD/dataset_scripts/dataset_utils.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, Sung-Ho-Jo/hierarchical-dro when it was checked","code_sha256":"e684423057c906e4","code_sha256_prefix":"e684423057c906e4","mcp_get_code":{"code_sha256":"e684423057c906e4"}},{"arxiv_id":"2505.06111","arxiv_id_is_arxiv":true,"paper":"/paper/univla-learning-to-act-anywhere-with-task","title":"UniVLA: Learning to Act Anywhere with Task-centric Latent Actions","date":"2025-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/univla","path":"experiments/robot/simpler-bridge/policies/univla/univla_model.py","file_url":"https://github.com/opendrivelab/univla/blob/HEAD/experiments/robot/simpler-bridge/policies/univla/univla_model.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":"d4883358a40b04e4","code_sha256_prefix":"d4883358a40b04e4","mcp_get_code":{"code_sha256":"d4883358a40b04e4"}},{"arxiv_id":"2406.09246","arxiv_id_is_arxiv":true,"paper":"/paper/openvla-an-open-source-vision-language-action","title":"OpenVLA: An Open-Source Vision-Language-Action Model","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openvla/openvla","path":"experiments/robot/openvla_utils.py","file_url":"https://github.com/openvla/openvla/blob/HEAD/experiments/robot/openvla_utils.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":"d4883358a40b04e4","code_sha256_prefix":"d4883358a40b04e4","mcp_get_code":{"code_sha256":"d4883358a40b04e4"}},{"arxiv_id":"2405.04715","arxiv_id_is_arxiv":true,"paper":"/paper/causality-pursuit-from-heterogeneous","title":"Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmyw96/fair","path":"dataset_utils.py","file_url":"https://github.com/wmyw96/fair/blob/HEAD/dataset_utils.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, wmyw96/fair when it was checked","code_sha256":"baa53c8c87dfebf5","code_sha256_prefix":"baa53c8c87dfebf5","mcp_get_code":{"code_sha256":"baa53c8c87dfebf5"}},{"arxiv_id":"2403.03375","arxiv_id_is_arxiv":true,"paper":"/paper/complexity-matters-dynamics-of-feature","title":"Complexity Matters: Dynamics of Feature Learning in the Presence of Spurious Correlations","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NayutaQiu/Boolean_Spurious","path":"src/dataset_utils.py","file_url":"https://github.com/NayutaQiu/Boolean_Spurious/blob/HEAD/src/dataset_utils.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, NayutaQiu/Boolean_Spurious when it was checked","code_sha256":"e2f8b1a98dec9723","code_sha256_prefix":"e2f8b1a98dec9723","mcp_get_code":{"code_sha256":"e2f8b1a98dec9723"}},{"arxiv_id":"2310.06161","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-simplicity-bias-in-deep-learning","title":"Mitigating Simplicity Bias in Deep Learning for Improved OOD Generalization and Robustness","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"estija/cmid","path":"dataset_scripts/dataset_utils.py","file_url":"https://github.com/estija/cmid/blob/HEAD/dataset_scripts/dataset_utils.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":"e2f8b1a98dec9723","code_sha256_prefix":"e2f8b1a98dec9723","mcp_get_code":{"code_sha256":"e2f8b1a98dec9723"}},{"arxiv_id":"2203.10385","arxiv_id_is_arxiv":true,"paper":"/paper/pressurevision-estimating-hand-pressure-from","title":"PressureVision: Estimating Hand Pressure from a Single RGB Image","date":"2022-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/pressurevision","path":"prediction/webcam_demo.py","file_url":"https://github.com/facebookresearch/pressurevision/blob/HEAD/prediction/webcam_demo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/pressurevision, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"533874f4636fedbf","code_sha256_prefix":"533874f4636fedbf","mcp_get_code":{"code_sha256":"533874f4636fedbf"}},{"arxiv_id":"2007.04612","arxiv_id_is_arxiv":true,"paper":"/paper/concept-bottleneck-models","title":"Concept Bottleneck Models","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewsiang/ConceptBottleneck","path":"CUB/gen_cub_synthetic.py","file_url":"https://github.com/yewsiang/ConceptBottleneck/blob/HEAD/CUB/gen_cub_synthetic.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":"e2f8b1a98dec9723","code_sha256_prefix":"e2f8b1a98dec9723","mcp_get_code":{"code_sha256":"e2f8b1a98dec9723"}},{"arxiv_id":"1901.02970","arxiv_id_is_arxiv":true,"paper":"/paper/normalized-object-coordinate-space-for","title":"Normalized Object Coordinate Space for Category-Level 6D Object Pose and Size Estimation","date":"2019-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sahithchada/NOCS_PyTorch","path":"model.py","file_url":"https://github.com/sahithchada/NOCS_PyTorch/blob/HEAD/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":"69c7643b22386435","code_sha256_prefix":"69c7643b22386435","mcp_get_code":{"code_sha256":"69c7643b22386435"}},{"arxiv_id":"openreview_7MlfE2Da2W","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_7MlfE2Da2W","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"snumprlab/scale","path":"experiments/robot/openvla_utils.py","file_url":"https://github.com/snumprlab/scale/blob/HEAD/experiments/robot/openvla_utils.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":"d4883358a40b04e4","code_sha256_prefix":"d4883358a40b04e4","mcp_get_code":{"code_sha256":"d4883358a40b04e4"}}],"record_sha256":"627860f407d5c8bda1665f5ff66036d7f768bd118586f92f2fcf157ad0de1188","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}