{"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/compute-cost","entry":"compute_cost","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":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":5,"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":"2601.02578","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02578","title":"DataParasite Enables Scalable and Repurposable Online Data Curation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"mengysun/DataParasite","path":"src/data_parasite.py","file_url":"https://github.com/mengysun/DataParasite/blob/HEAD/src/data_parasite.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"645666446aafcbfe","code_sha256_prefix":"645666446aafcbfe","mcp_get_code":{"code_sha256":"645666446aafcbfe"}},{"arxiv_id":"2506.08477","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-harmful-memes-with-decoupled","title":"Detecting Harmful Memes with Decoupled Understanding and Guided CoT Reasoning","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panFJCharlotte98/HMC","path":"call_gpt.py","file_url":"https://github.com/panFJCharlotte98/HMC/blob/HEAD/call_gpt.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":"c46b835f604591c0","code_sha256_prefix":"c46b835f604591c0","mcp_get_code":{"code_sha256":"c46b835f604591c0"}},{"arxiv_id":"2410.15050","arxiv_id_is_arxiv":true,"paper":"/paper/are-llms-good-zero-shot-fallacy-classifiers","title":"Are LLMs Good Zero-Shot Fallacy Classifiers?","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"panfjcharlotte98/fallacy_detection","path":"models/gpt_based.py","file_url":"https://github.com/panfjcharlotte98/fallacy_detection/blob/HEAD/models/gpt_based.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":"b88a86c99705decd","code_sha256_prefix":"b88a86c99705decd","mcp_get_code":{"code_sha256":"b88a86c99705decd"}},{"arxiv_id":"2409.04617","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-rewards-can-self-train-dialogue-agents","title":"Sparse Rewards Can Self-Train Dialogue Agents","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asappresearch/josh-llm-simulation-training","path":"josh_train/utils.py","file_url":"https://github.com/asappresearch/josh-llm-simulation-training/blob/HEAD/josh_train/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":"6d3738cda068547c","code_sha256_prefix":"6d3738cda068547c","mcp_get_code":{"code_sha256":"6d3738cda068547c"}},{"arxiv_id":"2403.16218","arxiv_id_is_arxiv":true,"paper":"/paper/coverup-coverage-guided-llm-based-test","title":"CoverUp: Effective High Coverage Test Generation for Python","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plasma-umass/coverup","path":"src/coverup/llm.py","file_url":"https://github.com/plasma-umass/coverup/blob/HEAD/src/coverup/llm.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":"def8599068e3dbf6","code_sha256_prefix":"def8599068e3dbf6","mcp_get_code":{"code_sha256":"def8599068e3dbf6"}},{"arxiv_id":"2402.11760","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-as-a-parsimonious","title":"Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scailab/paser","path":"src/pretrain_rl.py","file_url":"https://github.com/scailab/paser/blob/HEAD/src/pretrain_rl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, scailab/paser when it was checked","code_sha256":"3317f307bb2e7fc6","code_sha256_prefix":"3317f307bb2e7fc6","mcp_get_code":{"code_sha256":"3317f307bb2e7fc6"}},{"arxiv_id":"2305.05176","arxiv_id_is_arxiv":true,"paper":"/paper/frugalgpt-how-to-use-large-language-models","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-futuredata/frugalgpt","path":"src/service/utils.py","file_url":"https://github.com/stanford-futuredata/frugalgpt/blob/HEAD/src/service/utils.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":"5141b572dad4bddf","code_sha256_prefix":"5141b572dad4bddf","mcp_get_code":{"code_sha256":"5141b572dad4bddf"}},{"arxiv_id":"2105.03153","arxiv_id_is_arxiv":true,"paper":"/paper/pairwise-fairness-for-ordinal-regression","title":"Pairwise Fairness for Ordinal Regression","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/fair-ordinal-regression","path":"learn_fair_threshold_model/evaluation.py","file_url":"https://github.com/amazon-research/fair-ordinal-regression/blob/HEAD/learn_fair_threshold_model/evaluation.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":"77331f760d7f305b","code_sha256_prefix":"77331f760d7f305b","mcp_get_code":{"code_sha256":"77331f760d7f305b"}},{"arxiv_id":"2012.12420","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-fl-algorithms-and-implementation","title":"Hybrid Federated Learning: Algorithms and Implementation","date":"2020-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"564612540/Hybrid-Federated-Learning","path":"model_matching/model_matching.py","file_url":"https://github.com/564612540/Hybrid-Federated-Learning/blob/HEAD/model_matching/model_matching.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, 564612540/Hybrid-Federated-Learning when it was checked","code_sha256":"8dd003cffc884698","code_sha256_prefix":"8dd003cffc884698","mcp_get_code":{"code_sha256":"8dd003cffc884698"}},{"arxiv_id":"2007.11718","arxiv_id_is_arxiv":true,"paper":"/paper/safety-critical-model-predictive-control-with","title":"Safety-Critical Model Predictive Control with Discrete-Time Control Barrier Function","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hybridrobotics/car-racing","path":"car_racing/control/lmpc_helper.py","file_url":"https://github.com/hybridrobotics/car-racing/blob/HEAD/car_racing/control/lmpc_helper.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":"9a70375264b211c3","code_sha256_prefix":"9a70375264b211c3","mcp_get_code":{"code_sha256":"9a70375264b211c3"}},{"arxiv_id":"2002.06440","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-with-matched-averaging-1","title":"Federated Learning with Matched Averaging","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/FedMA","path":"matching/pfnm.py","file_url":"https://github.com/IBM/FedMA/blob/HEAD/matching/pfnm.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":"0deab229a7b7de8e","code_sha256_prefix":"0deab229a7b7de8e","mcp_get_code":{"code_sha256":"0deab229a7b7de8e"}},{"arxiv_id":"1911.00218","arxiv_id_is_arxiv":true,"paper":"/paper/statistical-model-aggregation-via-parameter","title":"Statistical Model Aggregation via Parameter Matching","date":"2019-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/SPAHM","path":"topicmodeling/matching/gaus_marginal_matching.py","file_url":"https://github.com/IBM/SPAHM/blob/HEAD/topicmodeling/matching/gaus_marginal_matching.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79a0729a8d3b82bb","code_sha256_prefix":"79a0729a8d3b82bb","mcp_get_code":{"code_sha256":"79a0729a8d3b82bb"}},{"arxiv_id":"1911.00111","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-wasserstein-generative-adversarial","title":"Quantum Wasserstein Generative Adversarial Networks","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiminghwang/qWGAN","path":"model/model_hs.py","file_url":"https://github.com/yiminghwang/qWGAN/blob/HEAD/model/model_hs.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":"b8bd853d4c85ec09","code_sha256_prefix":"b8bd853d4c85ec09","mcp_get_code":{"code_sha256":"b8bd853d4c85ec09"}},{"arxiv_id":"1905.12022","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-nonparametric-federated-learning-of","title":"Bayesian Nonparametric Federated Learning of Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/probabilistic-federated-neural-matching","path":"matching/pfnm.py","file_url":"https://github.com/IBM/probabilistic-federated-neural-matching/blob/HEAD/matching/pfnm.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":"beed9270a5b69d7a","code_sha256_prefix":"beed9270a5b69d7a","mcp_get_code":{"code_sha256":"beed9270a5b69d7a"}}],"record_sha256":"6bf01131d1f849966dee32a7e5ff4147abeb33e86e1b9ec23cc4f80eeffc3627","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}