{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5SB3EASM7BSJYKI5JBNITKKMDD","short_pith_number":"pith:5SB3EASM","schema_version":"1.0","canonical_sha256":"ec83b2024cf8649c291d485a89a94c18c87e4e17c98271ba7d9bd3e81fc5924f","source":{"kind":"arxiv","id":"1609.01795","version":3},"attestation_state":"computed","paper":{"title":"MC^2: A Two-Phase Algorithm for Leveraged Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Armin Eftekhari, Michael B. Wakin, Rachel A. Ward","submitted_at":"2016-09-07T01:25:51Z","abstract_excerpt":"Leverage scores, loosely speaking, reflect the importance of the rows and columns of a matrix. Ideally, given the leverage scores of a rank-$r$ matrix $M\\in\\mathbb{R}^{n\\times n}$, that matrix can be reliably completed from just $O(rn\\log^{2}n)$ samples if the samples are chosen randomly from a nonuniform distribution induced by the leverage scores. In practice, however, the leverage scores are often unknown a priori. As such, the sample complexity in uniform matrix completion---using uniform random sampling---increases to $O(\\eta(M)\\cdot rn\\log^{2}n)$, where $\\eta(M)$ is the largest leverage "},"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":"1609.01795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T01:25:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c87f99e56cae57c7e00ea4de139dde58212a76c0f359db2c89e25f34445a9323","abstract_canon_sha256":"b9b2d4f0e7afd7f06d006822b1307266d3c63483d16b813ddb692f75da8659e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.509479Z","signature_b64":"gNRA74yD4VBA2kxpXkxYgOH9InPFsM8g1yN19ifW675ntJEL5V7M2sBoMS5m0oZU9R9XmXHQPGpfKI5g9Hd5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec83b2024cf8649c291d485a89a94c18c87e4e17c98271ba7d9bd3e81fc5924f","last_reissued_at":"2026-05-18T00:30:17.508649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.508649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MC^2: A Two-Phase Algorithm for Leveraged Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Armin Eftekhari, Michael B. Wakin, Rachel A. Ward","submitted_at":"2016-09-07T01:25:51Z","abstract_excerpt":"Leverage scores, loosely speaking, reflect the importance of the rows and columns of a matrix. Ideally, given the leverage scores of a rank-$r$ matrix $M\\in\\mathbb{R}^{n\\times n}$, that matrix can be reliably completed from just $O(rn\\log^{2}n)$ samples if the samples are chosen randomly from a nonuniform distribution induced by the leverage scores. In practice, however, the leverage scores are often unknown a priori. As such, the sample complexity in uniform matrix completion---using uniform random sampling---increases to $O(\\eta(M)\\cdot rn\\log^{2}n)$, where $\\eta(M)$ is the largest leverage "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01795","kind":"arxiv","version":3},"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":"1609.01795","created_at":"2026-05-18T00:30:17.508782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01795v3","created_at":"2026-05-18T00:30:17.508782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01795","created_at":"2026-05-18T00:30:17.508782+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SB3EASM7BSJ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SB3EASM7BSJYKI5","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SB3EASM","created_at":"2026-05-18T12:30:01.593930+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/5SB3EASM7BSJYKI5JBNITKKMDD","json":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD.json","graph_json":"https://pith.science/api/pith-number/5SB3EASM7BSJYKI5JBNITKKMDD/graph.json","events_json":"https://pith.science/api/pith-number/5SB3EASM7BSJYKI5JBNITKKMDD/events.json","paper":"https://pith.science/paper/5SB3EASM"},"agent_actions":{"view_html":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD","download_json":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD.json","view_paper":"https://pith.science/paper/5SB3EASM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01795&json=true","fetch_graph":"https://pith.science/api/pith-number/5SB3EASM7BSJYKI5JBNITKKMDD/graph.json","fetch_events":"https://pith.science/api/pith-number/5SB3EASM7BSJYKI5JBNITKKMDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD/action/storage_attestation","attest_author":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD/action/author_attestation","sign_citation":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD/action/citation_signature","submit_replication":"https://pith.science/pith/5SB3EASM7BSJYKI5JBNITKKMDD/action/replication_record"}},"created_at":"2026-05-18T00:30:17.508782+00:00","updated_at":"2026-05-18T00:30:17.508782+00:00"}