{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5XW3U4LBV4ARG7RGWCWYCCLN7F","short_pith_number":"pith:5XW3U4LB","schema_version":"1.0","canonical_sha256":"ededba7161af01137e26b0ad81096df979feaedefda6f29cbdc5449e1edcdd66","source":{"kind":"arxiv","id":"2404.17209","version":3},"attestation_state":"computed","paper":{"title":"Generalized multi-view model: Adaptive density estimation under low-rank constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre Tsybakov (CREST-ENSAE), Julien Chhor (TSE), Olga Klopp (CREST-ENSAE)","submitted_at":"2024-04-26T07:34:39Z","abstract_excerpt":"We study the problem of bivariate discrete or continuous probability density estimation under low-rank constraints.For discrete distributions, we assume that the two-dimensional array to estimate is a low-rank probability matrix. In the continuous case, we assume that the density with respect to the Lebesgue measure satisfies a generalized multi-view model, meaning that it is $\\beta$-H{\\\"o}lder and can be decomposed as a sum of $K$ components, each of which is a product of one-dimensional functions. In both settings, we propose estimators that achieve, up to logarithmic factors, the minimax op"},"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":"2404.17209","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-04-26T07:34:39Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"bf968fa025f1d0e408d442e4d1bdac32b819d4054644172e2f974739b617c3d7","abstract_canon_sha256":"eac4440c0b6a58dab2b875136bd820c962d4f0563fe07b784318e8e320797847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:49.334186Z","signature_b64":"K4m9bQVJy6xt4MCXJzkGhzQNG+sgLLZ4mHtV2WCv8VCH+dD2kso3L7xVQ7SvT87cx7LLZaiw9zZ7X5ORFa0NAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ededba7161af01137e26b0ad81096df979feaedefda6f29cbdc5449e1edcdd66","last_reissued_at":"2026-07-05T09:23:49.333634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:49.333634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized multi-view model: Adaptive density estimation under low-rank constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre Tsybakov (CREST-ENSAE), Julien Chhor (TSE), Olga Klopp (CREST-ENSAE)","submitted_at":"2024-04-26T07:34:39Z","abstract_excerpt":"We study the problem of bivariate discrete or continuous probability density estimation under low-rank constraints.For discrete distributions, we assume that the two-dimensional array to estimate is a low-rank probability matrix. In the continuous case, we assume that the density with respect to the Lebesgue measure satisfies a generalized multi-view model, meaning that it is $\\beta$-H{\\\"o}lder and can be decomposed as a sum of $K$ components, each of which is a product of one-dimensional functions. In both settings, we propose estimators that achieve, up to logarithmic factors, the minimax op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.17209","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.17209/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.17209","created_at":"2026-07-05T09:23:49.333692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.17209v3","created_at":"2026-07-05T09:23:49.333692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.17209","created_at":"2026-07-05T09:23:49.333692+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XW3U4LBV4AR","created_at":"2026-07-05T09:23:49.333692+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XW3U4LBV4ARG7RG","created_at":"2026-07-05T09:23:49.333692+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XW3U4LB","created_at":"2026-07-05T09:23:49.333692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21396","citing_title":"PMODE: Theoretically Grounded and Modular Mixture Modeling","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F","json":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F.json","graph_json":"https://pith.science/api/pith-number/5XW3U4LBV4ARG7RGWCWYCCLN7F/graph.json","events_json":"https://pith.science/api/pith-number/5XW3U4LBV4ARG7RGWCWYCCLN7F/events.json","paper":"https://pith.science/paper/5XW3U4LB"},"agent_actions":{"view_html":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F","download_json":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F.json","view_paper":"https://pith.science/paper/5XW3U4LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.17209&json=true","fetch_graph":"https://pith.science/api/pith-number/5XW3U4LBV4ARG7RGWCWYCCLN7F/graph.json","fetch_events":"https://pith.science/api/pith-number/5XW3U4LBV4ARG7RGWCWYCCLN7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F/action/storage_attestation","attest_author":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F/action/author_attestation","sign_citation":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F/action/citation_signature","submit_replication":"https://pith.science/pith/5XW3U4LBV4ARG7RGWCWYCCLN7F/action/replication_record"}},"created_at":"2026-07-05T09:23:49.333692+00:00","updated_at":"2026-07-05T09:23:49.333692+00:00"}