{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GQIE4YWFNF6XKFMJXJYLGDM422","short_pith_number":"pith:GQIE4YWF","schema_version":"1.0","canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","source":{"kind":"arxiv","id":"1812.05524","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alistair Stewart, Anastasios Sidiropoulos, Ilias Diakonikolas","submitted_at":"2018-12-13T17:09:21Z","abstract_excerpt":"We study the problem of computing the maximum likelihood estimator (MLE) of multivariate log-concave densities. Our main result is the first computationally efficient algorithm for this problem. In more detail, we give an algorithm that, on input a set of $n$ points in $\\mathbb{R}^d$ and an accuracy parameter $\\epsilon>0$, it runs in time $\\text{poly}(n, d, 1/\\epsilon)$, and outputs a log-concave density that with high probability maximizes the log-likelihood up to an additive $\\epsilon$. Our approach relies on a natural convex optimization formulation of the underlying problem that can be eff"},"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":"1812.05524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T17:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"dd2c071b7cb44ae762e79b120da6681cc3a561c0a4ddae4b79a23c9f3c086821","abstract_canon_sha256":"2e65ca51ab288c08adf745b78d12623e0152c7252fbaae5d601dd96e37873a78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:20.040236Z","signature_b64":"/EUIII9IFLEU18qLeFCBXjjeDmeo+015kk7J4IbNDhdE+ODTV5FkJxRpzgb/pil5bSpzz7Rc0bvnTPFAcVnVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","last_reissued_at":"2026-05-17T23:58:20.039809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:20.039809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alistair Stewart, Anastasios Sidiropoulos, Ilias Diakonikolas","submitted_at":"2018-12-13T17:09:21Z","abstract_excerpt":"We study the problem of computing the maximum likelihood estimator (MLE) of multivariate log-concave densities. Our main result is the first computationally efficient algorithm for this problem. In more detail, we give an algorithm that, on input a set of $n$ points in $\\mathbb{R}^d$ and an accuracy parameter $\\epsilon>0$, it runs in time $\\text{poly}(n, d, 1/\\epsilon)$, and outputs a log-concave density that with high probability maximizes the log-likelihood up to an additive $\\epsilon$. Our approach relies on a natural convex optimization formulation of the underlying problem that can be eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05524","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":"1812.05524","created_at":"2026-05-17T23:58:20.039873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05524v1","created_at":"2026-05-17T23:58:20.039873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05524","created_at":"2026-05-17T23:58:20.039873+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQIE4YWFNF6X","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQIE4YWFNF6XKFMJ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQIE4YWF","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08306","citing_title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06959","citing_title":"Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422","json":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422.json","graph_json":"https://pith.science/api/pith-number/GQIE4YWFNF6XKFMJXJYLGDM422/graph.json","events_json":"https://pith.science/api/pith-number/GQIE4YWFNF6XKFMJXJYLGDM422/events.json","paper":"https://pith.science/paper/GQIE4YWF"},"agent_actions":{"view_html":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422","download_json":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422.json","view_paper":"https://pith.science/paper/GQIE4YWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05524&json=true","fetch_graph":"https://pith.science/api/pith-number/GQIE4YWFNF6XKFMJXJYLGDM422/graph.json","fetch_events":"https://pith.science/api/pith-number/GQIE4YWFNF6XKFMJXJYLGDM422/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/action/storage_attestation","attest_author":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/action/author_attestation","sign_citation":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/action/citation_signature","submit_replication":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/action/replication_record"}},"created_at":"2026-05-17T23:58:20.039873+00:00","updated_at":"2026-05-17T23:58:20.039873+00:00"}