{"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":"/task/3d-dense-shape-correspondence","name":"3D Dense Shape Correspondence","slug":"3d-dense-shape-correspondence","description_markdown":"Finding a meaningful correspondence between two or more shapes is one of the most fundamental shape analysis tasks. The problem can be generally stated as: given input shapes S1,S2,...,SN, find a meaningful relation (or mapping) between their elements. Under different contexts, the problem has also been referred to as registration, alignment, or simply, matching. Shape correspondence is a key algorithmic component in tasks such as 3D scan alignment and space-time reconstruction, as well as an indispensable prerequisite in diverse applications including attribute transfer, shape interpolation, and statistical modeling.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":11,"papers_with_code":8,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/3d-dense-shape-correspondence-on-shrec-19","slug":"3d-dense-shape-correspondence-on-shrec-19","dataset":"SHREC'19","dataset_url":"/dataset/shrec-19","rows_in_archive":11,"metrics":["Euclidean Mean Error (EME)","Accuracy at 1%"],"first_row_in_archive_order":{"model":"Diffusion 3D Features (Zero-shot)","paper_title":"Diffusion 3D Features (Diff3F): Decorating Untextured Shapes with Distilled Semantic Features","paper_url":"/paper/diffusion-3d-features-diff3f-decorating","paper_date":"2023-11-28","arxiv_id":"2311.17024","code_links":[{"title":"niladridutt/Diffusion-3D-Features","url":"https://github.com/niladridutt/Diffusion-3D-Features"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-3d-features-diff3f-decorating#ran","syntology_url":"https://syntology.ai/paper/2311.17024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17024"}},"official":{"repos":["niladridutt/Diffusion-3D-Features"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/shrec-19","name":"SHREC'19","full_name":"SHREC'19 track Matching Humans with Different Connectivity","num_papers_in_archive":20},{"url":"/dataset/tosca","name":"TOSCA","full_name":"TOSCA high-resolution","num_papers_in_archive":4}],"subtasks":[],"parent_tasks":[{"url":"/task/3d-shape-representation","name":"3D Shape Representation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":11,"of":11,"of_with_code":8,"tagged_in_all":11,"counts":{"archive_papers_tagged":11,"with_a_code_link":8,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":11,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-elementary-structures-for-3d-shape","slug":"learning-elementary-structures-for-3d-shape","title":"Learning elementary structures for 3D shape generation and matching","date":"2019-08-13","arxiv_id":"1908.04725","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-elementary-structures-for-3d-shape#ran","syntology_url":"https://syntology.ai/paper/1908.04725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04725"}},"official":{"repos":["TheoDEPRELLE/AtlasNetV2"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/correspondence-learning-via-linearly","slug":"correspondence-learning-via-linearly","title":"Correspondence Learning via Linearly-invariant Embedding","date":"2020-10-25","arxiv_id":"2010.13136","repositories_listed":2,"syntology":null},{"url":"/paper/diffusion-3d-features-diff3f-decorating","slug":"diffusion-3d-features-diff3f-decorating","title":"Diffusion 3D Features (Diff3F): Decorating Untextured Shapes with Distilled Semantic Features","date":"2023-11-28","arxiv_id":"2311.17024","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-3d-features-diff3f-decorating#ran","syntology_url":"https://syntology.ai/paper/2311.17024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17024"}},"official":{"repos":["niladridutt/Diffusion-3D-Features"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/se-ornet-self-ensembling-orientation-aware","slug":"se-ornet-self-ensembling-orientation-aware","title":"SE-ORNet: Self-Ensembling Orientation-aware Network for Unsupervised Point Cloud Shape Correspondence","date":"2023-04-10","arxiv_id":"2304.05395","repositories_listed":1,"syntology":null},{"url":"/paper/roca-robust-cad-model-retrieval-and-alignment","slug":"roca-robust-cad-model-retrieval-and-alignment","title":"ROCA: Robust CAD Model Retrieval and Alignment from a Single Image","date":"2021-12-03","arxiv_id":"2112.01988","repositories_listed":1,"syntology":null},{"url":"/paper/dpc-unsupervised-deep-point-correspondence","slug":"dpc-unsupervised-deep-point-correspondence","title":"DPC: Unsupervised Deep Point Correspondence via Cross and Self Construction","date":"2021-10-16","arxiv_id":"2110.08636","repositories_listed":1,"syntology":null},{"url":"/paper/corrnet3d-unsupervised-end-to-end-learning-of","slug":"corrnet3d-unsupervised-end-to-end-learning-of","title":"CorrNet3D: Unsupervised End-to-end Learning of Dense Correspondence for 3D Point Clouds","date":"2020-12-31","arxiv_id":"2012.15638","repositories_listed":1,"syntology":null},{"url":"/paper/3d-coded-3d-correspondences-by-deep-1","slug":"3d-coded-3d-correspondences-by-deep-1","title":"3D-CODED : 3D Correspondences by Deep Deformation","date":"2018-06-13","arxiv_id":"1806.05228","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-template-assisted-point-cloud","slug":"unsupervised-template-assisted-point-cloud","title":"Unsupervised Template-assisted Point Cloud Shape Correspondence Network","date":"2024-03-25","arxiv_id":"2403.16412","repositories_listed":0,"syntology":null},{"url":null,"slug":"anisotropic-multi-scale-graph-convolutional","title":"Anisotropic Multi-Scale Graph Convolutional Network for Dense Shape Correspondence","date":"2022-10-17","arxiv_id":"2210.09466","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-meta-point-signature-learning-to-learn-3d","title":"3D Meta Point Signature: Learning to Learn 3D Point Signature for 3D Dense Shape Correspondence","date":"2020-10-21","arxiv_id":"2010.11159","repositories_listed":0,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/3d-dense-shape-correspondence/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/3d-dense-shape-correspondence/papers/ran/1","json":"/task/3d-dense-shape-correspondence/papers/ran/1.json","rows":2}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3e4f982a6b5c84a298798ce3f13844656b6c779a4d493c3704323c902a6a8ebe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}