{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UVUDWAFXCDTCRMAUTFDSCCQVJV","short_pith_number":"pith:UVUDWAFX","schema_version":"1.0","canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","source":{"kind":"arxiv","id":"1511.01699","version":2},"attestation_state":"computed","paper":{"title":"Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Chen Dan, He Jiang, Kristoffer Arnsfelt Hansen, Liwei Wang, Yuchen Zhou","submitted_at":"2015-11-05T11:26:52Z","abstract_excerpt":"Low rank matrix approximation is an important tool in machine learning. Given a data matrix, low rank approximation helps to find factors, patterns and provides concise representations for the data. Research on low rank approximation usually focus on real matrices. However, in many applications data are binary (categorical) rather than continuous. This leads to the problem of low rank approximation of binary matrix. Here we are given a $d \\times n$ binary matrix $A$ and a small integer $k$. The goal is to find two binary matrices $U$ and $V$ of sizes $d \\times k$ and $k \\times n$ respectively,"},"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":"1511.01699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-05T11:26:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"974a477a807bce14aa299ccf876990be7f20420a00b50ee95fca62653a1995c2","abstract_canon_sha256":"9bf94c85517cee013f2b2f6eca21b38ce3814d78f571371f33b5aecd9150617d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.629202Z","signature_b64":"qrzO6gWf7HsNfnFT7Iw7ON+JP+XjioBn3+i5Ms446kEcA20QPI/pM2t4PB4r/mZi79+D4JakjzECMgDU+hd1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","last_reissued_at":"2026-05-18T00:46:04.628790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.628790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Chen Dan, He Jiang, Kristoffer Arnsfelt Hansen, Liwei Wang, Yuchen Zhou","submitted_at":"2015-11-05T11:26:52Z","abstract_excerpt":"Low rank matrix approximation is an important tool in machine learning. Given a data matrix, low rank approximation helps to find factors, patterns and provides concise representations for the data. Research on low rank approximation usually focus on real matrices. However, in many applications data are binary (categorical) rather than continuous. This leads to the problem of low rank approximation of binary matrix. Here we are given a $d \\times n$ binary matrix $A$ and a small integer $k$. The goal is to find two binary matrices $U$ and $V$ of sizes $d \\times k$ and $k \\times n$ respectively,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01699","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":"1511.01699","created_at":"2026-05-18T00:46:04.628857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01699v2","created_at":"2026-05-18T00:46:04.628857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01699","created_at":"2026-05-18T00:46:04.628857+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVUDWAFXCDTC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVUDWAFXCDTCRMAU","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVUDWAFX","created_at":"2026-05-18T12:29:44.643036+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/UVUDWAFXCDTCRMAUTFDSCCQVJV","json":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV.json","graph_json":"https://pith.science/api/pith-number/UVUDWAFXCDTCRMAUTFDSCCQVJV/graph.json","events_json":"https://pith.science/api/pith-number/UVUDWAFXCDTCRMAUTFDSCCQVJV/events.json","paper":"https://pith.science/paper/UVUDWAFX"},"agent_actions":{"view_html":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV","download_json":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV.json","view_paper":"https://pith.science/paper/UVUDWAFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01699&json=true","fetch_graph":"https://pith.science/api/pith-number/UVUDWAFXCDTCRMAUTFDSCCQVJV/graph.json","fetch_events":"https://pith.science/api/pith-number/UVUDWAFXCDTCRMAUTFDSCCQVJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/action/storage_attestation","attest_author":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/action/author_attestation","sign_citation":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/action/citation_signature","submit_replication":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/action/replication_record"}},"created_at":"2026-05-18T00:46:04.628857+00:00","updated_at":"2026-05-18T00:46:04.628857+00:00"}