{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DYDH5DQSJ7QQ3LBGT5LTPFJHNP","short_pith_number":"pith:DYDH5DQS","schema_version":"1.0","canonical_sha256":"1e067e8e124fe10dac269f573795276bcbaf15b26af3ed17ab8bb0bc00ff7aea","source":{"kind":"arxiv","id":"1805.07272","version":2},"attestation_state":"computed","paper":{"title":"Fast Multivariate Log-Concave Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christoph Schn\\\"orr, Fabian Rathke","submitted_at":"2018-05-18T15:13:21Z","abstract_excerpt":"A novel computational approach to log-concave density estimation is proposed. Previous approaches utilize the piecewise-affine parametrization of the density induced by the given sample set. The number of parameters as well as non-smooth subgradient-based convex optimization for determining the maximum likelihood density estimate cause long runtimes for dimensions $d \\geq 2$ and large sample sets. The presented approach is based on mildly non-convex smooth approximations of the objective function and \\textit{sparse}, adaptive piecewise-affine density parametrization. Established memory-efficie"},"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":"1805.07272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-05-18T15:13:21Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"8fbec0c09c5c144b64a973023528166cbf34f2e0c6fe0f8b3e5c778bdd4c559f","abstract_canon_sha256":"d2037d6819fa823db5212251b0e54aa732a41920dbd193929f116e8dc8a269ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.564421Z","signature_b64":"4XG3AGk42LN488DsiHp2pteQBFW/c6DtYrT5GAkGIju4FVbyOGb5ZvZ/5q8Y8nNT1fXEEdojbbVmV0MDbbXCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e067e8e124fe10dac269f573795276bcbaf15b26af3ed17ab8bb0bc00ff7aea","last_reissued_at":"2026-05-17T23:53:09.563870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.563870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Multivariate Log-Concave Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Christoph Schn\\\"orr, Fabian Rathke","submitted_at":"2018-05-18T15:13:21Z","abstract_excerpt":"A novel computational approach to log-concave density estimation is proposed. Previous approaches utilize the piecewise-affine parametrization of the density induced by the given sample set. The number of parameters as well as non-smooth subgradient-based convex optimization for determining the maximum likelihood density estimate cause long runtimes for dimensions $d \\geq 2$ and large sample sets. The presented approach is based on mildly non-convex smooth approximations of the objective function and \\textit{sparse}, adaptive piecewise-affine density parametrization. Established memory-efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07272","kind":"arxiv","version":2},"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":"1805.07272","created_at":"2026-05-17T23:53:09.563950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07272v2","created_at":"2026-05-17T23:53:09.563950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07272","created_at":"2026-05-17T23:53:09.563950+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYDH5DQSJ7QQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYDH5DQSJ7QQ3LBG","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYDH5DQS","created_at":"2026-05-18T12:32:19.392346+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":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP","json":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP.json","graph_json":"https://pith.science/api/pith-number/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/graph.json","events_json":"https://pith.science/api/pith-number/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/events.json","paper":"https://pith.science/paper/DYDH5DQS"},"agent_actions":{"view_html":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP","download_json":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP.json","view_paper":"https://pith.science/paper/DYDH5DQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07272&json=true","fetch_graph":"https://pith.science/api/pith-number/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/graph.json","fetch_events":"https://pith.science/api/pith-number/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/action/storage_attestation","attest_author":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/action/author_attestation","sign_citation":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/action/citation_signature","submit_replication":"https://pith.science/pith/DYDH5DQSJ7QQ3LBGT5LTPFJHNP/action/replication_record"}},"created_at":"2026-05-17T23:53:09.563950+00:00","updated_at":"2026-05-17T23:53:09.563950+00:00"}