{"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-inputs","entry":"get_inputs","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":14,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":5,"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":13,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":14,"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":4,"ran_fixture":0,"ran":5,"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":"2503.21457","arxiv_id_is_arxiv":true,"paper":"/paper/facebench-a-multi-view-multi-level-facial","title":"FaceBench: A Multi-View Multi-Level Facial Attribute VQA Dataset for Benchmarking Face Perception MLLMs","date":"2025-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVI-SZU/FaceBench","path":"evaluation/inference.py","file_url":"https://github.com/CVI-SZU/FaceBench/blob/HEAD/evaluation/inference.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":"d69d7a79ec270f80","code_sha256_prefix":"d69d7a79ec270f80","mcp_get_code":{"code_sha256":"d69d7a79ec270f80"}},{"arxiv_id":"2410.20399","arxiv_id_is_arxiv":true,"paper":"/paper/thunderkittens-simple-fast-and-adorable-ai","title":"ThunderKittens: Simple, Fast, and Adorable AI Kernels","date":"2024-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/ThunderKittens","path":"demos/based/document_ie_based.py","file_url":"https://github.com/HazyResearch/ThunderKittens/blob/HEAD/demos/based/document_ie_based.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":"55de983a3ac2c905","code_sha256_prefix":"55de983a3ac2c905","mcp_get_code":{"code_sha256":"55de983a3ac2c905"}},{"arxiv_id":"2406.09952","arxiv_id_is_arxiv":true,"paper":"/paper/bivlc-extending-vision-language","title":"BiVLC: Extending Vision-Language Compositionality Evaluation with Text-to-Image Retrieval","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imirandam/bivlc","path":"src/BiVLC_Generation/BiVLC_img_generation.py","file_url":"https://github.com/imirandam/bivlc/blob/HEAD/src/BiVLC_Generation/BiVLC_img_generation.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":"471718d635dd1dd6","code_sha256_prefix":"471718d635dd1dd6","mcp_get_code":{"code_sha256":"471718d635dd1dd6"}},{"arxiv_id":"2404.00712","arxiv_id_is_arxiv":true,"paper":"/paper/survey-of-computerized-adaptive-testing-a","title":"Survey of Computerized Adaptive Testing: A Machine Learning Perspective","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/educat","path":"scripts/bobcat_train.py","file_url":"https://github.com/bigdata-ustc/educat/blob/HEAD/scripts/bobcat_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf10b1462929ad81","code_sha256_prefix":"bf10b1462929ad81","mcp_get_code":{"code_sha256":"bf10b1462929ad81"}},{"arxiv_id":"2403.06495","arxiv_id_is_arxiv":true,"paper":"/paper/toward-generalist-anomaly-detection-via-in","title":"Toward Generalist Anomaly Detection via In-context Residual Learning with Few-shot Sample Prompts","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/WinCLIP","path":"datasets/mvtec_dataset.py","file_url":"https://github.com/mala-lab/WinCLIP/blob/HEAD/datasets/mvtec_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, mala-lab/WinCLIP, is not in the permissive set Syntology serves inline","code_sha256":"8be46af3c88f4a4a","code_sha256_prefix":"8be46af3c88f4a4a","mcp_get_code":{"code_sha256":"8be46af3c88f4a4a"}},{"arxiv_id":"2402.12842","arxiv_id_is_arxiv":true,"paper":"/paper/promptkd-distilling-student-friendly","title":"PromptKD: Distilling Student-Friendly Knowledge for Generative Language Models via Prompt Tuning","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmkim-ai/promptkd","path":"evaluate_exposure_bias.py","file_url":"https://github.com/gmkim-ai/promptkd/blob/HEAD/evaluate_exposure_bias.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":"a71327fc1087c21e","code_sha256_prefix":"a71327fc1087c21e","mcp_get_code":{"code_sha256":"a71327fc1087c21e"}},{"arxiv_id":"2309.03199","arxiv_id_is_arxiv":true,"paper":"/paper/matcha-tts-a-fast-tts-architecture-with","title":"Matcha-TTS: A fast TTS architecture with conditional flow matching","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shivammehta25/Matcha-TTS","path":"matcha/onnx/export.py","file_url":"https://github.com/shivammehta25/Matcha-TTS/blob/HEAD/matcha/onnx/export.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":"f067a910719bc379","code_sha256_prefix":"f067a910719bc379","mcp_get_code":{"code_sha256":"f067a910719bc379"}},{"arxiv_id":"2108.07386","arxiv_id_is_arxiv":true,"paper":"/paper/bobcat-bilevel-optimization-based","title":"BOBCAT: Bilevel Optimization-Based Computerized Adaptive Testing","date":"2021-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"bf10b1462929ad81","code_sha256_prefix":"bf10b1462929ad81","mcp_get_code":{"code_sha256":"bf10b1462929ad81"}},{"arxiv_id":"2108.06852","arxiv_id_is_arxiv":true,"paper":"/paper/a-hybrid-video-anomaly-detection-framework","title":"A Hybrid Video Anomaly Detection Framework via Memory-Augmented Flow Reconstruction and Flow-Guided Frame Prediction","date":"2021-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiUzHiAn/hf2vad","path":"datasets/dataset.py","file_url":"https://github.com/LiUzHiAn/hf2vad/blob/HEAD/datasets/dataset.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":"8d81b09e9f81cc4b","code_sha256_prefix":"8d81b09e9f81cc4b","mcp_get_code":{"code_sha256":"8d81b09e9f81cc4b"}},{"arxiv_id":"1912.06445","arxiv_id_is_arxiv":true,"paper":"/paper/the-garden-of-forking-paths-towards-multi","title":"The Garden of Forking Paths: Towards Multi-Future Trajectory Prediction","date":"2019-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunweiLiang/Multiverse","path":"code/multifuture_inference.py","file_url":"https://github.com/JunweiLiang/Multiverse/blob/HEAD/code/multifuture_inference.py","status":"unverified","verification_level":0,"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":"3c55e4863789ee69","code_sha256_prefix":"3c55e4863789ee69","mcp_get_code":{"code_sha256":"3c55e4863789ee69"}},{"arxiv_id":"1902.00751","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-efficient-transfer-learning-for-nlp","title":"Parameter-Efficient Transfer Learning for NLP","date":"2019-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberZHG/keras-bert","path":"keras_bert/layers/inputs.py","file_url":"https://github.com/CyberZHG/keras-bert/blob/HEAD/keras_bert/layers/inputs.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":"9cbbfb6d9b9dc99e","code_sha256_prefix":"9cbbfb6d9b9dc99e","mcp_get_code":{"code_sha256":"9cbbfb6d9b9dc99e"}},{"arxiv_id":"1810.06111","arxiv_id_is_arxiv":true,"paper":"/paper/novel-deep-learning-methods-for-track","title":"Novel deep learning methods for track reconstruction","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"savvy379/princeton_gnn_tracking","path":"train_IN.py","file_url":"https://github.com/savvy379/princeton_gnn_tracking/blob/HEAD/train_IN.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, savvy379/princeton_gnn_tracking when it was checked","code_sha256":"84835f148962ab71","code_sha256_prefix":"84835f148962ab71","mcp_get_code":{"code_sha256":"84835f148962ab71"}},{"arxiv_id":"1805.10572","arxiv_id_is_arxiv":true,"paper":"/paper/brits-bidirectional-recurrent-imputation-for","title":"BRITS: Bidirectional Recurrent Imputation for Time Series","date":"2018-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flaviagiammarino/brits-tensorflow","path":"brits_tensorflow/utils.py","file_url":"https://github.com/flaviagiammarino/brits-tensorflow/blob/HEAD/brits_tensorflow/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":"09da6e3827e4f7db","code_sha256_prefix":"09da6e3827e4f7db","mcp_get_code":{"code_sha256":"09da6e3827e4f7db"}},{"arxiv_id":"1701.04722","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-variational-bayes-unifying","title":"Adversarial Variational Bayes: Unifying Variational Autoencoders and Generative Adversarial Networks","date":"2017-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LMescheder/AdversarialVariationalBayes","path":"avb/inputs.py","file_url":"https://github.com/LMescheder/AdversarialVariationalBayes/blob/HEAD/avb/inputs.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":"241589a9c025efb6","code_sha256_prefix":"241589a9c025efb6","mcp_get_code":{"code_sha256":"241589a9c025efb6"}}],"record_sha256":"1d8dda2a13529ecdb0b463a1c5738a34c5dd509831b47c2fd7f77ab3343455c4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}