{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5Q24H4A5BUXMUEGCZQAZZPKEWE","short_pith_number":"pith:5Q24H4A5","schema_version":"1.0","canonical_sha256":"ec35c3f01d0d2eca10c2cc019cbd44b125ee1dc1b5b5c2ba973af32894f19e50","source":{"kind":"arxiv","id":"1710.07278","version":3},"attestation_state":"computed","paper":{"title":"Early stopping for statistical inverse problems via truncated SVD estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Gilles Blanchard, Marc Hoffmann, Markus Rei{\\ss}","submitted_at":"2017-10-19T09:43:06Z","abstract_excerpt":"We consider truncated SVD (or spectral cut-off, projection) estimators for a prototypical statistical inverse problem in dimension $D$. Since calculating the singular value decomposition (SVD) only for the largest singular values is much less costly than the full SVD, our aim is to select a data-driven truncation level $\\widehat m\\in\\{1,\\ldots,D\\}$ only based on the knowledge of the first $\\widehat m$ singular values and vectors. We analyse in detail whether sequential {\\it early stopping} rules of this type can preserve statistical optimality. Information-constrained lower bounds and matching"},"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":"1710.07278","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-19T09:43:06Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"9329d273f1e6f0cce07e5d7fe0a46ca07cdb094f9c0e6f6e32ade5a1bbabb067","abstract_canon_sha256":"624716d0055a0b4d5dfded34cc4f6004f55c5695c7dc5730a07ea67e58cc250e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:12.133403Z","signature_b64":"Y7Q5KgNa5VgG+Dhoq/6e7RvIDUaq79GHzIZjV7xvonxl2E2R1nrUmU3SSO77L8QlYNQOPDRtWRzNwstrRfCYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec35c3f01d0d2eca10c2cc019cbd44b125ee1dc1b5b5c2ba973af32894f19e50","last_reissued_at":"2026-05-18T00:06:12.132650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:12.132650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early stopping for statistical inverse problems via truncated SVD estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Gilles Blanchard, Marc Hoffmann, Markus Rei{\\ss}","submitted_at":"2017-10-19T09:43:06Z","abstract_excerpt":"We consider truncated SVD (or spectral cut-off, projection) estimators for a prototypical statistical inverse problem in dimension $D$. Since calculating the singular value decomposition (SVD) only for the largest singular values is much less costly than the full SVD, our aim is to select a data-driven truncation level $\\widehat m\\in\\{1,\\ldots,D\\}$ only based on the knowledge of the first $\\widehat m$ singular values and vectors. We analyse in detail whether sequential {\\it early stopping} rules of this type can preserve statistical optimality. Information-constrained lower bounds and matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07278","kind":"arxiv","version":3},"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":"1710.07278","created_at":"2026-05-18T00:06:12.132777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07278v3","created_at":"2026-05-18T00:06:12.132777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07278","created_at":"2026-05-18T00:06:12.132777+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q24H4A5BUXM","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q24H4A5BUXMUEGC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q24H4A5","created_at":"2026-05-18T12:31:00.734936+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/5Q24H4A5BUXMUEGCZQAZZPKEWE","json":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE.json","graph_json":"https://pith.science/api/pith-number/5Q24H4A5BUXMUEGCZQAZZPKEWE/graph.json","events_json":"https://pith.science/api/pith-number/5Q24H4A5BUXMUEGCZQAZZPKEWE/events.json","paper":"https://pith.science/paper/5Q24H4A5"},"agent_actions":{"view_html":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE","download_json":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE.json","view_paper":"https://pith.science/paper/5Q24H4A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07278&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q24H4A5BUXMUEGCZQAZZPKEWE/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q24H4A5BUXMUEGCZQAZZPKEWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE/action/storage_attestation","attest_author":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE/action/author_attestation","sign_citation":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE/action/citation_signature","submit_replication":"https://pith.science/pith/5Q24H4A5BUXMUEGCZQAZZPKEWE/action/replication_record"}},"created_at":"2026-05-18T00:06:12.132777+00:00","updated_at":"2026-05-18T00:06:12.132777+00:00"}