{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BIWUHPIHNWTIJVIXSL6GKRU7DY","short_pith_number":"pith:BIWUHPIH","canonical_record":{"source":{"id":"1810.11544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T22:10:48Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e7b207c19caf785c8e90384180dfe94e7bc3ae2f1d397b5222602601de0c93d9","abstract_canon_sha256":"64c1bdf87f48d0a6e40b2cff8cb1f48406c47b891feeb3741c95deabb05ee964"},"schema_version":"1.0"},"canonical_sha256":"0a2d43bd076da684d51792fc65469f1e06775c0323482fcaa57a987be992e79f","source":{"kind":"arxiv","id":"1810.11544","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11544","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11544v2","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11544","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"BIWUHPIHNWTI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BIWUHPIHNWTIJVIX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BIWUHPIH","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BIWUHPIHNWTIJVIXSL6GKRU7DY","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T22:10:48Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e7b207c19caf785c8e90384180dfe94e7bc3ae2f1d397b5222602601de0c93d9","abstract_canon_sha256":"64c1bdf87f48d0a6e40b2cff8cb1f48406c47b891feeb3741c95deabb05ee964"},"schema_version":"1.0"},"canonical_sha256":"0a2d43bd076da684d51792fc65469f1e06775c0323482fcaa57a987be992e79f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.842671Z","signature_b64":"giis/qlGnQ4Gwm7d4pQyQ47o1scAEfOtgcyRhSd1tsbqOzFzlQF3pn4U8OqhpGaMT9WutKKjCUkELw027+1MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2d43bd076da684d51792fc65469f1e06775c0323482fcaa57a987be992e79f","last_reissued_at":"2026-05-17T23:56:40.842129Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.842129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11544","source_version":2,"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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKF0G4YKSTOAEtpg9ct5E1jIqfPJvJ+k4fvBvbKDU3swQo74DNWuS7qTGbDbni2cmJTo2lbXTyeBHv6ywgJ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:01:51.983516Z"},"content_sha256":"349265c6d19e760d11d616fa7a6dc49b8b8be758319f34b4a520119d382df1d9","schema_version":"1.0","event_id":"sha256:349265c6d19e760d11d616fa7a6dc49b8b8be758319f34b4a520119d382df1d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BIWUHPIHNWTIJVIXSL6GKRU7DY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantifying Learning Guarantees for Convex but Inconsistent Surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anton Osokin, Kirill Struminsky, Simon Lacoste-Julien","submitted_at":"2018-10-26T22:10:48Z","abstract_excerpt":"We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new lower bound on the calibration function for the quadratic surrogate, which is non-trivial (not always zero) for inconsistent cases. The new bound allows to quantify the level of inconsistency of the setting and shows how learning with inconsistent surrogates can have guarantees on sample complexity a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11544","kind":"arxiv","version":2},"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:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/haRk4DMdWwxtTfVxM/BUbBINM/f7V3LsfmYg+j8Oos9QC8ZvhuCHM+WmvdoGmb4aQV4+PI8Hg380jABLcrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:01:51.983878Z"},"content_sha256":"236250f071f96d99c7aeb9fc9b2b091ae4f7260807f992f7657d6f60e7d9aa9f","schema_version":"1.0","event_id":"sha256:236250f071f96d99c7aeb9fc9b2b091ae4f7260807f992f7657d6f60e7d9aa9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/bundle.json","state_url":"https://pith.science/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/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-03T14:01:51Z","links":{"resolver":"https://pith.science/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY","bundle":"https://pith.science/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/bundle.json","state":"https://pith.science/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIWUHPIHNWTIJVIXSL6GKRU7DY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BIWUHPIHNWTIJVIXSL6GKRU7DY","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":"64c1bdf87f48d0a6e40b2cff8cb1f48406c47b891feeb3741c95deabb05ee964","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T22:10:48Z","title_canon_sha256":"e7b207c19caf785c8e90384180dfe94e7bc3ae2f1d397b5222602601de0c93d9"},"schema_version":"1.0","source":{"id":"1810.11544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11544","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11544v2","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11544","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"BIWUHPIHNWTI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BIWUHPIHNWTIJVIX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BIWUHPIH","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:236250f071f96d99c7aeb9fc9b2b091ae4f7260807f992f7657d6f60e7d9aa9f","target":"graph","created_at":"2026-05-17T23:56:40Z","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":"We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new lower bound on the calibration function for the quadratic surrogate, which is non-trivial (not always zero) for inconsistent cases. The new bound allows to quantify the level of inconsistency of the setting and shows how learning with inconsistent surrogates can have guarantees on sample complexity a","authors_text":"Anton Osokin, Kirill Struminsky, Simon Lacoste-Julien","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T22:10:48Z","title":"Quantifying Learning Guarantees for Convex but Inconsistent Surrogates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11544","kind":"arxiv","version":2},"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:349265c6d19e760d11d616fa7a6dc49b8b8be758319f34b4a520119d382df1d9","target":"record","created_at":"2026-05-17T23:56:40Z","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":"64c1bdf87f48d0a6e40b2cff8cb1f48406c47b891feeb3741c95deabb05ee964","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T22:10:48Z","title_canon_sha256":"e7b207c19caf785c8e90384180dfe94e7bc3ae2f1d397b5222602601de0c93d9"},"schema_version":"1.0","source":{"id":"1810.11544","kind":"arxiv","version":2}},"canonical_sha256":"0a2d43bd076da684d51792fc65469f1e06775c0323482fcaa57a987be992e79f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a2d43bd076da684d51792fc65469f1e06775c0323482fcaa57a987be992e79f","first_computed_at":"2026-05-17T23:56:40.842129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.842129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"giis/qlGnQ4Gwm7d4pQyQ47o1scAEfOtgcyRhSd1tsbqOzFzlQF3pn4U8OqhpGaMT9WutKKjCUkELw027+1MAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.842671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349265c6d19e760d11d616fa7a6dc49b8b8be758319f34b4a520119d382df1d9","sha256:236250f071f96d99c7aeb9fc9b2b091ae4f7260807f992f7657d6f60e7d9aa9f"],"state_sha256":"ca0c7696a73f79a7c6dd66f4c8efa07ec2575b1b292328b064c11770e3529839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbHfUmRh9JiBtbZasvaNsNPKg0C8QKNvgmVyuTLtYzibwu9OrEhtW3Mrh2AodQzgmjrT3WZiBeanYkZ/c8pgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:01:51.985923Z","bundle_sha256":"11027bb9366ab600e7538eac7f96184e27f362ba9b00c1cbc4687803c551e8f2"}}