{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OQCP5Q6FXPB2HAVLZYPKJZGZ6C","short_pith_number":"pith:OQCP5Q6F","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"},"canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","source":{"kind":"arxiv","id":"1806.00904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00904","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00904v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00904","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"OQCP5Q6FXPB2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQCP5Q6FXPB2HAVL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQCP5Q6F","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OQCP5Q6FXPB2HAVLZYPKJZGZ6C","target":"record","payload":{"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"},"canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","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"},"source_kind":"arxiv","source_id":"1806.00904","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9y0Qgq1EqQNAd5KaWKf/nHD42zu/fXOwvg0bXghlnGJ7Y+aRr9HhoKp7e0qis1MB+DVQlZ6PIEPnDUyqoC9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:38:52.602461Z"},"content_sha256":"5b979e88f6e002119745bb33a5249c4ff1652b7fcfd5e985d2d588f2994814e8","schema_version":"1.0","event_id":"sha256:5b979e88f6e002119745bb33a5249c4ff1652b7fcfd5e985d2d588f2994814e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OQCP5Q6FXPB2HAVLZYPKJZGZ6C","target":"graph","payload":{"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"},"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"me7SR4h/bXF4oFsMijfV14D0Id2Lel0EnRYpc6q6gpZVXCgl1GPzXjsaptNb+0qslvXz2njsXtNdGD+GRWEPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:38:52.602822Z"},"content_sha256":"be6a8a18749a3639e09206bdf29016776e1621099d8e31f107a1d44177764aea","schema_version":"1.0","event_id":"sha256:be6a8a18749a3639e09206bdf29016776e1621099d8e31f107a1d44177764aea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/bundle.json","state_url":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/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-06-12T00:38:52Z","links":{"resolver":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C","bundle":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/bundle.json","state":"https://pith.science/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQCP5Q6FXPB2HAVLZYPKJZGZ6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OQCP5Q6FXPB2HAVLZYPKJZGZ6C","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":"b82fd885f2608079b04fdcbb0c40f105d9588314c41abb28f585e97a57750541","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-04T00:37:29Z","title_canon_sha256":"792cc52ac2e2954a16060769850b80cac82e751cbe8ebeff003fd9590c179bfb"},"schema_version":"1.0","source":{"id":"1806.00904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00904","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00904v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00904","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"OQCP5Q6FXPB2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQCP5Q6FXPB2HAVL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQCP5Q6F","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:be6a8a18749a3639e09206bdf29016776e1621099d8e31f107a1d44177764aea","target":"graph","created_at":"2026-05-18T00:14:18Z","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":"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","authors_text":"Meng Huang, Zhiqiang Xu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-04T00:37:29Z","title":"Solving Systems of Quadratic Equations via Exponential-type Gradient Descent Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00904","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:5b979e88f6e002119745bb33a5249c4ff1652b7fcfd5e985d2d588f2994814e8","target":"record","created_at":"2026-05-18T00:14:18Z","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":"b82fd885f2608079b04fdcbb0c40f105d9588314c41abb28f585e97a57750541","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-04T00:37:29Z","title_canon_sha256":"792cc52ac2e2954a16060769850b80cac82e751cbe8ebeff003fd9590c179bfb"},"schema_version":"1.0","source":{"id":"1806.00904","kind":"arxiv","version":1}},"canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7404fec3c5bbc3a382abce1ea4e4d9f0ade8bcce64809ebe09f92cd5e5b1e598","first_computed_at":"2026-05-18T00:14:18.065071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.065071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zeS72SUBwI4JcV0mZ8OkdWi6M08IaltYgDDqe1Sh0a97xF9MWQqtBOrTSAWXWaceNTBb43gV5Rru2eKUjdVaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.065632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b979e88f6e002119745bb33a5249c4ff1652b7fcfd5e985d2d588f2994814e8","sha256:be6a8a18749a3639e09206bdf29016776e1621099d8e31f107a1d44177764aea"],"state_sha256":"081f824cab9975f30bed11024036fb993aa2aa8663a0ff4737cc582e366114fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiiPTw1BH1O6NbYiPuHklSi4LeRp92kqbjGBL3eRKVPX3IsoNknWVbPaBlcg4nL2aPUzj9oBqrjbo2XnQPniDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:38:52.606302Z","bundle_sha256":"e87f2e5a2eaaca4081d2fdea3d159f5085bd0ef0339ed800abce3d603b6e6d02"}}