{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PPHOMIYC23SWIM3RNF6KDLLXXZ","short_pith_number":"pith:PPHOMIYC","schema_version":"1.0","canonical_sha256":"7bcee62302d6e5643371697ca1ad77be6240424ad35396ae09b72c2b9af3dc77","source":{"kind":"arxiv","id":"1502.04824","version":2},"attestation_state":"computed","paper":{"title":"Randomized LU decomposition: An Algorithm for Dictionaries Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir Averbuch, Aviv Rotbart, Gil Shabat, Yaniv Shmueli","submitted_at":"2015-02-17T08:18:00Z","abstract_excerpt":"In recent years, distinctive-dictionary construction has gained importance due to his usefulness in data processing. Usually, one or more dictionaries are constructed from a training data and then they are used to classify signals that did not participate in the training process. A new dictionary construction algorithm is introduced. It is based on a low-rank matrix factorization being achieved by the application of the randomized LU decomposition to a training data. This method is fast, scalable, parallelizable, consumes low memory, outperforms SVD in these categories and works also extremely"},"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":"1502.04824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-02-17T08:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"eaaae04e378c859c95bf41241592bf7c262a735213324e8320ff5fcb2fb0b4bb","abstract_canon_sha256":"b420da2104f4afad90503ec3a3716a73ba77da84e48d740c372a42deee661cca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.474506Z","signature_b64":"zJHmQltNQE0kyzO2utPl8pRBRRB6983Jm+xop7LDW/53qG1i8UOEKPe9zNGUQxRYETWzfucCugn0BWgEAKxsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bcee62302d6e5643371697ca1ad77be6240424ad35396ae09b72c2b9af3dc77","last_reissued_at":"2026-05-18T00:25:02.474141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.474141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized LU decomposition: An Algorithm for Dictionaries Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir Averbuch, Aviv Rotbart, Gil Shabat, Yaniv Shmueli","submitted_at":"2015-02-17T08:18:00Z","abstract_excerpt":"In recent years, distinctive-dictionary construction has gained importance due to his usefulness in data processing. Usually, one or more dictionaries are constructed from a training data and then they are used to classify signals that did not participate in the training process. A new dictionary construction algorithm is introduced. It is based on a low-rank matrix factorization being achieved by the application of the randomized LU decomposition to a training data. This method is fast, scalable, parallelizable, consumes low memory, outperforms SVD in these categories and works also extremely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04824","kind":"arxiv","version":2},"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":"1502.04824","created_at":"2026-05-18T00:25:02.474197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04824v2","created_at":"2026-05-18T00:25:02.474197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04824","created_at":"2026-05-18T00:25:02.474197+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPHOMIYC23SW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPHOMIYC23SWIM3R","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPHOMIYC","created_at":"2026-05-18T12:29:37.295048+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/PPHOMIYC23SWIM3RNF6KDLLXXZ","json":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ.json","graph_json":"https://pith.science/api/pith-number/PPHOMIYC23SWIM3RNF6KDLLXXZ/graph.json","events_json":"https://pith.science/api/pith-number/PPHOMIYC23SWIM3RNF6KDLLXXZ/events.json","paper":"https://pith.science/paper/PPHOMIYC"},"agent_actions":{"view_html":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ","download_json":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ.json","view_paper":"https://pith.science/paper/PPHOMIYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04824&json=true","fetch_graph":"https://pith.science/api/pith-number/PPHOMIYC23SWIM3RNF6KDLLXXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PPHOMIYC23SWIM3RNF6KDLLXXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ/action/storage_attestation","attest_author":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ/action/author_attestation","sign_citation":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ/action/citation_signature","submit_replication":"https://pith.science/pith/PPHOMIYC23SWIM3RNF6KDLLXXZ/action/replication_record"}},"created_at":"2026-05-18T00:25:02.474197+00:00","updated_at":"2026-05-18T00:25:02.474197+00:00"}