{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HX7YNGAQ6DM4TK2BWTQG3EMWEH","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":"cccd192a28c249af1ef8c4903a569eb2d68846effbc0897fcb6ab6085f0f5aa0","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-02-04T00:35:09Z","title_canon_sha256":"025a9819a155bb734dfe80c00fe405136139a77eacb674d1e5fc0d4b4c6b95fc"},"schema_version":"1.0","source":{"id":"2002.01066","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01066","created_at":"2026-07-05T01:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01066v2","created_at":"2026-07-05T01:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01066","created_at":"2026-07-05T01:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"HX7YNGAQ6DM4","created_at":"2026-07-05T01:59:27Z"},{"alias_kind":"pith_short_16","alias_value":"HX7YNGAQ6DM4TK2B","created_at":"2026-07-05T01:59:27Z"},{"alias_kind":"pith_short_8","alias_value":"HX7YNGAQ","created_at":"2026-07-05T01:59:27Z"}],"graph_snapshots":[{"event_id":"sha256:f4c62b36e2265b3bdaacbd7f5c92c2c1daef11bfe740af99a49d62262a86468e","target":"graph","created_at":"2026-07-05T01:59:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.01066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Angelia Nedi\\'c, Gautam Dasarathy, Parth Thaker","cross_cats":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-02-04T00:35:09Z","title":"On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01066","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:717d9e7cea7e7d3d7295ae2f7fdcbc64c3c12a76852d10a4341f3cb16636048b","target":"record","created_at":"2026-07-05T01:59:27Z","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":"cccd192a28c249af1ef8c4903a569eb2d68846effbc0897fcb6ab6085f0f5aa0","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-02-04T00:35:09Z","title_canon_sha256":"025a9819a155bb734dfe80c00fe405136139a77eacb674d1e5fc0d4b4c6b95fc"},"schema_version":"1.0","source":{"id":"2002.01066","kind":"arxiv","version":2}},"canonical_sha256":"3dff869810f0d9c9ab41b4e06d919621e18cf15a2cfb9ae80bb3eb3a7aa030cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dff869810f0d9c9ab41b4e06d919621e18cf15a2cfb9ae80bb3eb3a7aa030cf","first_computed_at":"2026-07-05T01:59:27.818627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:59:27.818627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lv8iBjO7DR8XL6oc9HhjdFZRjRgeyqkb1Afh4tth8UJ3TpsS92Tzyw7cfLSuHFnFemz+lZe1DRJUlh3R71EgDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:59:27.819114Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.01066","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:717d9e7cea7e7d3d7295ae2f7fdcbc64c3c12a76852d10a4341f3cb16636048b","sha256:f4c62b36e2265b3bdaacbd7f5c92c2c1daef11bfe740af99a49d62262a86468e"],"state_sha256":"78571b271f0e9aaddcc15849d1846899b4e5a5bebc2e9036dab0d56d2e26b164"}