{"kind":"paper","resolved_to":{"arxiv_id":"openreview_BzqkbJTsbq"},"have":"no_code","tier":"paper_only","absence_asserted":"for_this_paper_only","declared_repos":null,"note":"No: this paper is in the graph but none of its methods has a stored implementation.","name_competition":{"checked":["method_name","title_prefix","acronym_expansion"],"may_be_wrong_sense":true,"bearers_found":4,"served":{"arxiv_id":"openreview_BzqkbJTsbq","citations":null},"also_named":[{"arxiv_id":"2205.02101","title":"Dynamic Sparse R-CNN","citations":38,"named_by":["acronym_expansion"],"bearer_name":"Dynamic Proposal Generation (DPG)","ask_with":"have('2205.02101')"},{"arxiv_id":"2604.08423","title":"Synthetic Data for any Differentiable Target","citations":1,"named_by":["acronym_expansion"],"bearer_name":"Dataset Policy Gradient (DPG)","ask_with":"have('2604.08423')"},{"arxiv_id":"2609.27423","title":"Overlapping Visual Grouping Without Semantic Priors","citations":null,"named_by":["acronym_expansion"],"bearer_name":"Domain Parent Grouping (DPG)","ask_with":"have('2609.27423')"}],"verdict":"outranked","note":"'DPG' is ALSO the name of 'Dynamic Proposal Generation (DPG)', a method in 'Dynamic Sparse R-CNN' (arXiv:2205.02101, 38 citations), which is cited FAR more than the paper this answer is about (citations not recorded). This answer may be about the wrong DPG. If you meant the better-known one, ask again with that entry of `also_named`."},"query":"DPG","cost":"free"}