{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:433T5HBUWVHSTLVBZKVTJHKXUP","short_pith_number":"pith:433T5HBU","canonical_record":{"source":{"id":"1901.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T06:28:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac8278d25f1a73435dd4ebb59ef225d4e51a72e40a4a376ad3ba1993905b0325","abstract_canon_sha256":"dca7abb5756a21a4eeb58ebd487254feb2eb9d7ca544dc57e6944e1b2aa1c67e"},"schema_version":"1.0"},"canonical_sha256":"e6f73e9c34b54f29aea1caab349d57a3d6e43feae9e1c7ff91e5ba708291f06a","source":{"kind":"arxiv","id":"1901.03031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03031","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03031v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03031","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"433T5HBUWVHS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"433T5HBUWVHSTLVB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"433T5HBU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:433T5HBUWVHSTLVBZKVTJHKXUP","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T06:28:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac8278d25f1a73435dd4ebb59ef225d4e51a72e40a4a376ad3ba1993905b0325","abstract_canon_sha256":"dca7abb5756a21a4eeb58ebd487254feb2eb9d7ca544dc57e6944e1b2aa1c67e"},"schema_version":"1.0"},"canonical_sha256":"e6f73e9c34b54f29aea1caab349d57a3d6e43feae9e1c7ff91e5ba708291f06a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.766808Z","signature_b64":"B16C4UbvjqVVKrhOvuTVm1GedfJYYEXIrYbHfyQx/+68zIcPJFRS9+DUHJeMN5y3eghL6tbeEPgmD4eYwOEAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6f73e9c34b54f29aea1caab349d57a3d6e43feae9e1c7ff91e5ba708291f06a","last_reissued_at":"2026-05-17T23:56:35.766282Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.766282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03031","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLNoKMkGA/08OcCjiSjjBhM+A23YmdcLbtfsAcyKCGKebOCAnpLs9slJRcphjynnNQ3YmdTdUJ5Twr5ii9L5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:47:48.289568Z"},"content_sha256":"5c51e01439044cca131b7682d5e3fdd620b24b7ba001691f44b345ad829e7b12","schema_version":"1.0","event_id":"sha256:5c51e01439044cca131b7682d5e3fdd620b24b7ba001691f44b345ad829e7b12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:433T5HBUWVHSTLVBZKVTJHKXUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-feature Distance Metric Learning for Non-rigid 3D Shape Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Haohao Li, Huibing Wang, Xianping Fu","submitted_at":"2019-01-10T06:28:16Z","abstract_excerpt":"In the past decades, feature-learning-based 3D shape retrieval approaches have been received widespread attention in the computer graphic community. These approaches usually explored the hand-crafted distance metric or conventional distance metric learning methods to compute the similarity of the single feature. The single feature always contains onefold geometric information, which cannot characterize the 3D shapes well. Therefore, the multiple features should be used for the retrieval task to overcome the limitation of single feature and further improve the performance. However, most convent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03031","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4SCmN3FJvPpKkoKJfEnl5dJcsVxjnuBCoYetfupvyCB45NDbLugUzRiiVlknEskcfTs1Y3B1vdKm6BpIq7sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:47:48.290245Z"},"content_sha256":"e73fa443bbb8f27abc8e7ca0c159b9aa80ccc00641d959fb1f3945181edab967","schema_version":"1.0","event_id":"sha256:e73fa443bbb8f27abc8e7ca0c159b9aa80ccc00641d959fb1f3945181edab967"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/433T5HBUWVHSTLVBZKVTJHKXUP/bundle.json","state_url":"https://pith.science/pith/433T5HBUWVHSTLVBZKVTJHKXUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/433T5HBUWVHSTLVBZKVTJHKXUP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:47:48Z","links":{"resolver":"https://pith.science/pith/433T5HBUWVHSTLVBZKVTJHKXUP","bundle":"https://pith.science/pith/433T5HBUWVHSTLVBZKVTJHKXUP/bundle.json","state":"https://pith.science/pith/433T5HBUWVHSTLVBZKVTJHKXUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/433T5HBUWVHSTLVBZKVTJHKXUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:433T5HBUWVHSTLVBZKVTJHKXUP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dca7abb5756a21a4eeb58ebd487254feb2eb9d7ca544dc57e6944e1b2aa1c67e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T06:28:16Z","title_canon_sha256":"ac8278d25f1a73435dd4ebb59ef225d4e51a72e40a4a376ad3ba1993905b0325"},"schema_version":"1.0","source":{"id":"1901.03031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03031","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03031v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03031","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"433T5HBUWVHS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"433T5HBUWVHSTLVB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"433T5HBU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e73fa443bbb8f27abc8e7ca0c159b9aa80ccc00641d959fb1f3945181edab967","target":"graph","created_at":"2026-05-17T23:56:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the past decades, feature-learning-based 3D shape retrieval approaches have been received widespread attention in the computer graphic community. These approaches usually explored the hand-crafted distance metric or conventional distance metric learning methods to compute the similarity of the single feature. The single feature always contains onefold geometric information, which cannot characterize the 3D shapes well. Therefore, the multiple features should be used for the retrieval task to overcome the limitation of single feature and further improve the performance. However, most convent","authors_text":"Haohao Li, Huibing Wang, Xianping Fu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T06:28:16Z","title":"Multi-feature Distance Metric Learning for Non-rigid 3D Shape Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03031","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c51e01439044cca131b7682d5e3fdd620b24b7ba001691f44b345ad829e7b12","target":"record","created_at":"2026-05-17T23:56:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dca7abb5756a21a4eeb58ebd487254feb2eb9d7ca544dc57e6944e1b2aa1c67e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T06:28:16Z","title_canon_sha256":"ac8278d25f1a73435dd4ebb59ef225d4e51a72e40a4a376ad3ba1993905b0325"},"schema_version":"1.0","source":{"id":"1901.03031","kind":"arxiv","version":1}},"canonical_sha256":"e6f73e9c34b54f29aea1caab349d57a3d6e43feae9e1c7ff91e5ba708291f06a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6f73e9c34b54f29aea1caab349d57a3d6e43feae9e1c7ff91e5ba708291f06a","first_computed_at":"2026-05-17T23:56:35.766282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.766282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B16C4UbvjqVVKrhOvuTVm1GedfJYYEXIrYbHfyQx/+68zIcPJFRS9+DUHJeMN5y3eghL6tbeEPgmD4eYwOEAAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.766808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c51e01439044cca131b7682d5e3fdd620b24b7ba001691f44b345ad829e7b12","sha256:e73fa443bbb8f27abc8e7ca0c159b9aa80ccc00641d959fb1f3945181edab967"],"state_sha256":"bc2ac498c641ec8c4dbe98b2b66da0f07da008994952cf2d3b626186bb777008"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmKBkLXlwVKnkKg7KGDPB5cFVCJOkOQ/qcaMu+qRHUrDBUx4YTupztdLqEjCWN++gUx9+k+5ZEYDFXg99jCKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:47:48.294135Z","bundle_sha256":"d29bbbbffdaba1eb68a332a395f4fb08ba90b12df42b68e21c7f965b86c543c0"}}