{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:R6KM6BO6R2GDVYHKNQZRRROLIO","short_pith_number":"pith:R6KM6BO6","schema_version":"1.0","canonical_sha256":"8f94cf05de8e8c3ae0ea6c3318c5cb43af645f0e736bf82e2d5b7c76049ec72c","source":{"kind":"arxiv","id":"0909.4331","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0909.4331","created_at":"2026-05-18T04:39:50.405216+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4331v3","created_at":"2026-05-18T04:39:50.405216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4331","created_at":"2026-05-18T04:39:50.405216+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6KM6BO6R2GD","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6KM6BO6R2GDVYHK","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6KM6BO6","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO","json":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO.json","graph_json":"https://pith.science/api/pith-number/R6KM6BO6R2GDVYHKNQZRRROLIO/graph.json","events_json":"https://pith.science/api/pith-number/R6KM6BO6R2GDVYHKNQZRRROLIO/events.json","paper":"https://pith.science/paper/R6KM6BO6"},"agent_actions":{"view_html":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO","download_json":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO.json","view_paper":"https://pith.science/paper/R6KM6BO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4331&json=true","fetch_graph":"https://pith.science/api/pith-number/R6KM6BO6R2GDVYHKNQZRRROLIO/graph.json","fetch_events":"https://pith.science/api/pith-number/R6KM6BO6R2GDVYHKNQZRRROLIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/action/storage_attestation","attest_author":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/action/author_attestation","sign_citation":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/action/citation_signature","submit_replication":"https://pith.science/pith/R6KM6BO6R2GDVYHKNQZRRROLIO/action/replication_record"}},"created_at":"2026-05-18T04:39:50.405216+00:00","updated_at":"2026-05-18T04:39:50.405216+00:00"}