{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3VG4GQZ2I7F4KRJ545AUKEDW6Z","short_pith_number":"pith:3VG4GQZ2","schema_version":"1.0","canonical_sha256":"dd4dc3433a47cbc5453de741451076f65513a9846d204a497897974c0f568c86","source":{"kind":"arxiv","id":"2504.17947","version":1},"attestation_state":"computed","paper":{"title":"Improving the Threshold for Finding Rank-1 Matrices in a Subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander S. Wein, Jeshu Dastidar, Tait Weicht","submitted_at":"2025-04-24T21:22:17Z","abstract_excerpt":"We consider a basic computational task of finding $s$ planted rank-1 $m \\times n$ matrices in a linear subspace $\\mathcal{U} \\subseteq \\mathbb{R}^{m \\times n}$ where $\\dim(\\mathcal{U}) = R \\ge s$. The work of Johnston-Lovitz-Vijayaraghavan (FOCS 2023) gave a polynomial-time algorithm for this task and proved that it succeeds when ${R \\le (1-o(1))mn/4}$, under minimal genericity assumptions on the input. Aiming to precisely characterize the performance of this algorithm, we improve the bound to ${R \\le (1-o(1))mn/2}$ and also prove that the algorithm fails when ${R \\ge (1+o(1))mn/\\sqrt{2}}$. Nu"},"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":"2504.17947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T21:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"cb0db65a85a963f2c30c1d7f9b897e488ad5312bd9aab0acfcbcd110db2da824","abstract_canon_sha256":"3adc5618f306f87a7392bb9644a7ebbb792138c79a87c41205cc896ed8f60a86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:59.172674Z","signature_b64":"8mSdd8Vf1tWulIGOCC6ZBuFUiU4nVDeJYcRosmq3QugxwpZBcTNimTfLeXmvlvBUMyY2ODjAS5yB9Ead8x6NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd4dc3433a47cbc5453de741451076f65513a9846d204a497897974c0f568c86","last_reissued_at":"2026-07-05T10:53:59.172207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:59.172207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Threshold for Finding Rank-1 Matrices in a Subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander S. Wein, Jeshu Dastidar, Tait Weicht","submitted_at":"2025-04-24T21:22:17Z","abstract_excerpt":"We consider a basic computational task of finding $s$ planted rank-1 $m \\times n$ matrices in a linear subspace $\\mathcal{U} \\subseteq \\mathbb{R}^{m \\times n}$ where $\\dim(\\mathcal{U}) = R \\ge s$. The work of Johnston-Lovitz-Vijayaraghavan (FOCS 2023) gave a polynomial-time algorithm for this task and proved that it succeeds when ${R \\le (1-o(1))mn/4}$, under minimal genericity assumptions on the input. Aiming to precisely characterize the performance of this algorithm, we improve the bound to ${R \\le (1-o(1))mn/2}$ and also prove that the algorithm fails when ${R \\ge (1+o(1))mn/\\sqrt{2}}$. Nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17947","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/2504.17947/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":"2504.17947","created_at":"2026-07-05T10:53:59.172264+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17947v1","created_at":"2026-07-05T10:53:59.172264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17947","created_at":"2026-07-05T10:53:59.172264+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VG4GQZ2I7F4","created_at":"2026-07-05T10:53:59.172264+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VG4GQZ2I7F4KRJ5","created_at":"2026-07-05T10:53:59.172264+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VG4GQZ2","created_at":"2026-07-05T10:53:59.172264+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11701","citing_title":"Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06854","citing_title":"Simplicial Regularizability of the Pseudo-Moment Cone and Carath\\'eodory-Type Atomic Decomposition of Moment Matrices","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z","json":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z.json","graph_json":"https://pith.science/api/pith-number/3VG4GQZ2I7F4KRJ545AUKEDW6Z/graph.json","events_json":"https://pith.science/api/pith-number/3VG4GQZ2I7F4KRJ545AUKEDW6Z/events.json","paper":"https://pith.science/paper/3VG4GQZ2"},"agent_actions":{"view_html":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z","download_json":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z.json","view_paper":"https://pith.science/paper/3VG4GQZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17947&json=true","fetch_graph":"https://pith.science/api/pith-number/3VG4GQZ2I7F4KRJ545AUKEDW6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/3VG4GQZ2I7F4KRJ545AUKEDW6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z/action/storage_attestation","attest_author":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z/action/author_attestation","sign_citation":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z/action/citation_signature","submit_replication":"https://pith.science/pith/3VG4GQZ2I7F4KRJ545AUKEDW6Z/action/replication_record"}},"created_at":"2026-07-05T10:53:59.172264+00:00","updated_at":"2026-07-05T10:53:59.172264+00:00"}