{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZVHQPC72E44JTYEIDD44M7NRWD","short_pith_number":"pith:ZVHQPC72","schema_version":"1.0","canonical_sha256":"cd4f078bfa273899e08818f9c67db1b0cd50094f836350caac874d0368d3919b","source":{"kind":"arxiv","id":"2011.13076","version":1},"attestation_state":"computed","paper":{"title":"Non-Rigid Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Alex Bronstein, Daniel Cremers, Emanuele Rodol\\`a, Michael Bronstein, Or Litany","submitted_at":"2020-11-26T00:32:30Z","abstract_excerpt":"Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2011.13076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T00:32:30Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"8ab9602c55c21f5f88ac2cf747deb937d93f41bbb5c9b08fd6649f52579a734d","abstract_canon_sha256":"44e13fc299033eea91c52cb440ce97a18578f76f6836db160f6f71902ab5e880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:50.446872Z","signature_b64":"XY1zJiPtZ3q54V+8v6W9v7yTWMssuMS/71YM8/yXMaIVGgEgtVL0dDmn6H9J8DD7+3+Qtbsos3/Hhmxvr8B8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4f078bfa273899e08818f9c67db1b0cd50094f836350caac874d0368d3919b","last_reissued_at":"2026-07-05T01:54:50.446419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:50.446419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Rigid Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Alex Bronstein, Daniel Cremers, Emanuele Rodol\\`a, Michael Bronstein, Or Litany","submitted_at":"2020-11-26T00:32:30Z","abstract_excerpt":"Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13076","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.13076/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.13076","created_at":"2026-07-05T01:54:50.446484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.13076v1","created_at":"2026-07-05T01:54:50.446484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13076","created_at":"2026-07-05T01:54:50.446484+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVHQPC72E44J","created_at":"2026-07-05T01:54:50.446484+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVHQPC72E44JTYEI","created_at":"2026-07-05T01:54:50.446484+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVHQPC72","created_at":"2026-07-05T01:54:50.446484+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD","json":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD.json","graph_json":"https://pith.science/api/pith-number/ZVHQPC72E44JTYEIDD44M7NRWD/graph.json","events_json":"https://pith.science/api/pith-number/ZVHQPC72E44JTYEIDD44M7NRWD/events.json","paper":"https://pith.science/paper/ZVHQPC72"},"agent_actions":{"view_html":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD","download_json":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD.json","view_paper":"https://pith.science/paper/ZVHQPC72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.13076&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVHQPC72E44JTYEIDD44M7NRWD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVHQPC72E44JTYEIDD44M7NRWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD/action/storage_attestation","attest_author":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD/action/author_attestation","sign_citation":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD/action/citation_signature","submit_replication":"https://pith.science/pith/ZVHQPC72E44JTYEIDD44M7NRWD/action/replication_record"}},"created_at":"2026-07-05T01:54:50.446484+00:00","updated_at":"2026-07-05T01:54:50.446484+00:00"}