{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:QRXUTD3CO73PRHYFFIF4THV7ID","short_pith_number":"pith:QRXUTD3C","canonical_record":{"source":{"id":"math/0603123","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2006-03-05T17:10:54Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c37f4da53789363be9ea215705b4de9e047547bd9019af9c0f8bc9a87c6a70b1","abstract_canon_sha256":"02648f4d9120c4896941dc3b43ee0a00791fd06c3ab1542b613e66569a8e85bc"},"schema_version":"1.0"},"canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","source":{"kind":"arxiv","id":"math/0603123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0603123","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0603123v1","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603123","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"QRXUTD3CO73P","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"QRXUTD3CO73PRHYF","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"QRXUTD3C","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:QRXUTD3CO73PRHYFFIF4THV7ID","target":"record","payload":{"canonical_record":{"source":{"id":"math/0603123","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2006-03-05T17:10:54Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c37f4da53789363be9ea215705b4de9e047547bd9019af9c0f8bc9a87c6a70b1","abstract_canon_sha256":"02648f4d9120c4896941dc3b43ee0a00791fd06c3ab1542b613e66569a8e85bc"},"schema_version":"1.0"},"canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:50.468661Z","signature_b64":"qoZpqU0cwrjCxu5V1gOuZV4LCsIAybdqp2YehVAR4yAuaUivoY6yHvmXCnUxWjarVvD0I2D6IFQQcMOjbX+tDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","last_reissued_at":"2026-05-18T01:08:50.468124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:50.468124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0603123","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-18T01:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vV9N4VDLW6LeW3/kgHe1SS4EL5TJA67Mbsdxdr6WfZZdl4eEFWfhr5wI1asBw1xjY2C0DPCcgpN7GhpacViHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:13:36.379864Z"},"content_sha256":"f15876dbaaa72d7c24d584afca896512155c1319442a9816aa5b8e91e33d416f","schema_version":"1.0","event_id":"sha256:f15876dbaaa72d7c24d584afca896512155c1319442a9816aa5b8e91e33d416f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:QRXUTD3CO73PRHYFFIF4THV7ID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking and empirical minimization of U-statistics","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"G\\'abor Lugosi, Modal'x), Nicolas Vayatis (PMA), St\\'ephan Cl\\'emen\\c{c}on (PMA","submitted_at":"2006-03-05T17:10:54Z","abstract_excerpt":"The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn a ranking rule for deciding, among two instances, which one is \"better,\" with minimum ranking risk. Since the natural estimates of the risk are of the form of a U-statistic, results of the theory of U-processes are required for investigating the consistency of empirical risk minimizers. We establish in particular a tail inequality for degenerate U-processes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0603123","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-18T01:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbSMhDvqvuLqNn8kRStM/SQWfJT3DkgxrGBpUjAN8cpRPu7eHESM05Tn/goH3fxbMOHcOn4Wi+FzyjovCLcTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:13:36.380585Z"},"content_sha256":"584d22c4ad6603269a213e75996b0b2b58130fb26240baecf98f2b535b03d3d0","schema_version":"1.0","event_id":"sha256:584d22c4ad6603269a213e75996b0b2b58130fb26240baecf98f2b535b03d3d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/bundle.json","state_url":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRXUTD3CO73PRHYFFIF4THV7ID/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-23T03:13:36Z","links":{"resolver":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID","bundle":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/bundle.json","state":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRXUTD3CO73PRHYFFIF4THV7ID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:QRXUTD3CO73PRHYFFIF4THV7ID","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":"02648f4d9120c4896941dc3b43ee0a00791fd06c3ab1542b613e66569a8e85bc","cross_cats_sorted":["stat.TH"],"license":"","primary_cat":"math.ST","submitted_at":"2006-03-05T17:10:54Z","title_canon_sha256":"c37f4da53789363be9ea215705b4de9e047547bd9019af9c0f8bc9a87c6a70b1"},"schema_version":"1.0","source":{"id":"math/0603123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0603123","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0603123v1","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603123","created_at":"2026-05-18T01:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"QRXUTD3CO73P","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"QRXUTD3CO73PRHYF","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"QRXUTD3C","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:584d22c4ad6603269a213e75996b0b2b58130fb26240baecf98f2b535b03d3d0","target":"graph","created_at":"2026-05-18T01:08:50Z","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":"The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn a ranking rule for deciding, among two instances, which one is \"better,\" with minimum ranking risk. Since the natural estimates of the risk are of the form of a U-statistic, results of the theory of U-processes are required for investigating the consistency of empirical risk minimizers. We establish in particular a tail inequality for degenerate U-processes,","authors_text":"G\\'abor Lugosi, Modal'x), Nicolas Vayatis (PMA), St\\'ephan Cl\\'emen\\c{c}on (PMA","cross_cats":["stat.TH"],"headline":"","license":"","primary_cat":"math.ST","submitted_at":"2006-03-05T17:10:54Z","title":"Ranking and empirical minimization of U-statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0603123","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:f15876dbaaa72d7c24d584afca896512155c1319442a9816aa5b8e91e33d416f","target":"record","created_at":"2026-05-18T01:08:50Z","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":"02648f4d9120c4896941dc3b43ee0a00791fd06c3ab1542b613e66569a8e85bc","cross_cats_sorted":["stat.TH"],"license":"","primary_cat":"math.ST","submitted_at":"2006-03-05T17:10:54Z","title_canon_sha256":"c37f4da53789363be9ea215705b4de9e047547bd9019af9c0f8bc9a87c6a70b1"},"schema_version":"1.0","source":{"id":"math/0603123","kind":"arxiv","version":1}},"canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","first_computed_at":"2026-05-18T01:08:50.468124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:50.468124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qoZpqU0cwrjCxu5V1gOuZV4LCsIAybdqp2YehVAR4yAuaUivoY6yHvmXCnUxWjarVvD0I2D6IFQQcMOjbX+tDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:50.468661Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0603123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f15876dbaaa72d7c24d584afca896512155c1319442a9816aa5b8e91e33d416f","sha256:584d22c4ad6603269a213e75996b0b2b58130fb26240baecf98f2b535b03d3d0"],"state_sha256":"3497487939777e4fd9eec224339c5a8c33fa5d3b4365ca475e698c01bfb6e0b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KINZ7oxTlJD9mjrd4wiUM4kf1xTLcy7TCTcifctPMXMYcfyRcMe2ZL6hu89q/LehTefl2q16cksfzVABr92xDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T03:13:36.383235Z","bundle_sha256":"ae86f0510249fa45561aedf61c9a35e4e99a3052e53bb630bac9be377b6d19b6"}}