{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TOVM5FFXOEHWL7PUGWZ6GOD5E6","short_pith_number":"pith:TOVM5FFX","schema_version":"1.0","canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","source":{"kind":"arxiv","id":"1710.02844","version":2},"attestation_state":"computed","paper":{"title":"Reconstruction of Hidden Representation for Robust Feature Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bing Liu, Hongmei Chen, Ning Yu, Tianrui Li, Yi Pan, Zeng Yu","submitted_at":"2017-10-08T15:48:37Z","abstract_excerpt":"This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders: 1) The reconstruction error of the input can not be lower than a lower bound, which can be viewed as a guiding principle for reconstructing the input. Additionally, when the input is corrupted with noises, the reconstruction error of the corrupted input also can not be lower than a lower bound. 2) The reconstruction of a hidden representation achieving its i"},"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":"1710.02844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-08T15:48:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"05ebbf7f66fe78ee24b4cd41d12c6b7c45b06629f8e33f9cd281bf4cd640b148","abstract_canon_sha256":"7a449ecfa29d24ca95a7c0c9f8c87657ecc559cb5bb087acc0c25a57ddb677e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.134952Z","signature_b64":"/PdP2FLcDhrXNXIgYkBAo+CAwbKuEa/xr4P0M4nbgZZxHMFhYunENGnJlXTfOPL58QC3957/GwSl1zbDOAH/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","last_reissued_at":"2026-05-18T00:02:36.134263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.134263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of Hidden Representation for Robust Feature Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bing Liu, Hongmei Chen, Ning Yu, Tianrui Li, Yi Pan, Zeng Yu","submitted_at":"2017-10-08T15:48:37Z","abstract_excerpt":"This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders: 1) The reconstruction error of the input can not be lower than a lower bound, which can be viewed as a guiding principle for reconstructing the input. Additionally, when the input is corrupted with noises, the reconstruction error of the corrupted input also can not be lower than a lower bound. 2) The reconstruction of a hidden representation achieving its i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02844","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":"1710.02844","created_at":"2026-05-18T00:02:36.134405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02844v2","created_at":"2026-05-18T00:02:36.134405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02844","created_at":"2026-05-18T00:02:36.134405+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOVM5FFXOEHW","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOVM5FFXOEHWL7PU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOVM5FFX","created_at":"2026-05-18T12:31:46.661854+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/TOVM5FFXOEHWL7PUGWZ6GOD5E6","json":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6.json","graph_json":"https://pith.science/api/pith-number/TOVM5FFXOEHWL7PUGWZ6GOD5E6/graph.json","events_json":"https://pith.science/api/pith-number/TOVM5FFXOEHWL7PUGWZ6GOD5E6/events.json","paper":"https://pith.science/paper/TOVM5FFX"},"agent_actions":{"view_html":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6","download_json":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6.json","view_paper":"https://pith.science/paper/TOVM5FFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02844&json=true","fetch_graph":"https://pith.science/api/pith-number/TOVM5FFXOEHWL7PUGWZ6GOD5E6/graph.json","fetch_events":"https://pith.science/api/pith-number/TOVM5FFXOEHWL7PUGWZ6GOD5E6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/action/storage_attestation","attest_author":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/action/author_attestation","sign_citation":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/action/citation_signature","submit_replication":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/action/replication_record"}},"created_at":"2026-05-18T00:02:36.134405+00:00","updated_at":"2026-05-18T00:02:36.134405+00:00"}