{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TOVM5FFXOEHWL7PUGWZ6GOD5E6","short_pith_number":"pith:TOVM5FFX","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"},"canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","source":{"kind":"arxiv","id":"1710.02844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02844","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02844v2","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02844","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"TOVM5FFXOEHW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOVM5FFXOEHWL7PU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOVM5FFX","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TOVM5FFXOEHWL7PUGWZ6GOD5E6","target":"record","payload":{"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"},"canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","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"},"source_kind":"arxiv","source_id":"1710.02844","source_version":2,"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3fgkDElWLdsCn63HXwERVKFt3JxrZ/GLnKXza1PM7pdnV617RilK+ONJPb5OZwkkHT+AEaHqooOtqN3dS91Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:59.843378Z"},"content_sha256":"75b4a25734647ad03b919a4919cc331d4acd0196c48bd2b3a060d58e3a470b81","schema_version":"1.0","event_id":"sha256:75b4a25734647ad03b919a4919cc331d4acd0196c48bd2b3a060d58e3a470b81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TOVM5FFXOEHWL7PUGWZ6GOD5E6","target":"graph","payload":{"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"},"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tpnrHsmw614Qj9AXtu4hOhip3C4HOzeK3y2e1ucaoyJEh7JrsHq4IvJxvV3Dg5nVzult2cq6u2FfacBEXn7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:59.844142Z"},"content_sha256":"018aaaadd8432886c22c73b704abd06d626e89637f09496d2514bd7be9aa6775","schema_version":"1.0","event_id":"sha256:018aaaadd8432886c22c73b704abd06d626e89637f09496d2514bd7be9aa6775"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/bundle.json","state_url":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/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-10T16:21:59Z","links":{"resolver":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6","bundle":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/bundle.json","state":"https://pith.science/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOVM5FFXOEHWL7PUGWZ6GOD5E6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TOVM5FFXOEHWL7PUGWZ6GOD5E6","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":"7a449ecfa29d24ca95a7c0c9f8c87657ecc559cb5bb087acc0c25a57ddb677e6","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-08T15:48:37Z","title_canon_sha256":"05ebbf7f66fe78ee24b4cd41d12c6b7c45b06629f8e33f9cd281bf4cd640b148"},"schema_version":"1.0","source":{"id":"1710.02844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02844","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02844v2","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02844","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"TOVM5FFXOEHW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOVM5FFXOEHWL7PU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOVM5FFX","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:018aaaadd8432886c22c73b704abd06d626e89637f09496d2514bd7be9aa6775","target":"graph","created_at":"2026-05-18T00:02:36Z","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":"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","authors_text":"Bing Liu, Hongmei Chen, Ning Yu, Tianrui Li, Yi Pan, Zeng Yu","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-08T15:48:37Z","title":"Reconstruction of Hidden Representation for Robust Feature Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02844","kind":"arxiv","version":2},"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:75b4a25734647ad03b919a4919cc331d4acd0196c48bd2b3a060d58e3a470b81","target":"record","created_at":"2026-05-18T00:02:36Z","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":"7a449ecfa29d24ca95a7c0c9f8c87657ecc559cb5bb087acc0c25a57ddb677e6","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-08T15:48:37Z","title_canon_sha256":"05ebbf7f66fe78ee24b4cd41d12c6b7c45b06629f8e33f9cd281bf4cd640b148"},"schema_version":"1.0","source":{"id":"1710.02844","kind":"arxiv","version":2}},"canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9baace94b7710f65fdf435b3e3387d27aa3354698496fce72c9499069f13fed9","first_computed_at":"2026-05-18T00:02:36.134263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:36.134263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/PdP2FLcDhrXNXIgYkBAo+CAwbKuEa/xr4P0M4nbgZZxHMFhYunENGnJlXTfOPL58QC3957/GwSl1zbDOAH/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:36.134952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75b4a25734647ad03b919a4919cc331d4acd0196c48bd2b3a060d58e3a470b81","sha256:018aaaadd8432886c22c73b704abd06d626e89637f09496d2514bd7be9aa6775"],"state_sha256":"035091d5612c31fd0d71da9a191cbf9856448dc51b0fe2a2d82e99cfb3ad54ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+oogoym1USYNxXD69CCoGTLKwDabMN8+cS3Bh8tbhyv0UB9RI/HGrgCOO5yP7kG7FksVM70LOLXSqDRlmpXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:21:59.848384Z","bundle_sha256":"42e9ddb5de29764a953d754089ae65beda87d2f6b0aaaf6a95ea4e7f79ce4ddd"}}