{"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/find-best-threshold","entry":"find_best_threshold","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":3,"n_places":8,"n_places_pointer_only":4,"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":3,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"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":"2607.24688","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-24688","title":"Beyond Scale and Generation: Understanding Language Model-based Entity Matching","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Jantory/llm-trained-matcher","path":"utils/metrics.py","file_url":"https://github.com/Jantory/llm-trained-matcher/blob/HEAD/utils/metrics.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, Jantory/llm-trained-matcher when it was checked","code_sha256":"3bc05ccd3f730a71","code_sha256_prefix":"3bc05ccd3f730a71","mcp_get_code":{"code_sha256":"3bc05ccd3f730a71"}},{"arxiv_id":"2511.01293","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-01293","title":"Detecting Generated Images by Fitting Natural Image Distributions","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"tmlr-group/ConV","path":"srcs/ConV.py","file_url":"https://github.com/tmlr-group/ConV/blob/HEAD/srcs/ConV.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"295724c23de5a53d","code_sha256_prefix":"295724c23de5a53d","mcp_get_code":{"code_sha256":"295724c23de5a53d"}},{"arxiv_id":"2412.05897","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-discrepancies-between-ai-generated","title":"Detecting Discrepancies Between AI-Generated and Natural Images Using Uncertainty","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/WePe","path":"wepe.py","file_url":"https://github.com/tmlr-group/WePe/blob/HEAD/wepe.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8135b8bd6213c904","code_sha256_prefix":"8135b8bd6213c904","mcp_get_code":{"code_sha256":"8135b8bd6213c904"}},{"arxiv_id":"2411.15633","arxiv_id_is_arxiv":true,"paper":"/paper/effort-efficient-orthogonal-modeling-for","title":"Orthogonal Subspace Decomposition for Generalizable AI-Generated Image Detection","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzy-stack/effort-aigi-detection","path":"UniversalFakeDetect_Benchmark/validate.py","file_url":"https://github.com/yzy-stack/effort-aigi-detection/blob/HEAD/UniversalFakeDetect_Benchmark/validate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yzy-stack/effort-aigi-detection when it was checked","code_sha256":"4139aa85d28b1ed5","code_sha256_prefix":"4139aa85d28b1ed5","mcp_get_code":{"code_sha256":"4139aa85d28b1ed5"}},{"arxiv_id":"2404.08452","arxiv_id_is_arxiv":true,"paper":"/paper/moe-ffd-mixture-of-experts-for-generalized","title":"MoE-FFD: Mixture of Experts for Generalized and Parameter-Efficient Face Forgery Detection","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lovesiamesecat/moe-ffd","path":"utils.py","file_url":"https://github.com/lovesiamesecat/moe-ffd/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, lovesiamesecat/moe-ffd when it was checked","code_sha256":"d2ddbdaa544b49d4","code_sha256_prefix":"d2ddbdaa544b49d4","mcp_get_code":{"code_sha256":"d2ddbdaa544b49d4"}},{"arxiv_id":"2404.04584","arxiv_id_is_arxiv":true,"paper":"/paper/d-3-scaling-up-deepfake-detection-by-learning","title":"D$^3$: Scaling Up Deepfake Detection by Learning from Discrepancy","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigaandsmallq/d3","path":"validate_for_robustness.py","file_url":"https://github.com/bigaandsmallq/d3/blob/HEAD/validate_for_robustness.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bigaandsmallq/d3 when it was checked","code_sha256":"4139aa85d28b1ed5","code_sha256_prefix":"4139aa85d28b1ed5","mcp_get_code":{"code_sha256":"4139aa85d28b1ed5"}},{"arxiv_id":"2109.14155","arxiv_id_is_arxiv":true,"paper":"/paper/customs-fraud-detection-in-the-presence-of","title":"Customs Fraud Detection in the Presence of Concept Drift","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Seondong/Customs-Fraud-Detection","path":"utils.py","file_url":"https://github.com/Seondong/Customs-Fraud-Detection/blob/HEAD/utils.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":"1ebeae63a8c09e55","code_sha256_prefix":"1ebeae63a8c09e55","mcp_get_code":{"code_sha256":"1ebeae63a8c09e55"}},{"arxiv_id":"2002.06483","arxiv_id_is_arxiv":true,"paper":"/paper/face-recognition-too-bias-or-not-too-bias","title":"Face Recognition: Too Bias, or Not Too Bias?","date":"2020-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visionjo/facerec-bias-bfw","path":"code/facebias/utils.py","file_url":"https://github.com/visionjo/facerec-bias-bfw/blob/HEAD/code/facebias/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"123165e61e51bec5","code_sha256_prefix":"123165e61e51bec5","mcp_get_code":{"code_sha256":"123165e61e51bec5"}}],"record_sha256":"50aefa7cc630dfa8428a99ff9f42ced92a4823b9c1191ef188d16831ee27eeb8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}