{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YNXU24MWTJ55A4NXI2QJQ7RD3X","short_pith_number":"pith:YNXU24MW","canonical_record":{"source":{"id":"1702.06175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T21:04:36Z","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"title_canon_sha256":"2873ea2099260e1587cc44f09b144933817251e9c611383a7d49462bd0a43251","abstract_canon_sha256":"a661ad9c9ad2649d9dd0c62514b4670f6358bf256a6d366fd69faf6451ae413d"},"schema_version":"1.0"},"canonical_sha256":"c36f4d71969a7bd071b746a0987e23dddcb295f82b60cbd15d7e7d2b8188d76a","source":{"kind":"arxiv","id":"1702.06175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06175","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06175v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06175","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"YNXU24MWTJ55","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YNXU24MWTJ55A4NX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YNXU24MW","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YNXU24MWTJ55A4NXI2QJQ7RD3X","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T21:04:36Z","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"title_canon_sha256":"2873ea2099260e1587cc44f09b144933817251e9c611383a7d49462bd0a43251","abstract_canon_sha256":"a661ad9c9ad2649d9dd0c62514b4670f6358bf256a6d366fd69faf6451ae413d"},"schema_version":"1.0"},"canonical_sha256":"c36f4d71969a7bd071b746a0987e23dddcb295f82b60cbd15d7e7d2b8188d76a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.793550Z","signature_b64":"ZX4ViKLd/l7ydmIT3WJpmQoqmeWeT4VIQ9M4a6uFoQeJuB/r1jYhb2C2mDUufefsjM2Syeg1J0Gu76StO7uFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c36f4d71969a7bd071b746a0987e23dddcb295f82b60cbd15d7e7d2b8188d76a","last_reissued_at":"2026-05-18T00:50:14.792965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.792965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06175","source_version":1,"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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5iVdxuwSD7JSZW/6itCcHWL12PmZ2NDee4b6pHGIMi4fUqWsfZJqLZBiKCWW6t/oLCM+NvuKh/KTtWhxXKHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:48:46.014631Z"},"content_sha256":"1f87988d0ab40ae0d1ffa27366267a0400511b0b8059a6a4ed4d98cb81b19b2f","schema_version":"1.0","event_id":"sha256:1f87988d0ab40ae0d1ffa27366267a0400511b0b8059a6a4ed4d98cb81b19b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YNXU24MWTJ55A4NXI2QJQ7RD3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Soltanolkotabi","submitted_at":"2017-02-20T21:04:36Z","abstract_excerpt":"This paper concerns the problem of recovering an unknown but structured signal $x \\in R^n$ from $m$ quadratic measurements of the form $y_r=|<a_r,x>|^2$ for $r=1,2,...,m$. We focus on the under-determined setting where the number of measurements is significantly smaller than the dimension of the signal ($m<<n$). We formulate the recovery problem as a nonconvex optimization problem where prior structural information about the signal is enforced through constrains on the optimization variables. We prove that projected gradient descent, when initialized in a neighborhood of the desired signal, co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06175","kind":"arxiv","version":1},"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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlJgwsYcpyRD5rLoJcoKalex0J9pKLkCMRjYdkSzBjXy/AQoWd25TQOM24Tf0G2HkRr5BMc7+SsHcES5j4OSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:48:46.015022Z"},"content_sha256":"a8a5bafe8dc201f17785d64f51acc83b394ef5756ad40da23b2a11a4a265551c","schema_version":"1.0","event_id":"sha256:a8a5bafe8dc201f17785d64f51acc83b394ef5756ad40da23b2a11a4a265551c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/bundle.json","state_url":"https://pith.science/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/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-31T07:48:46Z","links":{"resolver":"https://pith.science/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X","bundle":"https://pith.science/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/bundle.json","state":"https://pith.science/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNXU24MWTJ55A4NXI2QJQ7RD3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YNXU24MWTJ55A4NXI2QJQ7RD3X","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":"a661ad9c9ad2649d9dd0c62514b4670f6358bf256a6d366fd69faf6451ae413d","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T21:04:36Z","title_canon_sha256":"2873ea2099260e1587cc44f09b144933817251e9c611383a7d49462bd0a43251"},"schema_version":"1.0","source":{"id":"1702.06175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06175","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06175v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06175","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"YNXU24MWTJ55","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YNXU24MWTJ55A4NX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YNXU24MW","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:a8a5bafe8dc201f17785d64f51acc83b394ef5756ad40da23b2a11a4a265551c","target":"graph","created_at":"2026-05-18T00:50:14Z","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":"This paper concerns the problem of recovering an unknown but structured signal $x \\in R^n$ from $m$ quadratic measurements of the form $y_r=|<a_r,x>|^2$ for $r=1,2,...,m$. We focus on the under-determined setting where the number of measurements is significantly smaller than the dimension of the signal ($m<<n$). We formulate the recovery problem as a nonconvex optimization problem where prior structural information about the signal is enforced through constrains on the optimization variables. We prove that projected gradient descent, when initialized in a neighborhood of the desired signal, co","authors_text":"Mahdi Soltanolkotabi","cross_cats":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T21:04:36Z","title":"Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06175","kind":"arxiv","version":1},"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:1f87988d0ab40ae0d1ffa27366267a0400511b0b8059a6a4ed4d98cb81b19b2f","target":"record","created_at":"2026-05-18T00:50:14Z","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":"a661ad9c9ad2649d9dd0c62514b4670f6358bf256a6d366fd69faf6451ae413d","cross_cats_sorted":["cs.IT","math.FA","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T21:04:36Z","title_canon_sha256":"2873ea2099260e1587cc44f09b144933817251e9c611383a7d49462bd0a43251"},"schema_version":"1.0","source":{"id":"1702.06175","kind":"arxiv","version":1}},"canonical_sha256":"c36f4d71969a7bd071b746a0987e23dddcb295f82b60cbd15d7e7d2b8188d76a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c36f4d71969a7bd071b746a0987e23dddcb295f82b60cbd15d7e7d2b8188d76a","first_computed_at":"2026-05-18T00:50:14.792965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.792965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZX4ViKLd/l7ydmIT3WJpmQoqmeWeT4VIQ9M4a6uFoQeJuB/r1jYhb2C2mDUufefsjM2Syeg1J0Gu76StO7uFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.793550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f87988d0ab40ae0d1ffa27366267a0400511b0b8059a6a4ed4d98cb81b19b2f","sha256:a8a5bafe8dc201f17785d64f51acc83b394ef5756ad40da23b2a11a4a265551c"],"state_sha256":"32155289b737aee5fbf74c372a27222949e6db12189be1e611ee1c46f81d0b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HlqzwwUY9hx7owOQnJKaG/9sv4VAKYvTk/wcHZMOqZuhnjmLM8RMOoSxBcs5P25OsQZl3UMFTX6aqnneXs5/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:48:46.017468Z","bundle_sha256":"e776bcd4eba51af1f26967c04c74d24b71077017f6021600ce33cb61808ecadc"}}