{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XNBPKDAN3UFGKINTC74SO3JIBR","short_pith_number":"pith:XNBPKDAN","schema_version":"1.0","canonical_sha256":"bb42f50c0ddd0a6521b317f9276d280c4fede96ae6a70fb762f3b728c6cf0392","source":{"kind":"arxiv","id":"2305.09274","version":3},"attestation_state":"computed","paper":{"title":"ReMatching: Low-Resolution Representations for Scalable Shape Correspondence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Daniele Baieri, Emanuele Rodol\\`a, Filippo Maggioli, Simone Melzi","submitted_at":"2023-05-16T08:28:28Z","abstract_excerpt":"We introduce \\emph{ReMatching}, a novel shape correspondence solution based on the functional maps framework. Our method, by exploiting a new and appropriate \\emph{re}-meshing paradigm, can target shape-\\emph{matching} tasks even on meshes counting millions of vertices, where the original functional maps does not apply or requires a massive computational cost. The core of our procedure is a time-efficient remeshing algorithm which constructs a low-resolution geometry while acting conservatively on the original topology and metric. These properties allow translating the functional maps optimiza"},"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":"2305.09274","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2023-05-16T08:28:28Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"108d85422942d1be4e8ae3506cbcf4298fe30d5ebd192a81f6d95c69a339bceb","abstract_canon_sha256":"f63434b92c41c96b658b90f58dfa39bd93e28c3b920241e31d13e793ea7c3e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:17.801015Z","signature_b64":"74oYLvtd0qN3fEYbh9SmbG0MpO8D8c47jFIK6j03gWdSYJom4qi5ThayLy4hk9YL3d8z8Q8H/YreNVS9eVRCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb42f50c0ddd0a6521b317f9276d280c4fede96ae6a70fb762f3b728c6cf0392","last_reissued_at":"2026-07-05T10:30:17.800472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:17.800472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReMatching: Low-Resolution Representations for Scalable Shape Correspondence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Daniele Baieri, Emanuele Rodol\\`a, Filippo Maggioli, Simone Melzi","submitted_at":"2023-05-16T08:28:28Z","abstract_excerpt":"We introduce \\emph{ReMatching}, a novel shape correspondence solution based on the functional maps framework. Our method, by exploiting a new and appropriate \\emph{re}-meshing paradigm, can target shape-\\emph{matching} tasks even on meshes counting millions of vertices, where the original functional maps does not apply or requires a massive computational cost. The core of our procedure is a time-efficient remeshing algorithm which constructs a low-resolution geometry while acting conservatively on the original topology and metric. These properties allow translating the functional maps optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09274","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/2305.09274/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":"2305.09274","created_at":"2026-07-05T10:30:17.800535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.09274v3","created_at":"2026-07-05T10:30:17.800535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09274","created_at":"2026-07-05T10:30:17.800535+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNBPKDAN3UFG","created_at":"2026-07-05T10:30:17.800535+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNBPKDAN3UFGKINT","created_at":"2026-07-05T10:30:17.800535+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNBPKDAN","created_at":"2026-07-05T10:30:17.800535+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/XNBPKDAN3UFGKINTC74SO3JIBR","json":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR.json","graph_json":"https://pith.science/api/pith-number/XNBPKDAN3UFGKINTC74SO3JIBR/graph.json","events_json":"https://pith.science/api/pith-number/XNBPKDAN3UFGKINTC74SO3JIBR/events.json","paper":"https://pith.science/paper/XNBPKDAN"},"agent_actions":{"view_html":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR","download_json":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR.json","view_paper":"https://pith.science/paper/XNBPKDAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.09274&json=true","fetch_graph":"https://pith.science/api/pith-number/XNBPKDAN3UFGKINTC74SO3JIBR/graph.json","fetch_events":"https://pith.science/api/pith-number/XNBPKDAN3UFGKINTC74SO3JIBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR/action/storage_attestation","attest_author":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR/action/author_attestation","sign_citation":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR/action/citation_signature","submit_replication":"https://pith.science/pith/XNBPKDAN3UFGKINTC74SO3JIBR/action/replication_record"}},"created_at":"2026-07-05T10:30:17.800535+00:00","updated_at":"2026-07-05T10:30:17.800535+00:00"}