{"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/point-sample","entry":"point_sample","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"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":2,"ran_fixture":2,"ran":0,"unverified":4},"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":"2404.07973","arxiv_id_is_arxiv":true,"paper":"/paper/ferret-v2-an-improved-baseline-for-referring","title":"Ferret-v2: An Improved Baseline for Referring and Grounding with Large Language Models","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"55e4e4a151814912","code_sha256_prefix":"55e4e4a151814912","mcp_get_code":{"code_sha256":"55e4e4a151814912"}},{"arxiv_id":"2402.08960","arxiv_id_is_arxiv":true,"paper":"/paper/open-vocabulary-segmentation-with-unpaired","title":"Open-Vocabulary Segmentation with Unpaired Mask-Text Supervision","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"derrickwang005/uni-ovseg.pytorch","path":"lib/utils/misc.py","file_url":"https://github.com/derrickwang005/uni-ovseg.pytorch/blob/HEAD/lib/utils/misc.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, derrickwang005/uni-ovseg.pytorch when it was checked","code_sha256":"b99a89a4da0d0106","code_sha256_prefix":"b99a89a4da0d0106","mcp_get_code":{"code_sha256":"b99a89a4da0d0106"}},{"arxiv_id":"2401.13051","arxiv_id_is_arxiv":true,"paper":"/paper/pa-sam-prompt-adapter-sam-for-high-quality","title":"PA-SAM: Prompt Adapter SAM for High-Quality Image Segmentation","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xzz2/pa-sam","path":"utils/losses.py","file_url":"https://github.com/xzz2/pa-sam/blob/HEAD/utils/losses.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, xzz2/pa-sam when it was checked","code_sha256":"965de439489202e7","code_sha256_prefix":"965de439489202e7","mcp_get_code":{"code_sha256":"965de439489202e7"}},{"arxiv_id":"2401.13051","arxiv_id_is_arxiv":true,"paper":"/paper/pa-sam-prompt-adapter-sam-for-high-quality","title":"PA-SAM: Prompt Adapter SAM for High-Quality Image Segmentation","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xzz2/pa-sam","path":"utils/function.py","file_url":"https://github.com/xzz2/pa-sam/blob/HEAD/utils/function.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, xzz2/pa-sam when it was checked","code_sha256":"ab9b6bc249e53154","code_sha256_prefix":"ab9b6bc249e53154","mcp_get_code":{"code_sha256":"ab9b6bc249e53154"}},{"arxiv_id":"2401.10222","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-fine-tuning-in-turn-improves","title":"Supervised Fine-tuning in turn Improves Visual Foundation Models","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencentarc/visft","path":"mmf/models/visft/point_sampler.py","file_url":"https://github.com/tencentarc/visft/blob/HEAD/mmf/models/visft/point_sampler.py","status":"unverified","verification_level":0,"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":"90469906eb7f6e8f","code_sha256_prefix":"90469906eb7f6e8f","mcp_get_code":{"code_sha256":"90469906eb7f6e8f"}},{"arxiv_id":"2312.09158","arxiv_id_is_arxiv":true,"paper":"/paper/general-object-foundation-model-for-images","title":"General Object Foundation Model for Images and Videos at Scale","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FoundationVision/GLEE","path":"projects/GLEE/glee/modules/point_features.py","file_url":"https://github.com/FoundationVision/GLEE/blob/HEAD/projects/GLEE/glee/modules/point_features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39e4af93b70bcddf","code_sha256_prefix":"39e4af93b70bcddf","mcp_get_code":{"code_sha256":"39e4af93b70bcddf"}},{"arxiv_id":"2311.14671","arxiv_id_is_arxiv":true,"paper":"/paper/segic-unleashing-the-emergent-correspondence","title":"SEGIC: Unleashing the Emergent Correspondence for In-Context Segmentation","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"menglcool/segic","path":"utils/loss_mask.py","file_url":"https://github.com/menglcool/segic/blob/HEAD/utils/loss_mask.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xzz2/pa-sam, and GitHub detected no licence in that repository when it was checked","code_sha256":"965de439489202e7","code_sha256_prefix":"965de439489202e7","mcp_get_code":{"code_sha256":"965de439489202e7"}},{"arxiv_id":"2310.07704","arxiv_id_is_arxiv":true,"paper":"/paper/ferret-refer-and-ground-anything-anywhere-at","title":"Ferret: Refer and Ground Anything Anywhere at Any Granularity","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-ferret","path":"ferret/model/ferret_arch.py","file_url":"https://github.com/apple/ml-ferret/blob/HEAD/ferret/model/ferret_arch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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, apple/ml-ferret (NOASSERTION)","code_sha256":"55e4e4a151814912","code_sha256_prefix":"55e4e4a151814912","mcp_get_code":{"code_sha256":"55e4e4a151814912"}},{"arxiv_id":"2306.09347","arxiv_id_is_arxiv":true,"paper":"/paper/segment-any-point-cloud-sequences-by","title":"Segment Any Point Cloud Sequences by Distilling Vision Foundation Models","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IDEA-Research/OpenSeeD","path":"openseed/modules/point_features.py","file_url":"https://github.com/IDEA-Research/OpenSeeD/blob/HEAD/openseed/modules/point_features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39e4af93b70bcddf","code_sha256_prefix":"39e4af93b70bcddf","mcp_get_code":{"code_sha256":"39e4af93b70bcddf"}},{"arxiv_id":"2301.02657","arxiv_id_is_arxiv":true,"paper":"/paper/tarvis-a-unified-approach-for-target-based","title":"TarViS: A Unified Approach for Target-based Video Segmentation","date":"2023-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ali2500/TarViS","path":"tarvis/modelling/point_sampling_utils.py","file_url":"https://github.com/Ali2500/TarViS/blob/HEAD/tarvis/modelling/point_sampling_utils.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":"35425cfa0d3f34a7","code_sha256_prefix":"35425cfa0d3f34a7","mcp_get_code":{"code_sha256":"35425cfa0d3f34a7"}},{"arxiv_id":"2103.15734","arxiv_id_is_arxiv":true,"paper":"/paper/enhanced-boundary-learning-for-glass-like","title":"Enhanced Boundary Learning for Glass-like Object Segmentation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hehao13/EBLNet","path":"network/nn/contour_point_gcn.py","file_url":"https://github.com/hehao13/EBLNet/blob/HEAD/network/nn/contour_point_gcn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hehao13/EBLNet when it was checked","code_sha256":"43876e037ee3f9df","code_sha256_prefix":"43876e037ee3f9df","mcp_get_code":{"code_sha256":"43876e037ee3f9df"}},{"arxiv_id":"2103.06564","arxiv_id_is_arxiv":true,"paper":"/paper/pointflow-flowing-semantics-through-points","title":"PointFlow: Flowing Semantics Through Points for Aerial Image Segmentation","date":"2021-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lxtGH/PFSegNets","path":"network/nn/point_flow.py","file_url":"https://github.com/lxtGH/PFSegNets/blob/HEAD/network/nn/point_flow.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, lxtGH/PFSegNets when it was checked","code_sha256":"b99a89a4da0d0106","code_sha256_prefix":"b99a89a4da0d0106","mcp_get_code":{"code_sha256":"b99a89a4da0d0106"}},{"arxiv_id":"05519","arxiv_id_is_arxiv":false,"paper":null,"title":"id 05519 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MengLcool/SEGIC","path":"utils/loss_mask.py","file_url":"https://github.com/MengLcool/SEGIC/blob/HEAD/utils/loss_mask.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xzz2/pa-sam, and GitHub detected no licence in that repository when it was checked","code_sha256":"965de439489202e7","code_sha256_prefix":"965de439489202e7","mcp_get_code":{"code_sha256":"965de439489202e7"}}],"record_sha256":"14dea277d1514cbc0886a05296c8eca01e2a6b98d5745ae6ea65fdf25e2af76f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}