{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IY3VHWTTAZP5X2ZQ2YWH2M3DH6","short_pith_number":"pith:IY3VHWTT","schema_version":"1.0","canonical_sha256":"463753da73065fdbeb30d62c7d33633f8747c152df0cd04b38087480b9c0f1da","source":{"kind":"arxiv","id":"1707.08872","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Approximate Subtropical Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pauli Miettinen, Sanjar Karaev","submitted_at":"2017-07-19T15:01:08Z","abstract_excerpt":"Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra -- and the summation of the rank-1 components to build the approximation of the original matrix -- we use the subtropical algebra, which is an algebra over the nonnegative real values with the summation replaced by the maximum operator. Subtropical matrix factorizations allow \"winner-takes-it"},"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.08872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-19T15:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"63e16f51256621016e2270a067143089e9802bdcda9f21ea52d7aae84907c6da","abstract_canon_sha256":"047bcde39f90916cf2127beca96a8c994b3a6246dbb0e339883bd4e842aacae5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.231255Z","signature_b64":"NdHZur3IKOvFPV9ReA4fj8UZyc0CXrvWuyYyJexSEVHYjKtxQKfGb1X+NCQ8xuGZAJWPSNRU9J9Ia9z7Ct+6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"463753da73065fdbeb30d62c7d33633f8747c152df0cd04b38087480b9c0f1da","last_reissued_at":"2026-05-18T00:39:19.230527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.230527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Approximate Subtropical Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pauli Miettinen, Sanjar Karaev","submitted_at":"2017-07-19T15:01:08Z","abstract_excerpt":"Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra -- and the summation of the rank-1 components to build the approximation of the original matrix -- we use the subtropical algebra, which is an algebra over the nonnegative real values with the summation replaced by the maximum operator. Subtropical matrix factorizations allow \"winner-takes-it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08872","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.08872","created_at":"2026-05-18T00:39:19.230642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08872v1","created_at":"2026-05-18T00:39:19.230642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08872","created_at":"2026-05-18T00:39:19.230642+00:00"},{"alias_kind":"pith_short_12","alias_value":"IY3VHWTTAZP5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IY3VHWTTAZP5X2ZQ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IY3VHWTT","created_at":"2026-05-18T12:31:21.493067+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/IY3VHWTTAZP5X2ZQ2YWH2M3DH6","json":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6.json","graph_json":"https://pith.science/api/pith-number/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/graph.json","events_json":"https://pith.science/api/pith-number/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/events.json","paper":"https://pith.science/paper/IY3VHWTT"},"agent_actions":{"view_html":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6","download_json":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6.json","view_paper":"https://pith.science/paper/IY3VHWTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08872&json=true","fetch_graph":"https://pith.science/api/pith-number/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/graph.json","fetch_events":"https://pith.science/api/pith-number/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/action/storage_attestation","attest_author":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/action/author_attestation","sign_citation":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/action/citation_signature","submit_replication":"https://pith.science/pith/IY3VHWTTAZP5X2ZQ2YWH2M3DH6/action/replication_record"}},"created_at":"2026-05-18T00:39:19.230642+00:00","updated_at":"2026-05-18T00:39:19.230642+00:00"}