{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:QRXUTD3CO73PRHYFFIF4THV7ID","short_pith_number":"pith:QRXUTD3C","schema_version":"1.0","canonical_sha256":"846f498f6277f6f89f052a0bc99ebf40c961b456080342ad46d8fe2d08ee8e12","source":{"kind":"arxiv","id":"math/0603123","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0603123","created_at":"2026-05-18T01:08:50.468223+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0603123v1","created_at":"2026-05-18T01:08:50.468223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603123","created_at":"2026-05-18T01:08:50.468223+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRXUTD3CO73P","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRXUTD3CO73PRHYF","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRXUTD3C","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID","json":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID.json","graph_json":"https://pith.science/api/pith-number/QRXUTD3CO73PRHYFFIF4THV7ID/graph.json","events_json":"https://pith.science/api/pith-number/QRXUTD3CO73PRHYFFIF4THV7ID/events.json","paper":"https://pith.science/paper/QRXUTD3C"},"agent_actions":{"view_html":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID","download_json":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID.json","view_paper":"https://pith.science/paper/QRXUTD3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0603123&json=true","fetch_graph":"https://pith.science/api/pith-number/QRXUTD3CO73PRHYFFIF4THV7ID/graph.json","fetch_events":"https://pith.science/api/pith-number/QRXUTD3CO73PRHYFFIF4THV7ID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/action/storage_attestation","attest_author":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/action/author_attestation","sign_citation":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/action/citation_signature","submit_replication":"https://pith.science/pith/QRXUTD3CO73PRHYFFIF4THV7ID/action/replication_record"}},"created_at":"2026-05-18T01:08:50.468223+00:00","updated_at":"2026-05-18T01:08:50.468223+00:00"}