{"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/vectorize","entry":"vectorize","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":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":7,"unverified":4},"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":"2605.07063","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07063","title":"Dr. Post-Training : A Data Regularization Perspective on LLM Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TRAIS-Lab/Dr.Post-Training","path":"drpt/utils.py","file_url":"https://github.com/TRAIS-Lab/Dr.Post-Training/blob/HEAD/drpt/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, TRAIS-Lab/Dr.Post-Training when it was checked","code_sha256":"2b12fa6b855b18ef","code_sha256_prefix":"2b12fa6b855b18ef","mcp_get_code":{"code_sha256":"2b12fa6b855b18ef"}},{"arxiv_id":"2411.02988","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-calibration-of-classifiers-with","title":"Confidence Calibration of Classifiers with Many Classes","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/PLMCalibration","path":"train-bow-tf_idf.py","file_url":"https://github.com/lifan-yuan/PLMCalibration/blob/HEAD/train-bow-tf_idf.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":"6824958e0d4a8b02","code_sha256_prefix":"6824958e0d4a8b02","mcp_get_code":{"code_sha256":"6824958e0d4a8b02"}},{"arxiv_id":"2406.06246","arxiv_id_is_arxiv":true,"paper":"/paper/data-efficient-learning-with-neural-programs","title":"Data-Efficient Learning with Neural Programs","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alaiasolkobreslin/ised","path":"custom/sudoku/src/ised.py","file_url":"https://github.com/alaiasolkobreslin/ised/blob/HEAD/custom/sudoku/src/ised.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":"078a4055138f52d3","code_sha256_prefix":"078a4055138f52d3","mcp_get_code":{"code_sha256":"078a4055138f52d3"}},{"arxiv_id":"2402.02032","arxiv_id_is_arxiv":true,"paper":"/paper/robusttsf-towards-theory-and-design-of-robust","title":"RobustTSF: Towards Theory and Design of Robust Time Series Forecasting with Anomalies","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haochenglouis/robusttsf","path":"RobustTSF_SOTA_Methods/Robust_Exp_Transformer/data_provider/trendfilter_modify/trendfilter.py","file_url":"https://github.com/haochenglouis/robusttsf/blob/HEAD/RobustTSF_SOTA_Methods/Robust_Exp_Transformer/data_provider/trendfilter_modify/trendfilter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, haochenglouis/robusttsf when it was checked","code_sha256":"ac866917dc1cd68b","code_sha256_prefix":"ac866917dc1cd68b","mcp_get_code":{"code_sha256":"ac866917dc1cd68b"}},{"arxiv_id":"2307.00835","arxiv_id_is_arxiv":true,"paper":"/paper/engression-extrapolation-for-nonlinear","title":"Engression: Extrapolation through the Lens of Distributional Regression","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwshen51/engression","path":"engression-python/engression/utils.py","file_url":"https://github.com/xwshen51/engression/blob/HEAD/engression-python/engression/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99d5218e579e5adb","code_sha256_prefix":"99d5218e579e5adb","mcp_get_code":{"code_sha256":"99d5218e579e5adb"}},{"arxiv_id":"2305.03010","arxiv_id_is_arxiv":true,"paper":"/paper/sentence-embedding-leaks-more-information","title":"Sentence Embedding Leaks More Information than You Expect: Generative Embedding Inversion Attack to Recover the Whole Sentence","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/geia","path":"eval_classification.py","file_url":"https://github.com/hkust-knowcomp/geia/blob/HEAD/eval_classification.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":"2a52efec5d900b19","code_sha256_prefix":"2a52efec5d900b19","mcp_get_code":{"code_sha256":"2a52efec5d900b19"}},{"arxiv_id":"2105.13407","arxiv_id_is_arxiv":true,"paper":"/paper/manifold-constrained-gaussian-process","title":"Manifold-constrained Gaussian process inference for time-varying parameters in dynamic systems","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"canadasunyan/tvmagi","path":"package/TVMAGI_HMC.py","file_url":"https://github.com/canadasunyan/tvmagi/blob/HEAD/package/TVMAGI_HMC.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":"7830145d6e8c84b2","code_sha256_prefix":"7830145d6e8c84b2","mcp_get_code":{"code_sha256":"7830145d6e8c84b2"}},{"arxiv_id":"2005.04790","arxiv_id_is_arxiv":true,"paper":"/paper/the-hateful-memes-challenge-detecting-hate","title":"The Hateful Memes Challenge: Detecting Hate Speech in Multimodal Memes","date":"2020-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SebKleiner/Hateful_Memes","path":"predict.py","file_url":"https://github.com/SebKleiner/Hateful_Memes/blob/HEAD/predict.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":"05027f25ccd8edb8","code_sha256_prefix":"05027f25ccd8edb8","mcp_get_code":{"code_sha256":"05027f25ccd8edb8"}},{"arxiv_id":"1912.13046","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-burrows-wheeler-transform-markov","title":"A New Burrows Wheeler Transform Markov Distance","date":"2019-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EdwardRaff/pyBWMD","path":"pyBWMD/bwmd.py","file_url":"https://github.com/EdwardRaff/pyBWMD/blob/HEAD/pyBWMD/bwmd.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, EdwardRaff/pyBWMD when it was checked","code_sha256":"4c16c93dfc6b693c","code_sha256_prefix":"4c16c93dfc6b693c","mcp_get_code":{"code_sha256":"4c16c93dfc6b693c"}},{"arxiv_id":"1910.05852","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-competitive-regularization-in-gans-1","title":"Implicit competitive regularization in GANs","date":"2019-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wagenaartje/torch-cgd","path":"torch_cgd/utils.py","file_url":"https://github.com/wagenaartje/torch-cgd/blob/HEAD/torch_cgd/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":"480f12ea8540663b","code_sha256_prefix":"480f12ea8540663b","mcp_get_code":{"code_sha256":"480f12ea8540663b"}},{"arxiv_id":"1905.05733","arxiv_id_is_arxiv":true,"paper":"/paper/multi-step-retriever-reader-interaction-for-1","title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajarshd/Multi-Step-Reasoning","path":"paragraph_encoder/model/vector.py","file_url":"https://github.com/rajarshd/Multi-Step-Reasoning/blob/HEAD/paragraph_encoder/model/vector.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":"1819a5e33ac523fc","code_sha256_prefix":"1819a5e33ac523fc","mcp_get_code":{"code_sha256":"1819a5e33ac523fc"}},{"arxiv_id":"2021.acl-long.164","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.acl-long.164","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/OpenQA","path":"src/reader/vector.py","file_url":"https://github.com/thunlp/OpenQA/blob/HEAD/src/reader/vector.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":"e97ebe192b89aa12","code_sha256_prefix":"e97ebe192b89aa12","mcp_get_code":{"code_sha256":"e97ebe192b89aa12"}}],"record_sha256":"7f20a3f0e51f77065b9cce9068b98c518fdf983169d39c785a80541e1af12838","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}