{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PWKIN3WI6ZXMKG7KSY4AX57GIF","short_pith_number":"pith:PWKIN3WI","schema_version":"1.0","canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","source":{"kind":"arxiv","id":"1511.03796","version":2},"attestation_state":"computed","paper":{"title":"Learning Nonparametric Forest Graphical Models with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Siqi Sun, Yuancheng Zhu, Zhe Liu","submitted_at":"2015-11-12T06:36:53Z","abstract_excerpt":"We present a framework for incorporating prior information into nonparametric estimation of graphical models. To avoid distributional assumptions, we restrict the graph to be a forest and build on the work of forest density estimation (FDE). We reformulate the FDE approach from a Bayesian perspective, and introduce prior distributions on the graphs. As two concrete examples, we apply this framework to estimating scale-free graphs and learning multiple graphs with similar structures. The resulting algorithms are equivalent to finding a maximum spanning tree of a weighted graph with a penalty te"},"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":"1511.03796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-11-12T06:36:53Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a325c4ada6f0249d95db2f4fb767de5c82d25e21de40133805947c8762ec2924","abstract_canon_sha256":"3f4e546380f5c5d4950d83e26d72724a1847790ea4c15d637e94e15eea1e1428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.978575Z","signature_b64":"HxWju41EcCG24Ch5oA4HKqJ1oq6i8YYf4f0jI4oTc47WY1ZM4ISVNJgNDQxd+NAZligPuYLpAw3mLyJmIXfMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","last_reissued_at":"2026-05-18T01:13:39.977943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.977943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Nonparametric Forest Graphical Models with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Siqi Sun, Yuancheng Zhu, Zhe Liu","submitted_at":"2015-11-12T06:36:53Z","abstract_excerpt":"We present a framework for incorporating prior information into nonparametric estimation of graphical models. To avoid distributional assumptions, we restrict the graph to be a forest and build on the work of forest density estimation (FDE). We reformulate the FDE approach from a Bayesian perspective, and introduce prior distributions on the graphs. As two concrete examples, we apply this framework to estimating scale-free graphs and learning multiple graphs with similar structures. The resulting algorithms are equivalent to finding a maximum spanning tree of a weighted graph with a penalty te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03796","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":"1511.03796","created_at":"2026-05-18T01:13:39.978030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03796v2","created_at":"2026-05-18T01:13:39.978030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03796","created_at":"2026-05-18T01:13:39.978030+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWKIN3WI6ZXM","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWKIN3WI6ZXMKG7K","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWKIN3WI","created_at":"2026-05-18T12:29:37.295048+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/PWKIN3WI6ZXMKG7KSY4AX57GIF","json":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF.json","graph_json":"https://pith.science/api/pith-number/PWKIN3WI6ZXMKG7KSY4AX57GIF/graph.json","events_json":"https://pith.science/api/pith-number/PWKIN3WI6ZXMKG7KSY4AX57GIF/events.json","paper":"https://pith.science/paper/PWKIN3WI"},"agent_actions":{"view_html":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF","download_json":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF.json","view_paper":"https://pith.science/paper/PWKIN3WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03796&json=true","fetch_graph":"https://pith.science/api/pith-number/PWKIN3WI6ZXMKG7KSY4AX57GIF/graph.json","fetch_events":"https://pith.science/api/pith-number/PWKIN3WI6ZXMKG7KSY4AX57GIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/action/storage_attestation","attest_author":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/action/author_attestation","sign_citation":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/action/citation_signature","submit_replication":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/action/replication_record"}},"created_at":"2026-05-18T01:13:39.978030+00:00","updated_at":"2026-05-18T01:13:39.978030+00:00"}