{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZBWRZUCFDV5ZRKVZ5LXZY5BTLM","short_pith_number":"pith:ZBWRZUCF","schema_version":"1.0","canonical_sha256":"c86d1cd0451d7b98aab9eaef9c74335b2564a315ddf927cce81a7762315da2a5","source":{"kind":"arxiv","id":"1907.00139","version":1},"attestation_state":"computed","paper":{"title":"Fast Convolutive Nonnegative Matrix Factorization Through Coordinate and Block Coordinate Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex H Williams, Anthony Degleris, Ben Antin, Surya Ganguli","submitted_at":"2019-06-29T03:53:09Z","abstract_excerpt":"Identifying recurring patterns in high-dimensional time series data is an important problem in many scientific domains. A popular model to achieve this is convolutive nonnegative matrix factorization (CNMF), which extends classic nonnegative matrix factorization (NMF) to extract short-lived temporal motifs from a long time series. Prior work has typically fit this model by multiplicative parameter updates---an approach widely considered to be suboptimal for NMF, especially in large-scale data applications. Here, we describe how to extend two popular and computationally scalable NMF algorithms-"},"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":"1907.00139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T03:53:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12d6b5b22b4d423846db86df493e222b90a3cc2e0ebeb6700b5f828ed6f7b674","abstract_canon_sha256":"3be4a68c8da894b3521a744a7dcf8fb93e73317e582ae8a4d68de2b6ee698ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:57.360356Z","signature_b64":"vjhPWIPl9Thl6XQRmYVW2Z7zD0R1bbSffxds8c53PriK2KECYfzopqSkHPzwK/dE/KskzJQ5NtEOd8hKCzWgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86d1cd0451d7b98aab9eaef9c74335b2564a315ddf927cce81a7762315da2a5","last_reissued_at":"2026-05-17T23:41:57.359589Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:57.359589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Convolutive Nonnegative Matrix Factorization Through Coordinate and Block Coordinate Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex H Williams, Anthony Degleris, Ben Antin, Surya Ganguli","submitted_at":"2019-06-29T03:53:09Z","abstract_excerpt":"Identifying recurring patterns in high-dimensional time series data is an important problem in many scientific domains. A popular model to achieve this is convolutive nonnegative matrix factorization (CNMF), which extends classic nonnegative matrix factorization (NMF) to extract short-lived temporal motifs from a long time series. Prior work has typically fit this model by multiplicative parameter updates---an approach widely considered to be suboptimal for NMF, especially in large-scale data applications. Here, we describe how to extend two popular and computationally scalable NMF algorithms-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00139","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":"1907.00139","created_at":"2026-05-17T23:41:57.359718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00139v1","created_at":"2026-05-17T23:41:57.359718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00139","created_at":"2026-05-17T23:41:57.359718+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBWRZUCFDV5Z","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBWRZUCFDV5ZRKVZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBWRZUCF","created_at":"2026-05-18T12:33:33.725879+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/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM","json":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM.json","graph_json":"https://pith.science/api/pith-number/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/graph.json","events_json":"https://pith.science/api/pith-number/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/events.json","paper":"https://pith.science/paper/ZBWRZUCF"},"agent_actions":{"view_html":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM","download_json":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM.json","view_paper":"https://pith.science/paper/ZBWRZUCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00139&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/action/storage_attestation","attest_author":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/action/author_attestation","sign_citation":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/action/citation_signature","submit_replication":"https://pith.science/pith/ZBWRZUCFDV5ZRKVZ5LXZY5BTLM/action/replication_record"}},"created_at":"2026-05-17T23:41:57.359718+00:00","updated_at":"2026-05-17T23:41:57.359718+00:00"}