{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SB3EASM7BSJYKI5JBNITKKMDD","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":"b9b2d4f0e7afd7f06d006822b1307266d3c63483d16b813ddb692f75da8659e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T01:25:51Z","title_canon_sha256":"c87f99e56cae57c7e00ea4de139dde58212a76c0f359db2c89e25f34445a9323"},"schema_version":"1.0","source":{"id":"1609.01795","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01795","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01795v3","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01795","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"5SB3EASM7BSJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SB3EASM7BSJYKI5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SB3EASM","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4f504d0c7f7123ca5899911371769411dc33cb873d80d8f72d24bb8b87e76af3","target":"graph","created_at":"2026-05-18T00:30:17Z","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":"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 ","authors_text":"Armin Eftekhari, Michael B. Wakin, Rachel A. Ward","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T01:25:51Z","title":"MC^2: A Two-Phase Algorithm for Leveraged Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01795","kind":"arxiv","version":3},"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:d4e7f2fef20852a294de14a9a9c16f98db3a747ba3f68fc6c41c5e29c1b8d8d3","target":"record","created_at":"2026-05-18T00:30:17Z","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":"b9b2d4f0e7afd7f06d006822b1307266d3c63483d16b813ddb692f75da8659e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T01:25:51Z","title_canon_sha256":"c87f99e56cae57c7e00ea4de139dde58212a76c0f359db2c89e25f34445a9323"},"schema_version":"1.0","source":{"id":"1609.01795","kind":"arxiv","version":3}},"canonical_sha256":"ec83b2024cf8649c291d485a89a94c18c87e4e17c98271ba7d9bd3e81fc5924f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec83b2024cf8649c291d485a89a94c18c87e4e17c98271ba7d9bd3e81fc5924f","first_computed_at":"2026-05-18T00:30:17.508649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:17.508649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gNRA74yD4VBA2kxpXkxYgOH9InPFsM8g1yN19ifW675ntJEL5V7M2sBoMS5m0oZU9R9XmXHQPGpfKI5g9Hd5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:17.509479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01795","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4e7f2fef20852a294de14a9a9c16f98db3a747ba3f68fc6c41c5e29c1b8d8d3","sha256:4f504d0c7f7123ca5899911371769411dc33cb873d80d8f72d24bb8b87e76af3"],"state_sha256":"2625e916cef15bd5bcd3d72184692c56e6b2a8b3a4b550b18d90a6b27da2bcb6"}