{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5FKLVFOX4I7ZKFFJXZO2JODDHB","short_pith_number":"pith:5FKLVFOX","schema_version":"1.0","canonical_sha256":"e954ba95d7e23f9514a9be5da4b863385f4d4e3fb36ea5ba9ec7d8c19c4a6ed8","source":{"kind":"arxiv","id":"2102.01570","version":3},"attestation_state":"computed","paper":{"title":"Symmetric Sparse Boolean Matrix Factorization and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ruizhe Zhang, Runzhou Tao, Sitan Chen, Zhao Song","submitted_at":"2021-02-02T15:52:52Z","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"},"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":"2102.01570","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-02T15:52:52Z","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"title_canon_sha256":"bebd27e1348741550f5a0813410ab162b77b8cd0bbff02c09a535fe1fab94516","abstract_canon_sha256":"f9b553fcaeafe9ddfe22eb42ecd68d4c455f4622a0689cbefe84f60236ac2b16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:05.175124Z","signature_b64":"wPz59U2GcOc9ylriYOgz8cHPpDkjhccx1TgeU4aTJvRCL0IsHB861zwTwzYGzfmrVuIMtALYef31X/crkRDvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e954ba95d7e23f9514a9be5da4b863385f4d4e3fb36ea5ba9ec7d8c19c4a6ed8","last_reissued_at":"2026-07-05T03:48:05.174716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:05.174716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Sparse Boolean Matrix Factorization and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ruizhe Zhang, Runzhou Tao, Sitan Chen, Zhao Song","submitted_at":"2021-02-02T15:52:52Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01570","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01570/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.01570","created_at":"2026-07-05T03:48:05.174772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.01570v3","created_at":"2026-07-05T03:48:05.174772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01570","created_at":"2026-07-05T03:48:05.174772+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FKLVFOX4I7Z","created_at":"2026-07-05T03:48:05.174772+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FKLVFOX4I7ZKFFJ","created_at":"2026-07-05T03:48:05.174772+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FKLVFOX","created_at":"2026-07-05T03:48:05.174772+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/5FKLVFOX4I7ZKFFJXZO2JODDHB","json":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB.json","graph_json":"https://pith.science/api/pith-number/5FKLVFOX4I7ZKFFJXZO2JODDHB/graph.json","events_json":"https://pith.science/api/pith-number/5FKLVFOX4I7ZKFFJXZO2JODDHB/events.json","paper":"https://pith.science/paper/5FKLVFOX"},"agent_actions":{"view_html":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB","download_json":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB.json","view_paper":"https://pith.science/paper/5FKLVFOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.01570&json=true","fetch_graph":"https://pith.science/api/pith-number/5FKLVFOX4I7ZKFFJXZO2JODDHB/graph.json","fetch_events":"https://pith.science/api/pith-number/5FKLVFOX4I7ZKFFJXZO2JODDHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB/action/storage_attestation","attest_author":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB/action/author_attestation","sign_citation":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB/action/citation_signature","submit_replication":"https://pith.science/pith/5FKLVFOX4I7ZKFFJXZO2JODDHB/action/replication_record"}},"created_at":"2026-07-05T03:48:05.174772+00:00","updated_at":"2026-07-05T03:48:05.174772+00:00"}