{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LKF2ZXMSTLKCPSOL6RDQJPMO3G","short_pith_number":"pith:LKF2ZXMS","schema_version":"1.0","canonical_sha256":"5a8bacdd929ad427c9cbf44704bd8ed9ad8a016d54832cb6b3144899b1446822","source":{"kind":"arxiv","id":"1605.08188","version":2},"attestation_state":"computed","paper":{"title":"Learning Multivariate Log-concave Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2016-05-26T08:31:18Z","abstract_excerpt":"We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on $\\mathbb{R}^d$, for all $d \\geq 1$. Prior to our work, no upper bound on the sample complexity of this learning problem was known for the case of $d>3$. In more detail, we give an estimator that, for any $d \\ge 1$ and $\\epsilon>0$, draws $\\tilde{O}_d \\left( (1/\\epsilon)^{(d+5)/2} \\right)$ samples from an unknown target log-concave density on $\\mathbb{R}^d$, and outputs a hypothesis that (with high probability) is $\\eps"},"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":"1605.08188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-26T08:31:18Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"33b0af5b0a0fe1ed3cbe23350d432560b252ebe017e716443aa935e0def68678","abstract_canon_sha256":"c14e9bc4461eb1814e104c57248102be3c596efe1d74728899fa98e5f797a426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:02.788903Z","signature_b64":"zm2VV7KJvdNsqV+oPxCSKxQfXOWofTX1a4LVZynR7LsHHt9dqJRf8+6x+EhaS61bXWPHWiCgk4StviIYqIU4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a8bacdd929ad427c9cbf44704bd8ed9ad8a016d54832cb6b3144899b1446822","last_reissued_at":"2026-05-18T00:43:02.788335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:02.788335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Multivariate Log-concave Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2016-05-26T08:31:18Z","abstract_excerpt":"We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on $\\mathbb{R}^d$, for all $d \\geq 1$. Prior to our work, no upper bound on the sample complexity of this learning problem was known for the case of $d>3$. In more detail, we give an estimator that, for any $d \\ge 1$ and $\\epsilon>0$, draws $\\tilde{O}_d \\left( (1/\\epsilon)^{(d+5)/2} \\right)$ samples from an unknown target log-concave density on $\\mathbb{R}^d$, and outputs a hypothesis that (with high probability) is $\\eps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08188","kind":"arxiv","version":2},"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":"1605.08188","created_at":"2026-05-18T00:43:02.788445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08188v2","created_at":"2026-05-18T00:43:02.788445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08188","created_at":"2026-05-18T00:43:02.788445+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKF2ZXMSTLKC","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKF2ZXMSTLKCPSOL","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKF2ZXMS","created_at":"2026-05-18T12:30:29.479603+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/LKF2ZXMSTLKCPSOL6RDQJPMO3G","json":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G.json","graph_json":"https://pith.science/api/pith-number/LKF2ZXMSTLKCPSOL6RDQJPMO3G/graph.json","events_json":"https://pith.science/api/pith-number/LKF2ZXMSTLKCPSOL6RDQJPMO3G/events.json","paper":"https://pith.science/paper/LKF2ZXMS"},"agent_actions":{"view_html":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G","download_json":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G.json","view_paper":"https://pith.science/paper/LKF2ZXMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08188&json=true","fetch_graph":"https://pith.science/api/pith-number/LKF2ZXMSTLKCPSOL6RDQJPMO3G/graph.json","fetch_events":"https://pith.science/api/pith-number/LKF2ZXMSTLKCPSOL6RDQJPMO3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G/action/storage_attestation","attest_author":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G/action/author_attestation","sign_citation":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G/action/citation_signature","submit_replication":"https://pith.science/pith/LKF2ZXMSTLKCPSOL6RDQJPMO3G/action/replication_record"}},"created_at":"2026-05-18T00:43:02.788445+00:00","updated_at":"2026-05-18T00:43:02.788445+00:00"}