{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TZMBTAVY6ZS4B2ZDIWZMN5D3V2","short_pith_number":"pith:TZMBTAVY","schema_version":"1.0","canonical_sha256":"9e581982b8f665c0eb2345b2c6f47baeb9d19a4b7b8908a910f8f8ee8e9d2fe9","source":{"kind":"arxiv","id":"1707.08991","version":3},"attestation_state":"computed","paper":{"title":"Efficient Deformable Shape Correspondence via Kernel Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alex Bronstein, Amit Boyarski, Daniel Cremers, Emanuele Rodol\\`a, Matthias Vestner, Michael Bronstein, Or Litany, Ron Kimmel, Ron Slossberg, Tal Remez, Zorah L\\\"ahner","submitted_at":"2017-07-25T01:41:44Z","abstract_excerpt":"We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming. Surprisingly, in spite of the highly non-convex nature of the resulting quadratic assignment problem, our method converges to a semantically meaningful and continuous mapping in most of our experiments, and scales well. We prov"},"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":"1707.08991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-25T01:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"215eb6f8c944ca8b65c40f4303dfc97aa91258cbb6375ea96cbde04a1ffa0370","abstract_canon_sha256":"e55d5a8d102eeaf6ca0f94bc3349d627667b0ef04bd915a1ab27c03860e02a7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:08.950330Z","signature_b64":"eC4fpAR6WGl0gZs9K1Svf8So1gWpVSr4Z0ALajHXLodTksBIeTS+J57f1hB6j3G60yGcuABK/i3L9hHp5wHiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e581982b8f665c0eb2345b2c6f47baeb9d19a4b7b8908a910f8f8ee8e9d2fe9","last_reissued_at":"2026-05-18T00:35:08.949975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:08.949975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Deformable Shape Correspondence via Kernel Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alex Bronstein, Amit Boyarski, Daniel Cremers, Emanuele Rodol\\`a, Matthias Vestner, Michael Bronstein, Or Litany, Ron Kimmel, Ron Slossberg, Tal Remez, Zorah L\\\"ahner","submitted_at":"2017-07-25T01:41:44Z","abstract_excerpt":"We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming. Surprisingly, in spite of the highly non-convex nature of the resulting quadratic assignment problem, our method converges to a semantically meaningful and continuous mapping in most of our experiments, and scales well. We prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08991","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":""},"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":"1707.08991","created_at":"2026-05-18T00:35:08.950031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08991v3","created_at":"2026-05-18T00:35:08.950031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08991","created_at":"2026-05-18T00:35:08.950031+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZMBTAVY6ZS4","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZMBTAVY6ZS4B2ZD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZMBTAVY","created_at":"2026-05-18T12:31:46.661854+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/TZMBTAVY6ZS4B2ZDIWZMN5D3V2","json":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2.json","graph_json":"https://pith.science/api/pith-number/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/graph.json","events_json":"https://pith.science/api/pith-number/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/events.json","paper":"https://pith.science/paper/TZMBTAVY"},"agent_actions":{"view_html":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2","download_json":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2.json","view_paper":"https://pith.science/paper/TZMBTAVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08991&json=true","fetch_graph":"https://pith.science/api/pith-number/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/graph.json","fetch_events":"https://pith.science/api/pith-number/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/action/storage_attestation","attest_author":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/action/author_attestation","sign_citation":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/action/citation_signature","submit_replication":"https://pith.science/pith/TZMBTAVY6ZS4B2ZDIWZMN5D3V2/action/replication_record"}},"created_at":"2026-05-18T00:35:08.950031+00:00","updated_at":"2026-05-18T00:35:08.950031+00:00"}