{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RXDNJSQWSZHLCAMQI54OVB63EA","short_pith_number":"pith:RXDNJSQW","schema_version":"1.0","canonical_sha256":"8dc6d4ca16964eb101904778ea87db201c40c0863dc999d9c01ee51b518e5ff3","source":{"kind":"arxiv","id":"1701.00016","version":1},"attestation_state":"computed","paper":{"title":"Non-Negative Matrix Factorization Test Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA"],"primary_cat":"math.NA","authors_text":"Connor Sell, Jeremy Kepner","submitted_at":"2016-12-30T21:18:01Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is a prob- lem with many applications, ranging from facial recognition to document clustering. However, due to the variety of algorithms that solve NMF, the randomness involved in these algorithms, and the somewhat subjective nature of the problem, there is no clear \"correct answer\" to any particular NMF problem, and as a result, it can be hard to test new algorithms. This paper suggests some test cases for NMF algorithms derived from matrices with enumerable exact non-negative factorizations and perturbations of these matrices. Three algorithms using wi"},"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":"1701.00016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-30T21:18:01Z","cross_cats_sorted":["cs.AI","cs.NA"],"title_canon_sha256":"6167e206d34b5b175671f6719a67d165b287c90e1abcdfe0db6cf611c76b91f0","abstract_canon_sha256":"861a7d286aa38192896b9eec869a8b1abf8f24564bde402cd95fca303217e136"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:19.760728Z","signature_b64":"RLc9bDeHCdOhZWSz7pegFYBUs8/BGlp051QvcTw9gwTLzLDViUNaX7w1d4qy0gXxfxgbQTc7E24/olXkElBkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc6d4ca16964eb101904778ea87db201c40c0863dc999d9c01ee51b518e5ff3","last_reissued_at":"2026-05-17T23:58:19.760168Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:19.760168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Negative Matrix Factorization Test Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA"],"primary_cat":"math.NA","authors_text":"Connor Sell, Jeremy Kepner","submitted_at":"2016-12-30T21:18:01Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is a prob- lem with many applications, ranging from facial recognition to document clustering. However, due to the variety of algorithms that solve NMF, the randomness involved in these algorithms, and the somewhat subjective nature of the problem, there is no clear \"correct answer\" to any particular NMF problem, and as a result, it can be hard to test new algorithms. This paper suggests some test cases for NMF algorithms derived from matrices with enumerable exact non-negative factorizations and perturbations of these matrices. Three algorithms using wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00016","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":"1701.00016","created_at":"2026-05-17T23:58:19.760248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00016v1","created_at":"2026-05-17T23:58:19.760248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00016","created_at":"2026-05-17T23:58:19.760248+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXDNJSQWSZHL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXDNJSQWSZHLCAMQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXDNJSQW","created_at":"2026-05-18T12:30:41.710351+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/RXDNJSQWSZHLCAMQI54OVB63EA","json":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA.json","graph_json":"https://pith.science/api/pith-number/RXDNJSQWSZHLCAMQI54OVB63EA/graph.json","events_json":"https://pith.science/api/pith-number/RXDNJSQWSZHLCAMQI54OVB63EA/events.json","paper":"https://pith.science/paper/RXDNJSQW"},"agent_actions":{"view_html":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA","download_json":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA.json","view_paper":"https://pith.science/paper/RXDNJSQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00016&json=true","fetch_graph":"https://pith.science/api/pith-number/RXDNJSQWSZHLCAMQI54OVB63EA/graph.json","fetch_events":"https://pith.science/api/pith-number/RXDNJSQWSZHLCAMQI54OVB63EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA/action/storage_attestation","attest_author":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA/action/author_attestation","sign_citation":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA/action/citation_signature","submit_replication":"https://pith.science/pith/RXDNJSQWSZHLCAMQI54OVB63EA/action/replication_record"}},"created_at":"2026-05-17T23:58:19.760248+00:00","updated_at":"2026-05-17T23:58:19.760248+00:00"}