{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J363H7DKB4JSOURP4YOA56WKVV","short_pith_number":"pith:J363H7DK","schema_version":"1.0","canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","source":{"kind":"arxiv","id":"1811.03204","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Brian Axelrod, Gregory Valiant","submitted_at":"2018-11-08T01:04:51Z","abstract_excerpt":"The log-concave maximum likelihood estimator (MLE) problem answers: for a set of points $X_1,...X_n \\in \\mathbb R^d$, which log-concave density maximizes their likelihood? We present a characterization of the log-concave MLE that leads to an algorithm with runtime $poly(n,d, \\frac 1 \\epsilon,r)$ to compute a log-concave distribution whose log-likelihood is at most $\\epsilon$ less than that of the MLE, and $r$ is parameter of the problem that is bounded by the $\\ell_2$ norm of the vector of log-likelihoods the MLE evaluated at $X_1,...,X_n$."},"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":"1811.03204","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T01:04:51Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"e20a6c4d69307b31758eb3a4cac8c1865cc42cdd7b29b9d875621604693659b8","abstract_canon_sha256":"8d7fa1eb38adaed246153d4546de2f0afbe202a119e1500a70b22d074f12ce00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:18.861336Z","signature_b64":"l2bZoIZc1sVVkgQ25FOL7e7IifDinnQ/rMf89RjMxGxVefdpmUAu9xka8ImWLBtIKtGU1EkJVh9w6P1G+Q88DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","last_reissued_at":"2026-05-18T00:01:18.860932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:18.860932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Brian Axelrod, Gregory Valiant","submitted_at":"2018-11-08T01:04:51Z","abstract_excerpt":"The log-concave maximum likelihood estimator (MLE) problem answers: for a set of points $X_1,...X_n \\in \\mathbb R^d$, which log-concave density maximizes their likelihood? We present a characterization of the log-concave MLE that leads to an algorithm with runtime $poly(n,d, \\frac 1 \\epsilon,r)$ to compute a log-concave distribution whose log-likelihood is at most $\\epsilon$ less than that of the MLE, and $r$ is parameter of the problem that is bounded by the $\\ell_2$ norm of the vector of log-likelihoods the MLE evaluated at $X_1,...,X_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03204","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":"1811.03204","created_at":"2026-05-18T00:01:18.860994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03204v1","created_at":"2026-05-18T00:01:18.860994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03204","created_at":"2026-05-18T00:01:18.860994+00:00"},{"alias_kind":"pith_short_12","alias_value":"J363H7DKB4JS","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J363H7DKB4JSOURP","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J363H7DK","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV","json":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV.json","graph_json":"https://pith.science/api/pith-number/J363H7DKB4JSOURP4YOA56WKVV/graph.json","events_json":"https://pith.science/api/pith-number/J363H7DKB4JSOURP4YOA56WKVV/events.json","paper":"https://pith.science/paper/J363H7DK"},"agent_actions":{"view_html":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV","download_json":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV.json","view_paper":"https://pith.science/paper/J363H7DK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03204&json=true","fetch_graph":"https://pith.science/api/pith-number/J363H7DKB4JSOURP4YOA56WKVV/graph.json","fetch_events":"https://pith.science/api/pith-number/J363H7DKB4JSOURP4YOA56WKVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/action/storage_attestation","attest_author":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/action/author_attestation","sign_citation":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/action/citation_signature","submit_replication":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/action/replication_record"}},"created_at":"2026-05-18T00:01:18.860994+00:00","updated_at":"2026-05-18T00:01:18.860994+00:00"}