{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E7PXTJ3LR4QFV54V4GYMFPF52K","short_pith_number":"pith:E7PXTJ3L","schema_version":"1.0","canonical_sha256":"27df79a76b8f205af795e1b0c2bcbdd299a64fa07571ca5374f15fe8d2f2c22c","source":{"kind":"arxiv","id":"1703.00167","version":1},"attestation_state":"computed","paper":{"title":"Adaptive estimation of the sparsity in the Gaussian vector model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandra Carpentier, Nicolas Verzelen","submitted_at":"2017-03-01T07:57:26Z","abstract_excerpt":"Consider the Gaussian vector model with mean value {\\theta}. We study the twin problems of estimating the number |{\\theta}|_0 of non-zero components of {\\theta} and testing whether |{\\theta}|_0 is smaller than some value. For testing, we establish the minimax separation distances for this model and introduce a minimax adaptive test. Extensions to the case of unknown variance are also discussed. Rewriting the estimation of |{\\theta}|_0 as a multiple testing problem of all hypotheses {|{\\theta}|_0 <= q}, we both derive a new way of assessing the optimality of a sparsity estimator and we exhibit "},"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":"1703.00167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-03-01T07:57:26Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f683aa63eafeb819e3ff4a78fa57301db0f318401753ac041e4015be06f9985a","abstract_canon_sha256":"8cafc03ad40fe1258595d2e251f53919f3869534d5523ad63d10b35bc600561e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.768192Z","signature_b64":"yIFmxEF2BiGcYb2ICJJh8Ic+pbssqfOeir3BwdHhjvOVItJiUxH+iPEDtQCKG9BTJkb8CInvQEtmyT3EL2WRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27df79a76b8f205af795e1b0c2bcbdd299a64fa07571ca5374f15fe8d2f2c22c","last_reissued_at":"2026-05-18T00:49:45.767674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.767674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive estimation of the sparsity in the Gaussian vector model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandra Carpentier, Nicolas Verzelen","submitted_at":"2017-03-01T07:57:26Z","abstract_excerpt":"Consider the Gaussian vector model with mean value {\\theta}. We study the twin problems of estimating the number |{\\theta}|_0 of non-zero components of {\\theta} and testing whether |{\\theta}|_0 is smaller than some value. For testing, we establish the minimax separation distances for this model and introduce a minimax adaptive test. Extensions to the case of unknown variance are also discussed. Rewriting the estimation of |{\\theta}|_0 as a multiple testing problem of all hypotheses {|{\\theta}|_0 <= q}, we both derive a new way of assessing the optimality of a sparsity estimator and we exhibit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00167","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":"1703.00167","created_at":"2026-05-18T00:49:45.767751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00167v1","created_at":"2026-05-18T00:49:45.767751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00167","created_at":"2026-05-18T00:49:45.767751+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7PXTJ3LR4QF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7PXTJ3LR4QFV54V","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7PXTJ3L","created_at":"2026-05-18T12:31:12.930513+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/E7PXTJ3LR4QFV54V4GYMFPF52K","json":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K.json","graph_json":"https://pith.science/api/pith-number/E7PXTJ3LR4QFV54V4GYMFPF52K/graph.json","events_json":"https://pith.science/api/pith-number/E7PXTJ3LR4QFV54V4GYMFPF52K/events.json","paper":"https://pith.science/paper/E7PXTJ3L"},"agent_actions":{"view_html":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K","download_json":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K.json","view_paper":"https://pith.science/paper/E7PXTJ3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00167&json=true","fetch_graph":"https://pith.science/api/pith-number/E7PXTJ3LR4QFV54V4GYMFPF52K/graph.json","fetch_events":"https://pith.science/api/pith-number/E7PXTJ3LR4QFV54V4GYMFPF52K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K/action/storage_attestation","attest_author":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K/action/author_attestation","sign_citation":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K/action/citation_signature","submit_replication":"https://pith.science/pith/E7PXTJ3LR4QFV54V4GYMFPF52K/action/replication_record"}},"created_at":"2026-05-18T00:49:45.767751+00:00","updated_at":"2026-05-18T00:49:45.767751+00:00"}