{"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/extract-numbers","entry":"extract_numbers","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":13,"n_papers_ran_no_instrument_failure":9,"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":14,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":11,"n_places":14,"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":5,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"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":"2609.01737","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01737","title":"SpeakPay: Domain-Adaptive LoRA Fine-Tuning of Whisper for Low-Resource Nepali Financial Speech Recognition","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"subedibiraj/speakpay","path":"analysis/error_analysis.py","file_url":"https://github.com/subedibiraj/speakpay/blob/HEAD/analysis/error_analysis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, subedibiraj/speakpay (NOASSERTION)","code_sha256":"c3758f401073ef17","code_sha256_prefix":"c3758f401073ef17","mcp_get_code":{"code_sha256":"c3758f401073ef17"}},{"arxiv_id":"2602.22278","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22278","title":"RETLLM: Training and Data-Free MLLMs for Multimodal Information Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"alivecat05/RETLLM","path":"Codes/Qwen2_vl.py","file_url":"https://github.com/alivecat05/RETLLM/blob/HEAD/Codes/Qwen2_vl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22d6dd835992f7a4","code_sha256_prefix":"22d6dd835992f7a4","mcp_get_code":{"code_sha256":"22d6dd835992f7a4"}},{"arxiv_id":"2602.20671","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-20671","title":"Bikelution: Federated Gradient-Boosting for Scalable Shared Micro-Mobility Demand Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DataStories-UniPi/Bikelution","path":"src/helper.py","file_url":"https://github.com/DataStories-UniPi/Bikelution/blob/HEAD/src/helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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, DataStories-UniPi/Bikelution, is not in the permissive set Syntology serves inline","code_sha256":"6fe2cb3e21d73171","code_sha256_prefix":"6fe2cb3e21d73171","mcp_get_code":{"code_sha256":"6fe2cb3e21d73171"}},{"arxiv_id":"2601.21014","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21014","title":"Efficient Causal Structure Learning via Modular Subgraph Integration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Pedro-Tian/causal-dag","path":"dcilp/submit_slurmjobs.py","file_url":"https://github.com/Pedro-Tian/causal-dag/blob/HEAD/dcilp/submit_slurmjobs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Pedro-Tian/causal-dag when it was checked","code_sha256":"abe383ca180df4dc","code_sha256_prefix":"abe383ca180df4dc","mcp_get_code":{"code_sha256":"abe383ca180df4dc"}},{"arxiv_id":"2505.23281","arxiv_id_is_arxiv":true,"paper":"/paper/matharena-evaluating-llms-on-uncontaminated","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/matharena","path":"src/matharena/grader.py","file_url":"https://github.com/eth-sri/matharena/blob/HEAD/src/matharena/grader.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":"811a3d879ce72f27","code_sha256_prefix":"811a3d879ce72f27","mcp_get_code":{"code_sha256":"811a3d879ce72f27"}},{"arxiv_id":"2504.21682","arxiv_id_is_arxiv":true,"paper":"/paper/visual-text-processing-a-comprehensive-review","title":"Visual Text Processing: A Comprehensive Review and Unified Evaluation","date":"2025-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuyansy/visual-text-processing-survey","path":"VTP_Bench/DID/get_did_scores.py","file_url":"https://github.com/shuyansy/visual-text-processing-survey/blob/HEAD/VTP_Bench/DID/get_did_scores.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shuyansy/visual-text-processing-survey when it was checked","code_sha256":"a96bc131a3e39158","code_sha256_prefix":"a96bc131a3e39158","mcp_get_code":{"code_sha256":"a96bc131a3e39158"}},{"arxiv_id":"2502.14735","arxiv_id_is_arxiv":true,"paper":"/paper/eager-llm-enhancing-large-language-models-as","title":"EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integration","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Indolent-Kawhi/EAGER-LLM","path":"src/evaluate.py","file_url":"https://github.com/Indolent-Kawhi/EAGER-LLM/blob/HEAD/src/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fdaba9b1c31749ae","code_sha256_prefix":"fdaba9b1c31749ae","mcp_get_code":{"code_sha256":"fdaba9b1c31749ae"}},{"arxiv_id":"2407.09709","arxiv_id_is_arxiv":true,"paper":"/paper/gofa-a-generative-one-for-all-model-for-joint","title":"GOFA: A Generative One-For-All Model for Joint Graph Language Modeling","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaruifeng/gofa","path":"utils.py","file_url":"https://github.com/jiaruifeng/gofa/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03b3e38ed24cd3b1","code_sha256_prefix":"03b3e38ed24cd3b1","mcp_get_code":{"code_sha256":"03b3e38ed24cd3b1"}},{"arxiv_id":"2406.09760","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrapping-language-models-with-dpo","title":"Bootstrapping Language Models with DPO Implicit Rewards","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/dice","path":"self_alignment/utils/eval_util.py","file_url":"https://github.com/sail-sg/dice/blob/HEAD/self_alignment/utils/eval_util.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9accffd5c3b9c10","code_sha256_prefix":"d9accffd5c3b9c10","mcp_get_code":{"code_sha256":"d9accffd5c3b9c10"}},{"arxiv_id":"2406.02888","arxiv_id_is_arxiv":true,"paper":"/paper/hydra-model-factorization-framework-for-black","title":"HYDRA: Model Factorization Framework for Black-Box LLM Personalization","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"night-chen/HYDRA","path":"metrics/classification_metrics.py","file_url":"https://github.com/night-chen/HYDRA/blob/HEAD/metrics/classification_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, night-chen/HYDRA when it was checked","code_sha256":"128a6ca41173c482","code_sha256_prefix":"128a6ca41173c482","mcp_get_code":{"code_sha256":"128a6ca41173c482"}},{"arxiv_id":"2405.04950","arxiv_id_is_arxiv":true,"paper":"/paper/visiongraph-leveraging-large-multimodal","title":"VisionGraph: Leveraging Large Multimodal Models for Graph Theory Problems in Visual Context","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitsz-tmg/visiongraph","path":"Evaluate/Evaluate_LLaVA*.py","file_url":"https://github.com/hitsz-tmg/visiongraph/blob/HEAD/Evaluate/Evaluate_LLaVA%2A.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hitsz-tmg/visiongraph when it was checked","code_sha256":"49644adf394cafdd","code_sha256_prefix":"49644adf394cafdd","mcp_get_code":{"code_sha256":"49644adf394cafdd"}},{"arxiv_id":"2403.04706","arxiv_id_is_arxiv":true,"paper":"/paper/common-7b-language-models-already-possess","title":"Common 7B Language Models Already Possess Strong Math Capabilities","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jerrywu-code/susgen","path":"eval/code/eval_finqa.py","file_url":"https://github.com/jerrywu-code/susgen/blob/HEAD/eval/code/eval_finqa.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":"72dfc5e9d73fa763","code_sha256_prefix":"72dfc5e9d73fa763","mcp_get_code":{"code_sha256":"72dfc5e9d73fa763"}},{"arxiv_id":"2309.08532","arxiv_id_is_arxiv":true,"paper":"/paper/connecting-large-language-models-with","title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","date":"2023-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beeevita/EvoPrompt","path":"evoluter.py","file_url":"https://github.com/beeevita/EvoPrompt/blob/HEAD/evoluter.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76fda09860d6a6ba","code_sha256_prefix":"76fda09860d6a6ba","mcp_get_code":{"code_sha256":"76fda09860d6a6ba"}},{"arxiv_id":"2010.02656","arxiv_id_is_arxiv":true,"paper":"/paper/multi-instance-multi-label-learning-networks","title":"Multi-Instance Multi-Label Learning Networks for Aspect-Category Sentiment Analysis","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l294265421/AC-MIMLLN","path":"nlp_tasks/utils/attention_visualizer.py","file_url":"https://github.com/l294265421/AC-MIMLLN/blob/HEAD/nlp_tasks/utils/attention_visualizer.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":"8d4b830e0a2257bb","code_sha256_prefix":"8d4b830e0a2257bb","mcp_get_code":{"code_sha256":"8d4b830e0a2257bb"}}],"record_sha256":"49274d7a7b42e879a9e35e8bb50a462b1c1b6bb4a37b39be5cdd0ed4710070b0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}