{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4JRJ767VR7L63XOF3L6WBAFWAE","short_pith_number":"pith:4JRJ767V","canonical_record":{"source":{"id":"1210.4884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:45:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"22107fe4f2bedcafde2e2ab61d1cef0ecf36f0fa7721e4c5e8d47c848e92453e","abstract_canon_sha256":"07df144a012980962f35cbfeac349b7efa031d17542a30817c4559f5b01ed6da"},"schema_version":"1.0"},"canonical_sha256":"e2629ffbf58fd7edddc5dafd6080b60114860476663cb3c6c873acbe72aa5965","source":{"kind":"arxiv","id":"1210.4884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4884","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4884v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4884","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"4JRJ767VR7L6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JRJ767VR7L63XOF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JRJ767V","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4JRJ767VR7L63XOF3L6WBAFWAE","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:45:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"22107fe4f2bedcafde2e2ab61d1cef0ecf36f0fa7721e4c5e8d47c848e92453e","abstract_canon_sha256":"07df144a012980962f35cbfeac349b7efa031d17542a30817c4559f5b01ed6da"},"schema_version":"1.0"},"canonical_sha256":"e2629ffbf58fd7edddc5dafd6080b60114860476663cb3c6c873acbe72aa5965","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.189721Z","signature_b64":"SwDE1HsjZnObJ+nTvuRNNWlomx+xmkpa4Dwarg5Szs2gE5NJdXF0loDoZdYyeBZ3H2KIJCm+nq2UfTvVd90SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2629ffbf58fd7edddc5dafd6080b60114860476663cb3c6c873acbe72aa5965","last_reissued_at":"2026-05-18T03:42:55.189177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.189177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4884","source_version":1,"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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sokc+X9WALnVp2uXcF4xg9EO81dBbp0iiuhgfg76nlfkPC0X8JPLfY6XYMXfD+mSpy1+6eQoJg2Odpbc+mA9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:41:54.007077Z"},"content_sha256":"a8c7556e15f42fd32abd6670ae087922efbf6397c2dc1215883d8c4eb3b65cb7","schema_version":"1.0","event_id":"sha256:a8c7556e15f42fd32abd6670ae087922efbf6397c2dc1215883d8c4eb3b65cb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4JRJ767VR7L63XOF3L6WBAFWAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Spectral Algorithm for Latent Junction Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur P. Parikh, Eric P. Xing, Gabi Teodoru, Le Song, Mariya Ishteva","submitted_at":"2012-10-16T17:45:30Z","abstract_excerpt":"Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies predominantly on local search heuristics such as Expectation Maximization. Using tensor algebra, we propose an alternative parameterization of latent variable models (where the model structures are junction trees) that still allows for computation of marginals among observed variables. While this novel representation leads to a moderate increase in the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4884","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"},"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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ct+wZTWw+wzUCu5U6/mp0QuaMXEInCG5Z6X4gYroRbDZzIH6iVwpm83wYRWWAOgc+N5FSoUUOB3XEsew5/1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:41:54.007456Z"},"content_sha256":"b280606cc12e3444f109e0834ef5a82b3ab74053fbfa63ad5ae6225cc5f570ee","schema_version":"1.0","event_id":"sha256:b280606cc12e3444f109e0834ef5a82b3ab74053fbfa63ad5ae6225cc5f570ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JRJ767VR7L63XOF3L6WBAFWAE/bundle.json","state_url":"https://pith.science/pith/4JRJ767VR7L63XOF3L6WBAFWAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JRJ767VR7L63XOF3L6WBAFWAE/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-22T23:41:54Z","links":{"resolver":"https://pith.science/pith/4JRJ767VR7L63XOF3L6WBAFWAE","bundle":"https://pith.science/pith/4JRJ767VR7L63XOF3L6WBAFWAE/bundle.json","state":"https://pith.science/pith/4JRJ767VR7L63XOF3L6WBAFWAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JRJ767VR7L63XOF3L6WBAFWAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4JRJ767VR7L63XOF3L6WBAFWAE","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":"07df144a012980962f35cbfeac349b7efa031d17542a30817c4559f5b01ed6da","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:45:30Z","title_canon_sha256":"22107fe4f2bedcafde2e2ab61d1cef0ecf36f0fa7721e4c5e8d47c848e92453e"},"schema_version":"1.0","source":{"id":"1210.4884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4884","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4884v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4884","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"4JRJ767VR7L6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JRJ767VR7L63XOF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JRJ767V","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b280606cc12e3444f109e0834ef5a82b3ab74053fbfa63ad5ae6225cc5f570ee","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies predominantly on local search heuristics such as Expectation Maximization. Using tensor algebra, we propose an alternative parameterization of latent variable models (where the model structures are junction trees) that still allows for computation of marginals among observed variables. While this novel representation leads to a moderate increase in the number o","authors_text":"Ankur P. Parikh, Eric P. Xing, Gabi Teodoru, Le Song, Mariya Ishteva","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:45:30Z","title":"A Spectral Algorithm for Latent Junction Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4884","kind":"arxiv","version":1},"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:a8c7556e15f42fd32abd6670ae087922efbf6397c2dc1215883d8c4eb3b65cb7","target":"record","created_at":"2026-05-18T03:42:55Z","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":"07df144a012980962f35cbfeac349b7efa031d17542a30817c4559f5b01ed6da","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:45:30Z","title_canon_sha256":"22107fe4f2bedcafde2e2ab61d1cef0ecf36f0fa7721e4c5e8d47c848e92453e"},"schema_version":"1.0","source":{"id":"1210.4884","kind":"arxiv","version":1}},"canonical_sha256":"e2629ffbf58fd7edddc5dafd6080b60114860476663cb3c6c873acbe72aa5965","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2629ffbf58fd7edddc5dafd6080b60114860476663cb3c6c873acbe72aa5965","first_computed_at":"2026-05-18T03:42:55.189177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.189177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SwDE1HsjZnObJ+nTvuRNNWlomx+xmkpa4Dwarg5Szs2gE5NJdXF0loDoZdYyeBZ3H2KIJCm+nq2UfTvVd90SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.189721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8c7556e15f42fd32abd6670ae087922efbf6397c2dc1215883d8c4eb3b65cb7","sha256:b280606cc12e3444f109e0834ef5a82b3ab74053fbfa63ad5ae6225cc5f570ee"],"state_sha256":"ddd6e2c53770a4616031f0c0c33e396107c94886df6dd1872a321989a161cd4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmffeioWaw8gFrTrJGJBqf3OrW3gfPBVyBlIaDbZVlSPYEF6ADn4BzqZ/+oMHGHn93agCEt7txYd5xj1yoc4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:41:54.009470Z","bundle_sha256":"ad61af19d4f4e957992d28185a5981279b1ac5c72b7a2f12533623ed4fb61d86"}}