{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BI4XAFFORAUWJZNBG7VM5ZPKYH","short_pith_number":"pith:BI4XAFFO","schema_version":"1.0","canonical_sha256":"0a397014ae882964e5a137eacee5eac1f4c4baef1ded3a854c70a2fe46c68d39","source":{"kind":"arxiv","id":"1501.06243","version":6},"attestation_state":"computed","paper":{"title":"Poisson Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Yang Cao, Yao Xie","submitted_at":"2015-01-26T03:02:51Z","abstract_excerpt":"We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper constraints on the matrix $M$, and establish theoretical upper and lower bounds on the recovery error. Our bounds are nearly optimal up to a factor on the order of $\\mathcal{O}(\\log(d_1 d_2))$. These bounds are obtained by adapting the arguments used for one-bit matrix completion \\cite{davenport20121} (although these two problems are different in nature) and the adapt"},"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":"1501.06243","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-26T03:02:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"399fd3d5db826ef46c1ea94249d20e31a9d240a7613a68521523ebb9e96f6908","abstract_canon_sha256":"412c9bbaf3590060e2ac6df75be40210d47e1fa0dfb0caa232d33a03b9909a83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.319037Z","signature_b64":"XC35uFvv7dNkwlNLYyq/hM7Jg8WWmBtXpOol3KlQCgr8gYigF+Ci7F/fiWdZ9Yz8W0S5nSYejxny3bcnVOY+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a397014ae882964e5a137eacee5eac1f4c4baef1ded3a854c70a2fe46c68d39","last_reissued_at":"2026-05-18T02:20:28.318347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.318347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poisson Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Yang Cao, Yao Xie","submitted_at":"2015-01-26T03:02:51Z","abstract_excerpt":"We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper constraints on the matrix $M$, and establish theoretical upper and lower bounds on the recovery error. Our bounds are nearly optimal up to a factor on the order of $\\mathcal{O}(\\log(d_1 d_2))$. These bounds are obtained by adapting the arguments used for one-bit matrix completion \\cite{davenport20121} (although these two problems are different in nature) and the adapt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06243","kind":"arxiv","version":6},"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":"1501.06243","created_at":"2026-05-18T02:20:28.318433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06243v6","created_at":"2026-05-18T02:20:28.318433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06243","created_at":"2026-05-18T02:20:28.318433+00:00"},{"alias_kind":"pith_short_12","alias_value":"BI4XAFFORAUW","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BI4XAFFORAUWJZNB","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BI4XAFFO","created_at":"2026-05-18T12:29:14.074870+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/BI4XAFFORAUWJZNBG7VM5ZPKYH","json":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH.json","graph_json":"https://pith.science/api/pith-number/BI4XAFFORAUWJZNBG7VM5ZPKYH/graph.json","events_json":"https://pith.science/api/pith-number/BI4XAFFORAUWJZNBG7VM5ZPKYH/events.json","paper":"https://pith.science/paper/BI4XAFFO"},"agent_actions":{"view_html":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH","download_json":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH.json","view_paper":"https://pith.science/paper/BI4XAFFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06243&json=true","fetch_graph":"https://pith.science/api/pith-number/BI4XAFFORAUWJZNBG7VM5ZPKYH/graph.json","fetch_events":"https://pith.science/api/pith-number/BI4XAFFORAUWJZNBG7VM5ZPKYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH/action/storage_attestation","attest_author":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH/action/author_attestation","sign_citation":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH/action/citation_signature","submit_replication":"https://pith.science/pith/BI4XAFFORAUWJZNBG7VM5ZPKYH/action/replication_record"}},"created_at":"2026-05-18T02:20:28.318433+00:00","updated_at":"2026-05-18T02:20:28.318433+00:00"}