{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","short_pith_number":"pith:G3ZJ66SO","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"},"canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","source":{"kind":"arxiv","id":"1401.6024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6024","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6024v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6024","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"G3ZJ66SOK5U3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G3ZJ66SOK5U3ZCID","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G3ZJ66SO","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","target":"record","payload":{"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"},"canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","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"},"source_kind":"arxiv","source_id":"1401.6024","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdiTyefIC6+rCErhVIpFFPoaRUIeJIAkaWGctnaHE4XDIdIBEpUqQhPPsPq3cHck55LHXZgVtd+FfDd0EeNTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:21:23.443571Z"},"content_sha256":"a604d1801408292e15568ba110a1c7050eb1baa323d6aea6a9727ea5bbcb1054","schema_version":"1.0","event_id":"sha256:a604d1801408292e15568ba110a1c7050eb1baa323d6aea6a9727ea5bbcb1054"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIcggTGUf5jlqBUWLRLdQfnnVEXAJkViiGBIsyvhJJJ3xQjKzWnXlZA6BqFufjokA/UHX7H5IWe0QwUj8fh0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:21:23.443913Z"},"content_sha256":"e6bdf8ed484654a00f771cda028e681cadaafacde25edf49ba0bb64a650b80b6","schema_version":"1.0","event_id":"sha256:e6bdf8ed484654a00f771cda028e681cadaafacde25edf49ba0bb64a650b80b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/bundle.json","state_url":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T13:21:23Z","links":{"resolver":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","bundle":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/bundle.json","state":"https://pith.science/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3ZJ66SOK5U3ZCID3YPZ7AQ7XF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G3ZJ66SOK5U3ZCID3YPZ7AQ7XF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"142f705b61d66dba791ed5d97471f9550b23fea20a0d56767409a327cc94cb8e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-23T16:02:19Z","title_canon_sha256":"c418445fefe6d08ca2088009e3196293feffa5fdbe13594088d16fe869a8387a"},"schema_version":"1.0","source":{"id":"1401.6024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6024","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6024v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6024","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"G3ZJ66SOK5U3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G3ZJ66SOK5U3ZCID","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G3ZJ66SO","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e6bdf8ed484654a00f771cda028e681cadaafacde25edf49ba0bb64a650b80b6","target":"graph","created_at":"2026-05-18T03:01:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Martin Slawski, Matthias Hein, Pavlo Lutsik","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-23T16:02:19Z","title":"Matrix factorization with Binary Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6024","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a604d1801408292e15568ba110a1c7050eb1baa323d6aea6a9727ea5bbcb1054","target":"record","created_at":"2026-05-18T03:01:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"142f705b61d66dba791ed5d97471f9550b23fea20a0d56767409a327cc94cb8e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-23T16:02:19Z","title_canon_sha256":"c418445fefe6d08ca2088009e3196293feffa5fdbe13594088d16fe869a8387a"},"schema_version":"1.0","source":{"id":"1401.6024","kind":"arxiv","version":1}},"canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36f29f7a4e5769bc8903de1f9f821fb97f9eb4ebbcc355f37504b4804881664b","first_computed_at":"2026-05-18T03:01:23.076245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.076245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CcbTHjjAG/66u2Aw9cQDwWRZsbUx5pVN6Tl9uEYFaH9LC/QI+cX17IPztsBCYeBdn0j1S5asKNcLplk7bnqaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.077119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a604d1801408292e15568ba110a1c7050eb1baa323d6aea6a9727ea5bbcb1054","sha256:e6bdf8ed484654a00f771cda028e681cadaafacde25edf49ba0bb64a650b80b6"],"state_sha256":"967ef4fcaae54acc195d192bef6169c8da28ae27fe802ebb0bc5a7fbc4ed0a1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XDLka7OQ7Q330Dpcd7O9xh9eEpo9mhYMiIC46iSrSX5alt23MMl5ks7aOcOfXIOhfJoYx+R9oNd0iahpdbSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:21:23.445901Z","bundle_sha256":"7455d750d7996a7083853532f7a4979e2add465ad3f7b75e357cecc3a05ce3a0"}}