{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MULLSY3WUXN7XX7KSOY755I36N","short_pith_number":"pith:MULLSY3W","schema_version":"1.0","canonical_sha256":"6516b96376a5dbfbdfea93b1fef51bf379414598601fdc06af81f0f5b7b3d4c4","source":{"kind":"arxiv","id":"1601.06070","version":3},"attestation_state":"computed","paper":{"title":"Efficient Globally Optimal 2D-to-3D Deformable Shape Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Cremers, Emanuele Rodol\\`a, Frank R. Schmidt, Michael M. Bronstein, Zorah L\\\"ahner","submitted_at":"2016-01-22T16:58:32Z","abstract_excerpt":"We propose the first algorithm for non-rigid 2D-to-3D shape matching, where the input is a 2D shape represented as a planar curve and a 3D shape represented as a surface; the output is a continuous curve on the surface. We cast the problem as finding the shortest circular path on the product 3-manifold of the surface and the curve. We prove that the optimal matching can be computed in polynomial time with a (worst-case) complexity of $O(mn^2\\log(n))$, where $m$ and $n$ denote the number of vertices on the template curve and the 3D shape respectively. We also demonstrate that in practice the ru"},"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":"1601.06070","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-22T16:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"8acb6c90f090e64854d6bae95df498f227548ee29513a9162e74a18dbe15daa3","abstract_canon_sha256":"27d7bc39a2b9460be5d80dabd5a040fd65bcc85d490d1cc40486820eb67c63bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:11.522735Z","signature_b64":"TYx45UlEKUVQJy+XrVGFv1bupfhqsKqtsg65f4fFBmsh/Pi1AWwfVkrn5xG4mEd8aLO7xLVpKVYQhE1J9QdxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6516b96376a5dbfbdfea93b1fef51bf379414598601fdc06af81f0f5b7b3d4c4","last_reissued_at":"2026-07-05T03:50:11.522239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:11.522239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Globally Optimal 2D-to-3D Deformable Shape Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Cremers, Emanuele Rodol\\`a, Frank R. Schmidt, Michael M. Bronstein, Zorah L\\\"ahner","submitted_at":"2016-01-22T16:58:32Z","abstract_excerpt":"We propose the first algorithm for non-rigid 2D-to-3D shape matching, where the input is a 2D shape represented as a planar curve and a 3D shape represented as a surface; the output is a continuous curve on the surface. We cast the problem as finding the shortest circular path on the product 3-manifold of the surface and the curve. We prove that the optimal matching can be computed in polynomial time with a (worst-case) complexity of $O(mn^2\\log(n))$, where $m$ and $n$ denote the number of vertices on the template curve and the 3D shape respectively. We also demonstrate that in practice the ru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06070","kind":"arxiv","version":3},"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/1601.06070/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":"1601.06070","created_at":"2026-07-05T03:50:11.522297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06070v3","created_at":"2026-07-05T03:50:11.522297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06070","created_at":"2026-07-05T03:50:11.522297+00:00"},{"alias_kind":"pith_short_12","alias_value":"MULLSY3WUXN7","created_at":"2026-07-05T03:50:11.522297+00:00"},{"alias_kind":"pith_short_16","alias_value":"MULLSY3WUXN7XX7K","created_at":"2026-07-05T03:50:11.522297+00:00"},{"alias_kind":"pith_short_8","alias_value":"MULLSY3W","created_at":"2026-07-05T03:50:11.522297+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/MULLSY3WUXN7XX7KSOY755I36N","json":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N.json","graph_json":"https://pith.science/api/pith-number/MULLSY3WUXN7XX7KSOY755I36N/graph.json","events_json":"https://pith.science/api/pith-number/MULLSY3WUXN7XX7KSOY755I36N/events.json","paper":"https://pith.science/paper/MULLSY3W"},"agent_actions":{"view_html":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N","download_json":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N.json","view_paper":"https://pith.science/paper/MULLSY3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06070&json=true","fetch_graph":"https://pith.science/api/pith-number/MULLSY3WUXN7XX7KSOY755I36N/graph.json","fetch_events":"https://pith.science/api/pith-number/MULLSY3WUXN7XX7KSOY755I36N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N/action/storage_attestation","attest_author":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N/action/author_attestation","sign_citation":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N/action/citation_signature","submit_replication":"https://pith.science/pith/MULLSY3WUXN7XX7KSOY755I36N/action/replication_record"}},"created_at":"2026-07-05T03:50:11.522297+00:00","updated_at":"2026-07-05T03:50:11.522297+00:00"}