{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5BI3N4UIQJBYAC3FB7KJCC2SYG","short_pith_number":"pith:5BI3N4UI","schema_version":"1.0","canonical_sha256":"e851b6f2888243800b650fd4910b52c1bc095ce207c489842fd3140574026e98","source":{"kind":"arxiv","id":"1507.02454","version":2},"attestation_state":"computed","paper":{"title":"Optimized Compressed Sensing via Incoherent Frames Designed by Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cristian Rusu, Nuria Gonz\\'alez-Prelcic","submitted_at":"2015-07-09T10:49:07Z","abstract_excerpt":"The construction of highly incoherent frames, sequences of vectors placed on the unit hyper sphere of a finite dimensional Hilbert space with low correlation between them, has proven very difficult. Algorithms proposed in the past have focused in minimizing the absolute value off-diagonal entries of the Gram matrix of these structures. Recently, a method based on convex optimization that operates directly on the vectors of the frame has been shown to produce promising results. This paper gives a detailed analysis of the optimization problem at the heart of this approach and, based on these ins"},"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.02454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-09T10:49:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44bc8ba7a34151a204e97a146118901fcaae4cd9ac04c31d2074afab3ed8dd62","abstract_canon_sha256":"d31ad6a394c50e8a055f0cea4877f8d5826c112f493466b064dce2a0254b0493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.740563Z","signature_b64":"gxpmBQSCMR2isfhYQi9B4w4dErxH8EG/I8hdy3tkRWqCbYW6n0xOyXS0Ltpi4kBjfMDuYhza5eThcW6ABHytBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e851b6f2888243800b650fd4910b52c1bc095ce207c489842fd3140574026e98","last_reissued_at":"2026-05-18T00:56:46.740057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.740057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized Compressed Sensing via Incoherent Frames Designed by Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cristian Rusu, Nuria Gonz\\'alez-Prelcic","submitted_at":"2015-07-09T10:49:07Z","abstract_excerpt":"The construction of highly incoherent frames, sequences of vectors placed on the unit hyper sphere of a finite dimensional Hilbert space with low correlation between them, has proven very difficult. Algorithms proposed in the past have focused in minimizing the absolute value off-diagonal entries of the Gram matrix of these structures. Recently, a method based on convex optimization that operates directly on the vectors of the frame has been shown to produce promising results. This paper gives a detailed analysis of the optimization problem at the heart of this approach and, based on these ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02454","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.02454","created_at":"2026-05-18T00:56:46.740146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02454v2","created_at":"2026-05-18T00:56:46.740146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02454","created_at":"2026-05-18T00:56:46.740146+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BI3N4UIQJBY","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BI3N4UIQJBYAC3F","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BI3N4UI","created_at":"2026-05-18T12:29:05.191682+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/5BI3N4UIQJBYAC3FB7KJCC2SYG","json":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG.json","graph_json":"https://pith.science/api/pith-number/5BI3N4UIQJBYAC3FB7KJCC2SYG/graph.json","events_json":"https://pith.science/api/pith-number/5BI3N4UIQJBYAC3FB7KJCC2SYG/events.json","paper":"https://pith.science/paper/5BI3N4UI"},"agent_actions":{"view_html":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG","download_json":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG.json","view_paper":"https://pith.science/paper/5BI3N4UI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02454&json=true","fetch_graph":"https://pith.science/api/pith-number/5BI3N4UIQJBYAC3FB7KJCC2SYG/graph.json","fetch_events":"https://pith.science/api/pith-number/5BI3N4UIQJBYAC3FB7KJCC2SYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG/action/storage_attestation","attest_author":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG/action/author_attestation","sign_citation":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG/action/citation_signature","submit_replication":"https://pith.science/pith/5BI3N4UIQJBYAC3FB7KJCC2SYG/action/replication_record"}},"created_at":"2026-05-18T00:56:46.740146+00:00","updated_at":"2026-05-18T00:56:46.740146+00:00"}