{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IMXRBASBSKZRJLHLW5HDNLANZA","short_pith_number":"pith:IMXRBASB","canonical_record":{"source":{"id":"1702.01293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-04T14:33:16Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"571a75e654e2a30672c9b852f3f5daac2bf984160c03a7e2d1bb75be3bfdb1a7","abstract_canon_sha256":"0af2974eebb3f631efaa8223ea68efcfd9358032736ec23af4f626855758905a"},"schema_version":"1.0"},"canonical_sha256":"432f10824192b314acebb74e36ac0dc800edda349130ff7414201e533897c0c2","source":{"kind":"arxiv","id":"1702.01293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01293","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01293v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01293","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"IMXRBASBSKZR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IMXRBASBSKZRJLHL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IMXRBASB","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IMXRBASBSKZRJLHLW5HDNLANZA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-04T14:33:16Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"571a75e654e2a30672c9b852f3f5daac2bf984160c03a7e2d1bb75be3bfdb1a7","abstract_canon_sha256":"0af2974eebb3f631efaa8223ea68efcfd9358032736ec23af4f626855758905a"},"schema_version":"1.0"},"canonical_sha256":"432f10824192b314acebb74e36ac0dc800edda349130ff7414201e533897c0c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.915970Z","signature_b64":"czlKdadJba9DEJ2W/ihYDtR9bmoKpVwl7zE4g2gXnpPu1TBQO7ZKH2nNsTSeW6UkCAVEHY3uJspHx1MA1Z4FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"432f10824192b314acebb74e36ac0dc800edda349130ff7414201e533897c0c2","last_reissued_at":"2026-05-18T00:51:23.915304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.915304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01293","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-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOHmjghIVOfHKoC2vbNwa+Y4Y6EOimAfptW6XWbApbzNu5i1KbCNK61ujObPhXWUtQdjQ0OXbU7ZCG44SjUnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:09:36.310128Z"},"content_sha256":"0ecff27b982db7d1474c189ddab7a0bf76b4fd223856650e5a8b6f4c061229ac","schema_version":"1.0","event_id":"sha256:0ecff27b982db7d1474c189ddab7a0bf76b4fd223856650e5a8b6f4c061229ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IMXRBASBSKZRJLHLW5HDNLANZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latent Hinge-Minimax Risk Minimization for Inference from a Small Number of Training Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Dolev Raviv, Margarita Osadchy","submitted_at":"2017-02-04T14:33:16Z","abstract_excerpt":"Deep Learning (DL) methods show very good performance when trained on large, balanced data sets. However, many practical problems involve imbalanced data sets, or/and classes with a small number of training samples. The performance of DL methods as well as more traditional classifiers drops significantly in such settings. Most of the existing solutions for imbalanced problems focus on customizing the data for training. A more principled solution is to use mixed Hinge-Minimax risk [19] specifically designed to solve binary problems with imbalanced training sets. Here we propose a Latent Hinge M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01293","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-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of5KliQDD72umsPFa/zl/vK0mbN1rZyAEvHmPrkzC3S0EfWZh7/MFrtetDeAWkYHXXlsuQMCYMmzDlVoI8jaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:09:36.310495Z"},"content_sha256":"1c139f30c679996781b8acad3380fab26a242802e1c4116e88806e3b62c9f358","schema_version":"1.0","event_id":"sha256:1c139f30c679996781b8acad3380fab26a242802e1c4116e88806e3b62c9f358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMXRBASBSKZRJLHLW5HDNLANZA/bundle.json","state_url":"https://pith.science/pith/IMXRBASBSKZRJLHLW5HDNLANZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMXRBASBSKZRJLHLW5HDNLANZA/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-22T15:09:36Z","links":{"resolver":"https://pith.science/pith/IMXRBASBSKZRJLHLW5HDNLANZA","bundle":"https://pith.science/pith/IMXRBASBSKZRJLHLW5HDNLANZA/bundle.json","state":"https://pith.science/pith/IMXRBASBSKZRJLHLW5HDNLANZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMXRBASBSKZRJLHLW5HDNLANZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IMXRBASBSKZRJLHLW5HDNLANZA","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":"0af2974eebb3f631efaa8223ea68efcfd9358032736ec23af4f626855758905a","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-04T14:33:16Z","title_canon_sha256":"571a75e654e2a30672c9b852f3f5daac2bf984160c03a7e2d1bb75be3bfdb1a7"},"schema_version":"1.0","source":{"id":"1702.01293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01293","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01293v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01293","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"IMXRBASBSKZR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IMXRBASBSKZRJLHL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IMXRBASB","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1c139f30c679996781b8acad3380fab26a242802e1c4116e88806e3b62c9f358","target":"graph","created_at":"2026-05-18T00:51:23Z","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":"Deep Learning (DL) methods show very good performance when trained on large, balanced data sets. However, many practical problems involve imbalanced data sets, or/and classes with a small number of training samples. The performance of DL methods as well as more traditional classifiers drops significantly in such settings. Most of the existing solutions for imbalanced problems focus on customizing the data for training. A more principled solution is to use mixed Hinge-Minimax risk [19] specifically designed to solve binary problems with imbalanced training sets. Here we propose a Latent Hinge M","authors_text":"Dolev Raviv, Margarita Osadchy","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-04T14:33:16Z","title":"Latent Hinge-Minimax Risk Minimization for Inference from a Small Number of Training Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01293","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:0ecff27b982db7d1474c189ddab7a0bf76b4fd223856650e5a8b6f4c061229ac","target":"record","created_at":"2026-05-18T00:51:23Z","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":"0af2974eebb3f631efaa8223ea68efcfd9358032736ec23af4f626855758905a","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-04T14:33:16Z","title_canon_sha256":"571a75e654e2a30672c9b852f3f5daac2bf984160c03a7e2d1bb75be3bfdb1a7"},"schema_version":"1.0","source":{"id":"1702.01293","kind":"arxiv","version":1}},"canonical_sha256":"432f10824192b314acebb74e36ac0dc800edda349130ff7414201e533897c0c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"432f10824192b314acebb74e36ac0dc800edda349130ff7414201e533897c0c2","first_computed_at":"2026-05-18T00:51:23.915304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:23.915304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"czlKdadJba9DEJ2W/ihYDtR9bmoKpVwl7zE4g2gXnpPu1TBQO7ZKH2nNsTSeW6UkCAVEHY3uJspHx1MA1Z4FCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:23.915970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ecff27b982db7d1474c189ddab7a0bf76b4fd223856650e5a8b6f4c061229ac","sha256:1c139f30c679996781b8acad3380fab26a242802e1c4116e88806e3b62c9f358"],"state_sha256":"b0e4df5afbf487ca7c80303a7bd4f5c46959ceb6d80f4678cdde367e8abeb757"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwSUjavZwXTRTxwDdWRdo/QHviY8r0XvFwfujnvmDoeZzkbOw4AqtDwd4AIFyWdjW7i7RB81tTjLZv2E3CxoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:09:36.313204Z","bundle_sha256":"8713224b0325ec9a11b1dfdda70659f74e85da8f0adddf903a0eb8764a88f8a3"}}