{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7EHHD3IQXOFACGAB6AXPHA36UA","short_pith_number":"pith:7EHHD3IQ","schema_version":"1.0","canonical_sha256":"f90e71ed10bb8a011801f02ef3837ea03ef689de6b15163a7ae480da7e45f2e2","source":{"kind":"arxiv","id":"1707.09316","version":1},"attestation_state":"computed","paper":{"title":"Sparse Deep Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Shihua Zhang, Zhenxing Guo","submitted_at":"2017-07-28T16:37:37Z","abstract_excerpt":"Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure, is able to combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep nonnegative matrix factorization models to analyze complex data for more accurate classification and better feature interpretation. Such models are designed to learn localized features or generate more discriminative represen"},"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":"1707.09316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-28T16:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"eca15fff74f563d5c5cdef368e3815b0a304a2f6661271415f2ca10990490abd","abstract_canon_sha256":"a95f716a0601dc0555a6c6d5e9e653485fb91c8b3095cfc4cfc2eb9ec4ed3bc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:16.519795Z","signature_b64":"zL2QlQm78/iPBcNV6mY2qB3nzWLQQ1qrnFdX2wWVBjQVMpd8+X8Hm1OJas/1+4BiGomYj217KRxY+aA1VR8uCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90e71ed10bb8a011801f02ef3837ea03ef689de6b15163a7ae480da7e45f2e2","last_reissued_at":"2026-05-18T00:39:16.519149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:16.519149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Deep Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Shihua Zhang, Zhenxing Guo","submitted_at":"2017-07-28T16:37:37Z","abstract_excerpt":"Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure, is able to combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep nonnegative matrix factorization models to analyze complex data for more accurate classification and better feature interpretation. Such models are designed to learn localized features or generate more discriminative represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09316","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":"1707.09316","created_at":"2026-05-18T00:39:16.519250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09316v1","created_at":"2026-05-18T00:39:16.519250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09316","created_at":"2026-05-18T00:39:16.519250+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EHHD3IQXOFA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EHHD3IQXOFACGAB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EHHD3IQ","created_at":"2026-05-18T12:31:05.417338+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/7EHHD3IQXOFACGAB6AXPHA36UA","json":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA.json","graph_json":"https://pith.science/api/pith-number/7EHHD3IQXOFACGAB6AXPHA36UA/graph.json","events_json":"https://pith.science/api/pith-number/7EHHD3IQXOFACGAB6AXPHA36UA/events.json","paper":"https://pith.science/paper/7EHHD3IQ"},"agent_actions":{"view_html":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA","download_json":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA.json","view_paper":"https://pith.science/paper/7EHHD3IQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09316&json=true","fetch_graph":"https://pith.science/api/pith-number/7EHHD3IQXOFACGAB6AXPHA36UA/graph.json","fetch_events":"https://pith.science/api/pith-number/7EHHD3IQXOFACGAB6AXPHA36UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA/action/storage_attestation","attest_author":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA/action/author_attestation","sign_citation":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA/action/citation_signature","submit_replication":"https://pith.science/pith/7EHHD3IQXOFACGAB6AXPHA36UA/action/replication_record"}},"created_at":"2026-05-18T00:39:16.519250+00:00","updated_at":"2026-05-18T00:39:16.519250+00:00"}