{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:URHDP3JRCGLTLNU7RJWFCPHKX7","short_pith_number":"pith:URHDP3JR","canonical_record":{"source":{"id":"1107.1283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-07T02:33:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"58b27db6f63e65d21f63279e657b700af94f9e697ffa94d6051102a1026545f1","abstract_canon_sha256":"2498d2051c70e019a7437f577efa090687fecb9b0d00122b2e6df3c1077174c6"},"schema_version":"1.0"},"canonical_sha256":"a44e37ed31119735b69f8a6c513ceabfe472fe1129070783a78fcf4c6d17edf3","source":{"kind":"arxiv","id":"1107.1283","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1283","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1283v2","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1283","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"URHDP3JRCGLT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"URHDP3JRCGLTLNU7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"URHDP3JR","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:URHDP3JRCGLTLNU7RJWFCPHKX7","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-07T02:33:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"58b27db6f63e65d21f63279e657b700af94f9e697ffa94d6051102a1026545f1","abstract_canon_sha256":"2498d2051c70e019a7437f577efa090687fecb9b0d00122b2e6df3c1077174c6"},"schema_version":"1.0"},"canonical_sha256":"a44e37ed31119735b69f8a6c513ceabfe472fe1129070783a78fcf4c6d17edf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:25.127218Z","signature_b64":"Qg3rvFAcXFsNMjVol+M6wYV4hIS8BjnfV7tucDv9vuKYhdNynMvFLmzLch3Q64Oz/7Fwest9m8TzTchTJmSTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44e37ed31119735b69f8a6c513ceabfe472fe1129070783a78fcf4c6d17edf3","last_reissued_at":"2026-05-18T04:09:25.126652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:25.126652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1283","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-18T04:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwyMxvZxHciwatMgPOgWPV9WnPgZJx+ZvpEr9a6CI4FV33lDGCD6il2XsVipCcrGrSTpgAdFfbrJhnDAhVjICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:30:46.637810Z"},"content_sha256":"c4da73d31dc9d125a4bb421acbd30384fcad5ef9ad002d4604691434e72568e5","schema_version":"1.0","event_id":"sha256:c4da73d31dc9d125a4bb421acbd30384fcad5ef9ad002d4604691434e72568e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:URHDP3JRCGLTLNU7RJWFCPHKX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Methods for Learning Multivariate Latent Tree Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Animashree Anandkumar, Daniel Hsu, Kamalika Chaudhuri, Le Song, Sham M. Kakade, Tong Zhang","submitted_at":"2011-07-07T02:33:31Z","abstract_excerpt":"This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models, hidden Markov models, Gaussian mixture models, and Markov evolutionary trees. The setting is one where we only have samples from certain observed variables in the tree, and our goal is to estimate the tree structure (i.e., the graph of how the underlying hidden variables are connected to each other and to the observed variables). We propose the Spectral Recurs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1283","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-18T04:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuw18cyy3i7GID4FaBOordyF+RDcJWYLY0nSp1GiY6GBeIEcM/uO74yiiEKwp1jNWouJxNXBHw5cXA0CQsexCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:30:46.638153Z"},"content_sha256":"1109fa2dae1761eec490506e26a32b8826317c9666219e81446178e95307c66c","schema_version":"1.0","event_id":"sha256:1109fa2dae1761eec490506e26a32b8826317c9666219e81446178e95307c66c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/bundle.json","state_url":"https://pith.science/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/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-10T14:30:46Z","links":{"resolver":"https://pith.science/pith/URHDP3JRCGLTLNU7RJWFCPHKX7","bundle":"https://pith.science/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/bundle.json","state":"https://pith.science/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URHDP3JRCGLTLNU7RJWFCPHKX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:URHDP3JRCGLTLNU7RJWFCPHKX7","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":"2498d2051c70e019a7437f577efa090687fecb9b0d00122b2e6df3c1077174c6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-07T02:33:31Z","title_canon_sha256":"58b27db6f63e65d21f63279e657b700af94f9e697ffa94d6051102a1026545f1"},"schema_version":"1.0","source":{"id":"1107.1283","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1283","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1283v2","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1283","created_at":"2026-05-18T04:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"URHDP3JRCGLT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"URHDP3JRCGLTLNU7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"URHDP3JR","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:1109fa2dae1761eec490506e26a32b8826317c9666219e81446178e95307c66c","target":"graph","created_at":"2026-05-18T04:09:25Z","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":"This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models, hidden Markov models, Gaussian mixture models, and Markov evolutionary trees. The setting is one where we only have samples from certain observed variables in the tree, and our goal is to estimate the tree structure (i.e., the graph of how the underlying hidden variables are connected to each other and to the observed variables). We propose the Spectral Recurs","authors_text":"Animashree Anandkumar, Daniel Hsu, Kamalika Chaudhuri, Le Song, Sham M. Kakade, Tong Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-07T02:33:31Z","title":"Spectral Methods for Learning Multivariate Latent Tree Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1283","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:c4da73d31dc9d125a4bb421acbd30384fcad5ef9ad002d4604691434e72568e5","target":"record","created_at":"2026-05-18T04:09:25Z","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":"2498d2051c70e019a7437f577efa090687fecb9b0d00122b2e6df3c1077174c6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-07T02:33:31Z","title_canon_sha256":"58b27db6f63e65d21f63279e657b700af94f9e697ffa94d6051102a1026545f1"},"schema_version":"1.0","source":{"id":"1107.1283","kind":"arxiv","version":2}},"canonical_sha256":"a44e37ed31119735b69f8a6c513ceabfe472fe1129070783a78fcf4c6d17edf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a44e37ed31119735b69f8a6c513ceabfe472fe1129070783a78fcf4c6d17edf3","first_computed_at":"2026-05-18T04:09:25.126652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:25.126652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qg3rvFAcXFsNMjVol+M6wYV4hIS8BjnfV7tucDv9vuKYhdNynMvFLmzLch3Q64Oz/7Fwest9m8TzTchTJmSTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:25.127218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1283","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4da73d31dc9d125a4bb421acbd30384fcad5ef9ad002d4604691434e72568e5","sha256:1109fa2dae1761eec490506e26a32b8826317c9666219e81446178e95307c66c"],"state_sha256":"3b94ec7d1f28b8b683536b19548e173d033ea6923fed299601ed62f2b77934b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"go/Ysho3tPRIY8jBA1sxWgw6+665ToBL2rxBQkTPz/AMdVcD2wrAVd+HtRqI+YEgYGGUUFpRvDSjFUmUBpvUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:30:46.640129Z","bundle_sha256":"ff1271021db94aa68614b6431541e08d749aaf66a44eafc4c5948f3efdbc3d4a"}}