{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KW24WUOAPTHPLCVBRTRIACGIC7","short_pith_number":"pith:KW24WUOA","schema_version":"1.0","canonical_sha256":"55b5cb51c07ccef58aa18ce28008c817c5221e07b8bd9c2ea1a045944129744a","source":{"kind":"arxiv","id":"1001.1557","version":2},"attestation_state":"computed","paper":{"title":"Forest Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Anupam Gupta, Haijie Gu, Han Liu, John Lafferty, Larry Wasserman, Min Xu","submitted_at":"2010-01-10T20:39:25Z","abstract_excerpt":"We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to a forest; rather, we form kernel density estimates of the bivariate and univariate marginals, and apply Kruskal's algorithm to estimate the optimal forest on held out data. We prove an oracle inequality on the excess risk of the resulting estimator relative to the risk of the best forest. For graph estimation, we consider the problem of estimating forests wi"},"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":"1001.1557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-10T20:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"f070f7e675143cda9110c5c6d1266b402a5ecf557028f762dc87b0b69e1d7e3f","abstract_canon_sha256":"0a454323ae24b7dee5fd076ba2726fc451df260369db83c1921a1da8a6049364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:00.176524Z","signature_b64":"iEj7LQrJ9LBtKQ+R4PzocdVTww1nvN+oc6hLbeUYn8KWz/jeRq0SbWS0PU7J0zcivcEVKCcGLnHeWVih/C2ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b5cb51c07ccef58aa18ce28008c817c5221e07b8bd9c2ea1a045944129744a","last_reissued_at":"2026-05-18T04:39:00.176084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:00.176084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Anupam Gupta, Haijie Gu, Han Liu, John Lafferty, Larry Wasserman, Min Xu","submitted_at":"2010-01-10T20:39:25Z","abstract_excerpt":"We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to a forest; rather, we form kernel density estimates of the bivariate and univariate marginals, and apply Kruskal's algorithm to estimate the optimal forest on held out data. We prove an oracle inequality on the excess risk of the resulting estimator relative to the risk of the best forest. For graph estimation, we consider the problem of estimating forests wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1557","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":"1001.1557","created_at":"2026-05-18T04:39:00.176140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.1557v2","created_at":"2026-05-18T04:39:00.176140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1557","created_at":"2026-05-18T04:39:00.176140+00:00"},{"alias_kind":"pith_short_12","alias_value":"KW24WUOAPTHP","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KW24WUOAPTHPLCVB","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KW24WUOA","created_at":"2026-05-18T12:26:09.077623+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/KW24WUOAPTHPLCVBRTRIACGIC7","json":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7.json","graph_json":"https://pith.science/api/pith-number/KW24WUOAPTHPLCVBRTRIACGIC7/graph.json","events_json":"https://pith.science/api/pith-number/KW24WUOAPTHPLCVBRTRIACGIC7/events.json","paper":"https://pith.science/paper/KW24WUOA"},"agent_actions":{"view_html":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7","download_json":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7.json","view_paper":"https://pith.science/paper/KW24WUOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.1557&json=true","fetch_graph":"https://pith.science/api/pith-number/KW24WUOAPTHPLCVBRTRIACGIC7/graph.json","fetch_events":"https://pith.science/api/pith-number/KW24WUOAPTHPLCVBRTRIACGIC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7/action/storage_attestation","attest_author":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7/action/author_attestation","sign_citation":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7/action/citation_signature","submit_replication":"https://pith.science/pith/KW24WUOAPTHPLCVBRTRIACGIC7/action/replication_record"}},"created_at":"2026-05-18T04:39:00.176140+00:00","updated_at":"2026-05-18T04:39:00.176140+00:00"}