{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EUXXPJAIVWAENV4GTK7YOCGR5T","short_pith_number":"pith:EUXXPJAI","canonical_record":{"source":{"id":"1902.00693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-02T11:15:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aec3b137bd321e6ac8620a84feed226530080b595dbf59f78e4cd03d8cb359cc","abstract_canon_sha256":"5da1904c34a00f61671b5e2a3b22e65213df4aa0be23f93b7dfc588f9b89390c"},"schema_version":"1.0"},"canonical_sha256":"252f77a408ad8046d7869abf8708d1ecd1acf0396aefe4194dd1c14b24787033","source":{"kind":"arxiv","id":"1902.00693","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00693","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00693v3","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00693","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"EUXXPJAIVWAE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUXXPJAIVWAENV4G","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUXXPJAI","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EUXXPJAIVWAENV4GTK7YOCGR5T","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-02T11:15:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aec3b137bd321e6ac8620a84feed226530080b595dbf59f78e4cd03d8cb359cc","abstract_canon_sha256":"5da1904c34a00f61671b5e2a3b22e65213df4aa0be23f93b7dfc588f9b89390c"},"schema_version":"1.0"},"canonical_sha256":"252f77a408ad8046d7869abf8708d1ecd1acf0396aefe4194dd1c14b24787033","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.772298Z","signature_b64":"IoX+OsmeVjl5ddZ5MTHMlpni7mMbrouqZzJR+VMvohk8I+vtJSdlgf3Svc80ZcekYKsfrwOtgfD1vIToNJVXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252f77a408ad8046d7869abf8708d1ecd1acf0396aefe4194dd1c14b24787033","last_reissued_at":"2026-05-17T23:44:37.771893Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.771893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00693","source_version":3,"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-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9h9QgrxthauDtZ0L7gp33jn/CXLjxVpTbCmHDfFszrlQX2t2FeMDciJPUnpyI9Luo+/jmZeTzCQTS8BhGU8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:29:33.048892Z"},"content_sha256":"7cf4879f159eac76eb38c106578f708d476385354bce85107b57a92bb9481c9f","schema_version":"1.0","event_id":"sha256:7cf4879f159eac76eb38c106578f708d476385354bce85107b57a92bb9481c9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EUXXPJAIVWAENV4GTK7YOCGR5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supervised classification via minimax probabilistic transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrea Zanoni, Aritz Perez, Santiago Mazuelas","submitted_at":"2019-02-02T11:15:56Z","abstract_excerpt":"Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric representations suitable for surrogate loss minimization, and low complexity properties suitable for overfitting control. This paper presents classification techniques based on robust risk minimization (RRM) that we call linear probabilistic classifiers (LPCs). The proposed techniques consider unconstrained classification rules, optimize the classification 0-1 loss, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00693","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"},"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-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yukD5YXUuNrmZeLhoyz3Eno1+/L5PWcpJrgmBd1MmgISMYBwH7mIX9l4Ho7GX6m24zgAYC0v5d+SRUVDOJdQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:29:33.049593Z"},"content_sha256":"485977396b38d4424a6b363fa10b9e9b4ad84dddb73bcf9d03915d4b2f6000b7","schema_version":"1.0","event_id":"sha256:485977396b38d4424a6b363fa10b9e9b4ad84dddb73bcf9d03915d4b2f6000b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/bundle.json","state_url":"https://pith.science/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/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-06-10T11:29:33Z","links":{"resolver":"https://pith.science/pith/EUXXPJAIVWAENV4GTK7YOCGR5T","bundle":"https://pith.science/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/bundle.json","state":"https://pith.science/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUXXPJAIVWAENV4GTK7YOCGR5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUXXPJAIVWAENV4GTK7YOCGR5T","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":"5da1904c34a00f61671b5e2a3b22e65213df4aa0be23f93b7dfc588f9b89390c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-02T11:15:56Z","title_canon_sha256":"aec3b137bd321e6ac8620a84feed226530080b595dbf59f78e4cd03d8cb359cc"},"schema_version":"1.0","source":{"id":"1902.00693","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00693","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00693v3","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00693","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"EUXXPJAIVWAE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUXXPJAIVWAENV4G","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUXXPJAI","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:485977396b38d4424a6b363fa10b9e9b4ad84dddb73bcf9d03915d4b2f6000b7","target":"graph","created_at":"2026-05-17T23:44:37Z","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":"Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric representations suitable for surrogate loss minimization, and low complexity properties suitable for overfitting control. This paper presents classification techniques based on robust risk minimization (RRM) that we call linear probabilistic classifiers (LPCs). The proposed techniques consider unconstrained classification rules, optimize the classification 0-1 loss, and ","authors_text":"Andrea Zanoni, Aritz Perez, Santiago Mazuelas","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-02T11:15:56Z","title":"Supervised classification via minimax probabilistic transformations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00693","kind":"arxiv","version":3},"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:7cf4879f159eac76eb38c106578f708d476385354bce85107b57a92bb9481c9f","target":"record","created_at":"2026-05-17T23:44:37Z","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":"5da1904c34a00f61671b5e2a3b22e65213df4aa0be23f93b7dfc588f9b89390c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-02T11:15:56Z","title_canon_sha256":"aec3b137bd321e6ac8620a84feed226530080b595dbf59f78e4cd03d8cb359cc"},"schema_version":"1.0","source":{"id":"1902.00693","kind":"arxiv","version":3}},"canonical_sha256":"252f77a408ad8046d7869abf8708d1ecd1acf0396aefe4194dd1c14b24787033","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"252f77a408ad8046d7869abf8708d1ecd1acf0396aefe4194dd1c14b24787033","first_computed_at":"2026-05-17T23:44:37.771893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:37.771893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IoX+OsmeVjl5ddZ5MTHMlpni7mMbrouqZzJR+VMvohk8I+vtJSdlgf3Svc80ZcekYKsfrwOtgfD1vIToNJVXDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:37.772298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00693","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf4879f159eac76eb38c106578f708d476385354bce85107b57a92bb9481c9f","sha256:485977396b38d4424a6b363fa10b9e9b4ad84dddb73bcf9d03915d4b2f6000b7"],"state_sha256":"6a17fe3a044d0c95eadc17cb9d881f2021386b98208704082f68f639585eace5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iz+6/CvMvDlTzNpaRhDZwHYzcPJe5Pb2+PvjpeCZQCVtelFjxfjSybbOMnyDWxcCNzXf4dCHwc3rixTmlfKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:29:33.056208Z","bundle_sha256":"498377d77ad6e23cb07bdb2990788cfeb2d00c5a85b08c0f86e931552ddf29f3"}}