{"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-random-indices","entry":"get_random_indices","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":4,"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":"2506.08249","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08249","title":"RADAR: Benchmarking Language Models on Imperfect Tabular Data","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenqgu/radar","path":"radar/tasks/utils.py","file_url":"https://github.com/kenqgu/radar/blob/HEAD/radar/tasks/utils.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":"d51bad27fa5c0788","code_sha256_prefix":"d51bad27fa5c0788","mcp_get_code":{"code_sha256":"d51bad27fa5c0788"}},{"arxiv_id":"2505.18547","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-blend-inference-time-multi","title":"Diffusion Blend: Inference-Time Multi-Preference Alignment for Diffusion Models","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bluewoods127/db-2025","path":"train_online_pg.py","file_url":"https://github.com/bluewoods127/db-2025/blob/HEAD/train_online_pg.py","status":"ran_honours","verification_level":2,"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, bluewoods127/db-2025 when it was checked","code_sha256":"a57ed18dcd7f6eea","code_sha256_prefix":"a57ed18dcd7f6eea","mcp_get_code":{"code_sha256":"a57ed18dcd7f6eea"}},{"arxiv_id":"2412.16577","arxiv_id_is_arxiv":true,"paper":"/paper/a-meta-learning-approach-to-bayesian-causal","title":"A Meta-Learning Approach to Bayesian Causal Discovery","date":"2024-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anish144/CausalStructureNeuralProcess","path":"ml2_meta_causal_discovery/utils/datautils.py","file_url":"https://github.com/Anish144/CausalStructureNeuralProcess/blob/HEAD/ml2_meta_causal_discovery/utils/datautils.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":"d3aec780435dd02f","code_sha256_prefix":"d3aec780435dd02f","mcp_get_code":{"code_sha256":"d3aec780435dd02f"}},{"arxiv_id":"2405.08322","arxiv_id_is_arxiv":true,"paper":"/paper/straightpcf-straight-point-cloud-filtering","title":"StraightPCF: Straight Point Cloud Filtering","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddsediri/StraightPCF","path":"models/straightpcf.py","file_url":"https://github.com/ddsediri/StraightPCF/blob/HEAD/models/straightpcf.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":"41293a8736cbaded","code_sha256_prefix":"41293a8736cbaded","mcp_get_code":{"code_sha256":"41293a8736cbaded"}},{"arxiv_id":"2404.05522","arxiv_id_is_arxiv":true,"paper":"/paper/3dmambaipf-a-state-space-model-for-iterative","title":"3DMambaIPF: A State Space Model for Iterative Point Cloud Filtering via Differentiable Rendering","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"tsingyuanchou/3dmambaipf","path":"models/denoise.py","file_url":"https://github.com/tsingyuanchou/3dmambaipf/blob/HEAD/models/denoise.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, tsingyuanchou/3dmambaipf when it was checked","code_sha256":"41293a8736cbaded","code_sha256_prefix":"41293a8736cbaded","mcp_get_code":{"code_sha256":"41293a8736cbaded"}},{"arxiv_id":"2402.12336","arxiv_id_is_arxiv":true,"paper":"/paper/robust-clip-unsupervised-adversarial-fine","title":"Robust CLIP: Unsupervised Adversarial Fine-Tuning of Vision Embeddings for Robust Large Vision-Language Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chs20/robustvlm","path":"vlm_eval/run_evaluation.py","file_url":"https://github.com/chs20/robustvlm/blob/HEAD/vlm_eval/run_evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63ec736a72a6cb74","code_sha256_prefix":"63ec736a72a6cb74","mcp_get_code":{"code_sha256":"63ec736a72a6cb74"}},{"arxiv_id":"2311.16101","arxiv_id_is_arxiv":true,"paper":"/paper/how-many-unicorns-are-in-this-image-a-safety","title":"How Many Unicorns Are in This Image? A Safety Evaluation Benchmark for Vision LLMs","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-vlaa/vllm-safety-benchmark","path":"safety_evaluations/ood_scenarios/evaluation.py","file_url":"https://github.com/ucsc-vlaa/vllm-safety-benchmark/blob/HEAD/safety_evaluations/ood_scenarios/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ucsc-vlaa/vllm-safety-benchmark when it was checked","code_sha256":"ae36d350b447e2db","code_sha256_prefix":"ae36d350b447e2db","mcp_get_code":{"code_sha256":"ae36d350b447e2db"}},{"arxiv_id":"2308.10741","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-adversarial-robustness-of-multi-modal","title":"On the Adversarial Robustness of Multi-Modal Foundation Models","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"63ec736a72a6cb74","code_sha256_prefix":"63ec736a72a6cb74","mcp_get_code":{"code_sha256":"63ec736a72a6cb74"}},{"arxiv_id":"2305.14800","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-diverse-in-context-configurations","title":"Exploring Diverse In-Context Configurations for Image Captioning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongliang-wu/explorecfg","path":"open_flamingo/eval/evaluate.py","file_url":"https://github.com/yongliang-wu/explorecfg/blob/HEAD/open_flamingo/eval/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c5804bb71e2308b","code_sha256_prefix":"0c5804bb71e2308b","mcp_get_code":{"code_sha256":"0c5804bb71e2308b"}},{"arxiv_id":"2304.01529","arxiv_id_is_arxiv":true,"paper":"/paper/iterativepfn-true-iterative-point-cloud","title":"IterativePFN: True Iterative Point Cloud Filtering","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddsediri/IterativePFN","path":"models/denoise.py","file_url":"https://github.com/ddsediri/IterativePFN/blob/HEAD/models/denoise.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":"41293a8736cbaded","code_sha256_prefix":"41293a8736cbaded","mcp_get_code":{"code_sha256":"41293a8736cbaded"}},{"arxiv_id":"2001.01565","arxiv_id_is_arxiv":true,"paper":"/paper/stance-detection-benchmark-how-robust-is-your","title":"Stance Detection Benchmark: How Robust Is Your Stance Detection?","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/mdl-stance-robustness","path":"prepro.py","file_url":"https://github.com/UKPLab/mdl-stance-robustness/blob/HEAD/prepro.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":"8dbe6dcc5c31662f","code_sha256_prefix":"8dbe6dcc5c31662f","mcp_get_code":{"code_sha256":"8dbe6dcc5c31662f"}},{"arxiv_id":"aaai_35157","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_35157","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fidelity/BoolXAI","path":"boolxai/classifiers/util.py","file_url":"https://github.com/fidelity/BoolXAI/blob/HEAD/boolxai/classifiers/util.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":"69a9b7e1798bfdfa","code_sha256_prefix":"69a9b7e1798bfdfa","mcp_get_code":{"code_sha256":"69a9b7e1798bfdfa"}}],"record_sha256":"d36903004bc782861610e46bf752470a4239cb7de790e98a3cbe2f47b258f685","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}