{"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-sensitivity","entry":"get_sensitivity","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":5,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":6,"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":3,"ran_fixture":0,"ran":3,"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":"2405.01719","arxiv_id_is_arxiv":true,"paper":"/paper/inherent-trade-offs-between-diversity-and","title":"Inherent Trade-Offs between Diversity and Stability in Multi-Task Benchmarks","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socialfoundations/benchbench","path":"benchbench/measures/cardinal.py","file_url":"https://github.com/socialfoundations/benchbench/blob/HEAD/benchbench/measures/cardinal.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":"2a977e4f402ff472","code_sha256_prefix":"2a977e4f402ff472","mcp_get_code":{"code_sha256":"2a977e4f402ff472"}},{"arxiv_id":"2405.01719","arxiv_id_is_arxiv":true,"paper":"/paper/inherent-trade-offs-between-diversity-and","title":"Inherent Trade-Offs between Diversity and Stability in Multi-Task Benchmarks","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socialfoundations/benchbench","path":"benchbench/measures/ordinal.py","file_url":"https://github.com/socialfoundations/benchbench/blob/HEAD/benchbench/measures/ordinal.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":"7a936e8599af8beb","code_sha256_prefix":"7a936e8599af8beb","mcp_get_code":{"code_sha256":"7a936e8599af8beb"}},{"arxiv_id":"2402.15853","arxiv_id_is_arxiv":true,"paper":"/paper/rauca-a-novel-physical-adversarial-attack-on","title":"RAUCA: A Novel Physical Adversarial Attack on Vehicle Detectors via Robust and Accurate Camouflage Generation","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack","path":"src/Image_Segmentation/evaluation.py","file_url":"https://github.com/SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack/blob/HEAD/src/Image_Segmentation/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack when it was checked","code_sha256":"3fdc610e589e29bd","code_sha256_prefix":"3fdc610e589e29bd","mcp_get_code":{"code_sha256":"3fdc610e589e29bd"}},{"arxiv_id":"2210.13012","arxiv_id_is_arxiv":true,"paper":"/paper/cmu-net-a-strong-convmixer-based-medical","title":"CMU-Net: A Strong ConvMixer-based Medical Ultrasound Image Segmentation Network","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fenghetan9/cmu-net","path":"src/metrics.py","file_url":"https://github.com/fenghetan9/cmu-net/blob/HEAD/src/metrics.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":"eeb3b3a1000e9560","code_sha256_prefix":"eeb3b3a1000e9560","mcp_get_code":{"code_sha256":"eeb3b3a1000e9560"}},{"arxiv_id":"2110.13029","arxiv_id_is_arxiv":true,"paper":"/paper/fair-enough-searching-for-sufficient-measures","title":"Fair Enough: Searching for Sufficient Measures of Fairness","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"repoanonymous/fairness_metrics","path":"src/get_sensitivity.py","file_url":"https://github.com/repoanonymous/fairness_metrics/blob/HEAD/src/get_sensitivity.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":"2a43f64d93bc3450","code_sha256_prefix":"2a43f64d93bc3450","mcp_get_code":{"code_sha256":"2a43f64d93bc3450"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjcheon/MedicalImageSegmentation_Pytorch","path":"evaluation.py","file_url":"https://github.com/wjcheon/MedicalImageSegmentation_Pytorch/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wjcheon/MedicalImageSegmentation_Pytorch when it was checked","code_sha256":"dd0ff9a848c9079a","code_sha256_prefix":"dd0ff9a848c9079a","mcp_get_code":{"code_sha256":"dd0ff9a848c9079a"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lbareiro/Image_Segmentation-master","path":"evaluation.py","file_url":"https://github.com/lbareiro/Image_Segmentation-master/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, lbareiro/Image_Segmentation-master when it was checked","code_sha256":"6a33f9a26b1965ca","code_sha256_prefix":"6a33f9a26b1965ca","mcp_get_code":{"code_sha256":"6a33f9a26b1965ca"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeeJunHyun/Image_Segmentation","path":"evaluation.py","file_url":"https://github.com/LeeJunHyun/Image_Segmentation/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, LeeJunHyun/Image_Segmentation when it was checked","code_sha256":"3fdc610e589e29bd","code_sha256_prefix":"3fdc610e589e29bd","mcp_get_code":{"code_sha256":"3fdc610e589e29bd"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Spider-scnu/Instance-Segmentation-For-Cancer","path":"code/evaluation.py","file_url":"https://github.com/Spider-scnu/Instance-Segmentation-For-Cancer/blob/HEAD/code/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3162b492d7ffa807","code_sha256_prefix":"3162b492d7ffa807","mcp_get_code":{"code_sha256":"3162b492d7ffa807"}},{"arxiv_id":"1802.06955","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-residual-convolutional-neural","title":"Recurrent Residual Convolutional Neural Network based on U-Net (R2U-Net) for Medical Image Segmentation","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"dd0ff9a848c9079a","code_sha256_prefix":"dd0ff9a848c9079a","mcp_get_code":{"code_sha256":"dd0ff9a848c9079a"}},{"arxiv_id":"1802.06955","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-residual-convolutional-neural","title":"Recurrent Residual Convolutional Neural Network based on U-Net (R2U-Net) for Medical Image Segmentation","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3fdc610e589e29bd","code_sha256_prefix":"3fdc610e589e29bd","mcp_get_code":{"code_sha256":"3fdc610e589e29bd"}}],"record_sha256":"be355ca398423f4d964ae7b400a9b89a4359e312dfb15145b445585bc7952304","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}