{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UIFAKVJA3AZU3AIN346MWMF323","short_pith_number":"pith:UIFAKVJA","schema_version":"1.0","canonical_sha256":"a20a055520d8334d810ddf3ccb30bbd6c53fa5b00d9072743ffeba8676d82f34","source":{"kind":"arxiv","id":"1208.0432","version":3},"attestation_state":"computed","paper":{"title":"Efficient Point-to-Subspace Query in $\\ell^1$ with Application to Robust Object Instance Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"John Wright, Ju Sun, Yuqian Zhang","submitted_at":"2012-08-02T08:43:45Z","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. In contrast to the naive exhaustive search which entails large-scale linear programs, we show that the computational burden can be cut down significantly by a simple two-stage algorithm: (1) projecting the query and data-base subspaces into lower-dimensional space by random Cauchy "},"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":"1208.0432","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-02T08:43:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"32f4e9d708048bec961d1e871020c613fe675ae738b48cd002d96669fa64857f","abstract_canon_sha256":"3a59fd06b6c054b60b488c54c4b6fb6b8d5020246211e819cc1786a5722ee09e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.685353Z","signature_b64":"wFWGeuPBRSBmCHOmvw1naovGhkwJJBLISrRWEUB4cXGlhOMh3ZSjNfhloCUVmzJIj9kEsl24y83slx5z0neoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20a055520d8334d810ddf3ccb30bbd6c53fa5b00d9072743ffeba8676d82f34","last_reissued_at":"2026-05-18T02:31:27.684855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.684855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Point-to-Subspace Query in $\\ell^1$ with Application to Robust Object Instance Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"John Wright, Ju Sun, Yuqian Zhang","submitted_at":"2012-08-02T08:43:45Z","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. In contrast to the naive exhaustive search which entails large-scale linear programs, we show that the computational burden can be cut down significantly by a simple two-stage algorithm: (1) projecting the query and data-base subspaces into lower-dimensional space by random Cauchy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0432","kind":"arxiv","version":3},"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":"1208.0432","created_at":"2026-05-18T02:31:27.684941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0432v3","created_at":"2026-05-18T02:31:27.684941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0432","created_at":"2026-05-18T02:31:27.684941+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIFAKVJA3AZU","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIFAKVJA3AZU3AIN","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIFAKVJA","created_at":"2026-05-18T12:27:23.164592+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/UIFAKVJA3AZU3AIN346MWMF323","json":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323.json","graph_json":"https://pith.science/api/pith-number/UIFAKVJA3AZU3AIN346MWMF323/graph.json","events_json":"https://pith.science/api/pith-number/UIFAKVJA3AZU3AIN346MWMF323/events.json","paper":"https://pith.science/paper/UIFAKVJA"},"agent_actions":{"view_html":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323","download_json":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323.json","view_paper":"https://pith.science/paper/UIFAKVJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0432&json=true","fetch_graph":"https://pith.science/api/pith-number/UIFAKVJA3AZU3AIN346MWMF323/graph.json","fetch_events":"https://pith.science/api/pith-number/UIFAKVJA3AZU3AIN346MWMF323/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323/action/storage_attestation","attest_author":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323/action/author_attestation","sign_citation":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323/action/citation_signature","submit_replication":"https://pith.science/pith/UIFAKVJA3AZU3AIN346MWMF323/action/replication_record"}},"created_at":"2026-05-18T02:31:27.684941+00:00","updated_at":"2026-05-18T02:31:27.684941+00:00"}