{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UVUDWAFXCDTCRMAUTFDSCCQVJV","short_pith_number":"pith:UVUDWAFX","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"},"canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","source":{"kind":"arxiv","id":"1511.01699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01699","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01699v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01699","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"UVUDWAFXCDTC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVUDWAFXCDTCRMAU","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVUDWAFX","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UVUDWAFXCDTCRMAUTFDSCCQVJV","target":"record","payload":{"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"},"canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","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"},"source_kind":"arxiv","source_id":"1511.01699","source_version":2,"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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccJdbTMRVAdaPOp9+zq9JjiSd2Yqdjr2wRUPIPoZLDzSaEI9MHOuGRvLF55MhtgnaFcc1If270PwBMQXlmo2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:13:27.046870Z"},"content_sha256":"dc5bbb7b93c0f39ead6ce7f001bb928dc2c8ba7c42b77c90535c560ca6f1ffd0","schema_version":"1.0","event_id":"sha256:dc5bbb7b93c0f39ead6ce7f001bb928dc2c8ba7c42b77c90535c560ca6f1ffd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UVUDWAFXCDTCRMAUTFDSCCQVJV","target":"graph","payload":{"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"},"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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LAG4H07sxmgbfItA0RYEPUNcSlzYH2jfVLTUaGoqsMjyOKgR256QMi0N6I39ncTN+dRl6Cbtvj1iF0jwc8wBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:13:27.047221Z"},"content_sha256":"bf06a1f248d8f91ef907f046fa82cd45229c411352571ac04553b5e01336d2aa","schema_version":"1.0","event_id":"sha256:bf06a1f248d8f91ef907f046fa82cd45229c411352571ac04553b5e01336d2aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/bundle.json","state_url":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/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-01T05:13:27Z","links":{"resolver":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV","bundle":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/bundle.json","state":"https://pith.science/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVUDWAFXCDTCRMAUTFDSCCQVJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVUDWAFXCDTCRMAUTFDSCCQVJV","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":"9bf94c85517cee013f2b2f6eca21b38ce3814d78f571371f33b5aecd9150617d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-05T11:26:52Z","title_canon_sha256":"974a477a807bce14aa299ccf876990be7f20420a00b50ee95fca62653a1995c2"},"schema_version":"1.0","source":{"id":"1511.01699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01699","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01699v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01699","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"UVUDWAFXCDTC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVUDWAFXCDTCRMAU","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVUDWAFX","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:bf06a1f248d8f91ef907f046fa82cd45229c411352571ac04553b5e01336d2aa","target":"graph","created_at":"2026-05-18T00:46:04Z","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":"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,","authors_text":"Chen Dan, He Jiang, Kristoffer Arnsfelt Hansen, Liwei Wang, Yuchen Zhou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-05T11:26:52Z","title":"Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01699","kind":"arxiv","version":2},"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:dc5bbb7b93c0f39ead6ce7f001bb928dc2c8ba7c42b77c90535c560ca6f1ffd0","target":"record","created_at":"2026-05-18T00:46:04Z","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":"9bf94c85517cee013f2b2f6eca21b38ce3814d78f571371f33b5aecd9150617d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-05T11:26:52Z","title_canon_sha256":"974a477a807bce14aa299ccf876990be7f20420a00b50ee95fca62653a1995c2"},"schema_version":"1.0","source":{"id":"1511.01699","kind":"arxiv","version":2}},"canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5683b00b710e628b0149947210a154d68b601f2f557b1de76f2c75c3fe3fb24","first_computed_at":"2026-05-18T00:46:04.628790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:04.628790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrzO6gWf7HsNfnFT7Iw7ON+JP+XjioBn3+i5Ms446kEcA20QPI/pM2t4PB4r/mZi79+D4JakjzECMgDU+hd1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:04.629202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5bbb7b93c0f39ead6ce7f001bb928dc2c8ba7c42b77c90535c560ca6f1ffd0","sha256:bf06a1f248d8f91ef907f046fa82cd45229c411352571ac04553b5e01336d2aa"],"state_sha256":"47a99aa258dc216a9869f11d473f28f483eb7a049e066aa024884942f0da043f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxZ5PYrjBVDIPJwDrTnVIBndp56EraWmSYQ1Xpc/3kcM9OvpQCsRs2x2jTLWR7khI5fXmTLLa7fRWZraFz4XDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:13:27.049411Z","bundle_sha256":"559ffd0b90e34a363fa5045201153211033a2d8d09e55b22c2b6f349b935d8e3"}}