{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N3OMF24XRBYYYQJYCLEHH6ETDA","short_pith_number":"pith:N3OMF24X","canonical_record":{"source":{"id":"1205.2602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T18:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"6165bcfa1440eb89d1fd0ef0dc6416b9cffb0482eeff6f9d98e1377623067460","abstract_canon_sha256":"ec95c5aab606e8af118d6ca67973cb7131c92bba30b01a20c8c0bd0f0bbde231"},"schema_version":"1.0"},"canonical_sha256":"6edcc2eb9788718c413812c873f893182314f80b2fb602d51d0d865636664a87","source":{"kind":"arxiv","id":"1205.2602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2602","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2602v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2602","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"N3OMF24XRBYY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N3OMF24XRBYYYQJY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N3OMF24X","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N3OMF24XRBYYYQJYCLEHH6ETDA","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T18:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"6165bcfa1440eb89d1fd0ef0dc6416b9cffb0482eeff6f9d98e1377623067460","abstract_canon_sha256":"ec95c5aab606e8af118d6ca67973cb7131c92bba30b01a20c8c0bd0f0bbde231"},"schema_version":"1.0"},"canonical_sha256":"6edcc2eb9788718c413812c873f893182314f80b2fb602d51d0d865636664a87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.978934Z","signature_b64":"BomPZsiwlpEAjhNqtvBhfSbK61+UB1S80opsXFrnZh6c3xnQTlV9W6qeXPsy7xS7VnRNhcHS6Gqa5R6I7wOVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6edcc2eb9788718c413812c873f893182314f80b2fb602d51d0d865636664a87","last_reissued_at":"2026-05-18T03:55:47.978389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.978389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2602","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGElr+HhQTS/r2uwnko7mQ4VEA9801yhO5xOvLt7W7aE9eoYvYLljrJlu61aAUO8BMeFMtuY6TOtbyQfC+FmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:47:28.771812Z"},"content_sha256":"e2e56763181f7779dd17d6fa92148114355375acf7329f929a37f06457788c88","schema_version":"1.0","event_id":"sha256:e2e56763181f7779dd17d6fa92148114355375acf7329f929a37f06457788c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N3OMF24XRBYYYQJYCLEHH6ETDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Entire Quantile Path of a Risk-Agnostic SVM Classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Zhang, Jin Yu, S. V.N. Vishwanatan","submitted_at":"2012-05-09T18:46:51Z","abstract_excerpt":"A quantile binary classifier uses the rule: Classify x as +1 if P(Y = 1|X = x) >= t, and as -1 otherwise, for a fixed quantile parameter t {[0, 1]. It has been shown that Support Vector Machines (SVMs) in the limit are quantile classifiers with t = 1/2 . In this paper, we show that by using asymmetric cost of misclassification SVMs can be appropriately extended to recover, in the limit, the quantile binary classifier for any t. We then present a principled algorithm to solve the extended SVM classifier for all values of t simultaneously. This has two implications: First, one can recover the en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2602","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQIUBQ10OBznIBtb0eROtfuxkGjlmRYBLH4AhHT4FbeuDZjSVqQAqpzG1G8GYOaMsjMvfjpgHaFCvYfUOKp+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:47:28.772160Z"},"content_sha256":"6f09fcd1f84bde0a5bc245588e4925807078541be91a8a9b7749f3feb0fbfb8f","schema_version":"1.0","event_id":"sha256:6f09fcd1f84bde0a5bc245588e4925807078541be91a8a9b7749f3feb0fbfb8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/bundle.json","state_url":"https://pith.science/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/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-28T11:47:28Z","links":{"resolver":"https://pith.science/pith/N3OMF24XRBYYYQJYCLEHH6ETDA","bundle":"https://pith.science/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/bundle.json","state":"https://pith.science/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3OMF24XRBYYYQJYCLEHH6ETDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N3OMF24XRBYYYQJYCLEHH6ETDA","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":"ec95c5aab606e8af118d6ca67973cb7131c92bba30b01a20c8c0bd0f0bbde231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T18:46:51Z","title_canon_sha256":"6165bcfa1440eb89d1fd0ef0dc6416b9cffb0482eeff6f9d98e1377623067460"},"schema_version":"1.0","source":{"id":"1205.2602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2602","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2602v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2602","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"N3OMF24XRBYY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N3OMF24XRBYYYQJY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N3OMF24X","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:6f09fcd1f84bde0a5bc245588e4925807078541be91a8a9b7749f3feb0fbfb8f","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"A quantile binary classifier uses the rule: Classify x as +1 if P(Y = 1|X = x) >= t, and as -1 otherwise, for a fixed quantile parameter t {[0, 1]. It has been shown that Support Vector Machines (SVMs) in the limit are quantile classifiers with t = 1/2 . In this paper, we show that by using asymmetric cost of misclassification SVMs can be appropriately extended to recover, in the limit, the quantile binary classifier for any t. We then present a principled algorithm to solve the extended SVM classifier for all values of t simultaneously. This has two implications: First, one can recover the en","authors_text":"Jian Zhang, Jin Yu, S. V.N. Vishwanatan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T18:46:51Z","title":"The Entire Quantile Path of a Risk-Agnostic SVM Classifier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2602","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:e2e56763181f7779dd17d6fa92148114355375acf7329f929a37f06457788c88","target":"record","created_at":"2026-05-18T03:55:47Z","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":"ec95c5aab606e8af118d6ca67973cb7131c92bba30b01a20c8c0bd0f0bbde231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T18:46:51Z","title_canon_sha256":"6165bcfa1440eb89d1fd0ef0dc6416b9cffb0482eeff6f9d98e1377623067460"},"schema_version":"1.0","source":{"id":"1205.2602","kind":"arxiv","version":1}},"canonical_sha256":"6edcc2eb9788718c413812c873f893182314f80b2fb602d51d0d865636664a87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6edcc2eb9788718c413812c873f893182314f80b2fb602d51d0d865636664a87","first_computed_at":"2026-05-18T03:55:47.978389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.978389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BomPZsiwlpEAjhNqtvBhfSbK61+UB1S80opsXFrnZh6c3xnQTlV9W6qeXPsy7xS7VnRNhcHS6Gqa5R6I7wOVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.978934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2e56763181f7779dd17d6fa92148114355375acf7329f929a37f06457788c88","sha256:6f09fcd1f84bde0a5bc245588e4925807078541be91a8a9b7749f3feb0fbfb8f"],"state_sha256":"4a08942d8889dadf796ced2b148a672c815f49420baead89c5cb322034cf8d07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Inxa9dLpn4JOQTTmvu07N4F5J33uabTN60I0d5JFM8l4Kf1PD3clIWgoBvoJ1+i2VKG6nF0kA+5DdDfUTwkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:47:28.774427Z","bundle_sha256":"feaa9ae1fa423959194b897a7c2ce85b0b8f6ece9cf7c07c3b4bd70b86c83c64"}}