{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OKC2ZWTVA4WQ6NN7CYGDGAVPP6","short_pith_number":"pith:OKC2ZWTV","schema_version":"1.0","canonical_sha256":"7285acda75072d0f35bf160c3302af7fb69b5b1405a6c18960057d120e6d0c5d","source":{"kind":"arxiv","id":"1902.04972","version":5},"attestation_state":"computed","paper":{"title":"Provable Low Rank Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy, Seyedehsara Nayer","submitted_at":"2019-02-13T15:56:12Z","abstract_excerpt":"We study the Low Rank Phase Retrieval (LRPR) problem defined as follows: recover an $n \\times q$ matrix $X^*$ of rank $r$ from a different and independent set of $m$ phaseless (magnitude-only) linear projections of each of its columns. To be precise, we need to recover $X^*$ from $y_k := |A_k{}' x^*_k|, k=1,2,\\dots, q$ when the measurement matrices $A_k$ are mutually independent. Here $y_k$ is an $m$ length vector, $A_k$ is an $n \\times m$ matrix, and $'$ denotes matrix transpose. The question is when can we solve LRPR with $m \\ll n$? A reliable solution can enable fast and low-cost phaseless "},"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":"1902.04972","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-13T15:56:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"77b2c26f183ff8d78e3b38809759a0f5d046ac17288adeabaf19c46735f564cd","abstract_canon_sha256":"c82925cd213fedddba73ff485a24763bea52a3f9e59fc1e0ede0cfd0d03d83dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:39.712361Z","signature_b64":"69hV+dO7pN9Ahkd5U3C3rckiKPL3WpRy3mMNEqJmjTHSs9CnN1zCLFKYFQ+n9RNNCSzEQfe34OFOPrDi7KyOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7285acda75072d0f35bf160c3302af7fb69b5b1405a6c18960057d120e6d0c5d","last_reissued_at":"2026-07-05T01:54:39.711962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:39.711962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Low Rank Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy, Seyedehsara Nayer","submitted_at":"2019-02-13T15:56:12Z","abstract_excerpt":"We study the Low Rank Phase Retrieval (LRPR) problem defined as follows: recover an $n \\times q$ matrix $X^*$ of rank $r$ from a different and independent set of $m$ phaseless (magnitude-only) linear projections of each of its columns. To be precise, we need to recover $X^*$ from $y_k := |A_k{}' x^*_k|, k=1,2,\\dots, q$ when the measurement matrices $A_k$ are mutually independent. Here $y_k$ is an $m$ length vector, $A_k$ is an $n \\times m$ matrix, and $'$ denotes matrix transpose. The question is when can we solve LRPR with $m \\ll n$? A reliable solution can enable fast and low-cost phaseless "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04972","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.04972/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.04972","created_at":"2026-07-05T01:54:39.712024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04972v5","created_at":"2026-07-05T01:54:39.712024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04972","created_at":"2026-07-05T01:54:39.712024+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKC2ZWTVA4WQ","created_at":"2026-07-05T01:54:39.712024+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKC2ZWTVA4WQ6NN7","created_at":"2026-07-05T01:54:39.712024+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKC2ZWTV","created_at":"2026-07-05T01:54:39.712024+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/OKC2ZWTVA4WQ6NN7CYGDGAVPP6","json":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6.json","graph_json":"https://pith.science/api/pith-number/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/graph.json","events_json":"https://pith.science/api/pith-number/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/events.json","paper":"https://pith.science/paper/OKC2ZWTV"},"agent_actions":{"view_html":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6","download_json":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6.json","view_paper":"https://pith.science/paper/OKC2ZWTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04972&json=true","fetch_graph":"https://pith.science/api/pith-number/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/graph.json","fetch_events":"https://pith.science/api/pith-number/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/action/storage_attestation","attest_author":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/action/author_attestation","sign_citation":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/action/citation_signature","submit_replication":"https://pith.science/pith/OKC2ZWTVA4WQ6NN7CYGDGAVPP6/action/replication_record"}},"created_at":"2026-07-05T01:54:39.712024+00:00","updated_at":"2026-07-05T01:54:39.712024+00:00"}