{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3URHF73MB2KOLMV6UE57XEFQI","short_pith_number":"pith:R3URHF73","canonical_record":{"source":{"id":"1801.09678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-30T00:16:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"06247f2aeaaecf0227d9302adb74ccc893acd8a8603aeab26f56af550b511f29","abstract_canon_sha256":"1d377660c201b5a934f212dc5eadcdcd04b8cd67d3f1a1761f5b0ef0a183212a"},"schema_version":"1.0"},"canonical_sha256":"8ee91397fb6074a72d95f509dfdc85820c5eb9e67778180135b55fa0fd98e74f","source":{"kind":"arxiv","id":"1801.09678","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09678","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09678v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09678","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"R3URHF73MB2K","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3URHF73MB2KOLMV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3URHF73","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3URHF73MB2KOLMV6UE57XEFQI","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-30T00:16:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"06247f2aeaaecf0227d9302adb74ccc893acd8a8603aeab26f56af550b511f29","abstract_canon_sha256":"1d377660c201b5a934f212dc5eadcdcd04b8cd67d3f1a1761f5b0ef0a183212a"},"schema_version":"1.0"},"canonical_sha256":"8ee91397fb6074a72d95f509dfdc85820c5eb9e67778180135b55fa0fd98e74f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:48.414885Z","signature_b64":"34y68v7lDDnuiyXfPuUJapFVU963U6kSvXYyvLWvvh0Fp5BvSjSbuiF79CHHQMo47aFL5+D1Wc6bgbnR85kxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee91397fb6074a72d95f509dfdc85820c5eb9e67778180135b55fa0fd98e74f","last_reissued_at":"2026-05-18T00:12:48.414392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:48.414392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09678","source_version":2,"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-18T00:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7V8qbE6Pqc3MHYAkZE8CnEn6G42BWFYVZNqVzY2qgk/cSAp/YPnVV8AtwUP4QYKHQFQaKU5TXEve1j6CyglvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:48:38.027763Z"},"content_sha256":"2a407262769438d356cf03024df49083541fc3a070ff2726524ac5b71322507c","schema_version":"1.0","event_id":"sha256:2a407262769438d356cf03024df49083541fc3a070ff2726524ac5b71322507c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3URHF73MB2KOLMV6UE57XEFQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for the Construction of Incoherent Frames Under Various Design Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Cristian Rusu, Nuria Gonzalez-Prelcic, Robert W. Heath Jr","submitted_at":"2018-01-30T00:16:21Z","abstract_excerpt":"Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low coherence frames are useful in compressed sensing applications. When used as measurement matrices, they successfully recover highly sparse solutions to linear inverse problems. This paper describes algorithms for the design of various low coherence frame types: real, complex, unital (constant magnitude) complex, sparse real and complex, nonnegative real and comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09678","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"},"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-18T00:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fG3topEDk8b6G+iB+ZV600Q+pY2zIBtvLeBmC40/G/2gsLO233gAd1lXxOXEZOWCpsGvcNiwZPB8jeeMM6zuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:48:38.028436Z"},"content_sha256":"a75d5528a97543312e1822d09cca8a363ab91ca50e059fc4e77248aa8405d9a1","schema_version":"1.0","event_id":"sha256:a75d5528a97543312e1822d09cca8a363ab91ca50e059fc4e77248aa8405d9a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3URHF73MB2KOLMV6UE57XEFQI/bundle.json","state_url":"https://pith.science/pith/R3URHF73MB2KOLMV6UE57XEFQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3URHF73MB2KOLMV6UE57XEFQI/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-24T02:48:38Z","links":{"resolver":"https://pith.science/pith/R3URHF73MB2KOLMV6UE57XEFQI","bundle":"https://pith.science/pith/R3URHF73MB2KOLMV6UE57XEFQI/bundle.json","state":"https://pith.science/pith/R3URHF73MB2KOLMV6UE57XEFQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3URHF73MB2KOLMV6UE57XEFQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3URHF73MB2KOLMV6UE57XEFQI","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":"1d377660c201b5a934f212dc5eadcdcd04b8cd67d3f1a1761f5b0ef0a183212a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-30T00:16:21Z","title_canon_sha256":"06247f2aeaaecf0227d9302adb74ccc893acd8a8603aeab26f56af550b511f29"},"schema_version":"1.0","source":{"id":"1801.09678","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09678","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09678v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09678","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"R3URHF73MB2K","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3URHF73MB2KOLMV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3URHF73","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:a75d5528a97543312e1822d09cca8a363ab91ca50e059fc4e77248aa8405d9a1","target":"graph","created_at":"2026-05-18T00:12:48Z","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":"Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low coherence frames are useful in compressed sensing applications. When used as measurement matrices, they successfully recover highly sparse solutions to linear inverse problems. This paper describes algorithms for the design of various low coherence frame types: real, complex, unital (constant magnitude) complex, sparse real and complex, nonnegative real and comp","authors_text":"Cristian Rusu, Nuria Gonzalez-Prelcic, Robert W. Heath Jr","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-30T00:16:21Z","title":"Algorithms for the Construction of Incoherent Frames Under Various Design Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09678","kind":"arxiv","version":2},"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:2a407262769438d356cf03024df49083541fc3a070ff2726524ac5b71322507c","target":"record","created_at":"2026-05-18T00:12:48Z","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":"1d377660c201b5a934f212dc5eadcdcd04b8cd67d3f1a1761f5b0ef0a183212a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-30T00:16:21Z","title_canon_sha256":"06247f2aeaaecf0227d9302adb74ccc893acd8a8603aeab26f56af550b511f29"},"schema_version":"1.0","source":{"id":"1801.09678","kind":"arxiv","version":2}},"canonical_sha256":"8ee91397fb6074a72d95f509dfdc85820c5eb9e67778180135b55fa0fd98e74f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ee91397fb6074a72d95f509dfdc85820c5eb9e67778180135b55fa0fd98e74f","first_computed_at":"2026-05-18T00:12:48.414392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:48.414392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34y68v7lDDnuiyXfPuUJapFVU963U6kSvXYyvLWvvh0Fp5BvSjSbuiF79CHHQMo47aFL5+D1Wc6bgbnR85kxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:48.414885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09678","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a407262769438d356cf03024df49083541fc3a070ff2726524ac5b71322507c","sha256:a75d5528a97543312e1822d09cca8a363ab91ca50e059fc4e77248aa8405d9a1"],"state_sha256":"9d678433a54645f83b393ce5737cda3686a0053e509e18bb7ebe63b8aace3b67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJGeCV/R0EBUEG0mPFhpMC5oO422itfmYKSAtsAfJTK7VC31npxrle1amm6/AgK1/jA58ZR39P7U/E8RtbpTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:48:38.032401Z","bundle_sha256":"dd7f4ae8f1e1a7dc78b86317a5a1e0c562b8b41cd6520fe8d48216457fef2ea0"}}