{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PWKIN3WI6ZXMKG7KSY4AX57GIF","short_pith_number":"pith:PWKIN3WI","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"},"canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","source":{"kind":"arxiv","id":"1511.03796","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03796","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03796v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03796","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"PWKIN3WI6ZXM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWKIN3WI6ZXMKG7K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWKIN3WI","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PWKIN3WI6ZXMKG7KSY4AX57GIF","target":"record","payload":{"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"},"canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","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"},"source_kind":"arxiv","source_id":"1511.03796","source_version":2,"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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1MV4RVDPF+ZvPqe08kmSiHo2XTZt0cGc5PItudMWS5xc/9j/dIPeADzJChMJCpVvbGpYFvQY7FhQvThHbCiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:30:06.340989Z"},"content_sha256":"497977e47331463c5fc07671fa397b6549751dd3513d7b2fd3e6a017c7cfeda1","schema_version":"1.0","event_id":"sha256:497977e47331463c5fc07671fa397b6549751dd3513d7b2fd3e6a017c7cfeda1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PWKIN3WI6ZXMKG7KSY4AX57GIF","target":"graph","payload":{"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"},"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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXBo+9rGWpQyvO3boDDTaz+tV5uPQA8UTr8/9nxVeIqHTUcizWdW9IRQptltdADVuGBinPn/7K609EK2uGWKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:30:06.341349Z"},"content_sha256":"fef7219028b84e399289f0f49df2783f83a85cbf96f03ea6a7ea4ce03f186a6c","schema_version":"1.0","event_id":"sha256:fef7219028b84e399289f0f49df2783f83a85cbf96f03ea6a7ea4ce03f186a6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/bundle.json","state_url":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/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-06-10T20:30:06Z","links":{"resolver":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF","bundle":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/bundle.json","state":"https://pith.science/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWKIN3WI6ZXMKG7KSY4AX57GIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PWKIN3WI6ZXMKG7KSY4AX57GIF","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":"3f4e546380f5c5d4950d83e26d72724a1847790ea4c15d637e94e15eea1e1428","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-11-12T06:36:53Z","title_canon_sha256":"a325c4ada6f0249d95db2f4fb767de5c82d25e21de40133805947c8762ec2924"},"schema_version":"1.0","source":{"id":"1511.03796","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03796","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03796v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03796","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"PWKIN3WI6ZXM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWKIN3WI6ZXMKG7K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWKIN3WI","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fef7219028b84e399289f0f49df2783f83a85cbf96f03ea6a7ea4ce03f186a6c","target":"graph","created_at":"2026-05-18T01:13:39Z","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":"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","authors_text":"Siqi Sun, Yuancheng Zhu, Zhe Liu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-11-12T06:36:53Z","title":"Learning Nonparametric Forest Graphical Models with Prior Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03796","kind":"arxiv","version":2},"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:497977e47331463c5fc07671fa397b6549751dd3513d7b2fd3e6a017c7cfeda1","target":"record","created_at":"2026-05-18T01:13:39Z","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":"3f4e546380f5c5d4950d83e26d72724a1847790ea4c15d637e94e15eea1e1428","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-11-12T06:36:53Z","title_canon_sha256":"a325c4ada6f0249d95db2f4fb767de5c82d25e21de40133805947c8762ec2924"},"schema_version":"1.0","source":{"id":"1511.03796","kind":"arxiv","version":2}},"canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d9486eec8f66ec51bea96380bf7e6415585bb03fad23b1c776b7748ac43310c","first_computed_at":"2026-05-18T01:13:39.977943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.977943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HxWju41EcCG24Ch5oA4HKqJ1oq6i8YYf4f0jI4oTc47WY1ZM4ISVNJgNDQxd+NAZligPuYLpAw3mLyJmIXfMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.978575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03796","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497977e47331463c5fc07671fa397b6549751dd3513d7b2fd3e6a017c7cfeda1","sha256:fef7219028b84e399289f0f49df2783f83a85cbf96f03ea6a7ea4ce03f186a6c"],"state_sha256":"4cb1540a64d0ce9aa307af79fcdc213155aa15fa1c92a9daf0bae61895f5037c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8r3YTJx80QFY+kKRYnXK2mGxPaK3K9cIIiGXZ0CQRp/HOyAhpX6pJCSX1qNXCdB6U1jypuX0NBM8CIoIpyRKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:30:06.343487Z","bundle_sha256":"ec48e7fae0152be711228138b3571cbbcfe42eaf13e42dc7fc1a0ef008056007"}}