{"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-f1","entry":"get_f1","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":0,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2410.22564","arxiv_id_is_arxiv":true,"paper":"/paper/vertical-federated-learning-with-missing","title":"Vertical Federated Learning with Missing Features During Training and Inference","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valdeira/laser-vfl","path":"methods/laser.py","file_url":"https://github.com/valdeira/laser-vfl/blob/HEAD/methods/laser.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ae52284718dca6a","code_sha256_prefix":"9ae52284718dca6a","mcp_get_code":{"code_sha256":"9ae52284718dca6a"}},{"arxiv_id":"2305.14695","arxiv_id_is_arxiv":true,"paper":"/paper/a-causal-view-of-entity-bias-in-large","title":"A Causal View of Entity Bias in (Large) Language Models","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luka-group/causal-view-of-entity-bias","path":"evaluation.py","file_url":"https://github.com/luka-group/causal-view-of-entity-bias/blob/HEAD/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ad8c851e82cf45a","code_sha256_prefix":"1ad8c851e82cf45a","mcp_get_code":{"code_sha256":"1ad8c851e82cf45a"}},{"arxiv_id":"2305.05191","arxiv_id_is_arxiv":true,"paper":"/paper/cola-contextualized-commonsense-causal","title":"COLA: Contextualized Commonsense Causal Reasoning from the Causal Inference Perspective","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/cola","path":"evaluate.py","file_url":"https://github.com/hkust-knowcomp/cola/blob/HEAD/evaluate.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":"f71f4792bb23e87b","code_sha256_prefix":"f71f4792bb23e87b","mcp_get_code":{"code_sha256":"f71f4792bb23e87b"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikergarcia1996/sequence-labeling-llms","path":"Medical-MT5/get_results.py","file_url":"https://github.com/ikergarcia1996/sequence-labeling-llms/blob/HEAD/Medical-MT5/get_results.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":"f3fdd2b33f8ca63e","code_sha256_prefix":"f3fdd2b33f8ca63e","mcp_get_code":{"code_sha256":"f3fdd2b33f8ca63e"}},{"arxiv_id":"2103.11811","arxiv_id_is_arxiv":true,"paper":"/paper/masakhaner-named-entity-recognition-for","title":"MasakhaNER: Named Entity Recognition for African Languages","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michael-beukman/nertransfer","path":"src/analysis/v20/base.py","file_url":"https://github.com/michael-beukman/nertransfer/blob/HEAD/src/analysis/v20/base.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":"c60cb5d43bb0779f","code_sha256_prefix":"c60cb5d43bb0779f","mcp_get_code":{"code_sha256":"c60cb5d43bb0779f"}},{"arxiv_id":"1901.08634","arxiv_id_is_arxiv":true,"paper":"/paper/a-bert-baseline-for-the-natural-questions","title":"A BERT Baseline for the Natural Questions","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"see--/natural-question-answering","path":"eval_server.py","file_url":"https://github.com/see--/natural-question-answering/blob/HEAD/eval_server.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":"47a5135d3347930d","code_sha256_prefix":"47a5135d3347930d","mcp_get_code":{"code_sha256":"47a5135d3347930d"}}],"record_sha256":"a7279267070295a9fddc917e26d482fb50e42c7b84299b10c4bb53a1780f9768","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}