{"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/threshold","entry":"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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":10,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":1},"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":"2312.06436","arxiv_id_is_arxiv":true,"paper":"/paper/reward-certification-for-policy-smoothed","title":"Reward Certification for Policy Smoothed Reinforcement Learning","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustai/receps","path":"Freeway/action_attack_free.py","file_url":"https://github.com/trustai/receps/blob/HEAD/Freeway/action_attack_free.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, trustai/receps when it was checked","code_sha256":"a3ac61a71353c977","code_sha256_prefix":"a3ac61a71353c977","mcp_get_code":{"code_sha256":"a3ac61a71353c977"}},{"arxiv_id":"2312.06436","arxiv_id_is_arxiv":true,"paper":"/paper/reward-certification-for-policy-smoothed","title":"Reward Certification for Policy Smoothed Reinforcement Learning","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustai/receps","path":"Cartpole/action_attack_cartpole.py","file_url":"https://github.com/trustai/receps/blob/HEAD/Cartpole/action_attack_cartpole.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, trustai/receps when it was checked","code_sha256":"81d7081fdee68ac2","code_sha256_prefix":"81d7081fdee68ac2","mcp_get_code":{"code_sha256":"81d7081fdee68ac2"}},{"arxiv_id":"2305.14535","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-over-graph-with-1","title":"Uncertainty Quantification over Graph with Conformalized Graph Neural Networks","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/conformalized-gnn","path":"conformalized_gnn/conformal.py","file_url":"https://github.com/snap-stanford/conformalized-gnn/blob/HEAD/conformalized_gnn/conformal.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, snap-stanford/conformalized-gnn when it was checked","code_sha256":"6e8071034c8ec73d","code_sha256_prefix":"6e8071034c8ec73d","mcp_get_code":{"code_sha256":"6e8071034c8ec73d"}},{"arxiv_id":"2009.07736","arxiv_id_is_arxiv":true,"paper":"/paper/hota-a-higher-order-metric-for-evaluating","title":"HOTA: A Higher Order Metric for Evaluating Multi-Object Tracking","date":"2020-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonathonLuiten/TrackEval","path":"trackeval/baselines/baseline_utils.py","file_url":"https://github.com/JonathonLuiten/TrackEval/blob/HEAD/trackeval/baselines/baseline_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":"407ecabd804b59d8","code_sha256_prefix":"407ecabd804b59d8","mcp_get_code":{"code_sha256":"407ecabd804b59d8"}},{"arxiv_id":"1905.04804","arxiv_id_is_arxiv":true,"paper":"/paper/video-instance-segmentation","title":"Video Instance Segmentation","date":"2019-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TranThienDat-Nguyen/VisionEvaluation","path":"trackeval/baselines/baseline_utils.py","file_url":"https://github.com/TranThienDat-Nguyen/VisionEvaluation/blob/HEAD/trackeval/baselines/baseline_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":"407ecabd804b59d8","code_sha256_prefix":"407ecabd804b59d8","mcp_get_code":{"code_sha256":"407ecabd804b59d8"}},{"arxiv_id":"1806.01353","arxiv_id_is_arxiv":true,"paper":"/paper/natural-language-generation-for-electronic","title":"Natural Language Generation for Electronic Health Records","date":"2018-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scotthlee/nrc","path":"ae_training.py","file_url":"https://github.com/scotthlee/nrc/blob/HEAD/ae_training.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5073d7497bb337ef","code_sha256_prefix":"5073d7497bb337ef","mcp_get_code":{"code_sha256":"5073d7497bb337ef"}},{"arxiv_id":"1611.09326","arxiv_id_is_arxiv":true,"paper":"/paper/the-one-hundred-layers-tiramisu-fully","title":"The One Hundred Layers Tiramisu: Fully Convolutional DenseNets for Semantic Segmentation","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ankit-vaghela30/Cilia-Segmentation","path":"hastings/preprocessing.py","file_url":"https://github.com/ankit-vaghela30/Cilia-Segmentation/blob/HEAD/hastings/preprocessing.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":"cc07c5438fa01645","code_sha256_prefix":"cc07c5438fa01645","mcp_get_code":{"code_sha256":"cc07c5438fa01645"}},{"arxiv_id":"1610.02413","arxiv_id_is_arxiv":true,"paper":"/paper/equality-of-opportunity-in-supervised","title":"Equality of Opportunity in Supervised Learning","date":"2016-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scotthlee/fairness","path":"balancers.py","file_url":"https://github.com/scotthlee/fairness/blob/HEAD/balancers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ca100f1e9d61248","code_sha256_prefix":"6ca100f1e9d61248","mcp_get_code":{"code_sha256":"6ca100f1e9d61248"}},{"arxiv_id":"1609.03605","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-text-in-natural-image-with","title":"Detecting Text in Natural Image with Connectionist Text Proposal Network","date":"2016-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alorozco53/text-detection-ctpn","path":"lib/text_connector/other.py","file_url":"https://github.com/alorozco53/text-detection-ctpn/blob/HEAD/lib/text_connector/other.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":"d11f151f0452c0a7","code_sha256_prefix":"d11f151f0452c0a7","mcp_get_code":{"code_sha256":"d11f151f0452c0a7"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthurflor23/surface-crack-detection","path":"src/dip/image.py","file_url":"https://github.com/arthurflor23/surface-crack-detection/blob/HEAD/src/dip/image.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":"878ab850d8820d77","code_sha256_prefix":"878ab850d8820d77","mcp_get_code":{"code_sha256":"878ab850d8820d77"}}],"record_sha256":"3ec53ff41492dfb63e1fd19de762908e16ca20e07061496b1c28d929d41e6a2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}