{"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-predictor-and-zoomin-params","entry":"get_predictor_and_zoomin_params","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":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":4,"ran_fixture":0,"ran":0,"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":"2410.11722","arxiv_id_is_arxiv":true,"paper":"/paper/rclicks-realistic-click-simulation-for","title":"RClicks: Realistic Click Simulation for Benchmarking Interactive Segmentation","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emb-ai/rclicks","path":"scripts/evaluate_model_ritm.py","file_url":"https://github.com/emb-ai/rclicks/blob/HEAD/scripts/evaluate_model_ritm.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":"8b377b60d5f8f393","code_sha256_prefix":"8b377b60d5f8f393","mcp_get_code":{"code_sha256":"8b377b60d5f8f393"}},{"arxiv_id":"2405.04009","arxiv_id_is_arxiv":true,"paper":"/paper/structured-click-control-in-transformer-based","title":"Structured Click Control in Transformer-based Interactive Segmentation","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahamyt/scc","path":"scripts/evaluate_model.py","file_url":"https://github.com/hahamyt/scc/blob/HEAD/scripts/evaluate_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, hahamyt/scc, is not in the permissive set Syntology serves inline","code_sha256":"fca7b0a20cde7062","code_sha256_prefix":"fca7b0a20cde7062","mcp_get_code":{"code_sha256":"fca7b0a20cde7062"}},{"arxiv_id":"2405.00587","arxiv_id_is_arxiv":true,"paper":"/paper/graco-granularity-controllable-interactive","title":"GraCo: Granularity-Controllable Interactive Segmentation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhao-Yian/GraCo","path":"evaluate.py","file_url":"https://github.com/Zhao-Yian/GraCo/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hahamyt/scc, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"fca7b0a20cde7062","code_sha256_prefix":"fca7b0a20cde7062","mcp_get_code":{"code_sha256":"fca7b0a20cde7062"}},{"arxiv_id":"2303.05620","arxiv_id_is_arxiv":true,"paper":"/paper/cfr-icl-cascade-forward-refinement-with","title":"CFR-ICL: Cascade-Forward Refinement with Iterative Click Loss for Interactive Image Segmentation","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TitorX/CFR-ICL-Interactive-Segmentation","path":"scripts/evaluate_model.py","file_url":"https://github.com/TitorX/CFR-ICL-Interactive-Segmentation/blob/HEAD/scripts/evaluate_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, TitorX/CFR-ICL-Interactive-Segmentation (NOASSERTION)","code_sha256":"98528abf8b3bbe19","code_sha256_prefix":"98528abf8b3bbe19","mcp_get_code":{"code_sha256":"98528abf8b3bbe19"}},{"arxiv_id":"2210.11006","arxiv_id_is_arxiv":true,"paper":"/paper/simpleclick-interactive-image-segmentation","title":"SimpleClick: Interactive Image Segmentation with Simple Vision Transformers","date":"2022-10-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":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"fca7b0a20cde7062","code_sha256_prefix":"fca7b0a20cde7062","mcp_get_code":{"code_sha256":"fca7b0a20cde7062"}},{"arxiv_id":"2102.06583","arxiv_id_is_arxiv":true,"paper":"/paper/reviving-iterative-training-with-mask","title":"Reviving Iterative Training with Mask Guidance for Interactive Segmentation","date":"2021-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"supervisely-ecosystem/ritm-interactive-segmentation","path":"scripts/evaluate_model.py","file_url":"https://github.com/supervisely-ecosystem/ritm-interactive-segmentation/blob/HEAD/scripts/evaluate_model.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":"7bc32bef384c367b","code_sha256_prefix":"7bc32bef384c367b","mcp_get_code":{"code_sha256":"7bc32bef384c367b"}}],"record_sha256":"49e58ef801bfbc1b98d334656ab3c2006983ce02f1bd8e91c66ccff90606e3bf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}