{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BTCNY6MTKNMLVEUTQV3E7XMRBB","short_pith_number":"pith:BTCNY6MT","schema_version":"1.0","canonical_sha256":"0cc4dc79935358ba929385764fdd91086997c1eb97f81070faf4fbdfb26f282c","source":{"kind":"arxiv","id":"2202.01537","version":1},"attestation_state":"computed","paper":{"title":"Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.CV","authors_text":"Benjamin Busam, Federico Tombari, Luca Cosmo, Mahdi Saleh, Nassir Navab, Shun-Cheng Wu","submitted_at":"2022-02-03T11:41:46Z","abstract_excerpt":"Shape matching has been a long-studied problem for the computer graphics and vision community. The objective is to predict a dense correspondence between meshes that have a certain degree of deformation. Existing methods either consider the local description of sampled points or discover correspondences based on global shape information. In this work, we investigate a hierarchical learning design, to which we incorporate local patch-level information and global shape-level structures. This flexible representation enables correspondence prediction and provides rich features for the matching sta"},"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":"2202.01537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-02-03T11:41:46Z","cross_cats_sorted":["cs.CG","cs.GR"],"title_canon_sha256":"b78ac1e596a679a369fc5cbcbf01cb142fbddca1e4dc5d188dd94d66d8741557","abstract_canon_sha256":"be1b55ba3eb351236068a0b140025e2612cb3ba1090e46ad76f6fb4761bdef80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:55.685247Z","signature_b64":"Bi8VfKis90EkfRyKBJkSCFompm/g6zTP9aDEooCUz2XeR5CI60dRY3RDMlu1ka9JK/ktkobUoKFoCJsRhap6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc4dc79935358ba929385764fdd91086997c1eb97f81070faf4fbdfb26f282c","last_reissued_at":"2026-07-05T03:53:55.684846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:55.684846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.CV","authors_text":"Benjamin Busam, Federico Tombari, Luca Cosmo, Mahdi Saleh, Nassir Navab, Shun-Cheng Wu","submitted_at":"2022-02-03T11:41:46Z","abstract_excerpt":"Shape matching has been a long-studied problem for the computer graphics and vision community. The objective is to predict a dense correspondence between meshes that have a certain degree of deformation. Existing methods either consider the local description of sampled points or discover correspondences based on global shape information. In this work, we investigate a hierarchical learning design, to which we incorporate local patch-level information and global shape-level structures. This flexible representation enables correspondence prediction and provides rich features for the matching sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01537","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/2202.01537/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":"2202.01537","created_at":"2026-07-05T03:53:55.684897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.01537v1","created_at":"2026-07-05T03:53:55.684897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01537","created_at":"2026-07-05T03:53:55.684897+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTCNY6MTKNML","created_at":"2026-07-05T03:53:55.684897+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTCNY6MTKNMLVEUT","created_at":"2026-07-05T03:53:55.684897+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTCNY6MT","created_at":"2026-07-05T03:53:55.684897+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/BTCNY6MTKNMLVEUTQV3E7XMRBB","json":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB.json","graph_json":"https://pith.science/api/pith-number/BTCNY6MTKNMLVEUTQV3E7XMRBB/graph.json","events_json":"https://pith.science/api/pith-number/BTCNY6MTKNMLVEUTQV3E7XMRBB/events.json","paper":"https://pith.science/paper/BTCNY6MT"},"agent_actions":{"view_html":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB","download_json":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB.json","view_paper":"https://pith.science/paper/BTCNY6MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.01537&json=true","fetch_graph":"https://pith.science/api/pith-number/BTCNY6MTKNMLVEUTQV3E7XMRBB/graph.json","fetch_events":"https://pith.science/api/pith-number/BTCNY6MTKNMLVEUTQV3E7XMRBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB/action/storage_attestation","attest_author":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB/action/author_attestation","sign_citation":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB/action/citation_signature","submit_replication":"https://pith.science/pith/BTCNY6MTKNMLVEUTQV3E7XMRBB/action/replication_record"}},"created_at":"2026-07-05T03:53:55.684897+00:00","updated_at":"2026-07-05T03:53:55.684897+00:00"}