{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z3LJDN453DDHPF7YIRVIUWLCTJ","short_pith_number":"pith:Z3LJDN45","schema_version":"1.0","canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","source":{"kind":"arxiv","id":"1211.0757","version":1},"attestation_state":"computed","paper":{"title":"Efficient Point-to-Subspace Query in $\\ell^1$: Theory and Applications in Computer Vision","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CV","stat.AP"],"primary_cat":"stat.ML","authors_text":"John Wright, Ju Sun, Yuqian Zhang","submitted_at":"2012-11-05T04:15:25Z","abstract_excerpt":"Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in $\\ell^1$ distance. We show in theory that Cauchy random embedding of the objects into significantly-lower-dimensional spaces helps preserve the identity of the nearest subspace with constant probability. This offers the possibility of efficiently selecting several candidates for accurate search. We sk"},"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":"1211.0757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ML","submitted_at":"2012-11-05T04:15:25Z","cross_cats_sorted":["cs.CV","stat.AP"],"title_canon_sha256":"64496081869747b259ea3c743b7276c6052e60cbeaed6bd9e690808915a181f3","abstract_canon_sha256":"64c7cdbb0be66d1ad8b02e5cad4cbd34ffdd9059f0d6a59d05ceed6051f87b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:31.642511Z","signature_b64":"o5D8weu+FU6sX2FBRzJdoL5wu99KjU+gYoR+jGhpLnh6F6kIIcVUWSvXSO3cJPFsB7AipDzXYtSiJ2NeHbczDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","last_reissued_at":"2026-05-18T03:41:31.641984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:31.641984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Point-to-Subspace Query in $\\ell^1$: Theory and Applications in Computer Vision","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CV","stat.AP"],"primary_cat":"stat.ML","authors_text":"John Wright, Ju Sun, Yuqian Zhang","submitted_at":"2012-11-05T04:15:25Z","abstract_excerpt":"Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in $\\ell^1$ distance. We show in theory that Cauchy random embedding of the objects into significantly-lower-dimensional spaces helps preserve the identity of the nearest subspace with constant probability. This offers the possibility of efficiently selecting several candidates for accurate search. We sk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0757","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":"1211.0757","created_at":"2026-05-18T03:41:31.642069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0757v1","created_at":"2026-05-18T03:41:31.642069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0757","created_at":"2026-05-18T03:41:31.642069+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3LJDN453DDH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3LJDN453DDHPF7Y","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3LJDN45","created_at":"2026-05-18T12:27:30.460161+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/Z3LJDN453DDHPF7YIRVIUWLCTJ","json":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ.json","graph_json":"https://pith.science/api/pith-number/Z3LJDN453DDHPF7YIRVIUWLCTJ/graph.json","events_json":"https://pith.science/api/pith-number/Z3LJDN453DDHPF7YIRVIUWLCTJ/events.json","paper":"https://pith.science/paper/Z3LJDN45"},"agent_actions":{"view_html":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ","download_json":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ.json","view_paper":"https://pith.science/paper/Z3LJDN45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0757&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3LJDN453DDHPF7YIRVIUWLCTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3LJDN453DDHPF7YIRVIUWLCTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/action/storage_attestation","attest_author":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/action/author_attestation","sign_citation":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/action/citation_signature","submit_replication":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/action/replication_record"}},"created_at":"2026-05-18T03:41:31.642069+00:00","updated_at":"2026-05-18T03:41:31.642069+00:00"}