{"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":"/paper/improved-algorithm-and-bounds-for-successive","title":"Improved Algorithm and Bounds for Successive Projection","arxiv_id":"2403.11013","date":"2024-03-16","proceeding":null,"authors":["Jiashun Jin","Zheng Tracy Ke","Gabriel Moryoussef","Jiajun Tang","Jingming Wang"],"abstract":"Given a $K$-vertex simplex in a $d$-dimensional space, suppose we measure $n$ points on the simplex with noise (hence, some of the observed points fall outside the simplex). Vertex hunting is the problem of estimating the $K$ vertices of the simplex. A popular vertex hunting algorithm is successive projection algorithm (SPA). However, SPA is observed to perform unsatisfactorily under strong noise or outliers. We propose pseudo-point SPA (pp-SPA). It uses a projection step and a denoise step to generate pseudo-points and feed them into SPA for vertex hunting. We derive error bounds for pp-SPA, leveraging on extreme value theory of (possibly) high-dimensional random vectors. The results suggest that pp-SPA has faster rates and better numerical performances than SPA. Our analysis includes an improved non-asymptotic bound for the original SPA, which is of independent interest.","url_abs":"https://arxiv.org/abs/2403.11013v1","url_pdf":"https://arxiv.org/pdf/2403.11013v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"improved-algorithm-and-bounds-for-successive","repo_url":"https://github.com/gabriel78110/vertexhunting","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"single-particle-analysis","task_name":"Single Particle Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2403.11013","atlas_url":"https://app.syntology.ai/?focus=2403.11013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11013"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2403.11013"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2403.11013"},"call":"get_harvested_code_for_paper(arxiv_id=\"2403.11013\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2403.11013"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2403.11013\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2403.11013"},"call":"get_concepts_for_paper(arxiv_id=\"2403.11013\")"}],"by_repo":[{"repo":"gabriel78110/vertexhunting","kind":"official","samples":7,"ran":6,"instrument":1,"unverified":1}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2403.11013.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2403.11013.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/gabriel78110/vertexhunting","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":1,"ran_honours":3,"ran":2,"unverified":1},"n_samples":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":7,"ran":6,"n_ran_checked":5,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":7,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"96e6533f255346ef","code_sha256_prefix":"96e6533f255346ef","entry":"SuccessiveProj","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"spa.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/spa.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"R:ndarray/2/float, K:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"96e6533f255346ef"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"96e6533f255346ef"}},{"code_sha256":"940a14d8fe20cac3","code_sha256_prefix":"940a14d8fe20cac3","entry":"find_max_distance_to_average","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"utils.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"points:ndarray/2/float","fixture_out_type":"float64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"940a14d8fe20cac3"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"940a14d8fe20cac3"}},{"code_sha256":"87ba05ced5698a2d","code_sha256_prefix":"87ba05ced5698a2d","entry":"find_min_distance_to_average","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"utils.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"points:ndarray/2/float","fixture_out_type":"float32","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"87ba05ced5698a2d"}},{"code_sha256":"40d9c8caedee04fe","code_sha256_prefix":"40d9c8caedee04fe","entry":"get_projected_points","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"projection.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/projection.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"samples:ndarray/2/float, K:int/0/int, return_X:bool/0/bool, low_dim:bool/0/bool","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"40d9c8caedee04fe"}},{"code_sha256":"77e58ba613633c6d","code_sha256_prefix":"77e58ba613633c6d","entry":"get_sample","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"vertexH.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/vertexH.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"N_sample:int/0/int, vertex:ndarray/2/float, pure_nodes:int/0/int, sigma:float/0/float, d:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-sample","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"77e58ba613633c6d"}},{"code_sha256":"ba597b560b40e2ce","code_sha256_prefix":"ba597b560b40e2ce","entry":"max_pairwise_distance","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"vertexH.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/vertexH.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"arr:ndarray/2/float","fixture_out_type":"float64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"ba597b560b40e2ce"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"ba597b560b40e2ce"}},{"code_sha256":"3a9a5427e96c2ed7","code_sha256_prefix":"3a9a5427e96c2ed7","entry":"runif_in_simplex","repo":"gabriel78110/vertexhunting","repo_kind":"official","path":"vertexH.py","file_url":"https://github.com/gabriel78110/vertexhunting/blob/HEAD/vertexH.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gabriel78110/vertexhunting when it was checked","mcp_get_code":{"code_sha256":"3a9a5427e96c2ed7"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2c8b9734293f3de3ec0dc71a6baa1b90c07065707d942ec9ae90c430f74a83af","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}