{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YGPXHAL6HYTPUHTW2L7D5MH2R2","short_pith_number":"pith:YGPXHAL6","schema_version":"1.0","canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","source":{"kind":"arxiv","id":"1202.5844","version":3},"attestation_state":"computed","paper":{"title":"Divide-and-Conquer Method for L1 Norm Matrix Factorization in the Presence of Outliers and Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Deyu Meng, Zongben Xu","submitted_at":"2012-02-27T07:57:04Z","abstract_excerpt":"The low-rank matrix factorization as a L1 norm minimization problem has recently attracted much attention due to its intrinsic robustness to the presence of outliers and missing data. In this paper, we propose a new method, called the divide-and-conquer method, for solving this problem. The main idea is to break the original problem into a series of smallest possible sub-problems, each involving only unique scalar parameter. Each of these subproblems is proved to be convex and has closed-form solution. By recursively optimizing these small problems in an analytical way, efficient algorithm, en"},"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":"1202.5844","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-27T07:57:04Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b2f0eeabc594d299bd1b3541224c32beddd1a3681aa4fe03e664848152011a75","abstract_canon_sha256":"ab1517b41d26fdd6d837817c57789abfd11f611b030eb2f989f6880dc2d4da92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:02.579740Z","signature_b64":"05CpuEwcJy47j6k0/y7jI6gsyKAfSCEwFBj3gWaVGoMI9DNewSsY2Dj4FLqFlk7nVXb0D3UhagNcxbZNPRNQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","last_reissued_at":"2026-05-18T03:57:02.578968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:02.578968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide-and-Conquer Method for L1 Norm Matrix Factorization in the Presence of Outliers and Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Deyu Meng, Zongben Xu","submitted_at":"2012-02-27T07:57:04Z","abstract_excerpt":"The low-rank matrix factorization as a L1 norm minimization problem has recently attracted much attention due to its intrinsic robustness to the presence of outliers and missing data. In this paper, we propose a new method, called the divide-and-conquer method, for solving this problem. The main idea is to break the original problem into a series of smallest possible sub-problems, each involving only unique scalar parameter. Each of these subproblems is proved to be convex and has closed-form solution. By recursively optimizing these small problems in an analytical way, efficient algorithm, en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5844","kind":"arxiv","version":3},"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":"1202.5844","created_at":"2026-05-18T03:57:02.579095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5844v3","created_at":"2026-05-18T03:57:02.579095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5844","created_at":"2026-05-18T03:57:02.579095+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGPXHAL6HYTP","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGPXHAL6HYTPUHTW","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGPXHAL6","created_at":"2026-05-18T12:27:27.928770+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/YGPXHAL6HYTPUHTW2L7D5MH2R2","json":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2.json","graph_json":"https://pith.science/api/pith-number/YGPXHAL6HYTPUHTW2L7D5MH2R2/graph.json","events_json":"https://pith.science/api/pith-number/YGPXHAL6HYTPUHTW2L7D5MH2R2/events.json","paper":"https://pith.science/paper/YGPXHAL6"},"agent_actions":{"view_html":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2","download_json":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2.json","view_paper":"https://pith.science/paper/YGPXHAL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5844&json=true","fetch_graph":"https://pith.science/api/pith-number/YGPXHAL6HYTPUHTW2L7D5MH2R2/graph.json","fetch_events":"https://pith.science/api/pith-number/YGPXHAL6HYTPUHTW2L7D5MH2R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/action/storage_attestation","attest_author":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/action/author_attestation","sign_citation":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/action/citation_signature","submit_replication":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/action/replication_record"}},"created_at":"2026-05-18T03:57:02.579095+00:00","updated_at":"2026-05-18T03:57:02.579095+00:00"}