{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7UDZUZ4QZIVEK7VCEEI5AMOOWB","short_pith_number":"pith:7UDZUZ4Q","canonical_record":{"source":{"id":"1411.1132","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-05T02:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"ef97282f2ee4df26209d201fb98e0f437b86d0dcf35719272c9479232c19d581","abstract_canon_sha256":"68f8142b53211ea4eb7d4a392e799d124b7f6a978c91c9c216dcb6d32ce582ec"},"schema_version":"1.0"},"canonical_sha256":"fd079a6790ca2a457ea22111d031ceb07c6b636fe856f1be17d58df823d12a5c","source":{"kind":"arxiv","id":"1411.1132","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1132","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1132v7","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1132","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"7UDZUZ4QZIVE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UDZUZ4QZIVEK7VC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UDZUZ4Q","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7UDZUZ4QZIVEK7VCEEI5AMOOWB","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1132","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-05T02:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"ef97282f2ee4df26209d201fb98e0f437b86d0dcf35719272c9479232c19d581","abstract_canon_sha256":"68f8142b53211ea4eb7d4a392e799d124b7f6a978c91c9c216dcb6d32ce582ec"},"schema_version":"1.0"},"canonical_sha256":"fd079a6790ca2a457ea22111d031ceb07c6b636fe856f1be17d58df823d12a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:58.705273Z","signature_b64":"sNHauaT/xQsnBB8Ik5EOjwlunSMHr2RzSIPcIuHmZIOLeixfBKBnP8A8B/NKvb4AdHZ3Khi7nvz+MvUrlO5jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd079a6790ca2a457ea22111d031ceb07c6b636fe856f1be17d58df823d12a5c","last_reissued_at":"2026-05-18T01:12:58.704897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:58.704897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1132","source_version":7,"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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+fyMp4GBwXPdW/epc/csa+GDLphxN+BEo4YYIULZMgASBbr8wsu6pKIDBujWSKlEIFO+eS8xMGJRWGggEmPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:53:35.234673Z"},"content_sha256":"bb3f7ea2ca47f0babf3fe2fea68149569d01980841fe702627036eb9f849e444","schema_version":"1.0","event_id":"sha256:bb3f7ea2ca47f0babf3fe2fea68149569d01980841fe702627036eb9f849e444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7UDZUZ4QZIVEK7VCEEI5AMOOWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are you going to the party: depends, who else is coming? [Learning hidden group dynamics via conditional latent tree models]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Animashree Anandkumar, Carter T. Butts, Forough Arabshahi, Furong Huang, Sean M. Fitshugh","submitted_at":"2014-11-05T02:36:58Z","abstract_excerpt":"Scalable probabilistic modeling and prediction in high dimensional multivariate time-series is a challenging problem, particularly for systems with hidden sources of dependence and/or homogeneity. Examples of such problems include dynamic social networks with co-evolving nodes and edges and dynamic student learning in online courses. Here, we address these problems through the discovery of hierarchical latent groups. We introduce a family of Conditional Latent Tree Models (CLTM), in which tree-structured latent variables incorporate the unknown groups. The latent tree itself is conditioned on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1132","kind":"arxiv","version":7},"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:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krXlQeRD4RN8uExgWiLnjxHWWSQYa4bMdLaUQECfkaxLd6Uz10H86WJp60QnrukMM/VowD1MCI72PwZ76XSuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:53:35.235015Z"},"content_sha256":"40820884075bd90317ccd61f4764f9dc0a34a7063357f82ce5b7c08eb72136bd","schema_version":"1.0","event_id":"sha256:40820884075bd90317ccd61f4764f9dc0a34a7063357f82ce5b7c08eb72136bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/bundle.json","state_url":"https://pith.science/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/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-20T08:53:35Z","links":{"resolver":"https://pith.science/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB","bundle":"https://pith.science/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/bundle.json","state":"https://pith.science/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UDZUZ4QZIVEK7VCEEI5AMOOWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7UDZUZ4QZIVEK7VCEEI5AMOOWB","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":"68f8142b53211ea4eb7d4a392e799d124b7f6a978c91c9c216dcb6d32ce582ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-05T02:36:58Z","title_canon_sha256":"ef97282f2ee4df26209d201fb98e0f437b86d0dcf35719272c9479232c19d581"},"schema_version":"1.0","source":{"id":"1411.1132","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1132","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1132v7","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1132","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"7UDZUZ4QZIVE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UDZUZ4QZIVEK7VC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UDZUZ4Q","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:40820884075bd90317ccd61f4764f9dc0a34a7063357f82ce5b7c08eb72136bd","target":"graph","created_at":"2026-05-18T01:12:58Z","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":"Scalable probabilistic modeling and prediction in high dimensional multivariate time-series is a challenging problem, particularly for systems with hidden sources of dependence and/or homogeneity. Examples of such problems include dynamic social networks with co-evolving nodes and edges and dynamic student learning in online courses. Here, we address these problems through the discovery of hierarchical latent groups. We introduce a family of Conditional Latent Tree Models (CLTM), in which tree-structured latent variables incorporate the unknown groups. The latent tree itself is conditioned on ","authors_text":"Animashree Anandkumar, Carter T. Butts, Forough Arabshahi, Furong Huang, Sean M. Fitshugh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-05T02:36:58Z","title":"Are you going to the party: depends, who else is coming? [Learning hidden group dynamics via conditional latent tree models]"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1132","kind":"arxiv","version":7},"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:bb3f7ea2ca47f0babf3fe2fea68149569d01980841fe702627036eb9f849e444","target":"record","created_at":"2026-05-18T01:12:58Z","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":"68f8142b53211ea4eb7d4a392e799d124b7f6a978c91c9c216dcb6d32ce582ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-05T02:36:58Z","title_canon_sha256":"ef97282f2ee4df26209d201fb98e0f437b86d0dcf35719272c9479232c19d581"},"schema_version":"1.0","source":{"id":"1411.1132","kind":"arxiv","version":7}},"canonical_sha256":"fd079a6790ca2a457ea22111d031ceb07c6b636fe856f1be17d58df823d12a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd079a6790ca2a457ea22111d031ceb07c6b636fe856f1be17d58df823d12a5c","first_computed_at":"2026-05-18T01:12:58.704897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:58.704897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sNHauaT/xQsnBB8Ik5EOjwlunSMHr2RzSIPcIuHmZIOLeixfBKBnP8A8B/NKvb4AdHZ3Khi7nvz+MvUrlO5jBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:58.705273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1132","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb3f7ea2ca47f0babf3fe2fea68149569d01980841fe702627036eb9f849e444","sha256:40820884075bd90317ccd61f4764f9dc0a34a7063357f82ce5b7c08eb72136bd"],"state_sha256":"8a3827c6abcd50edb887d06494becbee101de76ac243b506b8ca959bd1e8197e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcZLrqlxrACEqBfcyaVKcQOoguIWDjjPbwTfHylh5Tbo32S4T9b4Ne0NKLzsFna4HG8tK0tcn/ShA3eP3mGQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:53:35.236934Z","bundle_sha256":"e9ed8c235997eaaa95724a71c530d9b387d200befb09e3bc1fd6d68cc5a691b4"}}