{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J363H7DKB4JSOURP4YOA56WKVV","short_pith_number":"pith:J363H7DK","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"},"canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","source":{"kind":"arxiv","id":"1811.03204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03204","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03204v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03204","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"J363H7DKB4JS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J363H7DKB4JSOURP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J363H7DK","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J363H7DKB4JSOURP4YOA56WKVV","target":"record","payload":{"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"},"canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","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"},"source_kind":"arxiv","source_id":"1811.03204","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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELBfrY5mQPN4LWh6B74UU6mlTyO+6wL9YU7a+wAk8onubIvrfZootkeb6arLLbSK5UcUM4bPdvXJrvpabqGVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:24.341355Z"},"content_sha256":"34756590707210fdf3daaf2550055b3928da56c3778e3b9be3a6dc269d515b5e","schema_version":"1.0","event_id":"sha256:34756590707210fdf3daaf2550055b3928da56c3778e3b9be3a6dc269d515b5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J363H7DKB4JSOURP4YOA56WKVV","target":"graph","payload":{"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"},"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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18yBvv4ik2hPmuP9entBNHFhiTwRtukrmyuWCSD9z2aU1f34uAkjz5/pPkmjJj6XwdAU5e2WXp89djHQmOJnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:24.342019Z"},"content_sha256":"09aa0bd1ed40f6b1c6b2ea540c3c847f7a747efc4d4946ee53a9d5063508195d","schema_version":"1.0","event_id":"sha256:09aa0bd1ed40f6b1c6b2ea540c3c847f7a747efc4d4946ee53a9d5063508195d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/bundle.json","state_url":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J363H7DKB4JSOURP4YOA56WKVV/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-05-26T19:59:24Z","links":{"resolver":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV","bundle":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/bundle.json","state":"https://pith.science/pith/J363H7DKB4JSOURP4YOA56WKVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J363H7DKB4JSOURP4YOA56WKVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J363H7DKB4JSOURP4YOA56WKVV","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":"8d7fa1eb38adaed246153d4546de2f0afbe202a119e1500a70b22d074f12ce00","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T01:04:51Z","title_canon_sha256":"e20a6c4d69307b31758eb3a4cac8c1865cc42cdd7b29b9d875621604693659b8"},"schema_version":"1.0","source":{"id":"1811.03204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03204","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03204v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03204","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"J363H7DKB4JS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J363H7DKB4JSOURP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J363H7DK","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:09aa0bd1ed40f6b1c6b2ea540c3c847f7a747efc4d4946ee53a9d5063508195d","target":"graph","created_at":"2026-05-18T00:01:18Z","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":"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$.","authors_text":"Brian Axelrod, Gregory Valiant","cross_cats":["stat.CO"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T01:04:51Z","title":"An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03204","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:34756590707210fdf3daaf2550055b3928da56c3778e3b9be3a6dc269d515b5e","target":"record","created_at":"2026-05-18T00:01:18Z","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":"8d7fa1eb38adaed246153d4546de2f0afbe202a119e1500a70b22d074f12ce00","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T01:04:51Z","title_canon_sha256":"e20a6c4d69307b31758eb3a4cac8c1865cc42cdd7b29b9d875621604693659b8"},"schema_version":"1.0","source":{"id":"1811.03204","kind":"arxiv","version":1}},"canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4efdb3fc6a0f1327522fe61c0efacaad5c74ac9aa1bfe23861d9b524040028da","first_computed_at":"2026-05-18T00:01:18.860932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:18.860932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2bZoIZc1sVVkgQ25FOL7e7IifDinnQ/rMf89RjMxGxVefdpmUAu9xka8ImWLBtIKtGU1EkJVh9w6P1G+Q88DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:18.861336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34756590707210fdf3daaf2550055b3928da56c3778e3b9be3a6dc269d515b5e","sha256:09aa0bd1ed40f6b1c6b2ea540c3c847f7a747efc4d4946ee53a9d5063508195d"],"state_sha256":"4c7d15416df7c0a89a728f31965d742bcbb5cb80db21ec9456fcdf6f63660336"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4694m+ofdVmvNK9zNC2ONnPPPPfb0x7yyeXz6j2b2js8AaX1X5VhDfBtoJO1t3rxZj1AepiS7qlP+QlsABxMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:59:24.345849Z","bundle_sha256":"794c2233562034d767932f0d798484e2d823491991dc680c4fdfa542e2031bbd"}}