{"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/save-result","entry":"save_result","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":2},"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":"2412.17596","arxiv_id_is_arxiv":true,"paper":"/paper/liveideabench-evaluating-llms-scientific","title":"LiveIdeaBench: Evaluating LLMs' Scientific Creativity and Idea Generation with Minimal Context","date":"2024-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"x66ccff/liveideabench","path":"utils/database.py","file_url":"https://github.com/x66ccff/liveideabench/blob/HEAD/utils/database.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":"8344c18f6c6bbafd","code_sha256_prefix":"8344c18f6c6bbafd","mcp_get_code":{"code_sha256":"8344c18f6c6bbafd"}},{"arxiv_id":"2412.09501","arxiv_id_is_arxiv":true,"paper":"/paper/lyra-an-efficient-and-speech-centric","title":"Lyra: An Efficient and Speech-Centric Framework for Omni-Cognition","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/Lyra","path":"lyra/eval/model_lyra_text_speech.py","file_url":"https://github.com/dvlab-research/Lyra/blob/HEAD/lyra/eval/model_lyra_text_speech.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":"7719de171ef38b85","code_sha256_prefix":"7719de171ef38b85","mcp_get_code":{"code_sha256":"7719de171ef38b85"}},{"arxiv_id":"2411.14717","arxiv_id_is_arxiv":true,"paper":"/paper/fedmllm-federated-fine-tuning-mllm-on","title":"FedMLLM: Federated Fine-tuning MLLM on Multimodal Heterogeneity Data","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1xbq1/fedmllm","path":"eval_medical.py","file_url":"https://github.com/1xbq1/fedmllm/blob/HEAD/eval_medical.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, 1xbq1/fedmllm when it was checked","code_sha256":"32f8f1bcb6c46c13","code_sha256_prefix":"32f8f1bcb6c46c13","mcp_get_code":{"code_sha256":"32f8f1bcb6c46c13"}},{"arxiv_id":"2405.10311","arxiv_id_is_arxiv":true,"paper":"/paper/unirag-universal-retrieval-augmentation-for","title":"UniRAG: Universal Retrieval Augmentation for Large Vision Language Models","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/unirag","path":"src/unirag/utils.py","file_url":"https://github.com/castorini/unirag/blob/HEAD/src/unirag/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, castorini/unirag when it was checked","code_sha256":"58629c6a6cb6b282","code_sha256_prefix":"58629c6a6cb6b282","mcp_get_code":{"code_sha256":"58629c6a6cb6b282"}},{"arxiv_id":"2403.11186","arxiv_id_is_arxiv":true,"paper":"/paper/nettrack-tracking-highly-dynamic-objects-with","title":"NetTrack: Tracking Highly Dynamic Objects with a Net","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"George-Zhuang/NetTrack","path":"tracker/nettrack.py","file_url":"https://github.com/George-Zhuang/NetTrack/blob/HEAD/tracker/nettrack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7aafbf95486fb2c0","code_sha256_prefix":"7aafbf95486fb2c0","mcp_get_code":{"code_sha256":"7aafbf95486fb2c0"}},{"arxiv_id":"2402.03161","arxiv_id_is_arxiv":true,"paper":"/paper/video-lavit-unified-video-language-pre","title":"Video-LaVIT: Unified Video-Language Pre-training with Decoupled Visual-Motional Tokenization","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jy0205/lavit","path":"LaVIT/utils.py","file_url":"https://github.com/jy0205/lavit/blob/HEAD/LaVIT/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, jy0205/lavit when it was checked","code_sha256":"58629c6a6cb6b282","code_sha256_prefix":"58629c6a6cb6b282","mcp_get_code":{"code_sha256":"58629c6a6cb6b282"}},{"arxiv_id":"2211.10797","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-on-contrastive-search-and","title":"An Empirical Study On Contrastive Search And Contrastive Decoding For Open-ended Text Generation","date":"2022-11-19","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":"08a4d22e5a9f3b60","code_sha256_prefix":"08a4d22e5a9f3b60","mcp_get_code":{"code_sha256":"08a4d22e5a9f3b60"}},{"arxiv_id":"2210.14140","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-search-is-what-you-need-for","title":"Contrastive Search Is What You Need For Neural Text Generation","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yxuansu/contrastive_search_is_what_you_need","path":"code_generation/inference.py","file_url":"https://github.com/yxuansu/contrastive_search_is_what_you_need/blob/HEAD/code_generation/inference.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, yxuansu/contrastive_search_is_what_you_need when it was checked","code_sha256":"08a4d22e5a9f3b60","code_sha256_prefix":"08a4d22e5a9f3b60","mcp_get_code":{"code_sha256":"08a4d22e5a9f3b60"}},{"arxiv_id":"2108.00146","arxiv_id_is_arxiv":true,"paper":"/paper/t-k-ml-ap-adversarial-attacks-to-top-k-multi","title":"T$_k$ML-AP: Adversarial Attacks to Top-$k$ Multi-Label Learning","date":"2021-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"discovershu/TKML-AP","path":"attack.py","file_url":"https://github.com/discovershu/TKML-AP/blob/HEAD/attack.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, discovershu/TKML-AP when it was checked","code_sha256":"c3197cc1dc16ced8","code_sha256_prefix":"c3197cc1dc16ced8","mcp_get_code":{"code_sha256":"c3197cc1dc16ced8"}},{"arxiv_id":"2105.01051","arxiv_id_is_arxiv":true,"paper":"/paper/superb-speech-processing-universal","title":"SUPERB: Speech processing Universal PERformance Benchmark","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usc-sail/fed-ser-leakage","path":"mitigation/federated_ser_classifier_udp.py","file_url":"https://github.com/usc-sail/fed-ser-leakage/blob/HEAD/mitigation/federated_ser_classifier_udp.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":"fbdf6d939f822660","code_sha256_prefix":"fbdf6d939f822660","mcp_get_code":{"code_sha256":"fbdf6d939f822660"}}],"record_sha256":"853b797cb898cbea9b10b77db9ed06a3e9d86b66e0788acae1d4d5ec17dbb861","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}