{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z3LJDN453DDHPF7YIRVIUWLCTJ","short_pith_number":"pith:Z3LJDN45","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"},"canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","source":{"kind":"arxiv","id":"1211.0757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0757","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0757v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0757","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z3LJDN453DDH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3LJDN453DDHPF7Y","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3LJDN45","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z3LJDN453DDHPF7YIRVIUWLCTJ","target":"record","payload":{"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"},"canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","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"},"source_kind":"arxiv","source_id":"1211.0757","source_version":1,"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-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjcghFwCWPSRFSJStangegyS+ojLSIkT8oNt55NtUGnsQQttG2Bb6gKF/FGYXfOwN8N4J455qInnrhHiKg9BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:13:08.571254Z"},"content_sha256":"5a948b04bf9e7f0c011e983b4c40c17a13aa11f75a0eac725a3f8460d98c5ed7","schema_version":"1.0","event_id":"sha256:5a948b04bf9e7f0c011e983b4c40c17a13aa11f75a0eac725a3f8460d98c5ed7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z3LJDN453DDHPF7YIRVIUWLCTJ","target":"graph","payload":{"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"},"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-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahgoevQIwpiIZIiR9L7M7oA3aAtJ7dJeV2WOGbhR2qUt/sVv+GvPlVnrMPUszddGvfjKPqcjLihIBbmaEkmJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:13:08.571926Z"},"content_sha256":"0cae1d9192c1586032ba35a6604b28d9438469c2ca2522f68da2c5fa31512632","schema_version":"1.0","event_id":"sha256:0cae1d9192c1586032ba35a6604b28d9438469c2ca2522f68da2c5fa31512632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/bundle.json","state_url":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/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-05-26T19:13:08Z","links":{"resolver":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ","bundle":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/bundle.json","state":"https://pith.science/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3LJDN453DDHPF7YIRVIUWLCTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z3LJDN453DDHPF7YIRVIUWLCTJ","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":"64c7cdbb0be66d1ad8b02e5cad4cbd34ffdd9059f0d6a59d05ceed6051f87b80","cross_cats_sorted":["cs.CV","stat.AP"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ML","submitted_at":"2012-11-05T04:15:25Z","title_canon_sha256":"64496081869747b259ea3c743b7276c6052e60cbeaed6bd9e690808915a181f3"},"schema_version":"1.0","source":{"id":"1211.0757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0757","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0757v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0757","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z3LJDN453DDH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3LJDN453DDHPF7Y","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3LJDN45","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:0cae1d9192c1586032ba35a6604b28d9438469c2ca2522f68da2c5fa31512632","target":"graph","created_at":"2026-05-18T03:41:31Z","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":"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","authors_text":"John Wright, Ju Sun, Yuqian Zhang","cross_cats":["cs.CV","stat.AP"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ML","submitted_at":"2012-11-05T04:15:25Z","title":"Efficient Point-to-Subspace Query in $\\ell^1$: Theory and Applications in Computer Vision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0757","kind":"arxiv","version":1},"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:5a948b04bf9e7f0c011e983b4c40c17a13aa11f75a0eac725a3f8460d98c5ed7","target":"record","created_at":"2026-05-18T03:41:31Z","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":"64c7cdbb0be66d1ad8b02e5cad4cbd34ffdd9059f0d6a59d05ceed6051f87b80","cross_cats_sorted":["cs.CV","stat.AP"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ML","submitted_at":"2012-11-05T04:15:25Z","title_canon_sha256":"64496081869747b259ea3c743b7276c6052e60cbeaed6bd9e690808915a181f3"},"schema_version":"1.0","source":{"id":"1211.0757","kind":"arxiv","version":1}},"canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ced691b79dd8c67797f8446a8a59629a74706e0c4f0596503ccf4a5dfc607ff8","first_computed_at":"2026-05-18T03:41:31.641984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:31.641984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5D8weu+FU6sX2FBRzJdoL5wu99KjU+gYoR+jGhpLnh6F6kIIcVUWSvXSO3cJPFsB7AipDzXYtSiJ2NeHbczDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:31.642511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a948b04bf9e7f0c011e983b4c40c17a13aa11f75a0eac725a3f8460d98c5ed7","sha256:0cae1d9192c1586032ba35a6604b28d9438469c2ca2522f68da2c5fa31512632"],"state_sha256":"2fddf86600bd6ad9ef22e43440fe65e555bfbd66657cad77c376234c3d459f25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87YaMD08FoXjx9oKBVruVFOi6ZHZZXIYgvLARZRrOBovNtSm2+uM2g3BaucisW0NrluAukXaFiTWxTlJj/JiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:13:08.576440Z","bundle_sha256":"33afbd343c062d2f96d780d63aedce69026070dee01ceceaa0d3f713e2658a7d"}}