{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5FKLVFOX4I7ZKFFJXZO2JODDHB","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":"f9b553fcaeafe9ddfe22eb42ecd68d4c455f4622a0689cbefe84f60236ac2b16","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T15:52:52Z","title_canon_sha256":"bebd27e1348741550f5a0813410ab162b77b8cd0bbff02c09a535fe1fab94516"},"schema_version":"1.0","source":{"id":"2102.01570","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01570","created_at":"2026-07-05T03:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01570v3","created_at":"2026-07-05T03:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01570","created_at":"2026-07-05T03:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"5FKLVFOX4I7Z","created_at":"2026-07-05T03:48:05Z"},{"alias_kind":"pith_short_16","alias_value":"5FKLVFOX4I7ZKFFJ","created_at":"2026-07-05T03:48:05Z"},{"alias_kind":"pith_short_8","alias_value":"5FKLVFOX","created_at":"2026-07-05T03:48:05Z"}],"graph_snapshots":[{"event_id":"sha256:913cda0516e537d2d9725cbea696ab6f82dce259608cedadbb9bb43cd84a297d","target":"graph","created_at":"2026-07-05T03:48:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study a variant of nonnegative matrix factorization where we wish to find a symmetric factorization of a given input matrix into a sparse, Boolean matrix. Formally speaking, given $\\mathbf{M}\\in\\mathbb{Z}^{m\\times m}$, we want to find $\\mathbf{W}\\in\\{0,1\\}^{m\\times r}$ such that $\\| \\mathbf{M} - \\mathbf{W}\\mathbf{W}^\\top \\|_0$ is minimized among all $\\mathbf{W}$ for which each row is $k$-sparse. This question turns out to be closely related to a number of questions like recovering a hypergraph from its line graph, as well as reconstruction attacks for private neural network tr","authors_text":"Ruizhe Zhang, Runzhou Tao, Sitan Chen, Zhao Song","cross_cats":["cs.CR","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T15:52:52Z","title":"Symmetric Sparse Boolean Matrix Factorization and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01570","kind":"arxiv","version":3},"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:7e2fb111ed55ecb4eb8cce713edd80b74b15a6ec3d3265f0f644167293b62751","target":"record","created_at":"2026-07-05T03:48:05Z","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":"f9b553fcaeafe9ddfe22eb42ecd68d4c455f4622a0689cbefe84f60236ac2b16","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T15:52:52Z","title_canon_sha256":"bebd27e1348741550f5a0813410ab162b77b8cd0bbff02c09a535fe1fab94516"},"schema_version":"1.0","source":{"id":"2102.01570","kind":"arxiv","version":3}},"canonical_sha256":"e954ba95d7e23f9514a9be5da4b863385f4d4e3fb36ea5ba9ec7d8c19c4a6ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e954ba95d7e23f9514a9be5da4b863385f4d4e3fb36ea5ba9ec7d8c19c4a6ed8","first_computed_at":"2026-07-05T03:48:05.174716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:05.174716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wPz59U2GcOc9ylriYOgz8cHPpDkjhccx1TgeU4aTJvRCL0IsHB861zwTwzYGzfmrVuIMtALYef31X/crkRDvDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:05.175124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01570","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e2fb111ed55ecb4eb8cce713edd80b74b15a6ec3d3265f0f644167293b62751","sha256:913cda0516e537d2d9725cbea696ab6f82dce259608cedadbb9bb43cd84a297d"],"state_sha256":"3311ae3178a4a62769eeb9aa012cf38f95dbb9f902a7b9f1949f2f3c1850c14e"}