{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UT5RAUSAOXDHAGWS5NIUD6KUMA","short_pith_number":"pith:UT5RAUSA","schema_version":"1.0","canonical_sha256":"a4fb10524075c6701ad2eb5141f954601a5d1f0f12fe554d2c5f44f2fd2277a2","source":{"kind":"arxiv","id":"1706.03860","version":4},"attestation_state":"computed","paper":{"title":"Subspace Clustering via Optimal Direction Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","stat.AP","stat.ML"],"primary_cat":"cs.CV","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2017-06-12T21:52:57Z","abstract_excerpt":"This letter presents a new spectral-clustering-based approach to the subspace clustering problem. Underpinning the proposed method is a convex program for optimal direction search, which for each data point d finds an optimal direction in the span of the data that has minimum projection on the other data points and non-vanishing projection on d. The obtained directions are subsequently leveraged to identify a neighborhood set for each data point. An alternating direction method of multipliers framework is provided to efficiently solve for the optimal directions. The proposed method is shown to"},"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":"1706.03860","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-06-12T21:52:57Z","cross_cats_sorted":["cs.IR","cs.LG","stat.AP","stat.ML"],"title_canon_sha256":"f62488b9513a4ee10a051e4f4a613a0d72cc5b451ca5841d5ebb4b585647c485","abstract_canon_sha256":"e77e59913752d8f539e1aa67df95924694b6c31daf0348436015b24793d0d468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:38.981488Z","signature_b64":"iW16Yzo2hKOG891VEQn+Qf+LzPNvB028nuKf8AgpLhYQNUGRI5y+RgbTJjOQKGjPglRB0rixvs8wJIVOvfGOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4fb10524075c6701ad2eb5141f954601a5d1f0f12fe554d2c5f44f2fd2277a2","last_reissued_at":"2026-05-18T00:29:38.980953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:38.980953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Clustering via Optimal Direction Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","stat.AP","stat.ML"],"primary_cat":"cs.CV","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2017-06-12T21:52:57Z","abstract_excerpt":"This letter presents a new spectral-clustering-based approach to the subspace clustering problem. Underpinning the proposed method is a convex program for optimal direction search, which for each data point d finds an optimal direction in the span of the data that has minimum projection on the other data points and non-vanishing projection on d. The obtained directions are subsequently leveraged to identify a neighborhood set for each data point. An alternating direction method of multipliers framework is provided to efficiently solve for the optimal directions. The proposed method is shown to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03860","kind":"arxiv","version":4},"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":"1706.03860","created_at":"2026-05-18T00:29:38.981054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03860v4","created_at":"2026-05-18T00:29:38.981054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03860","created_at":"2026-05-18T00:29:38.981054+00:00"},{"alias_kind":"pith_short_12","alias_value":"UT5RAUSAOXDH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UT5RAUSAOXDHAGWS","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UT5RAUSA","created_at":"2026-05-18T12:31:49.984773+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/UT5RAUSAOXDHAGWS5NIUD6KUMA","json":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA.json","graph_json":"https://pith.science/api/pith-number/UT5RAUSAOXDHAGWS5NIUD6KUMA/graph.json","events_json":"https://pith.science/api/pith-number/UT5RAUSAOXDHAGWS5NIUD6KUMA/events.json","paper":"https://pith.science/paper/UT5RAUSA"},"agent_actions":{"view_html":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA","download_json":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA.json","view_paper":"https://pith.science/paper/UT5RAUSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03860&json=true","fetch_graph":"https://pith.science/api/pith-number/UT5RAUSAOXDHAGWS5NIUD6KUMA/graph.json","fetch_events":"https://pith.science/api/pith-number/UT5RAUSAOXDHAGWS5NIUD6KUMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA/action/storage_attestation","attest_author":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA/action/author_attestation","sign_citation":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA/action/citation_signature","submit_replication":"https://pith.science/pith/UT5RAUSAOXDHAGWS5NIUD6KUMA/action/replication_record"}},"created_at":"2026-05-18T00:29:38.981054+00:00","updated_at":"2026-05-18T00:29:38.981054+00:00"}