{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GQIE4YWFNF6XKFMJXJYLGDM422","short_pith_number":"pith:GQIE4YWF","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"},"canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","source":{"kind":"arxiv","id":"1812.05524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05524","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05524v1","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05524","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"GQIE4YWFNF6X","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQIE4YWFNF6XKFMJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQIE4YWF","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GQIE4YWFNF6XKFMJXJYLGDM422","target":"record","payload":{"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"},"canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","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"},"source_kind":"arxiv","source_id":"1812.05524","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LHLsG7MoIpPljbl4C00ZI/gJdoAReBKJHlFJ82ZPUj1MCyK/4nQKOMimhki81VOtlhjhpoJKv84q3tLV8W2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:46:28.268874Z"},"content_sha256":"6909c24787a1088b4978eeeb5fec18a58d48d57c488cf279eaf3242315fe1d84","schema_version":"1.0","event_id":"sha256:6909c24787a1088b4978eeeb5fec18a58d48d57c488cf279eaf3242315fe1d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GQIE4YWFNF6XKFMJXJYLGDM422","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTgEOFHrTe72XlOZ9GG7kjUURi1jEjejq1qAh93YOAQoXyK909NW34YHrRXmIc8dxbGbuft9nNHSBJg+lnCGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:46:28.269228Z"},"content_sha256":"28d9faeda2ed397321a41ec8053962b8ca2e0ca48eb615869170f03529c7bcb2","schema_version":"1.0","event_id":"sha256:28d9faeda2ed397321a41ec8053962b8ca2e0ca48eb615869170f03529c7bcb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/bundle.json","state_url":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQIE4YWFNF6XKFMJXJYLGDM422/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T15:46:28Z","links":{"resolver":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422","bundle":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/bundle.json","state":"https://pith.science/pith/GQIE4YWFNF6XKFMJXJYLGDM422/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQIE4YWFNF6XKFMJXJYLGDM422/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GQIE4YWFNF6XKFMJXJYLGDM422","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e65ca51ab288c08adf745b78d12623e0152c7252fbaae5d601dd96e37873a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T17:09:21Z","title_canon_sha256":"dd2c071b7cb44ae762e79b120da6681cc3a561c0a4ddae4b79a23c9f3c086821"},"schema_version":"1.0","source":{"id":"1812.05524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05524","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05524v1","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05524","created_at":"2026-05-17T23:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"GQIE4YWFNF6X","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQIE4YWFNF6XKFMJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQIE4YWF","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:28d9faeda2ed397321a41ec8053962b8ca2e0ca48eb615869170f03529c7bcb2","target":"graph","created_at":"2026-05-17T23:58:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alistair Stewart, Anastasios Sidiropoulos, Ilias Diakonikolas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T17:09:21Z","title":"A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05524","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6909c24787a1088b4978eeeb5fec18a58d48d57c488cf279eaf3242315fe1d84","target":"record","created_at":"2026-05-17T23:58:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e65ca51ab288c08adf745b78d12623e0152c7252fbaae5d601dd96e37873a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T17:09:21Z","title_canon_sha256":"dd2c071b7cb44ae762e79b120da6681cc3a561c0a4ddae4b79a23c9f3c086821"},"schema_version":"1.0","source":{"id":"1812.05524","kind":"arxiv","version":1}},"canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34104e62c5697d751589ba70b30d9cd69ee9091a91e2ea111f4d7794fd6ece95","first_computed_at":"2026-05-17T23:58:20.039809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:20.039809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/EUIII9IFLEU18qLeFCBXjjeDmeo+015kk7J4IbNDhdE+ODTV5FkJxRpzgb/pil5bSpzz7Rc0bvnTPFAcVnVAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:20.040236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6909c24787a1088b4978eeeb5fec18a58d48d57c488cf279eaf3242315fe1d84","sha256:28d9faeda2ed397321a41ec8053962b8ca2e0ca48eb615869170f03529c7bcb2"],"state_sha256":"a505fb6eec11b6510033a185d88c1c8ad5fce26309ecbfa7db1860fd99f03c2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfJeKnHvTg1S4me3MHCMO03N95Yxqlh7DYqx5MAzHxjRdHAZt63iF45cnhT67mHqEzMfPl3ZtRaic1v4lSzCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:46:28.271206Z","bundle_sha256":"3b00f814007797662491c879004b78725296ed50ae4139b75ee213ff5299bcda"}}