{"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-detector","entry":"get_detector","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":1,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"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":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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":"2606.06959","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-06959","title":"OpenHalDet: A Unified Benchmark for Hallucination Detection across Diverse Generation Scenarios","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Nellie179/Hallucination-Detection","path":"baseline_detectors/runner.py","file_url":"https://github.com/Nellie179/Hallucination-Detection/blob/HEAD/baseline_detectors/runner.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, Nellie179/Hallucination-Detection when it was checked","code_sha256":"c31079ef8b45e418","code_sha256_prefix":"c31079ef8b45e418","mcp_get_code":{"code_sha256":"c31079ef8b45e418"}},{"arxiv_id":"2403.04808","arxiv_id_is_arxiv":true,"paper":"/paper/watermax-breaking-the-llm-watermark","title":"WaterMax: breaking the LLM watermark detectability-robustness-quality trade-off","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eva-giboulot/watermax","path":"test_sentence_wm.py","file_url":"https://github.com/eva-giboulot/watermax/blob/HEAD/test_sentence_wm.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, eva-giboulot/watermax when it was checked","code_sha256":"aa5abf5d87851c1c","code_sha256_prefix":"aa5abf5d87851c1c","mcp_get_code":{"code_sha256":"aa5abf5d87851c1c"}},{"arxiv_id":"2108.07002","arxiv_id_is_arxiv":true,"paper":"/paper/change-is-everywhere-single-temporal","title":"Change is Everywhere: Single-Temporal Supervised Object Change Detection in Remote Sensing Imagery","date":"2021-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Z-Zheng/ChangeStar","path":"core/head.py","file_url":"https://github.com/Z-Zheng/ChangeStar/blob/HEAD/core/head.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":"223a14941fe9ecd0","code_sha256_prefix":"223a14941fe9ecd0","mcp_get_code":{"code_sha256":"223a14941fe9ecd0"}},{"arxiv_id":"1812.03506","arxiv_id_is_arxiv":true,"paper":"/paper/from-coarse-to-fine-robust-hierarchical","title":"From Coarse to Fine: Robust Hierarchical Localization at Large Scale","date":"2018-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-asl/hf_net","path":"hfnet/models/lf_net.py","file_url":"https://github.com/ethz-asl/hf_net/blob/HEAD/hfnet/models/lf_net.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":"69c3c15c70b78ef8","code_sha256_prefix":"69c3c15c70b78ef8","mcp_get_code":{"code_sha256":"69c3c15c70b78ef8"}},{"arxiv_id":"1506.01497","arxiv_id_is_arxiv":true,"paper":"/paper/faster-r-cnn-towards-real-time-object","title":"Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks","date":"2015-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdha0727/lung-opacity-and-covid-chest-x-ray-detection","path":"models/detector.py","file_url":"https://github.com/kdha0727/lung-opacity-and-covid-chest-x-ray-detection/blob/HEAD/models/detector.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kdha0727/lung-opacity-and-covid-chest-x-ray-detection when it was checked","code_sha256":"85b003e6c83cb43b","code_sha256_prefix":"85b003e6c83cb43b","mcp_get_code":{"code_sha256":"85b003e6c83cb43b"}}],"record_sha256":"b09be96e60a5596dc4f332ac2e5931dad74378d9340e4d0a1d90ac7b7c78c688","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}