{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4NFFLDAVRRSRVFCOPWIMYNPHNV","short_pith_number":"pith:4NFFLDAV","schema_version":"1.0","canonical_sha256":"e34a558c158c651a944e7d90cc35e76d683c65523139f2a537bdf06943ac6d06","source":{"kind":"arxiv","id":"2303.12298","version":1},"attestation_state":"computed","paper":{"title":"A General Algorithm for Solving Rank-one Matrix Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Lianke Qin, Ruizhe Zhang, Zhao Song","submitted_at":"2023-03-22T04:07:26Z","abstract_excerpt":"Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision. The goal of matrix sensing is to recover a matrix $A_\\star \\in \\mathbb{R}^{n \\times n}$, based on a sequence of measurements $(u_i,b_i) \\in \\mathbb{R}^{n} \\times \\mathbb{R}$ such that $u_i^\\top A_\\star u_i = b_i$. Previous work [ZJD15] focused on the scenario where matrix $A_{\\star}$ has a small rank, e.g. rank-$k$. Their analysis heavily relies on the RIP assumption, making it unclear how to generalize to high-rank matrices. In this paper, we relax that "},"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":"2303.12298","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-03-22T04:07:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"84041d4fc8c1576a3414150e670eb34f583f8545127455c52b1e94d75a29d82e","abstract_canon_sha256":"38851f1d9040b8ce1c9ee5587f155651a976da0f320c1ab6a9d0f14f55221c72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:53:39.562813Z","signature_b64":"0BwXJT5iWPugpFKFxbqlFqAu+wWDmzkZsXZkEhR9dSxHbXVkwx8T98+K3BJ8Rvi+vCGt7aMsL8eGw9OR37A1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34a558c158c651a944e7d90cc35e76d683c65523139f2a537bdf06943ac6d06","last_reissued_at":"2026-07-05T05:53:39.562478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:53:39.562478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Algorithm for Solving Rank-one Matrix Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Lianke Qin, Ruizhe Zhang, Zhao Song","submitted_at":"2023-03-22T04:07:26Z","abstract_excerpt":"Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision. The goal of matrix sensing is to recover a matrix $A_\\star \\in \\mathbb{R}^{n \\times n}$, based on a sequence of measurements $(u_i,b_i) \\in \\mathbb{R}^{n} \\times \\mathbb{R}$ such that $u_i^\\top A_\\star u_i = b_i$. Previous work [ZJD15] focused on the scenario where matrix $A_{\\star}$ has a small rank, e.g. rank-$k$. Their analysis heavily relies on the RIP assumption, making it unclear how to generalize to high-rank matrices. In this paper, we relax that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.12298","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.12298/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":"2303.12298","created_at":"2026-07-05T05:53:39.562532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.12298v1","created_at":"2026-07-05T05:53:39.562532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.12298","created_at":"2026-07-05T05:53:39.562532+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NFFLDAVRRSR","created_at":"2026-07-05T05:53:39.562532+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NFFLDAVRRSRVFCO","created_at":"2026-07-05T05:53:39.562532+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NFFLDAV","created_at":"2026-07-05T05:53:39.562532+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/4NFFLDAVRRSRVFCOPWIMYNPHNV","json":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV.json","graph_json":"https://pith.science/api/pith-number/4NFFLDAVRRSRVFCOPWIMYNPHNV/graph.json","events_json":"https://pith.science/api/pith-number/4NFFLDAVRRSRVFCOPWIMYNPHNV/events.json","paper":"https://pith.science/paper/4NFFLDAV"},"agent_actions":{"view_html":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV","download_json":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV.json","view_paper":"https://pith.science/paper/4NFFLDAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.12298&json=true","fetch_graph":"https://pith.science/api/pith-number/4NFFLDAVRRSRVFCOPWIMYNPHNV/graph.json","fetch_events":"https://pith.science/api/pith-number/4NFFLDAVRRSRVFCOPWIMYNPHNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV/action/storage_attestation","attest_author":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV/action/author_attestation","sign_citation":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV/action/citation_signature","submit_replication":"https://pith.science/pith/4NFFLDAVRRSRVFCOPWIMYNPHNV/action/replication_record"}},"created_at":"2026-07-05T05:53:39.562532+00:00","updated_at":"2026-07-05T05:53:39.562532+00:00"}