{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DI5Z57SZ2ZUUGH4U36WK4FEUW7","short_pith_number":"pith:DI5Z57SZ","schema_version":"1.0","canonical_sha256":"1a3b9efe59d669431f94dfacae1494b7f56901df8da7d7b5cdbcbc60535676fc","source":{"kind":"arxiv","id":"1112.3055","version":3},"attestation_state":"computed","paper":{"title":"High dimensional matrix estimation with unknown variance of the noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Modal'x), Olga Klopp (CREST, St\\'ephane Gaiffas (CMAP)","submitted_at":"2011-12-13T21:48:28Z","abstract_excerpt":"We propose a new pivotal method for estimating high-dimensional matrices. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A\\_0$ corrupted by noise. We propose a new method for estimating $A\\_0$ which does not rely on the knowledge or an estimation of the standard deviation of the noise $\\sigma$. Our estimator achieves, up to a logarithmic factor, optimal rates of convergence under the Frobenius risk and, thus, has the same prediction performance as previously proposed estimators which rely on the knowledge of $\\sigma$. Our method is based o"},"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":"1112.3055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-13T21:48:28Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2cf2b7fe4ce15f37768aa6d34c5095f3378a79634b15e9c4d66c7a5155c7b5f2","abstract_canon_sha256":"06cfd17ee5eadebbb811e3b498c0f7ab840e2e699cd552b02c1d5836195d27ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.662102Z","signature_b64":"BYYgkAZROyL18A6aawwuxDN0z7gZfNpviIT453d2Uemq8+ExUTAgfddJ2MMf9O5cTSdS/92M252ewJcV/W6AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a3b9efe59d669431f94dfacae1494b7f56901df8da7d7b5cdbcbc60535676fc","last_reissued_at":"2026-05-18T02:28:13.661272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.661272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High dimensional matrix estimation with unknown variance of the noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Modal'x), Olga Klopp (CREST, St\\'ephane Gaiffas (CMAP)","submitted_at":"2011-12-13T21:48:28Z","abstract_excerpt":"We propose a new pivotal method for estimating high-dimensional matrices. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A\\_0$ corrupted by noise. We propose a new method for estimating $A\\_0$ which does not rely on the knowledge or an estimation of the standard deviation of the noise $\\sigma$. Our estimator achieves, up to a logarithmic factor, optimal rates of convergence under the Frobenius risk and, thus, has the same prediction performance as previously proposed estimators which rely on the knowledge of $\\sigma$. Our method is based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3055","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":"1112.3055","created_at":"2026-05-18T02:28:13.661414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3055v3","created_at":"2026-05-18T02:28:13.661414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3055","created_at":"2026-05-18T02:28:13.661414+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI5Z57SZ2ZUU","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI5Z57SZ2ZUUGH4U","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI5Z57SZ","created_at":"2026-05-18T12:26:26.731475+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/DI5Z57SZ2ZUUGH4U36WK4FEUW7","json":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7.json","graph_json":"https://pith.science/api/pith-number/DI5Z57SZ2ZUUGH4U36WK4FEUW7/graph.json","events_json":"https://pith.science/api/pith-number/DI5Z57SZ2ZUUGH4U36WK4FEUW7/events.json","paper":"https://pith.science/paper/DI5Z57SZ"},"agent_actions":{"view_html":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7","download_json":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7.json","view_paper":"https://pith.science/paper/DI5Z57SZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3055&json=true","fetch_graph":"https://pith.science/api/pith-number/DI5Z57SZ2ZUUGH4U36WK4FEUW7/graph.json","fetch_events":"https://pith.science/api/pith-number/DI5Z57SZ2ZUUGH4U36WK4FEUW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7/action/storage_attestation","attest_author":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7/action/author_attestation","sign_citation":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7/action/citation_signature","submit_replication":"https://pith.science/pith/DI5Z57SZ2ZUUGH4U36WK4FEUW7/action/replication_record"}},"created_at":"2026-05-18T02:28:13.661414+00:00","updated_at":"2026-05-18T02:28:13.661414+00:00"}