{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SBWQ6PFLN6TKBDM6I75VEWMU2B","short_pith_number":"pith:SBWQ6PFL","schema_version":"1.0","canonical_sha256":"906d0f3cab6fa6a08d9e47fb525994d047fe6f69eadd3c4f8407a543eb4f9f76","source":{"kind":"arxiv","id":"1310.3556","version":2},"attestation_state":"computed","paper":{"title":"Identifying Influential Entries in a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Abhisek Kundu, Petros Drineas, Srinivas Nambirajan","submitted_at":"2013-10-14T03:49:02Z","abstract_excerpt":"For any matrix A in R^(m x n) of rank \\rho, we present a probability distribution over the entries of A (the element-wise leverage scores of equation (2)) that reveals the most influential entries in the matrix. From a theoretical perspective, we prove that sampling at most s = O ((m + n) \\rho^2 ln (m + n)) entries of the matrix (see eqn. (3) for the precise value of s) with respect to these scores and solving the nuclear norm minimization problem on the sampled entries, reconstructs A exactly. To the best of our knowledge, these are the strongest theoretical guarantees on matrix completion wi"},"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":"1310.3556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-10-14T03:49:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c673c75225e213376b80cf6275a035e07cd51554ad7b07ff568fb34dddaaeba8","abstract_canon_sha256":"40b1453c2aa487f0a9cbbd10b773f39f988f747eeaf25180cd9d19239645d6d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:36.914161Z","signature_b64":"9ikx/DJrhFHnLHn+EPDeuCb+yVSoCMwHZry5e2KjsnZWMFHCHaQz0Mqh330XiIeyBuK5bS6/32gTpmAYctmyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906d0f3cab6fa6a08d9e47fb525994d047fe6f69eadd3c4f8407a543eb4f9f76","last_reissued_at":"2026-05-18T03:04:36.913144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:36.913144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying Influential Entries in a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Abhisek Kundu, Petros Drineas, Srinivas Nambirajan","submitted_at":"2013-10-14T03:49:02Z","abstract_excerpt":"For any matrix A in R^(m x n) of rank \\rho, we present a probability distribution over the entries of A (the element-wise leverage scores of equation (2)) that reveals the most influential entries in the matrix. From a theoretical perspective, we prove that sampling at most s = O ((m + n) \\rho^2 ln (m + n)) entries of the matrix (see eqn. (3) for the precise value of s) with respect to these scores and solving the nuclear norm minimization problem on the sampled entries, reconstructs A exactly. To the best of our knowledge, these are the strongest theoretical guarantees on matrix completion wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3556","kind":"arxiv","version":2},"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":"1310.3556","created_at":"2026-05-18T03:04:36.913332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3556v2","created_at":"2026-05-18T03:04:36.913332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3556","created_at":"2026-05-18T03:04:36.913332+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBWQ6PFLN6TK","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBWQ6PFLN6TKBDM6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBWQ6PFL","created_at":"2026-05-18T12:27:59.945178+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/SBWQ6PFLN6TKBDM6I75VEWMU2B","json":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B.json","graph_json":"https://pith.science/api/pith-number/SBWQ6PFLN6TKBDM6I75VEWMU2B/graph.json","events_json":"https://pith.science/api/pith-number/SBWQ6PFLN6TKBDM6I75VEWMU2B/events.json","paper":"https://pith.science/paper/SBWQ6PFL"},"agent_actions":{"view_html":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B","download_json":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B.json","view_paper":"https://pith.science/paper/SBWQ6PFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3556&json=true","fetch_graph":"https://pith.science/api/pith-number/SBWQ6PFLN6TKBDM6I75VEWMU2B/graph.json","fetch_events":"https://pith.science/api/pith-number/SBWQ6PFLN6TKBDM6I75VEWMU2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B/action/storage_attestation","attest_author":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B/action/author_attestation","sign_citation":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B/action/citation_signature","submit_replication":"https://pith.science/pith/SBWQ6PFLN6TKBDM6I75VEWMU2B/action/replication_record"}},"created_at":"2026-05-18T03:04:36.913332+00:00","updated_at":"2026-05-18T03:04:36.913332+00:00"}