{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","short_pith_number":"pith:G3ZJ66SO","schema_version":"1.0","canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","source":{"kind":"arxiv","id":"1401.6024","version":1},"attestation_state":"computed","paper":{"title":"Matrix factorization with Binary Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Martin Slawski, Matthias Hein, Pavlo Lutsik","submitted_at":"2014-01-23T16:02:19Z","abstract_excerpt":"Motivated by an application in computational biology, we consider low-rank matrix factorization with $\\{0,1\\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared with other matrix factorization schemes, our problem is further complicated by a combinatorial constraint set of size $2^{m \\cdot r}$, where $m$ is the dimension of the data points and $r$ the rank of the factorization. Despite apparent intractability, we provide - in the line of recent work on non-negative matrix factorization by Arora et al. (2012) - an algo"},"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":"1401.6024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-23T16:02:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c418445fefe6d08ca2088009e3196293feffa5fdbe13594088d16fe869a8387a","abstract_canon_sha256":"142f705b61d66dba791ed5d97471f9550b23fea20a0d56767409a327cc94cb8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.077119Z","signature_b64":"CcbTHjjAG/66u2Aw9cQDwWRZsbUx5pVN6Tl9uEYFaH9LC/QI+cX17IPztsBCYeBdn0j1S5asKNcLplk7bnqaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","last_reissued_at":"2026-05-18T03:01:23.076245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.076245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix factorization with Binary Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Martin Slawski, Matthias Hein, Pavlo Lutsik","submitted_at":"2014-01-23T16:02:19Z","abstract_excerpt":"Motivated by an application in computational biology, we consider low-rank matrix factorization with $\\{0,1\\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared with other matrix factorization schemes, our problem is further complicated by a combinatorial constraint set of size $2^{m \\cdot r}$, where $m$ is the dimension of the data points and $r$ the rank of the factorization. Despite apparent intractability, we provide - in the line of recent work on non-negative matrix factorization by Arora et al. (2012) - an algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6024","kind":"arxiv","version":1},"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":"1401.6024","created_at":"2026-05-18T03:01:23.076414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6024v1","created_at":"2026-05-18T03:01:23.076414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6024","created_at":"2026-05-18T03:01:23.076414+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3ZJ66SOK5U3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3ZJ66SOK5U3ZCID","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3ZJ66SO","created_at":"2026-05-18T12:28:28.263976+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/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","json":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF.json","graph_json":"https://pith.science/api/pith-number/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/graph.json","events_json":"https://pith.science/api/pith-number/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/events.json","paper":"https://pith.science/paper/G3ZJ66SO"},"agent_actions":{"view_html":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","download_json":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF.json","view_paper":"https://pith.science/paper/G3ZJ66SO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6024&json=true","fetch_graph":"https://pith.science/api/pith-number/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/graph.json","fetch_events":"https://pith.science/api/pith-number/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/action/storage_attestation","attest_author":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/action/author_attestation","sign_citation":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/action/citation_signature","submit_replication":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/action/replication_record"}},"created_at":"2026-05-18T03:01:23.076414+00:00","updated_at":"2026-05-18T03:01:23.076414+00:00"}