{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NHB5DKVMHC2LPZFBL2QSPC6UIM","short_pith_number":"pith:NHB5DKVM","schema_version":"1.0","canonical_sha256":"69c3d1aaac38b4b7e4a15ea1278bd4431f2cbbae459e9fd485cb378fc445353d","source":{"kind":"arxiv","id":"1708.00069","version":1},"attestation_state":"computed","paper":{"title":"Learning Robust Representations for Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, Jayaraman Jayaraman Thiagarajan, Karthikeyan Natesan Ramamurthy, Peng Zheng","submitted_at":"2017-07-31T20:50:01Z","abstract_excerpt":"Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces.\n  Our main goal is deeper understanding and new development of robust approaches for representation learning. We provide a new interpretation for existing robust approaches and present two specific contributions: a new robust PCA approach, which can separate foreground features from dynamic background, and a novel robust spectral clustering method,"},"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":"1708.00069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T20:50:01Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"16a6663d26c3752e6c1b42e4c12a4ffa4977cfe484180dda6cfa51c3ead46486","abstract_canon_sha256":"2059b077be8384d45b98adee90a62b1718e2789a11fc2b7c66fcf00b3783e3f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:06.120394Z","signature_b64":"dx6TSi4ji36MzzesoH7Yw/Tr4e8c60V2ZCXpqQH9oDqD4HS35FwhK7erW39C3w1PYu+GeK1wJX9Z1ieJXDj7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c3d1aaac38b4b7e4a15ea1278bd4431f2cbbae459e9fd485cb378fc445353d","last_reissued_at":"2026-05-18T00:39:06.119690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:06.119690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Robust Representations for Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, Jayaraman Jayaraman Thiagarajan, Karthikeyan Natesan Ramamurthy, Peng Zheng","submitted_at":"2017-07-31T20:50:01Z","abstract_excerpt":"Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces.\n  Our main goal is deeper understanding and new development of robust approaches for representation learning. We provide a new interpretation for existing robust approaches and present two specific contributions: a new robust PCA approach, which can separate foreground features from dynamic background, and a novel robust spectral clustering method,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00069","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.00069","created_at":"2026-05-18T00:39:06.119804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00069v1","created_at":"2026-05-18T00:39:06.119804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00069","created_at":"2026-05-18T00:39:06.119804+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/NHB5DKVMHC2LPZFBL2QSPC6UIM","json":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM.json","graph_json":"https://pith.science/api/pith-number/NHB5DKVMHC2LPZFBL2QSPC6UIM/graph.json","events_json":"https://pith.science/api/pith-number/NHB5DKVMHC2LPZFBL2QSPC6UIM/events.json","paper":"https://pith.science/paper/NHB5DKVM"},"agent_actions":{"view_html":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM","download_json":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM.json","view_paper":"https://pith.science/paper/NHB5DKVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00069&json=true","fetch_graph":"https://pith.science/api/pith-number/NHB5DKVMHC2LPZFBL2QSPC6UIM/graph.json","fetch_events":"https://pith.science/api/pith-number/NHB5DKVMHC2LPZFBL2QSPC6UIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM/action/storage_attestation","attest_author":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM/action/author_attestation","sign_citation":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM/action/citation_signature","submit_replication":"https://pith.science/pith/NHB5DKVMHC2LPZFBL2QSPC6UIM/action/replication_record"}},"created_at":"2026-05-18T00:39:06.119804+00:00","updated_at":"2026-05-18T00:39:06.119804+00:00"}