{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OQCP5Q6FXPB2HAVLZYPKJZGZ6C","short_pith_number":"pith:OQCP5Q6F","schema_version":"1.0","canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","source":{"kind":"arxiv","id":"1806.00904","version":1},"attestation_state":"computed","paper":{"title":"Solving Systems of Quadratic Equations via Exponential-type Gradient Descent Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Meng Huang, Zhiqiang Xu","submitted_at":"2018-06-04T00:37:29Z","abstract_excerpt":"We consider the rank minimization problem from quadratic measurements, i.e., recovering a rank $r$ matrix $X \\in \\mathbb{R}^{n \\times r}$ from $m$ scalar measurements $y_i=a_i^{\\top} XX^{\\top} a_i,\\;a_i\\in \\mathbb{R}^n,\\;i=1,\\ldots,m$. Such problem arises in a variety of applications such as quadratic regression and quantum state tomography. We present a novel algorithm, which is termed exponential-type gradient descent algorithm, to minimize a non-convex objective function $f(U)=\\frac{1}{4m}\\sum_{i=1}^m(y_i-a_i^{\\top} UU^{\\top} a_i)^2$. This algorithm starts with a careful initialization, and"},"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":"1806.00904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-04T00:37:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"792cc52ac2e2954a16060769850b80cac82e751cbe8ebeff003fd9590c179bfb","abstract_canon_sha256":"b82fd885f2608079b04fdcbb0c40f105d9588314c41abb28f585e97a57750541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.065632Z","signature_b64":"zeS72SUBwI4JcV0mZ8OkdWi6M08IaltYgDDqe1Sh0a97xF9MWQqtBOrTSAWXWaceNTBb43gV5Rru2eKUjdVaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","last_reissued_at":"2026-05-18T00:14:18.065071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.065071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Systems of Quadratic Equations via Exponential-type Gradient Descent Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Meng Huang, Zhiqiang Xu","submitted_at":"2018-06-04T00:37:29Z","abstract_excerpt":"We consider the rank minimization problem from quadratic measurements, i.e., recovering a rank $r$ matrix $X \\in \\mathbb{R}^{n \\times r}$ from $m$ scalar measurements $y_i=a_i^{\\top} XX^{\\top} a_i,\\;a_i\\in \\mathbb{R}^n,\\;i=1,\\ldots,m$. Such problem arises in a variety of applications such as quadratic regression and quantum state tomography. We present a novel algorithm, which is termed exponential-type gradient descent algorithm, to minimize a non-convex objective function $f(U)=\\frac{1}{4m}\\sum_{i=1}^m(y_i-a_i^{\\top} UU^{\\top} a_i)^2$. This algorithm starts with a careful initialization, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00904","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.00904","created_at":"2026-05-18T00:14:18.065160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00904v1","created_at":"2026-05-18T00:14:18.065160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00904","created_at":"2026-05-18T00:14:18.065160+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQCP5Q6FXPB2","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQCP5Q6FXPB2HAVL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQCP5Q6F","created_at":"2026-05-18T12:32:43.782077+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/OQCP5Q6FXPB2HAVLZYPKJZGZ6C","json":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C.json","graph_json":"https://pith.science/api/pith-number/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/graph.json","events_json":"https://pith.science/api/pith-number/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/events.json","paper":"https://pith.science/paper/OQCP5Q6F"},"agent_actions":{"view_html":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C","download_json":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C.json","view_paper":"https://pith.science/paper/OQCP5Q6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00904&json=true","fetch_graph":"https://pith.science/api/pith-number/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/graph.json","fetch_events":"https://pith.science/api/pith-number/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/action/storage_attestation","attest_author":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/action/author_attestation","sign_citation":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/action/citation_signature","submit_replication":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/action/replication_record"}},"created_at":"2026-05-18T00:14:18.065160+00:00","updated_at":"2026-05-18T00:14:18.065160+00:00"}