{"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-data-path","entry":"get_data_path","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":20,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":6,"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":19,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":6,"n_samples_fingerprinted":2,"n_places":20,"n_places_pointer_only":7,"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":5,"ran_fixture":0,"ran":8,"unverified":6},"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":"2608.14648","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-14648","title":"Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"cwida/SuperKMeans","path":"benchmarks/bench_utils.py","file_url":"https://github.com/cwida/SuperKMeans/blob/HEAD/benchmarks/bench_utils.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":"147f25df6007e667","code_sha256_prefix":"147f25df6007e667","mcp_get_code":{"code_sha256":"147f25df6007e667"}},{"arxiv_id":"2608.11083","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-11083","title":"A Systematic Sample Size Analysis of ML-Based Path Loss Prediction for LPWAN","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"mclab-hbrs/lora-bonn-ml-pathloss","path":"src/config/paths.py","file_url":"https://github.com/mclab-hbrs/lora-bonn-ml-pathloss/blob/HEAD/src/config/paths.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mclab-hbrs/lora-bonn-ml-pathloss (NOASSERTION)","code_sha256":"25ab0318fa4b8058","code_sha256_prefix":"25ab0318fa4b8058","mcp_get_code":{"code_sha256":"25ab0318fa4b8058"}},{"arxiv_id":"2511.17914","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-17914","title":"Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"j-cyoung/ADSA_DD","path":"perturbation_analysis/compute_entropy.py","file_url":"https://github.com/j-cyoung/ADSA_DD/blob/HEAD/perturbation_analysis/compute_entropy.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, j-cyoung/ADSA_DD when it was checked","code_sha256":"6c170c5c08c5f7d1","code_sha256_prefix":"6c170c5c08c5f7d1","mcp_get_code":{"code_sha256":"6c170c5c08c5f7d1"}},{"arxiv_id":"2506.01833","arxiv_id_is_arxiv":true,"paper":"/paper/space-your-genomic-profile-predictor-is-a","title":"SPACE: Your Genomic Profile Predictor is a Powerful DNA Foundation Model","date":"2025-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhujiwei111/space","path":"experiments/GUE/expr_GUE.py","file_url":"https://github.com/zhujiwei111/space/blob/HEAD/experiments/GUE/expr_GUE.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":"32d75d785abdbbfa","code_sha256_prefix":"32d75d785abdbbfa","mcp_get_code":{"code_sha256":"32d75d785abdbbfa"}},{"arxiv_id":"2503.01908","arxiv_id_is_arxiv":true,"paper":"/paper/udora-a-unified-red-teaming-framework-against","title":"UDora: A Unified Red Teaming Framework against LLM Agents by Dynamically Hijacking Their Own Reasoning","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-secure/udora","path":"webshop.py","file_url":"https://github.com/ai-secure/udora/blob/HEAD/webshop.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ai-secure/udora when it was checked","code_sha256":"348aa957ac0c8a68","code_sha256_prefix":"348aa957ac0c8a68","mcp_get_code":{"code_sha256":"348aa957ac0c8a68"}},{"arxiv_id":"2502.14922","arxiv_id_is_arxiv":true,"paper":"/paper/sift-grounding-llm-reasoning-in-contexts-via","title":"SIFT: Grounding LLM Reasoning in Contexts via Stickers","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhijie-group/sift","path":"datasets.py","file_url":"https://github.com/zhijie-group/sift/blob/HEAD/datasets.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":"68edb9734be2f8be","code_sha256_prefix":"68edb9734be2f8be","mcp_get_code":{"code_sha256":"68edb9734be2f8be"}},{"arxiv_id":"2410.21662","arxiv_id_is_arxiv":true,"paper":"/paper/f-po-generalizing-preference-optimization","title":"$f$-PO: Generalizing Preference Optimization with $f$-divergence Minimization","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/fpo","path":"src/align_stage/inference.py","file_url":"https://github.com/minkaixu/fpo/blob/HEAD/src/align_stage/inference.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":"af991fecf57a358d","code_sha256_prefix":"af991fecf57a358d","mcp_get_code":{"code_sha256":"af991fecf57a358d"}},{"arxiv_id":"2406.13864","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-representation-learning-on-the","title":"Evaluating representation learning on the protein structure universe","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a-r-j/ProteinWorkshop","path":"proteinworkshop/datasets/atom3d_datamodule.py","file_url":"https://github.com/a-r-j/ProteinWorkshop/blob/HEAD/proteinworkshop/datasets/atom3d_datamodule.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":"09ec7a346cca7bcd","code_sha256_prefix":"09ec7a346cca7bcd","mcp_get_code":{"code_sha256":"09ec7a346cca7bcd"}},{"arxiv_id":"2406.12038","arxiv_id_is_arxiv":true,"paper":"/paper/soft-prompting-for-unlearning-in-large","title":"Soft Prompting for Unlearning in Large Language Models","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karuna-bhaila/llm_unlearning","path":"utils.py","file_url":"https://github.com/karuna-bhaila/llm_unlearning/blob/HEAD/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, karuna-bhaila/llm_unlearning when it was checked","code_sha256":"7e1ff286a54b3ec5","code_sha256_prefix":"7e1ff286a54b3ec5","mcp_get_code":{"code_sha256":"7e1ff286a54b3ec5"}},{"arxiv_id":"2404.04518","arxiv_id_is_arxiv":true,"paper":"/paper/medianomaly-a-comparative-study-of-anomaly","title":"MedIAnomaly: A comparative study of anomaly detection in medical images","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyu6666/medianomaly","path":"reconstruction/dataloaders/data_utils.py","file_url":"https://github.com/caiyu6666/medianomaly/blob/HEAD/reconstruction/dataloaders/data_utils.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":"d3b86c112d1db20b","code_sha256_prefix":"d3b86c112d1db20b","mcp_get_code":{"code_sha256":"d3b86c112d1db20b"}},{"arxiv_id":"2402.00856","arxiv_id_is_arxiv":true,"paper":"/paper/towards-efficient-and-exact-optimization-of","title":"Towards Efficient Exact Optimization of Language Model Alignment","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haozheji/exact-optimization","path":"src/align_stage/inference.py","file_url":"https://github.com/haozheji/exact-optimization/blob/HEAD/src/align_stage/inference.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":"af991fecf57a358d","code_sha256_prefix":"af991fecf57a358d","mcp_get_code":{"code_sha256":"af991fecf57a358d"}},{"arxiv_id":"2311.02542","arxiv_id_is_arxiv":true,"paper":"/paper/vr-nerf-high-fidelity-virtualized-walkable","title":"VR-NeRF: High-Fidelity Virtualized Walkable Spaces","date":"2023-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/eyefultower","path":"processing/eyeful_dock/pipeline_utils.py","file_url":"https://github.com/facebookresearch/eyefultower/blob/HEAD/processing/eyeful_dock/pipeline_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/eyefultower, 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":"87d9b2fd12450d01","code_sha256_prefix":"87d9b2fd12450d01","mcp_get_code":{"code_sha256":"87d9b2fd12450d01"}},{"arxiv_id":"2310.19046","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-as-evolutionary","title":"Large Language Models as Evolutionary Optimizers","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cschen1205/lmea","path":"src/utils.py","file_url":"https://github.com/cschen1205/lmea/blob/HEAD/src/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, cschen1205/lmea when it was checked","code_sha256":"3fa8fb2249a581aa","code_sha256_prefix":"3fa8fb2249a581aa","mcp_get_code":{"code_sha256":"3fa8fb2249a581aa"}},{"arxiv_id":"2206.13424","arxiv_id_is_arxiv":true,"paper":"/paper/benchopt-reproducible-efficient-and","title":"Benchopt: Reproducible, efficient and collaborative optimization benchmarks","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benchopt/benchopt","path":"benchopt/config.py","file_url":"https://github.com/benchopt/benchopt/blob/HEAD/benchopt/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9484e5cb8dc4812e","code_sha256_prefix":"9484e5cb8dc4812e","mcp_get_code":{"code_sha256":"9484e5cb8dc4812e"}},{"arxiv_id":"2203.10543","arxiv_id_is_arxiv":true,"paper":"/paper/document-dewarping-with-control-points","title":"Document Dewarping with Control Points","date":"2022-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gwxie/document-dewarping-with-control-points","path":"Source/dataloader.py","file_url":"https://github.com/gwxie/document-dewarping-with-control-points/blob/HEAD/Source/dataloader.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":"c98abd6fb800536c","code_sha256_prefix":"c98abd6fb800536c","mcp_get_code":{"code_sha256":"c98abd6fb800536c"}},{"arxiv_id":"2001.01828","arxiv_id_is_arxiv":true,"paper":"/paper/listwise-learning-to-rank-by-exploring-unique","title":"Listwise Learning to Rank by Exploring Unique Ratings","date":"2020-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaofengZhu/uRank_uMart","path":"src/feature_norm_for_lambdarank.py","file_url":"https://github.com/XiaofengZhu/uRank_uMart/blob/HEAD/src/feature_norm_for_lambdarank.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":"05dad4ff3ca220d1","code_sha256_prefix":"05dad4ff3ca220d1","mcp_get_code":{"code_sha256":"05dad4ff3ca220d1"}},{"arxiv_id":"1911.07420","arxiv_id_is_arxiv":true,"paper":"/paper/a-graph-autoencoder-approach-to-causal","title":"A Graph Autoencoder Approach to Causal Structure Learning","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThinkNaive/GAE-PSP","path":"tools/tune_graph_threshold.py","file_url":"https://github.com/ThinkNaive/GAE-PSP/blob/HEAD/tools/tune_graph_threshold.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, ThinkNaive/GAE-PSP when it was checked","code_sha256":"d20a6ef344ecbac3","code_sha256_prefix":"d20a6ef344ecbac3","mcp_get_code":{"code_sha256":"d20a6ef344ecbac3"}},{"arxiv_id":"1602.05473","arxiv_id_is_arxiv":true,"paper":"/paper/auxiliary-deep-generative-models","title":"Auxiliary Deep Generative Models","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larsmaaloee/auxiliary-deep-generative-models","path":"utils/env_paths.py","file_url":"https://github.com/larsmaaloee/auxiliary-deep-generative-models/blob/HEAD/utils/env_paths.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":"a5c309d29bc74afa","code_sha256_prefix":"a5c309d29bc74afa","mcp_get_code":{"code_sha256":"a5c309d29bc74afa"}},{"arxiv_id":"aaai_27819","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"preprocess.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/preprocess.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":"ae5dbcd4ae8ca78d","code_sha256_prefix":"ae5dbcd4ae8ca78d","mcp_get_code":{"code_sha256":"ae5dbcd4ae8ca78d"}},{"arxiv_id":"Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_3D_Face_Reconstruction_with_the_Geometric_Guidance_of_Facial_Part_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wang-zidu/3DDFA-V3","path":"util/preprocess.py","file_url":"https://github.com/wang-zidu/3DDFA-V3/blob/HEAD/util/preprocess.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":"609ecb6425d21d63","code_sha256_prefix":"609ecb6425d21d63","mcp_get_code":{"code_sha256":"609ecb6425d21d63"}}],"record_sha256":"6be1825b97f03ddbd6275ded8ff7929844e87a5b7cb36efbfcd8fbdbe91529c0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}