{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FUVNP7NA4IC3XHBCDP3E3AVGSH","short_pith_number":"pith:FUVNP7NA","schema_version":"1.0","canonical_sha256":"2d2ad7fda0e205bb9c221bf64d82a691c65ec932b9985dfa0ae51c0f1e7cc5d1","source":{"kind":"arxiv","id":"1907.08306","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Alistair Stewart, Anastasios Sidiropoulos, Brian Axelrod, Gregory Valiant, Ilias Diakonikolas","submitted_at":"2019-07-18T22:04:21Z","abstract_excerpt":"We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given $n$ points in $\\mathbb{R}^d$ and an accuracy parameter $\\epsilon>0$, runs in time $poly(n,d,1/\\epsilon),$ and returns a log-concave distribution which, with high probability, has the property that the likelihood of the $n$ points under the returned distribution is at most an additive $\\epsilon$ less than the maximum likelihood that could be achieved via any log-concave distribution. This is the first computationally efficient "},"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":"1907.08306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T22:04:21Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"98ee6ea8911db42761591906a7d25a6bdf1539e1ec12c4e7b854493811768109","abstract_canon_sha256":"51117a68e552537cd674d920ae6c4bce4892376cee092b9d0dfcee678d36eb1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.273562Z","signature_b64":"b0qJStaUO/o8on2Lhl7RFKpf4KqWmrDBIHf9T5cXI4VB/rIa68CFPcbmE+eieMtGNO4oKo73zMV8K9gK3tYKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2ad7fda0e205bb9c221bf64d82a691c65ec932b9985dfa0ae51c0f1e7cc5d1","last_reissued_at":"2026-05-17T23:40:10.273048Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.273048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Alistair Stewart, Anastasios Sidiropoulos, Brian Axelrod, Gregory Valiant, Ilias Diakonikolas","submitted_at":"2019-07-18T22:04:21Z","abstract_excerpt":"We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given $n$ points in $\\mathbb{R}^d$ and an accuracy parameter $\\epsilon>0$, runs in time $poly(n,d,1/\\epsilon),$ and returns a log-concave distribution which, with high probability, has the property that the likelihood of the $n$ points under the returned distribution is at most an additive $\\epsilon$ less than the maximum likelihood that could be achieved via any log-concave distribution. This is the first computationally efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08306","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":"1907.08306","created_at":"2026-05-17T23:40:10.273130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08306v1","created_at":"2026-05-17T23:40:10.273130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08306","created_at":"2026-05-17T23:40:10.273130+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUVNP7NA4IC3","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUVNP7NA4IC3XHBC","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUVNP7NA","created_at":"2026-05-18T12:33:15.570797+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/FUVNP7NA4IC3XHBCDP3E3AVGSH","json":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH.json","graph_json":"https://pith.science/api/pith-number/FUVNP7NA4IC3XHBCDP3E3AVGSH/graph.json","events_json":"https://pith.science/api/pith-number/FUVNP7NA4IC3XHBCDP3E3AVGSH/events.json","paper":"https://pith.science/paper/FUVNP7NA"},"agent_actions":{"view_html":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH","download_json":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH.json","view_paper":"https://pith.science/paper/FUVNP7NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08306&json=true","fetch_graph":"https://pith.science/api/pith-number/FUVNP7NA4IC3XHBCDP3E3AVGSH/graph.json","fetch_events":"https://pith.science/api/pith-number/FUVNP7NA4IC3XHBCDP3E3AVGSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH/action/storage_attestation","attest_author":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH/action/author_attestation","sign_citation":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH/action/citation_signature","submit_replication":"https://pith.science/pith/FUVNP7NA4IC3XHBCDP3E3AVGSH/action/replication_record"}},"created_at":"2026-05-17T23:40:10.273130+00:00","updated_at":"2026-05-17T23:40:10.273130+00:00"}