{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YGPXHAL6HYTPUHTW2L7D5MH2R2","short_pith_number":"pith:YGPXHAL6","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"},"canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","source":{"kind":"arxiv","id":"1202.5844","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5844","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5844v3","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5844","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"YGPXHAL6HYTP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YGPXHAL6HYTPUHTW","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YGPXHAL6","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YGPXHAL6HYTPUHTW2L7D5MH2R2","target":"record","payload":{"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"},"canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","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"},"source_kind":"arxiv","source_id":"1202.5844","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm5lUEaIvfb5DWBhsBDkiC7fc0UKRUkT1r153fk5aHfyNb7/mlcwX/k5wCx9dWRfeJNht5w9kMU3VjwM48nBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:47:19.478848Z"},"content_sha256":"052cda17dab4d7bc47977893399c609b6b43a4dd7944b90b5425845ca914dda6","schema_version":"1.0","event_id":"sha256:052cda17dab4d7bc47977893399c609b6b43a4dd7944b90b5425845ca914dda6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YGPXHAL6HYTPUHTW2L7D5MH2R2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1FrXEzmipJexmoa5LbGcuo1ovYTx5pwU815C1ohrnB70wrZnlsdwYMPpvM78GP5MMsxXmXthrE7OO+exIGKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:47:19.479198Z"},"content_sha256":"8c80e58d456e516584964b860c77ed1a65f0c54e41475f1d506e38873e18fade","schema_version":"1.0","event_id":"sha256:8c80e58d456e516584964b860c77ed1a65f0c54e41475f1d506e38873e18fade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/bundle.json","state_url":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T09:47:19Z","links":{"resolver":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2","bundle":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/bundle.json","state":"https://pith.science/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGPXHAL6HYTPUHTW2L7D5MH2R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YGPXHAL6HYTPUHTW2L7D5MH2R2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ab1517b41d26fdd6d837817c57789abfd11f611b030eb2f989f6880dc2d4da92","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-27T07:57:04Z","title_canon_sha256":"b2f0eeabc594d299bd1b3541224c32beddd1a3681aa4fe03e664848152011a75"},"schema_version":"1.0","source":{"id":"1202.5844","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5844","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5844v3","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5844","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"YGPXHAL6HYTP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YGPXHAL6HYTPUHTW","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YGPXHAL6","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:8c80e58d456e516584964b860c77ed1a65f0c54e41475f1d506e38873e18fade","target":"graph","created_at":"2026-05-18T03:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Deyu Meng, Zongben Xu","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-27T07:57:04Z","title":"Divide-and-Conquer Method for L1 Norm Matrix Factorization in the Presence of Outliers and Missing Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5844","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:052cda17dab4d7bc47977893399c609b6b43a4dd7944b90b5425845ca914dda6","target":"record","created_at":"2026-05-18T03:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ab1517b41d26fdd6d837817c57789abfd11f611b030eb2f989f6880dc2d4da92","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-27T07:57:04Z","title_canon_sha256":"b2f0eeabc594d299bd1b3541224c32beddd1a3681aa4fe03e664848152011a75"},"schema_version":"1.0","source":{"id":"1202.5844","kind":"arxiv","version":3}},"canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c19f73817e3e26fa1e76d2fe3eb0fa8e865e23f7cef91fca794958e8712922ee","first_computed_at":"2026-05-18T03:57:02.578968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:02.578968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"05CpuEwcJy47j6k0/y7jI6gsyKAfSCEwFBj3gWaVGoMI9DNewSsY2Dj4FLqFlk7nVXb0D3UhagNcxbZNPRNQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:02.579740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5844","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:052cda17dab4d7bc47977893399c609b6b43a4dd7944b90b5425845ca914dda6","sha256:8c80e58d456e516584964b860c77ed1a65f0c54e41475f1d506e38873e18fade"],"state_sha256":"4bcc844e56a1f86bdf03f1cc1e521de2107bc787fb3a5ee2d315dc3fd4d9e310"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/YBkguTd3H2Fri3iwA67vfNpbY3Tz3RppWhYkhQwklKJ01IIi2kudCZVa/inqECEpjNd7xYn/NxPAkbBWq3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T09:47:19.481088Z","bundle_sha256":"427215fc252569815fbcacaefdbcf2bb68e9cef2cc0ef4466866e25481648bf0"}}