{"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/random-sample","entry":"random_sample","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":18,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":7,"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":18,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":19,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":4,"ran":10,"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":"2503.08363","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-point-cloud-completion-for","title":"Parametric Point Cloud Completion for Polygonal Surface Reconstruction","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parametric-completion/paco","path":"utils/misc.py","file_url":"https://github.com/parametric-completion/paco/blob/HEAD/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c13bc1137dca047","code_sha256_prefix":"2c13bc1137dca047","mcp_get_code":{"code_sha256":"2c13bc1137dca047"}},{"arxiv_id":"2406.13542","arxiv_id_is_arxiv":true,"paper":"/paper/self-play-with-execution-feedback-improving","title":"Self-play with Execution Feedback: Improving Instruction-following Capabilities of Large Language Models","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QwenLM/AutoIF","path":"code_dpo/2_dpo_data_query_construct.py","file_url":"https://github.com/QwenLM/AutoIF/blob/HEAD/code_dpo/2_dpo_data_query_construct.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c720b590a991017","code_sha256_prefix":"0c720b590a991017","mcp_get_code":{"code_sha256":"0c720b590a991017"}},{"arxiv_id":"2405.19547","arxiv_id_is_arxiv":true,"paper":"/paper/cliploss-and-norm-based-data-selection","title":"CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learning","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypwang61/VAS","path":"cal_clipscores.py","file_url":"https://github.com/ypwang61/VAS/blob/HEAD/cal_clipscores.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, ypwang61/VAS when it was checked","code_sha256":"cfd8b1cf3644b321","code_sha256_prefix":"cfd8b1cf3644b321","mcp_get_code":{"code_sha256":"cfd8b1cf3644b321"}},{"arxiv_id":"2405.18861","arxiv_id_is_arxiv":true,"paper":"/paper/domain-inspired-sharpness-aware-minimization","title":"Domain-Inspired Sharpness-Aware Minimization Under Domain Shifts","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MediaBrain-SJTU/DISAM","path":"code/models/resnet.py","file_url":"https://github.com/MediaBrain-SJTU/DISAM/blob/HEAD/code/models/resnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, MediaBrain-SJTU/DISAM when it was checked","code_sha256":"647d32905ebb0ee7","code_sha256_prefix":"647d32905ebb0ee7","mcp_get_code":{"code_sha256":"647d32905ebb0ee7"}},{"arxiv_id":"2404.04720","arxiv_id_is_arxiv":true,"paper":"/paper/on-exploring-pde-modeling-for-point-cloud","title":"On Exploring PDE Modeling for Point Cloud Video Representation Learning","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhh6425/MotionPointNet","path":"layers/subsample.py","file_url":"https://github.com/zhh6425/MotionPointNet/blob/HEAD/layers/subsample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhh6425/MotionPointNet when it was checked","code_sha256":"f1d9a9d6a76dbed2","code_sha256_prefix":"f1d9a9d6a76dbed2","mcp_get_code":{"code_sha256":"f1d9a9d6a76dbed2"}},{"arxiv_id":"2311.06750","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-for-generalization","title":"Federated Learning for Generalization, Robustness, Fairness: A Survey and Benchmark","date":"2023-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenkehuang/marsfl","path":"Backbones/ResNet_pretrain.py","file_url":"https://github.com/wenkehuang/marsfl/blob/HEAD/Backbones/ResNet_pretrain.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wenkehuang/marsfl when it was checked","code_sha256":"647d32905ebb0ee7","code_sha256_prefix":"647d32905ebb0ee7","mcp_get_code":{"code_sha256":"647d32905ebb0ee7"}},{"arxiv_id":"2306.06327","arxiv_id_is_arxiv":true,"paper":"/paper/any-dimensional-equivariant-neural-networks","title":"Any-dimensional equivariant neural networks","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateodd25/free-nets","path":"experiments/free_symmetric_projection.py","file_url":"https://github.com/mateodd25/free-nets/blob/HEAD/experiments/free_symmetric_projection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad3bd41e9ed1bb19","code_sha256_prefix":"ad3bd41e9ed1bb19","mcp_get_code":{"code_sha256":"ad3bd41e9ed1bb19"}},{"arxiv_id":"2306.06327","arxiv_id_is_arxiv":true,"paper":"/paper/any-dimensional-equivariant-neural-networks","title":"Any-dimensional equivariant neural networks","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateodd25/free-nets","path":"experiments/aux_O.py","file_url":"https://github.com/mateodd25/free-nets/blob/HEAD/experiments/aux_O.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c71362caaf3b0ab","code_sha256_prefix":"5c71362caaf3b0ab","mcp_get_code":{"code_sha256":"5c71362caaf3b0ab"}},{"arxiv_id":"2305.13788","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-models-infer-and-disagree","title":"Can Large Language Models Capture Dissenting Human Voices?","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xfactlab/emnlp2023-LLM-Disagreement","path":"sample.py","file_url":"https://github.com/xfactlab/emnlp2023-LLM-Disagreement/blob/HEAD/sample.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":"2163e5e3c4bcebcd","code_sha256_prefix":"2163e5e3c4bcebcd","mcp_get_code":{"code_sha256":"2163e5e3c4bcebcd"}},{"arxiv_id":"2302.00695","arxiv_id_is_arxiv":true,"paper":"/paper/versatile-energy-based-probabilistic-models-1","title":"Versatile Energy-Based Probabilistic Models for High Energy Physics","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taolicheng/ebm-hep","path":"ebm_jet_attn.py","file_url":"https://github.com/taolicheng/ebm-hep/blob/HEAD/ebm_jet_attn.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, taolicheng/ebm-hep when it was checked","code_sha256":"e5b729c5f624bcd2","code_sha256_prefix":"e5b729c5f624bcd2","mcp_get_code":{"code_sha256":"e5b729c5f624bcd2"}},{"arxiv_id":"2203.11934","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-all-vehicles","title":"Learning from All Vehicles","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dotchen/LAV","path":"lav/models/bev_planner.py","file_url":"https://github.com/dotchen/LAV/blob/HEAD/lav/models/bev_planner.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84aa89472ba98d55","code_sha256_prefix":"84aa89472ba98d55","mcp_get_code":{"code_sha256":"84aa89472ba98d55"}},{"arxiv_id":"2106.06575","arxiv_id_is_arxiv":true,"paper":"/paper/auto-nba-efficient-and-effective-search-over","title":"Auto-NBA: Efficient and Effective Search Over the Joint Space of Networks, Bitwidths, and Accelerators","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICE-EIC/Auto-NBA","path":"model_search.py","file_url":"https://github.com/RICE-EIC/Auto-NBA/blob/HEAD/model_search.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":"40eb5ef310a13593","code_sha256_prefix":"40eb5ef310a13593","mcp_get_code":{"code_sha256":"40eb5ef310a13593"}},{"arxiv_id":"2103.16559","arxiv_id_is_arxiv":true,"paper":"/paper/broaden-your-views-for-self-supervised-video","title":"Broaden Your Views for Self-Supervised Video Learning","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/brave","path":"brave/datasets/sampling.py","file_url":"https://github.com/deepmind/brave/blob/HEAD/brave/datasets/sampling.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":"e6ad315cfb7d7612","code_sha256_prefix":"e6ad315cfb7d7612","mcp_get_code":{"code_sha256":"e6ad315cfb7d7612"}},{"arxiv_id":"2004.14905","arxiv_id_is_arxiv":true,"paper":"/paper/modelling-suspense-in-short-stories-as","title":"Modelling Suspense in Short Stories as Uncertainty Reduction over Neural Representation","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwlmt/Story-Untangling","path":"story_untangling/modules/utils.py","file_url":"https://github.com/dwlmt/Story-Untangling/blob/HEAD/story_untangling/modules/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6392a9a1efc97e8","code_sha256_prefix":"f6392a9a1efc97e8","mcp_get_code":{"code_sha256":"f6392a9a1efc97e8"}},{"arxiv_id":"1907.02392","arxiv_id_is_arxiv":true,"paper":"/paper/guided-image-generation-with-conditional","title":"Guided Image Generation with Conditional Invertible Neural Networks","date":"2019-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"5yearsKim/Conditional-Normalizing-Flow","path":"inference.py","file_url":"https://github.com/5yearsKim/Conditional-Normalizing-Flow/blob/HEAD/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, 5yearsKim/Conditional-Normalizing-Flow when it was checked","code_sha256":"5dbb728ceb7ffbcb","code_sha256_prefix":"5dbb728ceb7ffbcb","mcp_get_code":{"code_sha256":"5dbb728ceb7ffbcb"}},{"arxiv_id":"1905.10688","arxiv_id_is_arxiv":true,"paper":"/paper/sherlock-a-deep-learning-approach-to-semantic","title":"Sherlock: A Deep Learning Approach to Semantic Data Type Detection","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitmedialab/sherlock-project","path":"sherlock/functional.py","file_url":"https://github.com/mitmedialab/sherlock-project/blob/HEAD/sherlock/functional.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8654506268afc092","code_sha256_prefix":"8654506268afc092","mcp_get_code":{"code_sha256":"8654506268afc092"}},{"arxiv_id":"1806.09045","arxiv_id_is_arxiv":true,"paper":"/paper/variational-wasserstein-clustering","title":"Variational Wasserstein Clustering","date":"2018-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icemiliang/pyvot","path":"utils_numpy.py","file_url":"https://github.com/icemiliang/pyvot/blob/HEAD/utils_numpy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bd6add87efaed8a7","code_sha256_prefix":"bd6add87efaed8a7","mcp_get_code":{"code_sha256":"bd6add87efaed8a7"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"near32/regym","path":"regym/rl_algorithms/algorithms/PPO/ppo.py","file_url":"https://github.com/near32/regym/blob/HEAD/regym/rl_algorithms/algorithms/PPO/ppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2439c728712b51ae","code_sha256_prefix":"2439c728712b51ae","mcp_get_code":{"code_sha256":"2439c728712b51ae"}},{"arxiv_id":"2022.findings-emnlp.353","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.353","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RaiPranav/FCL-FedSeIT","path":"FedWeit/utils.py","file_url":"https://github.com/RaiPranav/FCL-FedSeIT/blob/HEAD/FedWeit/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":"3bf4eb4b1fb26975","code_sha256_prefix":"3bf4eb4b1fb26975","mcp_get_code":{"code_sha256":"3bf4eb4b1fb26975"}}],"record_sha256":"fa9dd695ffe043d5b3a7a4b2055841fca17bfccb01eed3ed750c13078542a4d8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}