{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:R6KM6BO6R2GDVYHKNQZRRROLIO","short_pith_number":"pith:R6KM6BO6","canonical_record":{"source":{"id":"0909.4331","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2009-09-23T22:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"135703b82a350f5b2388c63a909c65a67bcecfd00d331f7ce9766fda64f88630","abstract_canon_sha256":"f7c8fe9b55c11503f73e1f6d75f75a95647cdf35451d12a2f5720008a75d48a9"},"schema_version":"1.0"},"canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","source":{"kind":"arxiv","id":"0909.4331","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.4331","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0909.4331v3","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4331","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"R6KM6BO6R2GD","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R6KM6BO6R2GDVYHK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R6KM6BO6","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:R6KM6BO6R2GDVYHKNQZRRROLIO","target":"record","payload":{"canonical_record":{"source":{"id":"0909.4331","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2009-09-23T22:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"135703b82a350f5b2388c63a909c65a67bcecfd00d331f7ce9766fda64f88630","abstract_canon_sha256":"f7c8fe9b55c11503f73e1f6d75f75a95647cdf35451d12a2f5720008a75d48a9"},"schema_version":"1.0"},"canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.405643Z","signature_b64":"OmSB+E3Ukeov8olLlAL0BZgOk22MKSKUyPWrush9rDzmu5dU/pQmCV3gI7sEXli0VPh/SEVNgZEaN7kH1hBgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","last_reissued_at":"2026-05-18T04:39:50.405140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.405140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.4331","source_version":3,"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:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dULMOcSUtIvsPOCNRxw1axZF7z6eg2w/6qRruCfLtOsGpjHsg0BW8GJSIUv9+gah8ceb+sPka2f4az8MGAOlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:55.934507Z"},"content_sha256":"aa95a162facfb6d5300bb77ec1ef59a1cd02c87642e722b51e4ea5db50cb71fa","schema_version":"1.0","event_id":"sha256:aa95a162facfb6d5300bb77ec1ef59a1cd02c87642e722b51e4ea5db50cb71fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:R6KM6BO6R2GDVYHKNQZRRROLIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical relational models for document networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"David M. Blei, Jonathan Chang","submitted_at":"2009-09-23T22:16:39Z","abstract_excerpt":"We develop the relational topic model (RTM), a hierarchical model of both network structure and node attributes. We focus on document networks, where the attributes of each document are its words, that is, discrete observations taken from a fixed vocabulary. For each pair of documents, the RTM models their link as a binary random variable that is conditioned on their contents. The model can be used to summarize a network of documents, predict links between them, and predict words within them. We derive efficient inference and estimation algorithms based on variational methods that take advanta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4331","kind":"arxiv","version":3},"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:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgDWb7rQwh7tT/uxZA8+j0bNekkguRuzMXyymIY2sh14T6clD8DWjwNAAozWbLgo6VMFOdvoxZK1iPYQUf8VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:55.935259Z"},"content_sha256":"bbb254611969a9bf6cdd8476ad4782c9249ba348da8506c00dc55436ebd78bac","schema_version":"1.0","event_id":"sha256:bbb254611969a9bf6cdd8476ad4782c9249ba348da8506c00dc55436ebd78bac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/bundle.json","state_url":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/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-01T02:02:55Z","links":{"resolver":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO","bundle":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/bundle.json","state":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:R6KM6BO6R2GDVYHKNQZRRROLIO","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":"f7c8fe9b55c11503f73e1f6d75f75a95647cdf35451d12a2f5720008a75d48a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2009-09-23T22:16:39Z","title_canon_sha256":"135703b82a350f5b2388c63a909c65a67bcecfd00d331f7ce9766fda64f88630"},"schema_version":"1.0","source":{"id":"0909.4331","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.4331","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0909.4331v3","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4331","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"R6KM6BO6R2GD","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R6KM6BO6R2GDVYHK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R6KM6BO6","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:bbb254611969a9bf6cdd8476ad4782c9249ba348da8506c00dc55436ebd78bac","target":"graph","created_at":"2026-05-18T04:39:50Z","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 develop the relational topic model (RTM), a hierarchical model of both network structure and node attributes. We focus on document networks, where the attributes of each document are its words, that is, discrete observations taken from a fixed vocabulary. For each pair of documents, the RTM models their link as a binary random variable that is conditioned on their contents. The model can be used to summarize a network of documents, predict links between them, and predict words within them. We derive efficient inference and estimation algorithms based on variational methods that take advanta","authors_text":"David M. Blei, Jonathan Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2009-09-23T22:16:39Z","title":"Hierarchical relational models for document networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4331","kind":"arxiv","version":3},"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:aa95a162facfb6d5300bb77ec1ef59a1cd02c87642e722b51e4ea5db50cb71fa","target":"record","created_at":"2026-05-18T04:39:50Z","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":"f7c8fe9b55c11503f73e1f6d75f75a95647cdf35451d12a2f5720008a75d48a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2009-09-23T22:16:39Z","title_canon_sha256":"135703b82a350f5b2388c63a909c65a67bcecfd00d331f7ce9766fda64f88630"},"schema_version":"1.0","source":{"id":"0909.4331","kind":"arxiv","version":3}},"canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","first_computed_at":"2026-05-18T04:39:50.405140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:50.405140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OmSB+E3Ukeov8olLlAL0BZgOk22MKSKUyPWrush9rDzmu5dU/pQmCV3gI7sEXli0VPh/SEVNgZEaN7kH1hBgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:50.405643Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.4331","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa95a162facfb6d5300bb77ec1ef59a1cd02c87642e722b51e4ea5db50cb71fa","sha256:bbb254611969a9bf6cdd8476ad4782c9249ba348da8506c00dc55436ebd78bac"],"state_sha256":"d8731ef9b37847f885af4e845780a91a46f5c5aca637a30e82750a6826135f43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8efZbx0qStq55h52uMTM2NO/uAN3xtxlUXeUB1H+KWkWmevuvL+SyphV4NAcPfMN2RuXq3wPsAVLQpPZGnzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:02:55.939307Z","bundle_sha256":"6cd4c5546f5d9aae19e8e8ea4e2d814f655c7c81b1e538c57233fc4ad50c5e5e"}}