{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TIRO63EVYNPSGMJXWEVA66C6MG","short_pith_number":"pith:TIRO63EV","schema_version":"1.0","canonical_sha256":"9a22ef6c95c35f233137b12a0f785e619d67c70cc56170fd53bd032d68c0ae2c","source":{"kind":"arxiv","id":"1502.00363","version":1},"attestation_state":"computed","paper":{"title":"Iterated Support Vector Machines for Distance Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"David Zhang, Deyu Meng, Faqiang Wang, Lei Zhang, Liang Lin, Wangmeng Zuo, Yuchi Huang","submitted_at":"2015-02-02T05:30:44Z","abstract_excerpt":"Distance metric learning aims to learn from the given training data a valid distance metric, with which the similarity between data samples can be more effectively evaluated for classification. Metric learning is often formulated as a convex or nonconvex optimization problem, while many existing metric learning algorithms become inefficient for large scale problems. In this paper, we formulate metric learning as a kernel classification problem, and solve it by iterated training of support vector machines (SVM). The new formulation is easy to implement, efficient in training, and tractable for "},"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":"1502.00363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-02T05:30:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"9a8f80b42d25af4d1de56b1480aeb711eca4ef10ae5b6b64457c71c7257e7f91","abstract_canon_sha256":"217cee59734b3d6c9131e4f776799e9dbbe5aeb737fbe21e41d02a6d6333e4f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.163778Z","signature_b64":"aEFYIrS6JqMUb3t9QB50Jzg3m54iMyQBHKXjimPMa0sCcRFq0j7YXDV5pCw/bS/AH+FqhtHhEcnz5IEtor24BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a22ef6c95c35f233137b12a0f785e619d67c70cc56170fd53bd032d68c0ae2c","last_reissued_at":"2026-05-18T02:28:06.163115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.163115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterated Support Vector Machines for Distance Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"David Zhang, Deyu Meng, Faqiang Wang, Lei Zhang, Liang Lin, Wangmeng Zuo, Yuchi Huang","submitted_at":"2015-02-02T05:30:44Z","abstract_excerpt":"Distance metric learning aims to learn from the given training data a valid distance metric, with which the similarity between data samples can be more effectively evaluated for classification. Metric learning is often formulated as a convex or nonconvex optimization problem, while many existing metric learning algorithms become inefficient for large scale problems. In this paper, we formulate metric learning as a kernel classification problem, and solve it by iterated training of support vector machines (SVM). The new formulation is easy to implement, efficient in training, and tractable for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00363","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00363","created_at":"2026-05-18T02:28:06.163207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00363v1","created_at":"2026-05-18T02:28:06.163207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00363","created_at":"2026-05-18T02:28:06.163207+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIRO63EVYNPS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIRO63EVYNPSGMJX","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIRO63EV","created_at":"2026-05-18T12:29:42.218222+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/TIRO63EVYNPSGMJXWEVA66C6MG","json":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG.json","graph_json":"https://pith.science/api/pith-number/TIRO63EVYNPSGMJXWEVA66C6MG/graph.json","events_json":"https://pith.science/api/pith-number/TIRO63EVYNPSGMJXWEVA66C6MG/events.json","paper":"https://pith.science/paper/TIRO63EV"},"agent_actions":{"view_html":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG","download_json":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG.json","view_paper":"https://pith.science/paper/TIRO63EV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00363&json=true","fetch_graph":"https://pith.science/api/pith-number/TIRO63EVYNPSGMJXWEVA66C6MG/graph.json","fetch_events":"https://pith.science/api/pith-number/TIRO63EVYNPSGMJXWEVA66C6MG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG/action/storage_attestation","attest_author":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG/action/author_attestation","sign_citation":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG/action/citation_signature","submit_replication":"https://pith.science/pith/TIRO63EVYNPSGMJXWEVA66C6MG/action/replication_record"}},"created_at":"2026-05-18T02:28:06.163207+00:00","updated_at":"2026-05-18T02:28:06.163207+00:00"}