{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EVNEMOJFM2B4RLNH3I3F5WPGIN","short_pith_number":"pith:EVNEMOJF","schema_version":"1.0","canonical_sha256":"255a4639256683c8ada7da365ed9e643728ea30049c9eca01af7943ae548f786","source":{"kind":"arxiv","id":"1504.05229","version":2},"attestation_state":"computed","paper":{"title":"Poisson Matrix Recovery and Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Yang Cao, Yao Xie","submitted_at":"2015-04-20T21:09:47Z","abstract_excerpt":"We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We consider the usual matrix recovery formulation through maximum likelihood with proper constraints on the matrix $M$ of size $d_1$-by-$d_2$, and establish theoretical upper and lower bounds on the recovery error. Our bounds for matrix completion are nearly optimal up to a factor on the order of $\\mathcal{O}(\\log(d_1 d_2))$. These bounds are obtained by combing "},"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":"1504.05229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-20T21:09:47Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"774d84343c7061b2e5cb0eaf8563d3a7c3fb73b3051f3ffbe7d19621ef1547e0","abstract_canon_sha256":"0c1740c44bb16c2f10b03f6756f985d3bab636fa1eaf5a7018151fd906075cc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:50.820648Z","signature_b64":"KlLvLB17OyAza7cIyxRyOQVxU7U0cdFdd46nsmuzzZXmJRgMvPmro5/5JxJpacJ4CZGaGIBQvqN4XDVJxsPvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"255a4639256683c8ada7da365ed9e643728ea30049c9eca01af7943ae548f786","last_reissued_at":"2026-05-18T01:16:50.819905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:50.819905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poisson Matrix Recovery and Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Yang Cao, Yao Xie","submitted_at":"2015-04-20T21:09:47Z","abstract_excerpt":"We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We consider the usual matrix recovery formulation through maximum likelihood with proper constraints on the matrix $M$ of size $d_1$-by-$d_2$, and establish theoretical upper and lower bounds on the recovery error. Our bounds for matrix completion are nearly optimal up to a factor on the order of $\\mathcal{O}(\\log(d_1 d_2))$. These bounds are obtained by combing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05229","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":"1504.05229","created_at":"2026-05-18T01:16:50.820018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05229v2","created_at":"2026-05-18T01:16:50.820018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05229","created_at":"2026-05-18T01:16:50.820018+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVNEMOJFM2B4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVNEMOJFM2B4RLNH","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVNEMOJF","created_at":"2026-05-18T12:29:19.899920+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/EVNEMOJFM2B4RLNH3I3F5WPGIN","json":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN.json","graph_json":"https://pith.science/api/pith-number/EVNEMOJFM2B4RLNH3I3F5WPGIN/graph.json","events_json":"https://pith.science/api/pith-number/EVNEMOJFM2B4RLNH3I3F5WPGIN/events.json","paper":"https://pith.science/paper/EVNEMOJF"},"agent_actions":{"view_html":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN","download_json":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN.json","view_paper":"https://pith.science/paper/EVNEMOJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05229&json=true","fetch_graph":"https://pith.science/api/pith-number/EVNEMOJFM2B4RLNH3I3F5WPGIN/graph.json","fetch_events":"https://pith.science/api/pith-number/EVNEMOJFM2B4RLNH3I3F5WPGIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN/action/storage_attestation","attest_author":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN/action/author_attestation","sign_citation":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN/action/citation_signature","submit_replication":"https://pith.science/pith/EVNEMOJFM2B4RLNH3I3F5WPGIN/action/replication_record"}},"created_at":"2026-05-18T01:16:50.820018+00:00","updated_at":"2026-05-18T01:16:50.820018+00:00"}