{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RVEQ67DRF2GN4J7CMT337YURSX","short_pith_number":"pith:RVEQ67DR","canonical_record":{"source":{"id":"1904.06395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T20:03:33Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"b57606d6edc76788f07182be808a40bc4cc5ee8469f267be595d88bf04a7bef2","abstract_canon_sha256":"e728e7d70886199d1617b8bcce0277ab975b28ef466d397c3d2897f4fc6b58e8"},"schema_version":"1.0"},"canonical_sha256":"8d490f7c712e8cde27e264f7bfe29195fbe9dd91518ab95d4455159c719ddf51","source":{"kind":"arxiv","id":"1904.06395","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06395","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06395v1","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06395","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"RVEQ67DRF2GN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RVEQ67DRF2GN4J7C","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RVEQ67DR","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RVEQ67DRF2GN4J7CMT337YURSX","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T20:03:33Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"b57606d6edc76788f07182be808a40bc4cc5ee8469f267be595d88bf04a7bef2","abstract_canon_sha256":"e728e7d70886199d1617b8bcce0277ab975b28ef466d397c3d2897f4fc6b58e8"},"schema_version":"1.0"},"canonical_sha256":"8d490f7c712e8cde27e264f7bfe29195fbe9dd91518ab95d4455159c719ddf51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:39.070273Z","signature_b64":"wnIDshRoO8xJhm1eWA5MpZqOrg8Hy04jvJlA7WVEN574//J4taGUIGQK+RZduYcDNWShtFLK1YRGfFTAQTMZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d490f7c712e8cde27e264f7bfe29195fbe9dd91518ab95d4455159c719ddf51","last_reissued_at":"2026-05-17T23:48:39.069763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:39.069763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06395","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-17T23:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rZ0GexDGKT+UKvwCLwP7XTRGNVu/nE7mJgDboPWwEVSFa/PGfs3RscLAOhrsLyhO3+PqwfSB2KxbH67BQKCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:31:14.502711Z"},"content_sha256":"0d2000465b0d06b6f6783c2e00413aff6e531025d9ada35ec19e2770e7736399","schema_version":"1.0","event_id":"sha256:0d2000465b0d06b6f6783c2e00413aff6e531025d9ada35ec19e2770e7736399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RVEQ67DRF2GN4J7CMT337YURSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theoretic Lower Bounds on Negative Log Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Luis A. Lastras","submitted_at":"2019-04-12T20:03:33Z","abstract_excerpt":"In this article we use rate-distortion theory, a branch of information theory devoted to the problem of lossy compression, to shed light on an important problem in latent variable modeling of data: is there room to improve the model? One way to address this question is to find an upper bound on the probability (equivalently a lower bound on the negative log likelihood) that the model can assign to some data as one varies the prior and/or the likelihood function in a latent variable model. The core of our contribution is to formally show that the problem of optimizing priors in latent variable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06395","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-17T23:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1fU2tCC52bFjlN0o7UVGRGVAKQS8SeZxc8TRoI36egY+p39YTsgKw9YcE4jC/eo88A1Xe8TcrGjTU12sHqJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:31:14.503065Z"},"content_sha256":"f75226cb4211df6ace38e73eb41f33752d086f74001e71a5f292528ecbea1bc2","schema_version":"1.0","event_id":"sha256:f75226cb4211df6ace38e73eb41f33752d086f74001e71a5f292528ecbea1bc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVEQ67DRF2GN4J7CMT337YURSX/bundle.json","state_url":"https://pith.science/pith/RVEQ67DRF2GN4J7CMT337YURSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVEQ67DRF2GN4J7CMT337YURSX/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-01T15:31:14Z","links":{"resolver":"https://pith.science/pith/RVEQ67DRF2GN4J7CMT337YURSX","bundle":"https://pith.science/pith/RVEQ67DRF2GN4J7CMT337YURSX/bundle.json","state":"https://pith.science/pith/RVEQ67DRF2GN4J7CMT337YURSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVEQ67DRF2GN4J7CMT337YURSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RVEQ67DRF2GN4J7CMT337YURSX","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":"e728e7d70886199d1617b8bcce0277ab975b28ef466d397c3d2897f4fc6b58e8","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T20:03:33Z","title_canon_sha256":"b57606d6edc76788f07182be808a40bc4cc5ee8469f267be595d88bf04a7bef2"},"schema_version":"1.0","source":{"id":"1904.06395","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06395","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06395v1","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06395","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"RVEQ67DRF2GN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RVEQ67DRF2GN4J7C","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RVEQ67DR","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:f75226cb4211df6ace38e73eb41f33752d086f74001e71a5f292528ecbea1bc2","target":"graph","created_at":"2026-05-17T23:48:39Z","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":"In this article we use rate-distortion theory, a branch of information theory devoted to the problem of lossy compression, to shed light on an important problem in latent variable modeling of data: is there room to improve the model? One way to address this question is to find an upper bound on the probability (equivalently a lower bound on the negative log likelihood) that the model can assign to some data as one varies the prior and/or the likelihood function in a latent variable model. The core of our contribution is to formally show that the problem of optimizing priors in latent variable ","authors_text":"Luis A. Lastras","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T20:03:33Z","title":"Information Theoretic Lower Bounds on Negative Log Likelihood"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06395","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:0d2000465b0d06b6f6783c2e00413aff6e531025d9ada35ec19e2770e7736399","target":"record","created_at":"2026-05-17T23:48:39Z","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":"e728e7d70886199d1617b8bcce0277ab975b28ef466d397c3d2897f4fc6b58e8","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T20:03:33Z","title_canon_sha256":"b57606d6edc76788f07182be808a40bc4cc5ee8469f267be595d88bf04a7bef2"},"schema_version":"1.0","source":{"id":"1904.06395","kind":"arxiv","version":1}},"canonical_sha256":"8d490f7c712e8cde27e264f7bfe29195fbe9dd91518ab95d4455159c719ddf51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d490f7c712e8cde27e264f7bfe29195fbe9dd91518ab95d4455159c719ddf51","first_computed_at":"2026-05-17T23:48:39.069763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:39.069763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnIDshRoO8xJhm1eWA5MpZqOrg8Hy04jvJlA7WVEN574//J4taGUIGQK+RZduYcDNWShtFLK1YRGfFTAQTMZCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:39.070273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06395","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d2000465b0d06b6f6783c2e00413aff6e531025d9ada35ec19e2770e7736399","sha256:f75226cb4211df6ace38e73eb41f33752d086f74001e71a5f292528ecbea1bc2"],"state_sha256":"f5f35499036ef5d6fd2bb5820277ac0592ad40c4880dce1e45382266e59fcc7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdAkU1Ri58qlQztEGeMOF6G+v25Z0PFj91Odzje93YpQHiBVHtzewbaBhYHe/tYZVKkZQj+4i2kiJKf5BvOkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:31:14.505087Z","bundle_sha256":"67e5a0ca6ebb24f70c276d8573c8b08b5b162c0dec76f33cba86edbbdb841fc4"}}