{"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-precision","entry":"compute_precision","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":8,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":3,"unverified":0},"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":"2605.31500","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-31500","title":"On Efficient Scaling of GNNs via IO-Aware Layers Implementations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yandex-research/On-Efficient-Scaling-Of-GNNs","path":"src/training/metrics.py","file_url":"https://github.com/yandex-research/On-Efficient-Scaling-Of-GNNs/blob/HEAD/src/training/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd6f55a7a1817bde","code_sha256_prefix":"cd6f55a7a1817bde","mcp_get_code":{"code_sha256":"cd6f55a7a1817bde"}},{"arxiv_id":"2605.12370","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12370","title":"Context Convergence Improves Answering Inferential Questions","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DataScienceUIBK/Context-Convergence-Inferential-QA","path":"experiments/convergence_vs_cosine.py","file_url":"https://github.com/DataScienceUIBK/Context-Convergence-Inferential-QA/blob/HEAD/experiments/convergence_vs_cosine.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f7e8fc166782345","code_sha256_prefix":"3f7e8fc166782345","mcp_get_code":{"code_sha256":"3f7e8fc166782345"}},{"arxiv_id":"2603.07567","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07567","title":"Revisiting the LiRA Membership Inference Attack Under Realistic Assumptions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"najeebjebreel/lira_analysis","path":"comprehensive_analysis/metrics.py","file_url":"https://github.com/najeebjebreel/lira_analysis/blob/HEAD/comprehensive_analysis/metrics.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":"54526585121a623a","code_sha256_prefix":"54526585121a623a","mcp_get_code":{"code_sha256":"54526585121a623a"}},{"arxiv_id":"2401.14493","arxiv_id_is_arxiv":true,"paper":"/paper/k-qa-a-real-world-medical-q-a-benchmark","title":"K-QA: A Real-World Medical Q&A Benchmark","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"itaymanes/k-qa","path":"evaluation/metrics.py","file_url":"https://github.com/itaymanes/k-qa/blob/HEAD/evaluation/metrics.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":"fa788cda714fd442","code_sha256_prefix":"fa788cda714fd442","mcp_get_code":{"code_sha256":"fa788cda714fd442"}},{"arxiv_id":"2310.12979","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-a-protein-s-stability-under-a","title":"Predicting a Protein's Stability under a Million Mutations","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jozhang97/MutateEverything","path":"metrics.py","file_url":"https://github.com/jozhang97/MutateEverything/blob/HEAD/metrics.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, jozhang97/MutateEverything when it was checked","code_sha256":"ef845b16cb85c032","code_sha256_prefix":"ef845b16cb85c032","mcp_get_code":{"code_sha256":"ef845b16cb85c032"}},{"arxiv_id":"1511.08308","arxiv_id_is_arxiv":true,"paper":"/paper/named-entity-recognition-with-bidirectional","title":"Named Entity Recognition with Bidirectional LSTM-CNNs","date":"2015-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mxhofer/Named-Entity-Recognition-BidirectionalLSTM-CNN-CoNLL","path":"validation.py","file_url":"https://github.com/mxhofer/Named-Entity-Recognition-BidirectionalLSTM-CNN-CoNLL/blob/HEAD/validation.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":"f5cc0f3470ea30e7","code_sha256_prefix":"f5cc0f3470ea30e7","mcp_get_code":{"code_sha256":"f5cc0f3470ea30e7"}},{"arxiv_id":"1510.01784","arxiv_id_is_arxiv":true,"paper":"/paper/vbpr-visual-bayesian-personalized-ranking","title":"VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback","date":"2015-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jchanxtarov/vbpr","path":"src/utils/metrics.py","file_url":"https://github.com/jchanxtarov/vbpr/blob/HEAD/src/utils/metrics.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":"ddc18fe321d7784d","code_sha256_prefix":"ddc18fe321d7784d","mcp_get_code":{"code_sha256":"ddc18fe321d7784d"}},{"arxiv_id":"1205.2618","arxiv_id_is_arxiv":true,"paper":"/paper/bpr-bayesian-personalized-ranking-from","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","date":"2012-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jchanxtarov/BPRMF","path":"src/utils/metrics.py","file_url":"https://github.com/jchanxtarov/BPRMF/blob/HEAD/src/utils/metrics.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":"ddc18fe321d7784d","code_sha256_prefix":"ddc18fe321d7784d","mcp_get_code":{"code_sha256":"ddc18fe321d7784d"}}],"record_sha256":"4d70ce14a5433d7c2d94baefcbc6c8798c989881999719156540a3a884ddd88f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}