{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FCKHZJLYBOQWMVI4O5RE7WIFIV","short_pith_number":"pith:FCKHZJLY","schema_version":"1.0","canonical_sha256":"28947ca5780ba166551c77624fd9054576faebde039a71d049aece69020d4e19","source":{"kind":"arxiv","id":"2005.09194","version":1},"attestation_state":"computed","paper":{"title":"A Riemannian Primal-dual Algorithm Based on Proximal Operator and its Application in Metric Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baocheng Zhu, Lintao Ma, Shijun Wang, Yuan Qi","submitted_at":"2020-05-19T03:31:01Z","abstract_excerpt":"In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to optimize the primal and dual variables iteratively. In each optimization iteration, we employ a proximal operator to search optimal solution in the primal space. We prove convergence of the proposed algorithm and show its non-asymptotic convergence rate. By utilizing the proposed primal-dual optimization technique, we propose a novel metric learning algorithm wh"},"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":"2005.09194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2020-05-19T03:31:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2dbef840e07604b7f45109b4e93b0bfbe935c3291ede9682ec84645979888f38","abstract_canon_sha256":"b17521a6d521ed670eeb4d93d074b476a2e3d0109e5290c31dbe26d133a2384d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:47.815037Z","signature_b64":"IV3+jczx+7nZITlFjpg7ObjDoebxB+nkTt3+zsb170XDOlS1WNfOGrkExHQVAtyhLWxxFCitXwvKzXVyRkEkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28947ca5780ba166551c77624fd9054576faebde039a71d049aece69020d4e19","last_reissued_at":"2026-07-05T01:03:47.814604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:47.814604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Riemannian Primal-dual Algorithm Based on Proximal Operator and its Application in Metric Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baocheng Zhu, Lintao Ma, Shijun Wang, Yuan Qi","submitted_at":"2020-05-19T03:31:01Z","abstract_excerpt":"In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to optimize the primal and dual variables iteratively. In each optimization iteration, we employ a proximal operator to search optimal solution in the primal space. We prove convergence of the proposed algorithm and show its non-asymptotic convergence rate. By utilizing the proposed primal-dual optimization technique, we propose a novel metric learning algorithm wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09194","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/2005.09194/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":"2005.09194","created_at":"2026-07-05T01:03:47.814662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.09194v1","created_at":"2026-07-05T01:03:47.814662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09194","created_at":"2026-07-05T01:03:47.814662+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCKHZJLYBOQW","created_at":"2026-07-05T01:03:47.814662+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCKHZJLYBOQWMVI4","created_at":"2026-07-05T01:03:47.814662+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCKHZJLY","created_at":"2026-07-05T01:03:47.814662+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/FCKHZJLYBOQWMVI4O5RE7WIFIV","json":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV.json","graph_json":"https://pith.science/api/pith-number/FCKHZJLYBOQWMVI4O5RE7WIFIV/graph.json","events_json":"https://pith.science/api/pith-number/FCKHZJLYBOQWMVI4O5RE7WIFIV/events.json","paper":"https://pith.science/paper/FCKHZJLY"},"agent_actions":{"view_html":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV","download_json":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV.json","view_paper":"https://pith.science/paper/FCKHZJLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.09194&json=true","fetch_graph":"https://pith.science/api/pith-number/FCKHZJLYBOQWMVI4O5RE7WIFIV/graph.json","fetch_events":"https://pith.science/api/pith-number/FCKHZJLYBOQWMVI4O5RE7WIFIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV/action/storage_attestation","attest_author":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV/action/author_attestation","sign_citation":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV/action/citation_signature","submit_replication":"https://pith.science/pith/FCKHZJLYBOQWMVI4O5RE7WIFIV/action/replication_record"}},"created_at":"2026-07-05T01:03:47.814662+00:00","updated_at":"2026-07-05T01:03:47.814662+00:00"}