{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:67DI75RC7GESP7EOUB6B6FJKCJ","short_pith_number":"pith:67DI75RC","schema_version":"1.0","canonical_sha256":"f7c68ff622f98927fc8ea07c1f152a1274049dcc0226d5cce97a9fd7deb2bc52","source":{"kind":"arxiv","id":"1412.6452","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic Robustness for Learning via $(\\epsilon, \\gamma, \\tau)$-Good Similarity Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amaury Habrard, \\'Eric Gaussier, Marc Sebban, Maria-Irina Nicolae, Massih-Reza Amini","submitted_at":"2014-12-19T17:43:26Z","abstract_excerpt":"The notion of metric plays a key role in machine learning problems such as classification, clustering or ranking. However, it is worth noting that there is a severe lack of theoretical guarantees that can be expected on the generalization capacity of the classifier associated to a given metric. The theoretical framework of $(\\epsilon, \\gamma, \\tau)$-good similarity functions (Balcan et al., 2008) has been one of the first attempts to draw a link between the properties of a similarity function and those of a linear classifier making use of it. In this paper, we extend and complete this theory b"},"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":"1412.6452","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-19T17:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"876aee78225e7ec5cc8e3f690579ae732e5d6c0e3daf4c063f242e05562fda08","abstract_canon_sha256":"2cb3f2f8735b834b3c6ad4e230222a30b3af96ace5b7d901cab7ac8bfc229d32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:52.563923Z","signature_b64":"QiQ44yddmbWZZSk0bJjOR+y2sFFPaTwChadjHvjf99GN9RfagMr+eCy6R63G/UQGx020aADJLY4NA15mzqe7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c68ff622f98927fc8ea07c1f152a1274049dcc0226d5cce97a9fd7deb2bc52","last_reissued_at":"2026-05-18T02:19:52.563373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:52.563373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Robustness for Learning via $(\\epsilon, \\gamma, \\tau)$-Good Similarity Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amaury Habrard, \\'Eric Gaussier, Marc Sebban, Maria-Irina Nicolae, Massih-Reza Amini","submitted_at":"2014-12-19T17:43:26Z","abstract_excerpt":"The notion of metric plays a key role in machine learning problems such as classification, clustering or ranking. However, it is worth noting that there is a severe lack of theoretical guarantees that can be expected on the generalization capacity of the classifier associated to a given metric. The theoretical framework of $(\\epsilon, \\gamma, \\tau)$-good similarity functions (Balcan et al., 2008) has been one of the first attempts to draw a link between the properties of a similarity function and those of a linear classifier making use of it. In this paper, we extend and complete this theory b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6452","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":""},"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":"1412.6452","created_at":"2026-05-18T02:19:52.563476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6452v3","created_at":"2026-05-18T02:19:52.563476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6452","created_at":"2026-05-18T02:19:52.563476+00:00"},{"alias_kind":"pith_short_12","alias_value":"67DI75RC7GES","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"67DI75RC7GESP7EO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"67DI75RC","created_at":"2026-05-18T12:28:16.859392+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/67DI75RC7GESP7EOUB6B6FJKCJ","json":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ.json","graph_json":"https://pith.science/api/pith-number/67DI75RC7GESP7EOUB6B6FJKCJ/graph.json","events_json":"https://pith.science/api/pith-number/67DI75RC7GESP7EOUB6B6FJKCJ/events.json","paper":"https://pith.science/paper/67DI75RC"},"agent_actions":{"view_html":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ","download_json":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ.json","view_paper":"https://pith.science/paper/67DI75RC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6452&json=true","fetch_graph":"https://pith.science/api/pith-number/67DI75RC7GESP7EOUB6B6FJKCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/67DI75RC7GESP7EOUB6B6FJKCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ/action/storage_attestation","attest_author":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ/action/author_attestation","sign_citation":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ/action/citation_signature","submit_replication":"https://pith.science/pith/67DI75RC7GESP7EOUB6B6FJKCJ/action/replication_record"}},"created_at":"2026-05-18T02:19:52.563476+00:00","updated_at":"2026-05-18T02:19:52.563476+00:00"}