{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3ESMU7PHX4F62X6REOFRLQXRER","short_pith_number":"pith:3ESMU7PH","schema_version":"1.0","canonical_sha256":"d924ca7de7bf0bed5fd1238b15c2f12471b01aa07c99413dfe018e4abb518ad3","source":{"kind":"arxiv","id":"1507.02999","version":2},"attestation_state":"computed","paper":{"title":"Compressive Detection of Random Subspace Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Razavi, Danijela Cabric, Mikko Valkama","submitted_at":"2015-07-10T19:37:53Z","abstract_excerpt":"The problem of compressive detection of random subspace signals is studied. We consider signals modeled as $\\mathbf{s} = \\mathbf{H} \\mathbf{x}$ where $\\mathbf{H}$ is an $N \\times K$ matrix with $K \\le N$ and $\\mathbf{x} \\sim \\mathcal{N}(\\mathbf{0}_{K,1},\\sigma_x^2 \\mathbf{I}_K)$. We say that signal $\\mathbf{s}$ lies in or leans toward a subspace if the largest eigenvalue of $\\mathbf{H} \\mathbf{H}^T$ is strictly greater than its smallest eigenvalue. We first design a measurement matrix $\\mathbf{\\Phi}=[\\mathbf{\\Phi}_s^T,\\mathbf{\\Phi}_o^T]^T$ comprising of two sub-matrices $\\mathbf{\\Phi}_s$ and $"},"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":"1507.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T19:37:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08a77060f883b1cf6d9b6c775f977cdfefff6e2248a87a446335b91ac7f4133a","abstract_canon_sha256":"49e683e51b785e57e33b95d709db9588344df4b9727d67deaafc03e58f9e8d79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:36.197185Z","signature_b64":"pF7MYbYlK+l0o5bRpwsssYQ8CJF5AwNPgadLYgU/cqPrt5He+nhwwyY3Xdtk3NQwpwLADy8ex5ZxYYuYYw+UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d924ca7de7bf0bed5fd1238b15c2f12471b01aa07c99413dfe018e4abb518ad3","last_reissued_at":"2026-05-18T01:15:36.196454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:36.196454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive Detection of Random Subspace Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Razavi, Danijela Cabric, Mikko Valkama","submitted_at":"2015-07-10T19:37:53Z","abstract_excerpt":"The problem of compressive detection of random subspace signals is studied. We consider signals modeled as $\\mathbf{s} = \\mathbf{H} \\mathbf{x}$ where $\\mathbf{H}$ is an $N \\times K$ matrix with $K \\le N$ and $\\mathbf{x} \\sim \\mathcal{N}(\\mathbf{0}_{K,1},\\sigma_x^2 \\mathbf{I}_K)$. We say that signal $\\mathbf{s}$ lies in or leans toward a subspace if the largest eigenvalue of $\\mathbf{H} \\mathbf{H}^T$ is strictly greater than its smallest eigenvalue. We first design a measurement matrix $\\mathbf{\\Phi}=[\\mathbf{\\Phi}_s^T,\\mathbf{\\Phi}_o^T]^T$ comprising of two sub-matrices $\\mathbf{\\Phi}_s$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02999","kind":"arxiv","version":2},"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":"1507.02999","created_at":"2026-05-18T01:15:36.196555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02999v2","created_at":"2026-05-18T01:15:36.196555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02999","created_at":"2026-05-18T01:15:36.196555+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ESMU7PHX4F6","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ESMU7PHX4F62X6R","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ESMU7PH","created_at":"2026-05-18T12:29:02.477457+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/3ESMU7PHX4F62X6REOFRLQXRER","json":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER.json","graph_json":"https://pith.science/api/pith-number/3ESMU7PHX4F62X6REOFRLQXRER/graph.json","events_json":"https://pith.science/api/pith-number/3ESMU7PHX4F62X6REOFRLQXRER/events.json","paper":"https://pith.science/paper/3ESMU7PH"},"agent_actions":{"view_html":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER","download_json":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER.json","view_paper":"https://pith.science/paper/3ESMU7PH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02999&json=true","fetch_graph":"https://pith.science/api/pith-number/3ESMU7PHX4F62X6REOFRLQXRER/graph.json","fetch_events":"https://pith.science/api/pith-number/3ESMU7PHX4F62X6REOFRLQXRER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER/action/storage_attestation","attest_author":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER/action/author_attestation","sign_citation":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER/action/citation_signature","submit_replication":"https://pith.science/pith/3ESMU7PHX4F62X6REOFRLQXRER/action/replication_record"}},"created_at":"2026-05-18T01:15:36.196555+00:00","updated_at":"2026-05-18T01:15:36.196555+00:00"}