{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IVI4NCV2E5NZ52ZTD2DYUWC7D5","short_pith_number":"pith:IVI4NCV2","schema_version":"1.0","canonical_sha256":"4551c68aba275b9eeb331e878a585f1f594462996ae1daa5d6d0e9604070954b","source":{"kind":"arxiv","id":"1307.7521","version":6},"attestation_state":"computed","paper":{"title":"Union of Low-Rank Subspaces Detector","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Joneidi, Mostafa Sadeghi, Nazanin Rahnavard, Parvin Ahmadi","submitted_at":"2013-07-29T09:54:51Z","abstract_excerpt":"The problem of signal detection using a flexible and general model is considered. Due to applicability and flexibility of sparse signal representation and approximation, it has attracted a lot of attention in many signal processing areas. In this paper, we propose a new detection method based on sparse decomposition in a union of subspaces (UoS) model. Our proposed detector uses a dictionary that can be interpreted as a bank of matched subspaces. This improves the performance of signal detection, as it is a generalization for detectors. Low-rank assumption for the desired signals implies that "},"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":"1307.7521","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2013-07-29T09:54:51Z","cross_cats_sorted":["cs.CV","math.IT"],"title_canon_sha256":"171956c81c4d724e936668e5c4afb4b504ceea892d995161ee33abaa2892f42f","abstract_canon_sha256":"b10af2744c8d03063eab4031785989c5b13674deda76aa62ec30716fd50046b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:47.640625Z","signature_b64":"hh3ILzmnoTbPBPuyBX0UOWixhm4ehHDDRK4vzKwM5dlBMZcQieSHlvG95SXukBnumHvG/hqaK/PEnXKRNAc1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4551c68aba275b9eeb331e878a585f1f594462996ae1daa5d6d0e9604070954b","last_reissued_at":"2026-05-18T01:20:47.640136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:47.640136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Union of Low-Rank Subspaces Detector","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Joneidi, Mostafa Sadeghi, Nazanin Rahnavard, Parvin Ahmadi","submitted_at":"2013-07-29T09:54:51Z","abstract_excerpt":"The problem of signal detection using a flexible and general model is considered. Due to applicability and flexibility of sparse signal representation and approximation, it has attracted a lot of attention in many signal processing areas. In this paper, we propose a new detection method based on sparse decomposition in a union of subspaces (UoS) model. Our proposed detector uses a dictionary that can be interpreted as a bank of matched subspaces. This improves the performance of signal detection, as it is a generalization for detectors. Low-rank assumption for the desired signals implies that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7521","kind":"arxiv","version":6},"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":"1307.7521","created_at":"2026-05-18T01:20:47.640214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7521v6","created_at":"2026-05-18T01:20:47.640214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7521","created_at":"2026-05-18T01:20:47.640214+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVI4NCV2E5NZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVI4NCV2E5NZ52ZT","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVI4NCV2","created_at":"2026-05-18T12:27:49.015174+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/IVI4NCV2E5NZ52ZTD2DYUWC7D5","json":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5.json","graph_json":"https://pith.science/api/pith-number/IVI4NCV2E5NZ52ZTD2DYUWC7D5/graph.json","events_json":"https://pith.science/api/pith-number/IVI4NCV2E5NZ52ZTD2DYUWC7D5/events.json","paper":"https://pith.science/paper/IVI4NCV2"},"agent_actions":{"view_html":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5","download_json":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5.json","view_paper":"https://pith.science/paper/IVI4NCV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7521&json=true","fetch_graph":"https://pith.science/api/pith-number/IVI4NCV2E5NZ52ZTD2DYUWC7D5/graph.json","fetch_events":"https://pith.science/api/pith-number/IVI4NCV2E5NZ52ZTD2DYUWC7D5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5/action/storage_attestation","attest_author":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5/action/author_attestation","sign_citation":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5/action/citation_signature","submit_replication":"https://pith.science/pith/IVI4NCV2E5NZ52ZTD2DYUWC7D5/action/replication_record"}},"created_at":"2026-05-18T01:20:47.640214+00:00","updated_at":"2026-05-18T01:20:47.640214+00:00"}