{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SA34BYWJD5MVGHYNGP4RYNUPYP","short_pith_number":"pith:SA34BYWJ","schema_version":"1.0","canonical_sha256":"9037c0e2c91f59531f0d33f91c368fc3eca77bfcca0b4b46a7b0802a8268f5fe","source":{"kind":"arxiv","id":"1906.01908","version":1},"attestation_state":"computed","paper":{"title":"Empirical Risk Minimization under Random Censorship: Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Portier, Guillaume Ausset, St\\'ephan Cl\\'emen\\c{c}on","submitted_at":"2019-06-05T09:40:41Z","abstract_excerpt":"We consider the classic supervised learning problem, where a continuous non-negative random label $Y$ (i.e. a random duration) is to be predicted based upon observing a random vector $X$ valued in $\\mathbb{R}^d$ with $d\\geq 1$ by means of a regression rule with minimum least square error. In various applications, ranging from industrial quality control to public health through credit risk analysis for instance, training observations can be right censored, meaning that, rather than on independent copies of $(X,Y)$, statistical learning relies on a collection of $n\\geq 1$ independent realization"},"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":"1906.01908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T09:40:41Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"f5c4835eb663bfd37cd44228ce0283e402e5b61213c58cabd35493d94e4a9b49","abstract_canon_sha256":"4966f453e4c06be84609c53e8a16d2f81c62bc24542feec80003d33ee47d0c83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.792669Z","signature_b64":"WQX8P/oqDfD9aMjduV1Fcx5+kF+IOeG4au0/p8Osq6GjBPUkc9YowmtCHt4S5fJE71TSVcMfrxY8uumfIQDHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9037c0e2c91f59531f0d33f91c368fc3eca77bfcca0b4b46a7b0802a8268f5fe","last_reissued_at":"2026-05-17T23:44:05.792013Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.792013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical Risk Minimization under Random Censorship: Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Fran\\c{c}ois Portier, Guillaume Ausset, St\\'ephan Cl\\'emen\\c{c}on","submitted_at":"2019-06-05T09:40:41Z","abstract_excerpt":"We consider the classic supervised learning problem, where a continuous non-negative random label $Y$ (i.e. a random duration) is to be predicted based upon observing a random vector $X$ valued in $\\mathbb{R}^d$ with $d\\geq 1$ by means of a regression rule with minimum least square error. In various applications, ranging from industrial quality control to public health through credit risk analysis for instance, training observations can be right censored, meaning that, rather than on independent copies of $(X,Y)$, statistical learning relies on a collection of $n\\geq 1$ independent realization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01908","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":"1906.01908","created_at":"2026-05-17T23:44:05.792108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01908v1","created_at":"2026-05-17T23:44:05.792108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01908","created_at":"2026-05-17T23:44:05.792108+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA34BYWJD5MV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA34BYWJD5MVGHYN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA34BYWJ","created_at":"2026-05-18T12:33:27.125529+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/SA34BYWJD5MVGHYNGP4RYNUPYP","json":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP.json","graph_json":"https://pith.science/api/pith-number/SA34BYWJD5MVGHYNGP4RYNUPYP/graph.json","events_json":"https://pith.science/api/pith-number/SA34BYWJD5MVGHYNGP4RYNUPYP/events.json","paper":"https://pith.science/paper/SA34BYWJ"},"agent_actions":{"view_html":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP","download_json":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP.json","view_paper":"https://pith.science/paper/SA34BYWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01908&json=true","fetch_graph":"https://pith.science/api/pith-number/SA34BYWJD5MVGHYNGP4RYNUPYP/graph.json","fetch_events":"https://pith.science/api/pith-number/SA34BYWJD5MVGHYNGP4RYNUPYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP/action/storage_attestation","attest_author":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP/action/author_attestation","sign_citation":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP/action/citation_signature","submit_replication":"https://pith.science/pith/SA34BYWJD5MVGHYNGP4RYNUPYP/action/replication_record"}},"created_at":"2026-05-17T23:44:05.792108+00:00","updated_at":"2026-05-17T23:44:05.792108+00:00"}