{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AFUY5CGHEMULEYYJDHVHEERI5G","short_pith_number":"pith:AFUY5CGH","schema_version":"1.0","canonical_sha256":"01698e88c72328b2630919ea721228e9a98addad7ba77b0aad854003cd15dc2f","source":{"kind":"arxiv","id":"1812.01786","version":1},"attestation_state":"computed","paper":{"title":"Density Deconvolution with Additive Measurement Errors using Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel Apley, David Ruppert, Jeremy Staum, Ran Yang","submitted_at":"2018-12-05T02:21:35Z","abstract_excerpt":"Distribution estimation for noisy data via density deconvolution is a notoriously difficult problem for typical noise distributions like Gaussian. We develop a density deconvolution estimator based on quadratic programming (QP) that can achieve better estimation than kernel density deconvolution methods. The QP approach appears to have a more favorable regularization tradeoff between oversmoothing vs. oscillation, especially at the tails of the distribution. An additional advantage is that it is straightforward to incorporate a number of common density constraints such as nonnegativity, integr"},"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":"1812.01786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-12-05T02:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"30eb57c7d47f27d6bd0238c9063a7a9ad9f343dc298ebcb7dacc544af6cd6ec3","abstract_canon_sha256":"92d7be6212a776d7891fe601f54c9031d34db8a09c07bce2965756eb8115190a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:00.656469Z","signature_b64":"NbctnsG0GLOSMdDu7CvSJE0KBRed8/tnDnUgAIIrQelTclAKN/bz7wS4vd4gD/TS4RLi8G5VGZ494xtLBveYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01698e88c72328b2630919ea721228e9a98addad7ba77b0aad854003cd15dc2f","last_reissued_at":"2026-05-17T23:59:00.656022Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:00.656022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Deconvolution with Additive Measurement Errors using Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniel Apley, David Ruppert, Jeremy Staum, Ran Yang","submitted_at":"2018-12-05T02:21:35Z","abstract_excerpt":"Distribution estimation for noisy data via density deconvolution is a notoriously difficult problem for typical noise distributions like Gaussian. We develop a density deconvolution estimator based on quadratic programming (QP) that can achieve better estimation than kernel density deconvolution methods. The QP approach appears to have a more favorable regularization tradeoff between oversmoothing vs. oscillation, especially at the tails of the distribution. An additional advantage is that it is straightforward to incorporate a number of common density constraints such as nonnegativity, integr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01786","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":"1812.01786","created_at":"2026-05-17T23:59:00.656093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01786v1","created_at":"2026-05-17T23:59:00.656093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01786","created_at":"2026-05-17T23:59:00.656093+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFUY5CGHEMUL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFUY5CGHEMULEYYJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFUY5CGH","created_at":"2026-05-18T12:32:13.499390+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/AFUY5CGHEMULEYYJDHVHEERI5G","json":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G.json","graph_json":"https://pith.science/api/pith-number/AFUY5CGHEMULEYYJDHVHEERI5G/graph.json","events_json":"https://pith.science/api/pith-number/AFUY5CGHEMULEYYJDHVHEERI5G/events.json","paper":"https://pith.science/paper/AFUY5CGH"},"agent_actions":{"view_html":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G","download_json":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G.json","view_paper":"https://pith.science/paper/AFUY5CGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01786&json=true","fetch_graph":"https://pith.science/api/pith-number/AFUY5CGHEMULEYYJDHVHEERI5G/graph.json","fetch_events":"https://pith.science/api/pith-number/AFUY5CGHEMULEYYJDHVHEERI5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G/action/storage_attestation","attest_author":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G/action/author_attestation","sign_citation":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G/action/citation_signature","submit_replication":"https://pith.science/pith/AFUY5CGHEMULEYYJDHVHEERI5G/action/replication_record"}},"created_at":"2026-05-17T23:59:00.656093+00:00","updated_at":"2026-05-17T23:59:00.656093+00:00"}