{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5XD2UKTMCRCCV72FASLO2BYTPY","short_pith_number":"pith:5XD2UKTM","schema_version":"1.0","canonical_sha256":"edc7aa2a6c14442aff450496ed07137e0bcd7e5533edf53665b65ef22ad33eb2","source":{"kind":"arxiv","id":"1312.7381","version":2},"attestation_state":"computed","paper":{"title":"Rate-Distortion Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jose C. Principe, Luis G. Sanchez Giraldo","submitted_at":"2013-12-28T02:08:53Z","abstract_excerpt":"A rekindled the interest in auto-encoder algorithms has been spurred by recent work on deep learning. Current efforts have been directed towards effective training of auto-encoder architectures with a large number of coding units. Here, we propose a learning algorithm for auto-encoders based on a rate-distortion objective that minimizes the mutual information between the inputs and the outputs of the auto-encoder subject to a fidelity constraint. The goal is to learn a representation that is minimally committed to the input data, but that is rich enough to reconstruct the inputs up to certain "},"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":"1312.7381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-28T02:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"f9ca5d05195ed81e588f92a2ba91945f484fc3d28f730bd21aa08ddbcb735f5e","abstract_canon_sha256":"7ca6c6b75427f8876ba9388653687ec4d6f51e93cfd562bc06fd546b2aa03557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:04.884261Z","signature_b64":"P0Z0sLL0IRiHlrK7tVxA5HLElK61e4gYzlmwQHpPRlhvjwiPeji99sq8z8HonLOvoj4G+LRFxuVcz3BVZqVSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edc7aa2a6c14442aff450496ed07137e0bcd7e5533edf53665b65ef22ad33eb2","last_reissued_at":"2026-05-18T02:54:04.883505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:04.883505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Distortion Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jose C. Principe, Luis G. Sanchez Giraldo","submitted_at":"2013-12-28T02:08:53Z","abstract_excerpt":"A rekindled the interest in auto-encoder algorithms has been spurred by recent work on deep learning. Current efforts have been directed towards effective training of auto-encoder architectures with a large number of coding units. Here, we propose a learning algorithm for auto-encoders based on a rate-distortion objective that minimizes the mutual information between the inputs and the outputs of the auto-encoder subject to a fidelity constraint. The goal is to learn a representation that is minimally committed to the input data, but that is rich enough to reconstruct the inputs up to certain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7381","kind":"arxiv","version":2},"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":"1312.7381","created_at":"2026-05-18T02:54:04.883641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7381v2","created_at":"2026-05-18T02:54:04.883641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7381","created_at":"2026-05-18T02:54:04.883641+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XD2UKTMCRCC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XD2UKTMCRCCV72F","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XD2UKTM","created_at":"2026-05-18T12:27:34.582898+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/5XD2UKTMCRCCV72FASLO2BYTPY","json":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY.json","graph_json":"https://pith.science/api/pith-number/5XD2UKTMCRCCV72FASLO2BYTPY/graph.json","events_json":"https://pith.science/api/pith-number/5XD2UKTMCRCCV72FASLO2BYTPY/events.json","paper":"https://pith.science/paper/5XD2UKTM"},"agent_actions":{"view_html":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY","download_json":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY.json","view_paper":"https://pith.science/paper/5XD2UKTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7381&json=true","fetch_graph":"https://pith.science/api/pith-number/5XD2UKTMCRCCV72FASLO2BYTPY/graph.json","fetch_events":"https://pith.science/api/pith-number/5XD2UKTMCRCCV72FASLO2BYTPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY/action/storage_attestation","attest_author":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY/action/author_attestation","sign_citation":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY/action/citation_signature","submit_replication":"https://pith.science/pith/5XD2UKTMCRCCV72FASLO2BYTPY/action/replication_record"}},"created_at":"2026-05-18T02:54:04.883641+00:00","updated_at":"2026-05-18T02:54:04.883641+00:00"}