{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PT4JOOKSIB7PDC5CCHRGXP6Z6Z","short_pith_number":"pith:PT4JOOKS","schema_version":"1.0","canonical_sha256":"7cf8973952407ef18ba211e26bbfd9f671e965c182e6568d530644774e7685d0","source":{"kind":"arxiv","id":"2001.10485","version":4},"attestation_state":"computed","paper":{"title":"Graph Metric Learning via Gershgorin Disc Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Gene Cheung, Wei Hu","submitted_at":"2020-01-28T17:44:01Z","abstract_excerpt":"We propose a fast general projection-free metric learning framework, where the minimization objective $\\min_{\\textbf{M} \\in \\mathcal{S}} Q(\\textbf{M})$ is a convex differentiable function of the metric matrix $\\textbf{M}$, and $\\textbf{M}$ resides in the set $\\mathcal{S}$ of generalized graph Laplacian matrices for connected graphs with positive edge weights and node degrees. Unlike low-rank metric matrices common in the literature, $\\mathcal{S}$ includes the important positive-diagonal-only matrices as a special case in the limit. The key idea for fast optimization is to rewrite the positive "},"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":"2001.10485","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-28T17:44:01Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"eb156ed7bbad48603fdd71f7928fa404b724dc0b9845b63964d785ccca724043","abstract_canon_sha256":"43dda2ef745e0347c681f1a9c516744b227d81e5e54d3eefa9fbecaed35e0415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:58.622865Z","signature_b64":"ioeOnyCY1vCDUUwUdyd/H3SqYxvE6UoB6LHPHMof2rAXkrvfPkv2xoG1tqv1cm6a6eaHniwE2y0GRDeOkGY2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf8973952407ef18ba211e26bbfd9f671e965c182e6568d530644774e7685d0","last_reissued_at":"2026-07-05T00:46:58.622400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:58.622400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Metric Learning via Gershgorin Disc Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Gene Cheung, Wei Hu","submitted_at":"2020-01-28T17:44:01Z","abstract_excerpt":"We propose a fast general projection-free metric learning framework, where the minimization objective $\\min_{\\textbf{M} \\in \\mathcal{S}} Q(\\textbf{M})$ is a convex differentiable function of the metric matrix $\\textbf{M}$, and $\\textbf{M}$ resides in the set $\\mathcal{S}$ of generalized graph Laplacian matrices for connected graphs with positive edge weights and node degrees. Unlike low-rank metric matrices common in the literature, $\\mathcal{S}$ includes the important positive-diagonal-only matrices as a special case in the limit. The key idea for fast optimization is to rewrite the positive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10485","kind":"arxiv","version":4},"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/2001.10485/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":"2001.10485","created_at":"2026-07-05T00:46:58.622461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.10485v4","created_at":"2026-07-05T00:46:58.622461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10485","created_at":"2026-07-05T00:46:58.622461+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT4JOOKSIB7P","created_at":"2026-07-05T00:46:58.622461+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT4JOOKSIB7PDC5C","created_at":"2026-07-05T00:46:58.622461+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT4JOOKS","created_at":"2026-07-05T00:46:58.622461+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/PT4JOOKSIB7PDC5CCHRGXP6Z6Z","json":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z.json","graph_json":"https://pith.science/api/pith-number/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/graph.json","events_json":"https://pith.science/api/pith-number/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/events.json","paper":"https://pith.science/paper/PT4JOOKS"},"agent_actions":{"view_html":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z","download_json":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z.json","view_paper":"https://pith.science/paper/PT4JOOKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.10485&json=true","fetch_graph":"https://pith.science/api/pith-number/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/action/storage_attestation","attest_author":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/action/author_attestation","sign_citation":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/action/citation_signature","submit_replication":"https://pith.science/pith/PT4JOOKSIB7PDC5CCHRGXP6Z6Z/action/replication_record"}},"created_at":"2026-07-05T00:46:58.622461+00:00","updated_at":"2026-07-05T00:46:58.622461+00:00"}