{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HX7YNGAQ6DM4TK2BWTQG3EMWEH","short_pith_number":"pith:HX7YNGAQ","schema_version":"1.0","canonical_sha256":"3dff869810f0d9c9ab41b4e06d919621e18cf15a2cfb9ae80bb3eb3a7aa030cf","source":{"kind":"arxiv","id":"2002.01066","version":2},"attestation_state":"computed","paper":{"title":"On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"eess.SP","authors_text":"Angelia Nedi\\'c, Gautam Dasarathy, Parth Thaker","submitted_at":"2020-02-04T00:35:09Z","abstract_excerpt":"We consider the problem of recovering a complex vector $\\mathbf{x}\\in \\mathbb{C}^n$ from $m$ quadratic measurements $\\{\\langle A_i\\mathbf{x}, \\mathbf{x}\\rangle\\}_{i=1}^m$. This problem, known as quadratic feasibility, encompasses the well known phase retrieval problem and has applications in a wide range of important areas including power system state estimation and x-ray crystallography. In general, not only is the the quadratic feasibility problem NP-hard to solve, but it may in fact be unidentifiable. In this paper, we establish conditions under which this problem becomes {identifiable}, an"},"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":"2002.01066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-02-04T00:35:09Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"025a9819a155bb734dfe80c00fe405136139a77eacb674d1e5fc0d4b4c6b95fc","abstract_canon_sha256":"cccd192a28c249af1ef8c4903a569eb2d68846effbc0897fcb6ab6085f0f5aa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:59:27.819114Z","signature_b64":"lv8iBjO7DR8XL6oc9HhjdFZRjRgeyqkb1Afh4tth8UJ3TpsS92Tzyw7cfLSuHFnFemz+lZe1DRJUlh3R71EgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dff869810f0d9c9ab41b4e06d919621e18cf15a2cfb9ae80bb3eb3a7aa030cf","last_reissued_at":"2026-07-05T01:59:27.818627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:59:27.818627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"eess.SP","authors_text":"Angelia Nedi\\'c, Gautam Dasarathy, Parth Thaker","submitted_at":"2020-02-04T00:35:09Z","abstract_excerpt":"We consider the problem of recovering a complex vector $\\mathbf{x}\\in \\mathbb{C}^n$ from $m$ quadratic measurements $\\{\\langle A_i\\mathbf{x}, \\mathbf{x}\\rangle\\}_{i=1}^m$. This problem, known as quadratic feasibility, encompasses the well known phase retrieval problem and has applications in a wide range of important areas including power system state estimation and x-ray crystallography. In general, not only is the the quadratic feasibility problem NP-hard to solve, but it may in fact be unidentifiable. In this paper, we establish conditions under which this problem becomes {identifiable}, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01066","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.01066/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":"2002.01066","created_at":"2026-07-05T01:59:27.818687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01066v2","created_at":"2026-07-05T01:59:27.818687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01066","created_at":"2026-07-05T01:59:27.818687+00:00"},{"alias_kind":"pith_short_12","alias_value":"HX7YNGAQ6DM4","created_at":"2026-07-05T01:59:27.818687+00:00"},{"alias_kind":"pith_short_16","alias_value":"HX7YNGAQ6DM4TK2B","created_at":"2026-07-05T01:59:27.818687+00:00"},{"alias_kind":"pith_short_8","alias_value":"HX7YNGAQ","created_at":"2026-07-05T01:59:27.818687+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/HX7YNGAQ6DM4TK2BWTQG3EMWEH","json":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH.json","graph_json":"https://pith.science/api/pith-number/HX7YNGAQ6DM4TK2BWTQG3EMWEH/graph.json","events_json":"https://pith.science/api/pith-number/HX7YNGAQ6DM4TK2BWTQG3EMWEH/events.json","paper":"https://pith.science/paper/HX7YNGAQ"},"agent_actions":{"view_html":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH","download_json":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH.json","view_paper":"https://pith.science/paper/HX7YNGAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01066&json=true","fetch_graph":"https://pith.science/api/pith-number/HX7YNGAQ6DM4TK2BWTQG3EMWEH/graph.json","fetch_events":"https://pith.science/api/pith-number/HX7YNGAQ6DM4TK2BWTQG3EMWEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH/action/storage_attestation","attest_author":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH/action/author_attestation","sign_citation":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH/action/citation_signature","submit_replication":"https://pith.science/pith/HX7YNGAQ6DM4TK2BWTQG3EMWEH/action/replication_record"}},"created_at":"2026-07-05T01:59:27.818687+00:00","updated_at":"2026-07-05T01:59:27.818687+00:00"}