{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WPBIVG3Q5VRMW76XV3QA2T6VAX","short_pith_number":"pith:WPBIVG3Q","canonical_record":{"source":{"id":"1812.10539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-26T21:14:06Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"e3c22192b68417f5a6359671fb5f09fefe74d81b8311b5302a3b2321b3fd4c71","abstract_canon_sha256":"b7cf69761f601229a0b05745ca3e6d3290b6eba7a98e01575d6626a73b993fe6"},"schema_version":"1.0"},"canonical_sha256":"b3c28a9b70ed62cb7fd7aee00d4fd505fc5396ac87aac5ff6dff0ff40c8573f6","source":{"kind":"arxiv","id":"1812.10539","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10539","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10539v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10539","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"WPBIVG3Q5VRM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WPBIVG3Q5VRMW76X","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WPBIVG3Q","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WPBIVG3Q5VRMW76XV3QA2T6VAX","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-26T21:14:06Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"e3c22192b68417f5a6359671fb5f09fefe74d81b8311b5302a3b2321b3fd4c71","abstract_canon_sha256":"b7cf69761f601229a0b05745ca3e6d3290b6eba7a98e01575d6626a73b993fe6"},"schema_version":"1.0"},"canonical_sha256":"b3c28a9b70ed62cb7fd7aee00d4fd505fc5396ac87aac5ff6dff0ff40c8573f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.266335Z","signature_b64":"EY8F5CcBijAan7bjDAM9bZUlyDG+fnARWMa3APTfOksOEkdfl2yOjm5eUXQNlFHr7vkZOp8hAUFo6DJfEqfbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c28a9b70ed62cb7fd7aee00d4fd505fc5396ac87aac5ff6dff0ff40c8573f6","last_reissued_at":"2026-05-17T23:48:45.265850Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.265850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10539","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-17T23:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pf7ha6XW30TrQd6zD5kK6/NU+Jqgqaig2soSB7VYhQCryfceHzgvjsC3cumH9B83zLhHYeamjO0e7AN4GcOrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:54:01.170801Z"},"content_sha256":"f190c4397ff2c283f931e079ae303489197c640bb7ef1fffc096f6b2b0a52eeb","schema_version":"1.0","event_id":"sha256:f190c4397ff2c283f931e079ae303489197c640bb7ef1fffc096f6b2b0a52eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WPBIVG3Q5VRMW76XV3QA2T6VAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uncertainty Autoencoders: Learning Compressed Representations via Variational Information Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Aditya Grover, Stefano Ermon","submitted_at":"2018-12-26T21:14:06Z","abstract_excerpt":"Compressed sensing techniques enable efficient acquisition and recovery of sparse, high-dimensional data signals via low-dimensional projections. In this work, we propose Uncertainty Autoencoders, a learning framework for unsupervised representation learning inspired by compressed sensing. We treat the low-dimensional projections as noisy latent representations of an autoencoder and directly learn both the acquisition (i.e., encoding) and amortized recovery (i.e., decoding) procedures. Our learning objective optimizes for a tractable variational lower bound to the mutual information between th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10539","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-17T23:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQvTlH6QQ0x28xIO7XJnxL4i3x6FAXdfRy133NPWPUEEgciAAzPvJLVJVlY3BrrKqojeJPtrVzEzLvN6633TCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:54:01.171149Z"},"content_sha256":"bde8e38659e007a892155953c8a30796447756a86f9f98e89184c37fd690f2f8","schema_version":"1.0","event_id":"sha256:bde8e38659e007a892155953c8a30796447756a86f9f98e89184c37fd690f2f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/bundle.json","state_url":"https://pith.science/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/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-03T17:54:01Z","links":{"resolver":"https://pith.science/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX","bundle":"https://pith.science/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/bundle.json","state":"https://pith.science/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPBIVG3Q5VRMW76XV3QA2T6VAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WPBIVG3Q5VRMW76XV3QA2T6VAX","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":"b7cf69761f601229a0b05745ca3e6d3290b6eba7a98e01575d6626a73b993fe6","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-26T21:14:06Z","title_canon_sha256":"e3c22192b68417f5a6359671fb5f09fefe74d81b8311b5302a3b2321b3fd4c71"},"schema_version":"1.0","source":{"id":"1812.10539","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10539","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10539v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10539","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"WPBIVG3Q5VRM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WPBIVG3Q5VRMW76X","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WPBIVG3Q","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bde8e38659e007a892155953c8a30796447756a86f9f98e89184c37fd690f2f8","target":"graph","created_at":"2026-05-17T23:48:45Z","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":"Compressed sensing techniques enable efficient acquisition and recovery of sparse, high-dimensional data signals via low-dimensional projections. In this work, we propose Uncertainty Autoencoders, a learning framework for unsupervised representation learning inspired by compressed sensing. We treat the low-dimensional projections as noisy latent representations of an autoencoder and directly learn both the acquisition (i.e., encoding) and amortized recovery (i.e., decoding) procedures. Our learning objective optimizes for a tractable variational lower bound to the mutual information between th","authors_text":"Aditya Grover, Stefano Ermon","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-26T21:14:06Z","title":"Uncertainty Autoencoders: Learning Compressed Representations via Variational Information Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10539","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:f190c4397ff2c283f931e079ae303489197c640bb7ef1fffc096f6b2b0a52eeb","target":"record","created_at":"2026-05-17T23:48:45Z","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":"b7cf69761f601229a0b05745ca3e6d3290b6eba7a98e01575d6626a73b993fe6","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-26T21:14:06Z","title_canon_sha256":"e3c22192b68417f5a6359671fb5f09fefe74d81b8311b5302a3b2321b3fd4c71"},"schema_version":"1.0","source":{"id":"1812.10539","kind":"arxiv","version":3}},"canonical_sha256":"b3c28a9b70ed62cb7fd7aee00d4fd505fc5396ac87aac5ff6dff0ff40c8573f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3c28a9b70ed62cb7fd7aee00d4fd505fc5396ac87aac5ff6dff0ff40c8573f6","first_computed_at":"2026-05-17T23:48:45.265850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:45.265850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EY8F5CcBijAan7bjDAM9bZUlyDG+fnARWMa3APTfOksOEkdfl2yOjm5eUXQNlFHr7vkZOp8hAUFo6DJfEqfbBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:45.266335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10539","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f190c4397ff2c283f931e079ae303489197c640bb7ef1fffc096f6b2b0a52eeb","sha256:bde8e38659e007a892155953c8a30796447756a86f9f98e89184c37fd690f2f8"],"state_sha256":"bb56bec6d97f7efb898f223e5f3c8a25394b5647132deaaa84e07bf06351370e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuonwPP5XeWQSGTFzIoxySmfrKtrLiDGhca8iERi/lItJZv7xwNE0z3QL8yHvDBBnBIrUMLLrqxw3sWuX00UDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:54:01.173223Z","bundle_sha256":"44f6ed0e88e3aafbfa1ab6ef8cad3a4f1b392e699aaffe05082161932e34e248"}}