{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LGANUJQ4QOXC7E34RBBHH6SFLQ","short_pith_number":"pith:LGANUJQ4","canonical_record":{"source":{"id":"1409.7591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-26T15:11:57Z","cross_cats_sorted":["cs.HC","cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"08eded676442d8bb926979d3c2e8db658d45c173708dff4fceb6430e847b1b30","abstract_canon_sha256":"dede4833a7ab1061642fcb67b9ca9163ff815f3ef87d1ef4211e52637336f091"},"schema_version":"1.0"},"canonical_sha256":"5980da261c83ae2f937c884273fa455c0214b826c4635fd41ae602bdaaaac520","source":{"kind":"arxiv","id":"1409.7591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7591","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7591v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7591","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGANUJQ4QOXC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LGANUJQ4QOXC7E34","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LGANUJQ4","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LGANUJQ4QOXC7E34RBBHH6SFLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-26T15:11:57Z","cross_cats_sorted":["cs.HC","cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"08eded676442d8bb926979d3c2e8db658d45c173708dff4fceb6430e847b1b30","abstract_canon_sha256":"dede4833a7ab1061642fcb67b9ca9163ff815f3ef87d1ef4211e52637336f091"},"schema_version":"1.0"},"canonical_sha256":"5980da261c83ae2f937c884273fa455c0214b826c4635fd41ae602bdaaaac520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.333457Z","signature_b64":"5qHSr6rI6waxK2YpCVmX/RlTHLIY0EFsRplFOtS2ZbIFBhazbmUzRYvHB4uIEvH2/+S7ZArjBNi5/EUNrT5wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5980da261c83ae2f937c884273fa455c0214b826c4635fd41ae602bdaaaac520","last_reissued_at":"2026-05-18T02:41:52.333006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.333006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7591","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tCz3+cY74N7rOntDj2JGO8oiz2jYuDZMoF7AlPCg+HplEEwrtrHY7Cvidn5YEPHs9ZY6CV20ciqRdnbty5xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:58:40.568251Z"},"content_sha256":"786b26f28f1cb40330421683854e8ea854976d85d89f941db04bc08458a3c12b","schema_version":"1.0","event_id":"sha256:786b26f28f1cb40330421683854e8ea854976d85d89f941db04bc08458a3c12b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LGANUJQ4QOXC7E34RBBHH6SFLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topic Similarity Networks: Visual Analytics for Large Document Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.IR","cs.SI","stat.ML"],"primary_cat":"cs.CL","authors_text":"Arun S. Maiya, Robert M. Rolfe","submitted_at":"2014-09-26T15:11:57Z","abstract_excerpt":"We investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We describe efficient and effective approaches to both building and labeling such networks. Visualizations of topic models based on these networks are shown to be a powerful means of exploring, characterizing, and summarizing large collections of unstructured text documents. They help to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7591","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"215JcHMDxp0GQLP9LuzD+T69EFjKahTlYbVZljSlRvpOdZBlozBFSmEIiVZv9NB1/jGRTq8BP9Z9k2g++T+pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:58:40.568648Z"},"content_sha256":"0cfd41457dc2a7825881968206a833318597918557ea062c71ea14ad1e7b0b31","schema_version":"1.0","event_id":"sha256:0cfd41457dc2a7825881968206a833318597918557ea062c71ea14ad1e7b0b31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/bundle.json","state_url":"https://pith.science/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/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-05T17:58:40Z","links":{"resolver":"https://pith.science/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ","bundle":"https://pith.science/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/bundle.json","state":"https://pith.science/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGANUJQ4QOXC7E34RBBHH6SFLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LGANUJQ4QOXC7E34RBBHH6SFLQ","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":"dede4833a7ab1061642fcb67b9ca9163ff815f3ef87d1ef4211e52637336f091","cross_cats_sorted":["cs.HC","cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-26T15:11:57Z","title_canon_sha256":"08eded676442d8bb926979d3c2e8db658d45c173708dff4fceb6430e847b1b30"},"schema_version":"1.0","source":{"id":"1409.7591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7591","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7591v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7591","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"LGANUJQ4QOXC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LGANUJQ4QOXC7E34","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LGANUJQ4","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:0cfd41457dc2a7825881968206a833318597918557ea062c71ea14ad1e7b0b31","target":"graph","created_at":"2026-05-18T02:41:52Z","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 investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We describe efficient and effective approaches to both building and labeling such networks. Visualizations of topic models based on these networks are shown to be a powerful means of exploring, characterizing, and summarizing large collections of unstructured text documents. They help to","authors_text":"Arun S. Maiya, Robert M. Rolfe","cross_cats":["cs.HC","cs.IR","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-26T15:11:57Z","title":"Topic Similarity Networks: Visual Analytics for Large Document Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7591","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:786b26f28f1cb40330421683854e8ea854976d85d89f941db04bc08458a3c12b","target":"record","created_at":"2026-05-18T02:41:52Z","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":"dede4833a7ab1061642fcb67b9ca9163ff815f3ef87d1ef4211e52637336f091","cross_cats_sorted":["cs.HC","cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-26T15:11:57Z","title_canon_sha256":"08eded676442d8bb926979d3c2e8db658d45c173708dff4fceb6430e847b1b30"},"schema_version":"1.0","source":{"id":"1409.7591","kind":"arxiv","version":1}},"canonical_sha256":"5980da261c83ae2f937c884273fa455c0214b826c4635fd41ae602bdaaaac520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5980da261c83ae2f937c884273fa455c0214b826c4635fd41ae602bdaaaac520","first_computed_at":"2026-05-18T02:41:52.333006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:52.333006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5qHSr6rI6waxK2YpCVmX/RlTHLIY0EFsRplFOtS2ZbIFBhazbmUzRYvHB4uIEvH2/+S7ZArjBNi5/EUNrT5wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:52.333457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:786b26f28f1cb40330421683854e8ea854976d85d89f941db04bc08458a3c12b","sha256:0cfd41457dc2a7825881968206a833318597918557ea062c71ea14ad1e7b0b31"],"state_sha256":"5f80e061004f9e1ae9d9364ffd49c5993475c17630452859ccc506b58290f4c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqdiHzAZOXJ38pK5FRZRfcI+L1pJp5xHdtsmHHWNLzXeVFJIchog7uLOEBBnWOn/KbqyO9Dt8V/a9+XWQjbMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:58:40.571337Z","bundle_sha256":"68f928897c7b6536f888253a1b7e75fb82b24637128edaee8c6c2169f508439f"}}